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/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 11:16:05,342 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 11:16:05,344 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 11:16:05,364 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 11:16:05,365 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 11:16:05,366 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 11:16:05,368 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 11:16:05,380 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 11:16:05,382 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 11:16:05,383 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 11:16:05,383 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 11:16:05,385 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 11:16:05,385 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 11:16:05,386 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 11:16:05,386 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 11:16:05,388 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 11:16:05,388 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 11:16:05,389 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 11:16:05,391 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 11:16:05,394 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 11:16:05,395 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 11:16:05,398 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 11:16:05,399 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 11:16:05,401 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 11:16:05,404 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 11:16:05,404 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 11:16:05,404 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 11:16:05,405 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 11:16:05,405 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 11:16:05,406 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 11:16:05,406 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 11:16:05,407 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 11:16:05,409 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 11:16:05,409 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 11:16:05,413 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 11:16:05,413 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 11:16:05,414 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 11:16:05,415 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 11:16:05,415 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 11:16:05,416 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 11:16:05,418 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 11:16:05,420 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-10-02 11:16:05,436 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 11:16:05,436 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 11:16:05,437 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 11:16:05,438 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 11:16:05,438 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 11:16:05,438 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 11:16:05,438 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 11:16:05,439 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 11:16:05,439 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 11:16:05,439 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 11:16:05,439 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 11:16:05,439 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 11:16:05,440 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 11:16:05,440 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 11:16:05,440 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 11:16:05,440 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 11:16:05,440 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 11:16:05,441 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 11:16:05,441 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 11:16:05,441 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 11:16:05,441 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 11:16:05,442 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:16:05,442 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 11:16:05,442 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 11:16:05,442 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 11:16:05,442 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 11:16:05,443 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 11:16:05,443 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 11:16:05,443 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 11:16:05,477 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 11:16:05,489 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 11:16:05,492 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 11:16:05,494 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 11:16:05,494 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 11:16:05,495 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c [2019-10-02 11:16:05,559 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5f18afec/6866a855c14043d6b333e78954ecb9cf/FLAGbe26dfb9f [2019-10-02 11:16:05,978 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 11:16:05,979 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c [2019-10-02 11:16:05,989 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5f18afec/6866a855c14043d6b333e78954ecb9cf/FLAGbe26dfb9f [2019-10-02 11:16:06,357 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5f18afec/6866a855c14043d6b333e78954ecb9cf [2019-10-02 11:16:06,367 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 11:16:06,369 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 11:16:06,371 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 11:16:06,371 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 11:16:06,374 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 11:16:06,375 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:16:06" (1/1) ... [2019-10-02 11:16:06,378 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71325e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:16:06, skipping insertion in model container [2019-10-02 11:16:06,379 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:16:06" (1/1) ... [2019-10-02 11:16:06,386 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 11:16:06,406 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 11:16:06,611 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:16:06,616 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 11:16:06,717 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:16:06,736 INFO L192 MainTranslator]: Completed translation [2019-10-02 11:16:06,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:16:06 WrapperNode [2019-10-02 11:16:06,737 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 11:16:06,738 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 11:16:06,738 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 11:16:06,738 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 11:16:06,747 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:16:06" (1/1) ... [2019-10-02 11:16:06,747 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:16:06" (1/1) ... [2019-10-02 11:16:06,754 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:16:06" (1/1) ... [2019-10-02 11:16:06,754 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:16:06" (1/1) ... [2019-10-02 11:16:06,762 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:16:06" (1/1) ... [2019-10-02 11:16:06,765 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:16:06" (1/1) ... [2019-10-02 11:16:06,767 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:16:06" (1/1) ... [2019-10-02 11:16:06,769 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 11:16:06,770 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 11:16:06,770 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 11:16:06,770 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 11:16:06,771 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:16:06" (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-10-02 11:16:06,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 11:16:06,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 11:16:06,821 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 11:16:06,822 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 11:16:06,822 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-02 11:16:06,822 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-02 11:16:06,822 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-10-02 11:16:06,822 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 11:16:06,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 11:16:06,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 11:16:06,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 11:16:06,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 11:16:06,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 11:16:06,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 11:16:07,103 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 11:16:07,104 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-02 11:16:07,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:16:07 BoogieIcfgContainer [2019-10-02 11:16:07,106 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 11:16:07,107 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 11:16:07,107 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 11:16:07,110 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 11:16:07,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:16:06" (1/3) ... [2019-10-02 11:16:07,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b338410 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:16:07, skipping insertion in model container [2019-10-02 11:16:07,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:16:06" (2/3) ... [2019-10-02 11:16:07,112 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b338410 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:16:07, skipping insertion in model container [2019-10-02 11:16:07,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:16:07" (3/3) ... [2019-10-02 11:16:07,114 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_4.i.v+nlh-reducer.c [2019-10-02 11:16:07,125 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 11:16:07,133 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-02 11:16:07,172 INFO L252 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-02 11:16:07,201 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 11:16:07,202 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 11:16:07,202 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 11:16:07,202 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 11:16:07,203 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 11:16:07,203 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 11:16:07,203 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 11:16:07,203 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 11:16:07,203 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 11:16:07,218 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2019-10-02 11:16:07,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-02 11:16:07,222 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:16:07,223 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:16:07,226 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:16:07,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:16:07,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1395858257, now seen corresponding path program 1 times [2019-10-02 11:16:07,231 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:16:07,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:16:07,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:16:07,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:16:07,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:16:07,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:16:07,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:16:07,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:16:07,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:16:07,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:16:07,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:16:07,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:16:07,433 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2019-10-02 11:16:07,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:16:07,479 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2019-10-02 11:16:07,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:16:07,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-02 11:16:07,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:16:07,490 INFO L225 Difference]: With dead ends: 51 [2019-10-02 11:16:07,491 INFO L226 Difference]: Without dead ends: 33 [2019-10-02 11:16:07,494 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10-02 11:16:07,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-02 11:16:07,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2019-10-02 11:16:07,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-02 11:16:07,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-10-02 11:16:07,534 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 13 [2019-10-02 11:16:07,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:16:07,535 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-10-02 11:16:07,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:16:07,535 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2019-10-02 11:16:07,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-02 11:16:07,536 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:16:07,537 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:16:07,537 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:16:07,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:16:07,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1868760050, now seen corresponding path program 1 times [2019-10-02 11:16:07,538 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:16:07,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:16:07,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:16:07,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:16:07,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:16:07,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:16:07,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:16:07,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:16:07,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:16:07,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:16:07,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:16:07,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:16:07,616 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 4 states. [2019-10-02 11:16:07,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:16:07,679 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2019-10-02 11:16:07,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:16:07,679 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-10-02 11:16:07,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:16:07,681 INFO L225 Difference]: With dead ends: 51 [2019-10-02 11:16:07,681 INFO L226 Difference]: Without dead ends: 49 [2019-10-02 11:16:07,682 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:16:07,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-02 11:16:07,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2019-10-02 11:16:07,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-02 11:16:07,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2019-10-02 11:16:07,690 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 14 [2019-10-02 11:16:07,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:16:07,691 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-10-02 11:16:07,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:16:07,691 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2019-10-02 11:16:07,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-02 11:16:07,692 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:16:07,692 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:16:07,693 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:16:07,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:16:07,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1932482999, now seen corresponding path program 1 times [2019-10-02 11:16:07,693 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:16:07,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:16:07,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:16:07,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:16:07,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:16:07,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:16:07,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:16:07,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:16:07,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:16:07,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:16:07,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:16:07,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:16:07,745 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 3 states. [2019-10-02 11:16:07,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:16:07,796 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2019-10-02 11:16:07,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:16:07,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-02 11:16:07,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:16:07,797 INFO L225 Difference]: With dead ends: 60 [2019-10-02 11:16:07,798 INFO L226 Difference]: Without dead ends: 40 [2019-10-02 11:16:07,798 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10-02 11:16:07,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-02 11:16:07,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2019-10-02 11:16:07,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-02 11:16:07,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-10-02 11:16:07,806 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 14 [2019-10-02 11:16:07,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:16:07,806 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-10-02 11:16:07,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:16:07,807 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-10-02 11:16:07,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-02 11:16:07,807 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:16:07,807 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:16:07,808 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:16:07,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:16:07,810 INFO L82 PathProgramCache]: Analyzing trace with hash -2140784762, now seen corresponding path program 1 times [2019-10-02 11:16:07,810 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:16:07,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:16:07,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:16:07,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:16:07,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:16:07,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:16:07,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:16:07,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:16:07,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:16:07,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:16:07,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:16:07,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:16:07,882 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 3 states. [2019-10-02 11:16:07,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:16:07,935 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2019-10-02 11:16:07,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:16:07,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-02 11:16:07,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:16:07,937 INFO L225 Difference]: With dead ends: 54 [2019-10-02 11:16:07,937 INFO L226 Difference]: Without dead ends: 34 [2019-10-02 11:16:07,938 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10-02 11:16:07,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-02 11:16:07,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2019-10-02 11:16:07,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-02 11:16:07,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2019-10-02 11:16:07,945 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 15 [2019-10-02 11:16:07,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:16:07,945 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-10-02 11:16:07,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:16:07,945 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2019-10-02 11:16:07,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-02 11:16:07,946 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:16:07,946 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:16:07,947 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:16:07,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:16:07,947 INFO L82 PathProgramCache]: Analyzing trace with hash 341027121, now seen corresponding path program 1 times [2019-10-02 11:16:07,947 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:16:07,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:16:07,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:16:07,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:16:07,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:16:08,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:16:08,468 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 33 [2019-10-02 11:16:09,002 WARN L191 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 89 [2019-10-02 11:16:09,350 WARN L191 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 73 [2019-10-02 11:16:09,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:16:09,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:16:09,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:16:09,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:16:09,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:16:09,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:16:09,371 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 9 states. [2019-10-02 11:16:09,620 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 42 [2019-10-02 11:16:09,779 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 46 [2019-10-02 11:16:09,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:16:09,815 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2019-10-02 11:16:09,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:16:09,818 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-10-02 11:16:09,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:16:09,819 INFO L225 Difference]: With dead ends: 44 [2019-10-02 11:16:09,819 INFO L226 Difference]: Without dead ends: 29 [2019-10-02 11:16:09,820 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:16:09,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-02 11:16:09,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-10-02 11:16:09,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-02 11:16:09,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-10-02 11:16:09,826 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 20 [2019-10-02 11:16:09,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:16:09,826 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-10-02 11:16:09,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:16:09,827 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-10-02 11:16:09,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-02 11:16:09,827 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:16:09,828 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:16:09,828 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:16:09,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:16:09,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1330084180, now seen corresponding path program 1 times [2019-10-02 11:16:09,829 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:16:09,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:16:09,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:16:09,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:16:09,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:16:09,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:16:09,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:16:09,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:16:09,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:16:09,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:16:09,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:16:09,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:16:09,886 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 6 states. [2019-10-02 11:16:09,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:16:09,950 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-10-02 11:16:09,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:16:09,951 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-10-02 11:16:09,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:16:09,952 INFO L225 Difference]: With dead ends: 42 [2019-10-02 11:16:09,952 INFO L226 Difference]: Without dead ends: 40 [2019-10-02 11:16:09,953 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:16:09,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-02 11:16:09,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 27. [2019-10-02 11:16:09,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-02 11:16:09,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-10-02 11:16:09,966 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 21 [2019-10-02 11:16:09,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:16:09,969 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-10-02 11:16:09,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:16:09,969 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-10-02 11:16:09,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-02 11:16:09,970 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:16:09,970 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:16:09,971 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:16:09,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:16:09,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1309636523, now seen corresponding path program 1 times [2019-10-02 11:16:09,971 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:16:09,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:16:09,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:16:09,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:16:09,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:16:10,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:16:10,315 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:16:10,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:16:10,316 INFO L224 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) [2019-10-02 11:16:10,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:16:10,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:16:10,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-02 11:16:10,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:16:10,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:16:10,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:16:10,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2019-10-02 11:16:10,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:16:10,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:16:10,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:16:10,596 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 7 states. [2019-10-02 11:16:15,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:16:15,242 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2019-10-02 11:16:15,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:16:15,245 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-10-02 11:16:15,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:16:15,246 INFO L225 Difference]: With dead ends: 44 [2019-10-02 11:16:15,246 INFO L226 Difference]: Without dead ends: 36 [2019-10-02 11:16:15,247 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:16:15,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-02 11:16:15,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2019-10-02 11:16:15,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-02 11:16:15,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-10-02 11:16:15,252 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 22 [2019-10-02 11:16:15,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:16:15,252 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-10-02 11:16:15,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:16:15,253 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-10-02 11:16:15,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-02 11:16:15,253 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:16:15,253 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 11:16:15,254 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:16:15,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:16:15,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1426055415, now seen corresponding path program 1 times [2019-10-02 11:16:15,254 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:16:15,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:16:15,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:16:15,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:16:15,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:16:15,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:16:16,493 WARN L191 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2019-10-02 11:16:16,613 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:16:16,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:16:16,614 INFO L224 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 -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 11:16:16,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:16:16,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:16:16,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-02 11:16:16,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:16:24,558 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:16:24,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:16:24,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4] total 11 [2019-10-02 11:16:24,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:16:24,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:16:24,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=80, Unknown=3, NotChecked=0, Total=110 [2019-10-02 11:16:24,564 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 11 states. [2019-10-02 11:16:31,235 WARN L191 SmtUtils]: Spent 4.32 s on a formula simplification. DAG size of input: 32 DAG size of output: 26 [2019-10-02 11:16:37,740 WARN L191 SmtUtils]: Spent 6.34 s on a formula simplification that was a NOOP. DAG size: 30 [2019-10-02 11:17:03,458 WARN L191 SmtUtils]: Spent 6.78 s on a formula simplification. DAG size of input: 61 DAG size of output: 27 [2019-10-02 11:17:20,623 WARN L191 SmtUtils]: Spent 3.57 s on a formula simplification. DAG size of input: 30 DAG size of output: 25 [2019-10-02 11:17:20,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:20,624 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2019-10-02 11:17:20,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:17:20,624 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2019-10-02 11:17:20,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:20,625 INFO L225 Difference]: With dead ends: 34 [2019-10-02 11:17:20,625 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 11:17:20,625 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 34.8s TimeCoverageRelationStatistics Valid=65, Invalid=171, Unknown=4, NotChecked=0, Total=240 [2019-10-02 11:17:20,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 11:17:20,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 11:17:20,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 11:17:20,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 11:17:20,626 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2019-10-02 11:17:20,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:20,626 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 11:17:20,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:17:20,627 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 11:17:20,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 11:17:20,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 11:17:25,154 WARN L191 SmtUtils]: Spent 4.47 s on a formula simplification. DAG size of input: 80 DAG size of output: 56 [2019-10-02 11:17:28,540 WARN L191 SmtUtils]: Spent 3.38 s on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-10-02 11:17:49,748 WARN L191 SmtUtils]: Spent 21.20 s on a formula simplification. DAG size of input: 55 DAG size of output: 37 [2019-10-02 11:17:49,839 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-02 11:17:49,840 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-02 11:17:49,840 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 11:17:49,840 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 11:17:49,840 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-02 11:17:49,840 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 11:17:49,841 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 11:17:49,841 INFO L446 ceAbstractionStarter]: At program point L126(lines 93 127) the Hoare annotation is: true [2019-10-02 11:17:49,841 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 9 163) no Hoare annotation was computed. [2019-10-02 11:17:49,841 INFO L439 ceAbstractionStarter]: At program point L151(lines 21 152) the Hoare annotation is: (or (and (<= main_~main__index2~0 (+ (* 4294967296 (div (+ (* (- 4294967296) (div (+ main_~main__index1~0 (* (- 1) main_~main__index2~0) 4294967294) 4294967296)) main_~main__index1~0 (- 1)) 4294967296)) 99998)) (= main_~__VERIFIER_assert__cond~0 1) (let ((.cse5 (div main_~main__index2~0 4294967296)) (.cse6 (div main_~main__index1~0 4294967296))) (or (let ((.cse4 (select |#memory_int| |main_~#main__array~0.base|))) (let ((.cse3 (select .cse4 (+ (* (- 17179869184) .cse6) (* 4 main_~main__index1~0) |main_~#main__array~0.offset|))) (.cse1 (select .cse4 (+ (* 4 main_~main__index2~0) |main_~#main__array~0.offset| (* (- 17179869184) .cse5))))) (let ((.cse2 (+ .cse3 (* 4294967296 (div .cse1 4294967296)))) (.cse0 (* 4294967296 (div .cse3 4294967296)))) (and (<= (+ .cse0 .cse1) .cse2) (< .cse2 (+ .cse0 .cse1 1)))))) (<= (+ main_~main__index1~0 (* 4294967296 .cse5)) (+ (* 4294967296 .cse6) main_~main__index2~0))))) (= main_~main__loop_entered~0 0)) [2019-10-02 11:17:49,841 INFO L443 ceAbstractionStarter]: For program point L52(lines 52 128) no Hoare annotation was computed. [2019-10-02 11:17:49,841 INFO L443 ceAbstractionStarter]: For program point L19(lines 19 157) no Hoare annotation was computed. [2019-10-02 11:17:49,842 INFO L439 ceAbstractionStarter]: At program point L114(lines 94 123) the Hoare annotation is: (let ((.cse7 (div main_~main__index1~0 4294967296)) (.cse6 (div main_~main__index2~0 4294967296))) (let ((.cse0 (= main_~__VERIFIER_assert__cond~0 1)) (.cse8 (* 4294967296 .cse6)) (.cse9 (+ (* 4294967296 .cse7) main_~main__index2~0))) (or (and (<= main_~main__index2~0 (+ (* 4294967296 (div (+ (* (- 4294967296) (div (+ main_~main__index1~0 (* (- 1) main_~main__index2~0) 4294967294) 4294967296)) main_~main__index1~0 (- 1)) 4294967296)) 99998)) .cse0 (or (let ((.cse5 (select |#memory_int| |main_~#main__array~0.base|))) (let ((.cse4 (select .cse5 (+ (* (- 17179869184) .cse7) (* 4 main_~main__index1~0) |main_~#main__array~0.offset|))) (.cse2 (select .cse5 (+ (* 4 main_~main__index2~0) |main_~#main__array~0.offset| (* (- 17179869184) .cse6))))) (let ((.cse3 (+ .cse4 (* 4294967296 (div .cse2 4294967296)))) (.cse1 (* 4294967296 (div .cse4 4294967296)))) (and (<= (+ .cse1 .cse2) .cse3) (< .cse3 (+ .cse1 .cse2 1)))))) (<= (+ main_~main__index1~0 .cse8) .cse9))) (and (<= main_~main__index2~0 (+ .cse8 99999)) .cse0 (not (= main_~__VERIFIER_assert__cond~2 0)) (<= (+ main_~main__index1~0 .cse8 1) .cse9))))) [2019-10-02 11:17:49,842 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2019-10-02 11:17:49,842 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2019-10-02 11:17:49,842 INFO L443 ceAbstractionStarter]: For program point L57(lines 57 83) no Hoare annotation was computed. [2019-10-02 11:17:49,843 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 147) no Hoare annotation was computed. [2019-10-02 11:17:49,843 INFO L439 ceAbstractionStarter]: At program point L82(lines 57 83) the Hoare annotation is: (let ((.cse1 (* 4294967296 (div main_~main__index1~0 4294967296))) (.cse0 (div main_~main__index2~0 4294967296))) (and (= main_~__VERIFIER_assert__cond~0 1) (not (= 0 main_~main____CPAchecker_TMP_0~1)) (<= (+ main_~main__index1~0 (* 4294967296 (div (+ main_~main__index2~0 1) 4294967296))) (+ (* 4294967296 (div (+ main_~main__index1~0 (- 1)) 4294967296)) main_~main__index2~0 1)) (<= (+ main_~main__index1~0 (* 4294967296 .cse0) 1) (+ .cse1 main_~main__index2~0)) (<= (+ (* 4294967296 (div (+ .cse1 main_~main__index2~0 (* (- 4294967296) .cse0) 4294867297) 4294967296)) 1) main_~main__index1~0))) [2019-10-02 11:17:49,843 INFO L443 ceAbstractionStarter]: For program point L16(lines 16 162) no Hoare annotation was computed. [2019-10-02 11:17:49,843 INFO L443 ceAbstractionStarter]: For program point L45(lines 45 133) no Hoare annotation was computed. [2019-10-02 11:17:49,843 INFO L439 ceAbstractionStarter]: At program point L74(lines 41 134) the Hoare annotation is: (let ((.cse3 (* 4294967296 (div main_~main__index2~0 4294967296)))) (let ((.cse0 (<= main_~main__index2~0 (+ .cse3 99999))) (.cse1 (= main_~__VERIFIER_assert__cond~0 1)) (.cse2 (<= (+ main_~main__index1~0 .cse3 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)))) (or (and (= 1 main_~main____CPAchecker_TMP_0~0) .cse0 .cse1 .cse2) (and .cse0 .cse1 (not (= 0 main_~main____CPAchecker_TMP_0~1)) (not (= main_~__VERIFIER_assert__cond~1 0)) .cse2)))) [2019-10-02 11:17:49,843 INFO L443 ceAbstractionStarter]: For program point L103(lines 103 115) no Hoare annotation was computed. [2019-10-02 11:17:49,843 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-10-02 11:17:49,844 INFO L443 ceAbstractionStarter]: For program point L66(lines 66 75) no Hoare annotation was computed. [2019-10-02 11:17:49,844 INFO L439 ceAbstractionStarter]: At program point L87(lines 55 88) the Hoare annotation is: false [2019-10-02 11:17:49,844 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 152) no Hoare annotation was computed. [2019-10-02 11:17:49,844 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 37) no Hoare annotation was computed. [2019-10-02 11:17:49,844 INFO L439 ceAbstractionStarter]: At program point L141(lines 26 142) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div main_~main__index2~0 4294967296)))) (and (= 1 main_~main____CPAchecker_TMP_0~0) (<= main_~main__index2~0 (+ .cse0 99999)) (= main_~main__loop_entered~0 0) (<= (+ main_~main__index1~0 .cse0 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)))) [2019-10-02 11:17:49,844 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 9 163) no Hoare annotation was computed. [2019-10-02 11:17:49,844 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 9 163) the Hoare annotation is: true [2019-10-02 11:17:49,845 INFO L443 ceAbstractionStarter]: For program point L26(lines 26 142) no Hoare annotation was computed. [2019-10-02 11:17:49,845 INFO L443 ceAbstractionStarter]: For program point L55(lines 55 88) no Hoare annotation was computed. [2019-10-02 11:17:49,845 INFO L439 ceAbstractionStarter]: At program point L146(lines 24 147) the Hoare annotation is: false [2019-10-02 11:17:49,845 INFO L443 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-10-02 11:17:49,845 INFO L443 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2019-10-02 11:17:49,845 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 134) no Hoare annotation was computed. [2019-10-02 11:17:49,854 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,855 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,856 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,856 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,856 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,856 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,857 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,857 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,864 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,864 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,864 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,865 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,865 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,865 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,865 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,865 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,869 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,869 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,870 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,870 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,870 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,870 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,871 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,871 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,872 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,873 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,873 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,873 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,873 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,874 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,874 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,874 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 11:17:49 BoogieIcfgContainer [2019-10-02 11:17:49,879 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 11:17:49,881 INFO L168 Benchmark]: Toolchain (without parser) took 103512.54 ms. Allocated memory was 133.7 MB in the beginning and 259.5 MB in the end (delta: 125.8 MB). Free memory was 89.9 MB in the beginning and 164.4 MB in the end (delta: -74.5 MB). Peak memory consumption was 51.3 MB. Max. memory is 7.1 GB. [2019-10-02 11:17:49,882 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 133.7 MB. Free memory was 108.0 MB in the beginning and 107.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 11:17:49,883 INFO L168 Benchmark]: CACSL2BoogieTranslator took 366.57 ms. Allocated memory was 133.7 MB in the beginning and 199.2 MB in the end (delta: 65.5 MB). Free memory was 89.7 MB in the beginning and 175.3 MB in the end (delta: -85.6 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. [2019-10-02 11:17:49,884 INFO L168 Benchmark]: Boogie Preprocessor took 32.07 ms. Allocated memory is still 199.2 MB. Free memory was 175.3 MB in the beginning and 173.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-10-02 11:17:49,885 INFO L168 Benchmark]: RCFGBuilder took 335.90 ms. Allocated memory is still 199.2 MB. Free memory was 173.4 MB in the beginning and 154.8 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. [2019-10-02 11:17:49,886 INFO L168 Benchmark]: TraceAbstraction took 102772.60 ms. Allocated memory was 199.2 MB in the beginning and 259.5 MB in the end (delta: 60.3 MB). Free memory was 154.8 MB in the beginning and 164.4 MB in the end (delta: -9.6 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. [2019-10-02 11:17:49,890 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.21 ms. Allocated memory is still 133.7 MB. Free memory was 108.0 MB in the beginning and 107.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 366.57 ms. Allocated memory was 133.7 MB in the beginning and 199.2 MB in the end (delta: 65.5 MB). Free memory was 89.7 MB in the beginning and 175.3 MB in the end (delta: -85.6 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 32.07 ms. Allocated memory is still 199.2 MB. Free memory was 175.3 MB in the beginning and 173.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 335.90 ms. Allocated memory is still 199.2 MB. Free memory was 173.4 MB in the beginning and 154.8 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 102772.60 ms. Allocated memory was 199.2 MB in the beginning and 259.5 MB in the end (delta: 60.3 MB). Free memory was 154.8 MB in the beginning and 164.4 MB in the end (delta: -9.6 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 37]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 105]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant [2019-10-02 11:17:49,905 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,905 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,905 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,905 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,906 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,906 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,906 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,906 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,907 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,908 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,908 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,908 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,908 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,908 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,909 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,909 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((main__index2 <= 4294967296 * ((-4294967296 * ((main__index1 + -1 * main__index2 + 4294967294) / 4294967296) + main__index1 + -1) / 4294967296) + 99998 && __VERIFIER_assert__cond == 1) && ((4294967296 * (unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] / 4294967296) + unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] <= unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] + 4294967296 * (unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] / 4294967296) && unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] + 4294967296 * (unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] / 4294967296) < 4294967296 * (unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] / 4294967296) + unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] + 1) || main__index1 + 4294967296 * (main__index2 / 4294967296) <= 4294967296 * (main__index1 / 4294967296) + main__index2)) || main__loop_entered == 0 - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 94]: Loop Invariant [2019-10-02 11:17:49,910 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,910 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,911 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,911 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,911 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,911 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,911 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,912 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,913 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,913 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,913 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,913 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,913 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,914 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,914 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-02 11:17:49,914 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((main__index2 <= 4294967296 * ((-4294967296 * ((main__index1 + -1 * main__index2 + 4294967294) / 4294967296) + main__index1 + -1) / 4294967296) + 99998 && __VERIFIER_assert__cond == 1) && ((4294967296 * (unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] / 4294967296) + unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] <= unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] + 4294967296 * (unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] / 4294967296) && unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] + 4294967296 * (unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] / 4294967296) < 4294967296 * (unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] / 4294967296) + unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] + 1) || main__index1 + 4294967296 * (main__index2 / 4294967296) <= 4294967296 * (main__index1 / 4294967296) + main__index2)) || (((main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999 && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((__VERIFIER_assert__cond == 1 && !(0 == main____CPAchecker_TMP_0)) && main__index1 + 4294967296 * ((main__index2 + 1) / 4294967296) <= 4294967296 * ((main__index1 + -1) / 4294967296) + main__index2 + 1) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2) && 4294967296 * ((4294967296 * (main__index1 / 4294967296) + main__index2 + -4294967296 * (main__index2 / 4294967296) + 4294867297) / 4294967296) + 1 <= main__index1 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: ((1 == main____CPAchecker_TMP_0 && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && main__loop_entered == 0) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2 - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: (((1 == main____CPAchecker_TMP_0 && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && __VERIFIER_assert__cond == 1) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2) || ((((main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999 && __VERIFIER_assert__cond == 1) && !(0 == main____CPAchecker_TMP_0)) && !(__VERIFIER_assert__cond == 0)) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 36 locations, 3 error locations. SAFE Result, 102.6s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 61.4s AutomataDifference, 0.0s DeadEndRemovalTime, 29.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 217 SDtfs, 221 SDslu, 337 SDs, 0 SdLazy, 225 SolverSat, 23 SolverUnsat, 13 SolverUnknown, 0 SolverNotchecked, 32.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 66 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 36.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=0, 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.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 50 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 26 NumberOfFragments, 567 HoareAnnotationTreeSize, 12 FomulaSimplifications, 1108 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 822 FormulaSimplificationTreeSizeReductionInter, 29.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 11.2s InterpolantComputationTime, 199 NumberOfCodeBlocks, 199 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 189 ConstructedInterpolants, 0 QuantifiedInterpolants, 72888 SizeOfPredicates, 4 NumberOfNonLiveVariables, 264 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 9/14 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...