java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/reducercommutativity/rangesum.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 11:10:50,617 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 11:10:50,619 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 11:10:50,631 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 11:10:50,632 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 11:10:50,633 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 11:10:50,634 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 11:10:50,636 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 11:10:50,638 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 11:10:50,638 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 11:10:50,640 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 11:10:50,641 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 11:10:50,641 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 11:10:50,642 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 11:10:50,643 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 11:10:50,644 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 11:10:50,645 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 11:10:50,646 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 11:10:50,648 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 11:10:50,650 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 11:10:50,652 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 11:10:50,653 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 11:10:50,654 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 11:10:50,655 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 11:10:50,658 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 11:10:50,658 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 11:10:50,659 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 11:10:50,660 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 11:10:50,660 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 11:10:50,661 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 11:10:50,662 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 11:10:50,663 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 11:10:50,663 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 11:10:50,664 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 11:10:50,665 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 11:10:50,666 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 11:10:50,666 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 11:10:50,667 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 11:10:50,667 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 11:10:50,668 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 11:10:50,668 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 11:10:50,669 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 11:10:50,698 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 11:10:50,699 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 11:10:50,701 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 11:10:50,701 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 11:10:50,701 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 11:10:50,701 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 11:10:50,702 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 11:10:50,702 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 11:10:50,702 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 11:10:50,702 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 11:10:50,702 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 11:10:50,703 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 11:10:50,703 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 11:10:50,703 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 11:10:50,704 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 11:10:50,705 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 11:10:50,705 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 11:10:50,705 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 11:10:50,705 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 11:10:50,705 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 11:10:50,706 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 11:10:50,706 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 11:10:50,706 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 11:10:50,707 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 11:10:50,707 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 11:10:50,707 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 11:10:50,707 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 11:10:50,707 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 11:10:50,708 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 11:10:50,747 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 11:10:50,763 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 11:10:50,767 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 11:10:50,769 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 11:10:50,769 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 11:10:50,770 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/rangesum.i [2019-09-07 11:10:50,839 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1da61c0e/ad4c1b1ef7e14951bb3cb8004b4660bb/FLAG9974f9640 [2019-09-07 11:10:51,316 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 11:10:51,318 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/rangesum.i [2019-09-07 11:10:51,326 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1da61c0e/ad4c1b1ef7e14951bb3cb8004b4660bb/FLAG9974f9640 [2019-09-07 11:10:51,683 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1da61c0e/ad4c1b1ef7e14951bb3cb8004b4660bb [2019-09-07 11:10:51,694 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 11:10:51,696 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 11:10:51,697 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 11:10:51,697 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 11:10:51,700 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 11:10:51,700 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 11:10:51" (1/1) ... [2019-09-07 11:10:51,703 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d0541da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:10:51, skipping insertion in model container [2019-09-07 11:10:51,703 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 11:10:51" (1/1) ... [2019-09-07 11:10:51,709 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 11:10:51,726 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 11:10:51,909 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 11:10:51,917 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 11:10:51,943 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 11:10:52,059 INFO L192 MainTranslator]: Completed translation [2019-09-07 11:10:52,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:10:52 WrapperNode [2019-09-07 11:10:52,060 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 11:10:52,060 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 11:10:52,060 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 11:10:52,061 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 11:10:52,074 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:10:52" (1/1) ... [2019-09-07 11:10:52,074 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:10:52" (1/1) ... [2019-09-07 11:10:52,088 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:10:52" (1/1) ... [2019-09-07 11:10:52,089 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:10:52" (1/1) ... [2019-09-07 11:10:52,106 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:10:52" (1/1) ... [2019-09-07 11:10:52,113 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:10:52" (1/1) ... [2019-09-07 11:10:52,115 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:10:52" (1/1) ... [2019-09-07 11:10:52,117 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 11:10:52,122 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 11:10:52,122 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 11:10:52,123 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 11:10:52,124 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:10:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 11:10:52,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 11:10:52,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 11:10:52,179 INFO L138 BoogieDeclarations]: Found implementation of procedure init_nondet [2019-09-07 11:10:52,179 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2019-09-07 11:10:52,179 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 11:10:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 11:10:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 11:10:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure init_nondet [2019-09-07 11:10:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-07 11:10:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2019-09-07 11:10:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-07 11:10:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 11:10:52,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-07 11:10:52,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-07 11:10:52,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 11:10:52,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 11:10:52,509 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 11:10:52,509 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-07 11:10:52,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 11:10:52 BoogieIcfgContainer [2019-09-07 11:10:52,511 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 11:10:52,512 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 11:10:52,512 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 11:10:52,515 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 11:10:52,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 11:10:51" (1/3) ... [2019-09-07 11:10:52,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b47ca6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 11:10:52, skipping insertion in model container [2019-09-07 11:10:52,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:10:52" (2/3) ... [2019-09-07 11:10:52,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b47ca6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 11:10:52, skipping insertion in model container [2019-09-07 11:10:52,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 11:10:52" (3/3) ... [2019-09-07 11:10:52,519 INFO L109 eAbstractionObserver]: Analyzing ICFG rangesum.i [2019-09-07 11:10:52,527 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 11:10:52,538 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 11:10:52,553 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 11:10:52,577 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 11:10:52,578 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 11:10:52,578 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 11:10:52,578 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 11:10:52,578 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 11:10:52,578 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 11:10:52,578 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 11:10:52,578 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 11:10:52,579 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 11:10:52,595 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2019-09-07 11:10:52,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-07 11:10:52,601 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:52,602 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:52,604 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:52,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:52,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1377249276, now seen corresponding path program 1 times [2019-09-07 11:10:52,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:52,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:52,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:52,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:10:52,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:52,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:52,746 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2019-09-07 11:10:52,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:10:52,747 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:10:52,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:10:52,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:52,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 1 conjunts are in the unsatisfiable core [2019-09-07 11:10:52,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:10:52,862 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-07 11:10:52,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 11:10:52,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-07 11:10:52,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-07 11:10:52,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-07 11:10:52,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 11:10:52,900 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 2 states. [2019-09-07 11:10:52,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:52,930 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2019-09-07 11:10:52,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-07 11:10:52,932 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 38 [2019-09-07 11:10:52,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:52,942 INFO L225 Difference]: With dead ends: 67 [2019-09-07 11:10:52,942 INFO L226 Difference]: Without dead ends: 33 [2019-09-07 11:10:52,946 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 11:10:52,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-07 11:10:52,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-07 11:10:52,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-07 11:10:52,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2019-09-07 11:10:53,000 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 38 [2019-09-07 11:10:53,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:53,001 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2019-09-07 11:10:53,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-07 11:10:53,001 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2019-09-07 11:10:53,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-07 11:10:53,004 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:53,005 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:53,005 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:53,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:53,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1240892162, now seen corresponding path program 1 times [2019-09-07 11:10:53,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:53,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:53,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:53,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:10:53,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:53,028 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-07 11:10:53,028 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-07 11:10:53,028 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-07 11:10:53,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-07 11:10:53,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:53,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 11:10:53,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:10:53,144 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-07 11:10:53,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 11:10:53,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 11:10:53,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 11:10:53,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 11:10:53,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 11:10:53,154 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 3 states. [2019-09-07 11:10:54,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:54,251 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2019-09-07 11:10:54,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 11:10:54,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-09-07 11:10:54,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:54,255 INFO L225 Difference]: With dead ends: 57 [2019-09-07 11:10:54,255 INFO L226 Difference]: Without dead ends: 39 [2019-09-07 11:10:54,256 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 11:10:54,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-07 11:10:54,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2019-09-07 11:10:54,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-07 11:10:54,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2019-09-07 11:10:54,267 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 38 [2019-09-07 11:10:54,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:54,268 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2019-09-07 11:10:54,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 11:10:54,268 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2019-09-07 11:10:54,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-07 11:10:54,270 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:54,270 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:54,270 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:54,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:54,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1742767491, now seen corresponding path program 1 times [2019-09-07 11:10:54,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:54,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:54,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:54,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:10:54,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:54,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:54,495 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-07 11:10:54,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 11:10:54,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-07 11:10:54,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 11:10:54,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 11:10:54,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-07 11:10:54,498 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand 9 states. [2019-09-07 11:10:54,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:54,779 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions. [2019-09-07 11:10:54,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 11:10:54,780 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2019-09-07 11:10:54,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:54,783 INFO L225 Difference]: With dead ends: 63 [2019-09-07 11:10:54,783 INFO L226 Difference]: Without dead ends: 59 [2019-09-07 11:10:54,784 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-07 11:10:54,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-07 11:10:54,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 46. [2019-09-07 11:10:54,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-07 11:10:54,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2019-09-07 11:10:54,814 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 60 transitions. Word has length 38 [2019-09-07 11:10:54,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:54,815 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 60 transitions. [2019-09-07 11:10:54,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 11:10:54,815 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2019-09-07 11:10:54,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-07 11:10:54,821 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:54,822 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:54,822 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:54,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:54,823 INFO L82 PathProgramCache]: Analyzing trace with hash 699235283, now seen corresponding path program 1 times [2019-09-07 11:10:54,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:54,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:54,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:54,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:10:54,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:54,873 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-07 11:10:54,873 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-07 11:10:54,874 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-07 11:10:54,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:10:54,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:54,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 11:10:54,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:10:55,011 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-07 11:10:55,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 11:10:55,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 11:10:55,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 11:10:55,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 11:10:55,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 11:10:55,017 INFO L87 Difference]: Start difference. First operand 46 states and 60 transitions. Second operand 4 states. [2019-09-07 11:10:55,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:55,106 INFO L93 Difference]: Finished difference Result 83 states and 111 transitions. [2019-09-07 11:10:55,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 11:10:55,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-09-07 11:10:55,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:55,112 INFO L225 Difference]: With dead ends: 83 [2019-09-07 11:10:55,112 INFO L226 Difference]: Without dead ends: 48 [2019-09-07 11:10:55,113 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 11:10:55,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-07 11:10:55,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-09-07 11:10:55,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-07 11:10:55,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2019-09-07 11:10:55,124 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 41 [2019-09-07 11:10:55,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:55,125 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2019-09-07 11:10:55,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 11:10:55,125 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2019-09-07 11:10:55,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-07 11:10:55,127 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:55,127 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:55,127 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:55,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:55,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1178839093, now seen corresponding path program 1 times [2019-09-07 11:10:55,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:55,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:55,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:55,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:10:55,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:55,147 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-07 11:10:55,147 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-07 11:10:55,147 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-07 11:10:55,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-07 11:10:55,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:55,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 11:10:55,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:10:55,274 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-07 11:10:55,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-07 11:10:55,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-09-07 11:10:55,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 11:10:55,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 11:10:55,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 11:10:55,280 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. Second operand 5 states. [2019-09-07 11:10:55,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:55,365 INFO L93 Difference]: Finished difference Result 85 states and 113 transitions. [2019-09-07 11:10:55,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 11:10:55,365 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-09-07 11:10:55,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:55,367 INFO L225 Difference]: With dead ends: 85 [2019-09-07 11:10:55,367 INFO L226 Difference]: Without dead ends: 50 [2019-09-07 11:10:55,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 11:10:55,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-07 11:10:55,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-09-07 11:10:55,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-07 11:10:55,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2019-09-07 11:10:55,378 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 63 transitions. Word has length 43 [2019-09-07 11:10:55,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:55,378 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 63 transitions. [2019-09-07 11:10:55,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 11:10:55,379 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2019-09-07 11:10:55,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-07 11:10:55,380 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:55,380 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:55,380 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:55,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:55,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1778367465, now seen corresponding path program 2 times [2019-09-07 11:10:55,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:55,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:55,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:55,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:10:55,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:55,399 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-07 11:10:55,399 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-07 11:10:55,399 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-07 11:10:55,423 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-07 11:10:55,466 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:10:55,466 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:10:55,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 11:10:55,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:10:55,516 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-07 11:10:55,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-07 11:10:55,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-09-07 11:10:55,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 11:10:55,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 11:10:55,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 11:10:55,522 INFO L87 Difference]: Start difference. First operand 49 states and 63 transitions. Second operand 5 states. [2019-09-07 11:10:55,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:55,588 INFO L93 Difference]: Finished difference Result 86 states and 124 transitions. [2019-09-07 11:10:55,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 11:10:55,588 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-09-07 11:10:55,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:55,590 INFO L225 Difference]: With dead ends: 86 [2019-09-07 11:10:55,590 INFO L226 Difference]: Without dead ends: 55 [2019-09-07 11:10:55,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 11:10:55,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-09-07 11:10:55,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2019-09-07 11:10:55,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-07 11:10:55,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2019-09-07 11:10:55,600 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 68 transitions. Word has length 45 [2019-09-07 11:10:55,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:55,602 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 68 transitions. [2019-09-07 11:10:55,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 11:10:55,603 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2019-09-07 11:10:55,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-07 11:10:55,604 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:55,604 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 6, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:55,605 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:55,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:55,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1346922871, now seen corresponding path program 1 times [2019-09-07 11:10:55,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:55,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:55,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:55,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:10:55,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:55,655 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-07 11:10:55,656 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-07 11:10:55,656 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-07 11:10:55,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:10:55,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:55,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 11:10:55,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:10:55,747 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-09-07 11:10:55,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 11:10:55,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 11:10:55,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 11:10:55,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 11:10:55,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 11:10:55,757 INFO L87 Difference]: Start difference. First operand 54 states and 68 transitions. Second operand 4 states. [2019-09-07 11:10:55,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:55,820 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2019-09-07 11:10:55,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 11:10:55,820 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-07 11:10:55,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:55,822 INFO L225 Difference]: With dead ends: 84 [2019-09-07 11:10:55,822 INFO L226 Difference]: Without dead ends: 58 [2019-09-07 11:10:55,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 11:10:55,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-07 11:10:55,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2019-09-07 11:10:55,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-07 11:10:55,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2019-09-07 11:10:55,841 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 63 [2019-09-07 11:10:55,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:55,842 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2019-09-07 11:10:55,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 11:10:55,842 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2019-09-07 11:10:55,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-07 11:10:55,845 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:55,845 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 6, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:55,846 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:55,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:55,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1679269433, now seen corresponding path program 1 times [2019-09-07 11:10:55,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:55,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:55,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:55,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:10:55,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:55,882 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-07 11:10:55,883 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-07 11:10:55,883 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-07 11:10:55,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:10:55,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:55,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 11:10:55,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:10:56,030 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 66 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-07 11:10:56,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-07 11:10:56,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-09-07 11:10:56,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 11:10:56,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 11:10:56,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-07 11:10:56,041 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand 9 states. [2019-09-07 11:10:56,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:56,195 INFO L93 Difference]: Finished difference Result 120 states and 154 transitions. [2019-09-07 11:10:56,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 11:10:56,197 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-09-07 11:10:56,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:56,199 INFO L225 Difference]: With dead ends: 120 [2019-09-07 11:10:56,199 INFO L226 Difference]: Without dead ends: 59 [2019-09-07 11:10:56,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-09-07 11:10:56,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-07 11:10:56,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-09-07 11:10:56,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-07 11:10:56,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2019-09-07 11:10:56,226 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 65 [2019-09-07 11:10:56,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:56,227 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2019-09-07 11:10:56,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 11:10:56,227 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2019-09-07 11:10:56,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-07 11:10:56,231 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:56,231 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 6, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:56,232 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:56,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:56,232 INFO L82 PathProgramCache]: Analyzing trace with hash -2040052581, now seen corresponding path program 2 times [2019-09-07 11:10:56,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:56,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:56,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:56,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:10:56,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:56,275 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-07 11:10:56,275 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-07 11:10:56,275 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-07 11:10:56,302 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-07 11:10:56,348 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:10:56,349 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:10:56,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 11:10:56,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:10:56,438 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 47 proven. 10 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-09-07 11:10:56,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-07 11:10:56,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-09-07 11:10:56,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 11:10:56,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 11:10:56,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-07 11:10:56,444 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand 9 states. [2019-09-07 11:10:56,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:56,582 INFO L93 Difference]: Finished difference Result 99 states and 128 transitions. [2019-09-07 11:10:56,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 11:10:56,582 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-09-07 11:10:56,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:56,584 INFO L225 Difference]: With dead ends: 99 [2019-09-07 11:10:56,584 INFO L226 Difference]: Without dead ends: 63 [2019-09-07 11:10:56,585 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-09-07 11:10:56,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-07 11:10:56,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2019-09-07 11:10:56,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-07 11:10:56,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2019-09-07 11:10:56,595 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 74 transitions. Word has length 67 [2019-09-07 11:10:56,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:56,596 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 74 transitions. [2019-09-07 11:10:56,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 11:10:56,596 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2019-09-07 11:10:56,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-07 11:10:56,597 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:56,597 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:56,598 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:56,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:56,598 INFO L82 PathProgramCache]: Analyzing trace with hash -737365673, now seen corresponding path program 1 times [2019-09-07 11:10:56,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:56,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:56,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:56,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:10:56,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:56,621 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-07 11:10:56,622 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-07 11:10:56,622 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-07 11:10:56,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:10:56,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:10:56,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 11:10:56,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:10:56,726 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 80 proven. 6 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:10:56,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-07 11:10:56,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-09-07 11:10:56,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 11:10:56,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 11:10:56,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 11:10:56,734 INFO L87 Difference]: Start difference. First operand 60 states and 74 transitions. Second operand 8 states. [2019-09-07 11:10:56,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:10:56,851 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2019-09-07 11:10:56,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 11:10:56,854 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2019-09-07 11:10:56,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:10:56,858 INFO L225 Difference]: With dead ends: 94 [2019-09-07 11:10:56,858 INFO L226 Difference]: Without dead ends: 66 [2019-09-07 11:10:56,859 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-07 11:10:56,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-07 11:10:56,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-09-07 11:10:56,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-07 11:10:56,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 78 transitions. [2019-09-07 11:10:56,879 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 78 transitions. Word has length 73 [2019-09-07 11:10:56,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:10:56,880 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 78 transitions. [2019-09-07 11:10:56,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 11:10:56,880 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 78 transitions. [2019-09-07 11:10:56,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-07 11:10:56,882 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:10:56,882 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:10:56,882 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:10:56,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:10:56,883 INFO L82 PathProgramCache]: Analyzing trace with hash 132738585, now seen corresponding path program 2 times [2019-09-07 11:10:56,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:10:56,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:10:56,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:56,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:10:56,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:10:56,895 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-07 11:10:56,895 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-07 11:10:56,895 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-07 11:10:56,917 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-07 11:10:56,988 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:10:56,989 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-09-07 11:10:57,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-07 11:10:57,096 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-07 11:10:57,097 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-07 11:10:57,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.09 11:10:57 BoogieIcfgContainer [2019-09-07 11:10:57,251 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-07 11:10:57,255 INFO L168 Benchmark]: Toolchain (without parser) took 5557.19 ms. Allocated memory was 131.1 MB in the beginning and 267.4 MB in the end (delta: 136.3 MB). Free memory was 86.8 MB in the beginning and 110.4 MB in the end (delta: -23.7 MB). Peak memory consumption was 112.7 MB. Max. memory is 7.1 GB. [2019-09-07 11:10:57,256 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 131.1 MB. Free memory is still 105.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-07 11:10:57,258 INFO L168 Benchmark]: CACSL2BoogieTranslator took 363.42 ms. Allocated memory was 131.1 MB in the beginning and 199.2 MB in the end (delta: 68.2 MB). Free memory was 86.8 MB in the beginning and 175.8 MB in the end (delta: -89.0 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. [2019-09-07 11:10:57,261 INFO L168 Benchmark]: Boogie Preprocessor took 57.25 ms. Allocated memory is still 199.2 MB. Free memory was 175.8 MB in the beginning and 173.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-09-07 11:10:57,262 INFO L168 Benchmark]: RCFGBuilder took 388.69 ms. Allocated memory is still 199.2 MB. Free memory was 173.9 MB in the beginning and 155.6 MB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. [2019-09-07 11:10:57,263 INFO L168 Benchmark]: TraceAbstraction took 4739.30 ms. Allocated memory was 199.2 MB in the beginning and 267.4 MB in the end (delta: 68.2 MB). Free memory was 155.6 MB in the beginning and 110.4 MB in the end (delta: 45.1 MB). Peak memory consumption was 113.3 MB. Max. memory is 7.1 GB. [2019-09-07 11:10:57,270 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.49 ms. Allocated memory is still 131.1 MB. Free memory is still 105.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 363.42 ms. Allocated memory was 131.1 MB in the beginning and 199.2 MB in the end (delta: 68.2 MB). Free memory was 86.8 MB in the beginning and 175.8 MB in the end (delta: -89.0 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 57.25 ms. Allocated memory is still 199.2 MB. Free memory was 175.8 MB in the beginning and 173.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 388.69 ms. Allocated memory is still 199.2 MB. Free memory was 173.9 MB in the beginning and 155.6 MB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4739.30 ms. Allocated memory was 199.2 MB in the beginning and 267.4 MB in the end (delta: 68.2 MB). Free memory was 155.6 MB in the beginning and 110.4 MB in the end (delta: 45.1 MB). Peak memory consumption was 113.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 53]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L4] int N; VAL [\old(N)=5, N=0] [L32] N = __VERIFIER_nondet_int() [L33] COND TRUE N > 1 [L34] int x[N]; VAL [\old(N)=0, N=3, x={-1:0}] [L35] CALL init_nondet(x) VAL [\old(N)=0, N=3, x={-1:0}] [L6] int i; [L7] i = 0 VAL [\old(N)=0, i=0, N=3, x={-1:0}, x={-1:0}] [L7] COND TRUE i < N [L8] x[i] = __VERIFIER_nondet_int() [L7] i++ VAL [\old(N)=0, i=1, N=3, x={-1:0}, x={-1:0}] [L7] COND TRUE i < N [L8] x[i] = __VERIFIER_nondet_int() [L7] i++ VAL [\old(N)=0, i=2, N=3, x={-1:0}, x={-1:0}] [L7] COND TRUE i < N [L8] x[i] = __VERIFIER_nondet_int() [L7] i++ VAL [\old(N)=0, i=3, N=3, x={-1:0}, x={-1:0}] [L7] COND FALSE !(i < N) VAL [\old(N)=0, i=3, N=3, x={-1:0}, x={-1:0}] [L35] RET init_nondet(x) VAL [\old(N)=0, N=3, x={-1:0}] [L36] int temp; [L37] int ret; [L38] int ret2; [L39] int ret5; VAL [\old(N)=0, N=3, x={-1:0}] [L41] CALL, EXPR rangesum(x) VAL [\old(N)=0, N=3, x={-1:0}] [L14] int i; [L15] long long ret; [L16] ret = 0 [L17] int cnt = 0; [L18] i = 0 VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={-1:0}, x={-1:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={-1:0}, x={-1:0}] [L19] COND FALSE !(i > N/2) VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={-1:0}, x={-1:0}] [L18] i++ VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={-1:0}, x={-1:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={-1:0}, x={-1:0}] [L19] COND FALSE !(i > N/2) VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={-1:0}, x={-1:0}] [L18] i++ VAL [\old(N)=0, cnt=0, i=2, N=3, ret=0, x={-1:0}, x={-1:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=2, N=3, ret=0, x={-1:0}, x={-1:0}] [L19] COND TRUE i > N/2 [L20] EXPR x[i] [L20] ret = ret + x[i] [L21] cnt = cnt + 1 VAL [\old(N)=0, cnt=1, i=2, N=3, ret=2147476757, x={-1:0}, x={-1:0}] [L18] i++ VAL [\old(N)=0, cnt=1, i=3, N=3, ret=2147476757, x={-1:0}, x={-1:0}] [L18] COND FALSE !(i < N) VAL [\old(N)=0, cnt=1, i=3, N=3, ret=2147476757, x={-1:0}, x={-1:0}] [L24] COND TRUE cnt !=0 [L25] return ret / cnt; VAL [\old(N)=0, \result=2147476757, cnt=1, i=3, N=3, ret=2147476757, x={-1:0}, x={-1:0}] [L41] RET, EXPR rangesum(x) VAL [\old(N)=0, N=3, rangesum(x)=2147476757, x={-1:0}] [L41] ret = rangesum(x) [L43] EXPR x[0] [L43] temp=x[0] [L43] EXPR x[1] [L43] x[0] = x[1] [L43] x[1] = temp VAL [\old(N)=0, N=3, ret=2147476757, temp=1, x={-1:0}] [L44] CALL, EXPR rangesum(x) VAL [\old(N)=0, N=3, x={-1:0}] [L14] int i; [L15] long long ret; [L16] ret = 0 [L17] int cnt = 0; [L18] i = 0 VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={-1:0}, x={-1:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={-1:0}, x={-1:0}] [L19] COND FALSE !(i > N/2) VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={-1:0}, x={-1:0}] [L18] i++ VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={-1:0}, x={-1:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={-1:0}, x={-1:0}] [L19] COND FALSE !(i > N/2) VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={-1:0}, x={-1:0}] [L18] i++ VAL [\old(N)=0, cnt=0, i=2, N=3, ret=0, x={-1:0}, x={-1:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=2, N=3, ret=0, x={-1:0}, x={-1:0}] [L19] COND TRUE i > N/2 [L20] EXPR x[i] [L20] ret = ret + x[i] [L21] cnt = cnt + 1 VAL [\old(N)=0, cnt=1, i=2, N=3, ret=2147476757, x={-1:0}, x={-1:0}] [L18] i++ VAL [\old(N)=0, cnt=1, i=3, N=3, ret=2147476757, x={-1:0}, x={-1:0}] [L18] COND FALSE !(i < N) VAL [\old(N)=0, cnt=1, i=3, N=3, ret=2147476757, x={-1:0}, x={-1:0}] [L24] COND TRUE cnt !=0 [L25] return ret / cnt; VAL [\old(N)=0, \result=2147476757, cnt=1, i=3, N=3, ret=2147476757, x={-1:0}, x={-1:0}] [L44] RET, EXPR rangesum(x) VAL [\old(N)=0, N=3, rangesum(x)=2147476757, ret=2147476757, temp=1, x={-1:0}] [L44] ret2 = rangesum(x) [L45] EXPR x[0] [L45] temp=x[0] [L46] int i =0 ; VAL [\old(N)=0, i=0, N=3, ret=2147476757, ret2=2147476757, temp=0, x={-1:0}] [L46] COND TRUE i N/2) VAL [\old(N)=0, cnt=0, i=0, N=3, ret=0, x={-1:0}, x={-1:0}] [L18] i++ VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={-1:0}, x={-1:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={-1:0}, x={-1:0}] [L19] COND FALSE !(i > N/2) VAL [\old(N)=0, cnt=0, i=1, N=3, ret=0, x={-1:0}, x={-1:0}] [L18] i++ VAL [\old(N)=0, cnt=0, i=2, N=3, ret=0, x={-1:0}, x={-1:0}] [L18] COND TRUE i < N VAL [\old(N)=0, cnt=0, i=2, N=3, ret=0, x={-1:0}, x={-1:0}] [L19] COND TRUE i > N/2 [L20] EXPR x[i] [L20] ret = ret + x[i] [L21] cnt = cnt + 1 VAL [\old(N)=0, cnt=1, i=2, N=3, ret=0, x={-1:0}, x={-1:0}] [L18] i++ VAL [\old(N)=0, cnt=1, i=3, N=3, ret=0, x={-1:0}, x={-1:0}] [L18] COND FALSE !(i < N) VAL [\old(N)=0, cnt=1, i=3, N=3, ret=0, x={-1:0}, x={-1:0}] [L24] COND TRUE cnt !=0 [L25] return ret / cnt; VAL [\old(N)=0, \result=0, cnt=1, i=3, N=3, ret=0, x={-1:0}, x={-1:0}] [L50] RET, EXPR rangesum(x) VAL [\old(N)=0, i=2, N=3, rangesum(x)=0, ret=2147476757, ret2=2147476757, temp=0, x={-1:0}] [L50] ret5 = rangesum(x) [L52] COND TRUE ret != ret2 || ret !=ret5 VAL [\old(N)=0, i=2, N=3, ret=2147476757, ret2=2147476757, ret5=0, temp=0, x={-1:0}] [L53] __VERIFIER_error() VAL [\old(N)=0, i=2, N=3, ret=2147476757, ret2=2147476757, ret5=0, temp=0, x={-1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 39 locations, 1 error locations. UNSAFE Result, 4.6s OverallTime, 11 OverallIterations, 9 TraceHistogramMax, 2.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 327 SDtfs, 186 SDslu, 554 SDs, 0 SdLazy, 448 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 480 GetRequests, 432 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 26 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 624 NumberOfCodeBlocks, 624 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 501 ConstructedInterpolants, 0 QuantifiedInterpolants, 58147 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1692 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 10 InterpolantComputations, 5 PerfectInterpolantSequences, 558/580 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...