/usr/bin/java -ea -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/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loop-lit/jm2006.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:49:37,348 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:49:37,350 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:49:37,363 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:49:37,363 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:49:37,364 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:49:37,366 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:49:37,368 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:49:37,370 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:49:37,371 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:49:37,372 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:49:37,373 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:49:37,373 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:49:37,374 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:49:37,375 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:49:37,376 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:49:37,377 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:49:37,378 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:49:37,380 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:49:37,382 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:49:37,384 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:49:37,385 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:49:37,386 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:49:37,387 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:49:37,389 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:49:37,389 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:49:37,389 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:49:37,390 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:49:37,391 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:49:37,392 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:49:37,392 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:49:37,393 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:49:37,394 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:49:37,394 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:49:37,396 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:49:37,396 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:49:37,397 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:49:37,397 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:49:37,397 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:49:37,398 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:49:37,399 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:49:37,400 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 00:49:37,409 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:49:37,409 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:49:37,410 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:49:37,411 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:49:37,411 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:49:37,411 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:49:37,411 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:49:37,411 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:49:37,412 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:49:37,412 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:49:37,412 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:49:37,412 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:49:37,412 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:49:37,413 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:49:37,413 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:49:37,413 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:49:37,413 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:49:37,413 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:49:37,414 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:49:37,414 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:49:37,414 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:49:37,414 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:49:37,414 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:49:37,703 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:49:37,723 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:49:37,726 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:49:37,728 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:49:37,728 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:49:37,730 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/jm2006.i [2020-07-18 00:49:37,806 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36e597d1c/30c4f28e838741fba2e602c5731322af/FLAG2b2ca5ac5 [2020-07-18 00:49:38,293 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:49:38,294 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/jm2006.i [2020-07-18 00:49:38,300 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36e597d1c/30c4f28e838741fba2e602c5731322af/FLAG2b2ca5ac5 [2020-07-18 00:49:38,644 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36e597d1c/30c4f28e838741fba2e602c5731322af [2020-07-18 00:49:38,655 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:49:38,658 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:49:38,659 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:49:38,659 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:49:38,663 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:49:38,665 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:49:38" (1/1) ... [2020-07-18 00:49:38,668 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dc06059 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:49:38, skipping insertion in model container [2020-07-18 00:49:38,668 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:49:38" (1/1) ... [2020-07-18 00:49:38,676 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:49:38,698 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:49:38,887 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:49:38,892 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:49:38,910 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:49:38,926 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:49:38,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:49:38 WrapperNode [2020-07-18 00:49:38,926 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:49:38,927 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:49:38,927 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:49:38,927 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:49:38,941 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:49:38" (1/1) ... [2020-07-18 00:49:38,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:49:38" (1/1) ... [2020-07-18 00:49:39,030 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:49:38" (1/1) ... [2020-07-18 00:49:39,031 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:49:38" (1/1) ... [2020-07-18 00:49:39,037 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:49:38" (1/1) ... [2020-07-18 00:49:39,043 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:49:38" (1/1) ... [2020-07-18 00:49:39,045 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:49:38" (1/1) ... [2020-07-18 00:49:39,049 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:49:39,050 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:49:39,050 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:49:39,052 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:49:39,053 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:49:38" (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 [2020-07-18 00:49:39,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:49:39,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:49:39,119 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-18 00:49:39,119 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-18 00:49:39,119 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:49:39,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:49:39,120 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-18 00:49:39,120 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-18 00:49:39,120 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-18 00:49:39,120 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 00:49:39,120 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:49:39,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:49:39,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:49:39,437 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:49:39,438 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-18 00:49:39,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:49:39 BoogieIcfgContainer [2020-07-18 00:49:39,442 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:49:39,443 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:49:39,444 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:49:39,447 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:49:39,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:49:38" (1/3) ... [2020-07-18 00:49:39,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@461c511f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:49:39, skipping insertion in model container [2020-07-18 00:49:39,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:49:38" (2/3) ... [2020-07-18 00:49:39,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@461c511f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:49:39, skipping insertion in model container [2020-07-18 00:49:39,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:49:39" (3/3) ... [2020-07-18 00:49:39,451 INFO L109 eAbstractionObserver]: Analyzing ICFG jm2006.i [2020-07-18 00:49:39,462 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:49:39,469 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:49:39,484 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:49:39,522 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:49:39,522 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:49:39,522 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:49:39,522 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:49:39,522 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:49:39,523 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:49:39,523 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:49:39,523 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:49:39,541 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2020-07-18 00:49:39,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-18 00:49:39,550 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:49:39,551 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:49:39,551 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:49:39,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:49:39,558 INFO L82 PathProgramCache]: Analyzing trace with hash -47870921, now seen corresponding path program 1 times [2020-07-18 00:49:39,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:49:39,565 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2055487630] [2020-07-18 00:49:39,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:49:39,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:40,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:40,054 INFO L280 TraceCheckUtils]: 0: Hoare triple {39#true} assume true; {39#true} is VALID [2020-07-18 00:49:40,055 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {39#true} {39#true} #67#return; {39#true} is VALID [2020-07-18 00:49:40,058 INFO L263 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {39#true} is VALID [2020-07-18 00:49:40,058 INFO L280 TraceCheckUtils]: 1: Hoare triple {39#true} assume true; {39#true} is VALID [2020-07-18 00:49:40,059 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {39#true} {39#true} #67#return; {39#true} is VALID [2020-07-18 00:49:40,059 INFO L263 TraceCheckUtils]: 3: Hoare triple {39#true} call #t~ret4 := main(); {39#true} is VALID [2020-07-18 00:49:40,060 INFO L280 TraceCheckUtils]: 4: Hoare triple {39#true} havoc ~i~0; {39#true} is VALID [2020-07-18 00:49:40,060 INFO L280 TraceCheckUtils]: 5: Hoare triple {39#true} havoc ~j~0; {39#true} is VALID [2020-07-18 00:49:40,061 INFO L280 TraceCheckUtils]: 6: Hoare triple {39#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {39#true} is VALID [2020-07-18 00:49:40,061 INFO L280 TraceCheckUtils]: 7: Hoare triple {39#true} ~i~0 := #t~nondet0; {39#true} is VALID [2020-07-18 00:49:40,062 INFO L280 TraceCheckUtils]: 8: Hoare triple {39#true} havoc #t~nondet0; {39#true} is VALID [2020-07-18 00:49:40,062 INFO L280 TraceCheckUtils]: 9: Hoare triple {39#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {39#true} is VALID [2020-07-18 00:49:40,062 INFO L280 TraceCheckUtils]: 10: Hoare triple {39#true} ~j~0 := #t~nondet1; {39#true} is VALID [2020-07-18 00:49:40,063 INFO L280 TraceCheckUtils]: 11: Hoare triple {39#true} havoc #t~nondet1; {39#true} is VALID [2020-07-18 00:49:40,063 INFO L280 TraceCheckUtils]: 12: Hoare triple {39#true} assume !!(~i~0 >= 0 && ~j~0 >= 0); {39#true} is VALID [2020-07-18 00:49:40,065 INFO L280 TraceCheckUtils]: 13: Hoare triple {39#true} ~x~0 := ~i~0; {43#(and (<= main_~i~0 main_~x~0) (<= main_~x~0 main_~i~0))} is VALID [2020-07-18 00:49:40,067 INFO L280 TraceCheckUtils]: 14: Hoare triple {43#(and (<= main_~i~0 main_~x~0) (<= main_~x~0 main_~i~0))} ~y~0 := ~j~0; {44#(and (or (<= (+ main_~i~0 main_~y~0) (+ main_~x~0 main_~j~0)) (<= main_~y~0 0)) (or (<= (+ main_~x~0 main_~j~0) (+ main_~i~0 main_~y~0)) (< 0 (+ main_~y~0 1))))} is VALID [2020-07-18 00:49:40,070 INFO L280 TraceCheckUtils]: 15: Hoare triple {44#(and (or (<= (+ main_~i~0 main_~y~0) (+ main_~x~0 main_~j~0)) (<= main_~y~0 0)) (or (<= (+ main_~x~0 main_~j~0) (+ main_~i~0 main_~y~0)) (< 0 (+ main_~y~0 1))))} assume !(0 != ~x~0); {45#(and (or (<= (+ main_~i~0 main_~y~0) main_~j~0) (<= main_~y~0 0)) (or (<= main_~j~0 (+ main_~i~0 main_~y~0)) (< 0 (+ main_~y~0 1))))} is VALID [2020-07-18 00:49:40,071 INFO L280 TraceCheckUtils]: 16: Hoare triple {45#(and (or (<= (+ main_~i~0 main_~y~0) main_~j~0) (<= main_~y~0 0)) (or (<= main_~j~0 (+ main_~i~0 main_~y~0)) (< 0 (+ main_~y~0 1))))} assume ~i~0 == ~j~0; {46#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2020-07-18 00:49:40,075 INFO L263 TraceCheckUtils]: 17: Hoare triple {46#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if 0 == ~y~0 then 1 else 0)); {47#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:49:40,076 INFO L280 TraceCheckUtils]: 18: Hoare triple {47#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {48#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:49:40,078 INFO L280 TraceCheckUtils]: 19: Hoare triple {48#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {40#false} is VALID [2020-07-18 00:49:40,078 INFO L280 TraceCheckUtils]: 20: Hoare triple {40#false} assume !false; {40#false} is VALID [2020-07-18 00:49:40,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:49:40,085 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:49:40,086 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2055487630] [2020-07-18 00:49:40,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:49:40,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-18 00:49:40,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488334478] [2020-07-18 00:49:40,097 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-07-18 00:49:40,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:49:40,106 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-18 00:49:40,144 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:40,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-18 00:49:40,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:49:40,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-18 00:49:40,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-18 00:49:40,158 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 8 states. [2020-07-18 00:49:40,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:40,895 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2020-07-18 00:49:40,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-18 00:49:40,896 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-07-18 00:49:40,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:49:40,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 00:49:40,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 75 transitions. [2020-07-18 00:49:40,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 00:49:40,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 75 transitions. [2020-07-18 00:49:40,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 75 transitions. [2020-07-18 00:49:41,029 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:41,042 INFO L225 Difference]: With dead ends: 64 [2020-07-18 00:49:41,042 INFO L226 Difference]: Without dead ends: 31 [2020-07-18 00:49:41,046 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-07-18 00:49:41,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-18 00:49:41,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2020-07-18 00:49:41,114 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:49:41,114 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 29 states. [2020-07-18 00:49:41,115 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 29 states. [2020-07-18 00:49:41,116 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 29 states. [2020-07-18 00:49:41,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:41,120 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2020-07-18 00:49:41,120 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2020-07-18 00:49:41,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:41,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:41,121 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 31 states. [2020-07-18 00:49:41,121 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 31 states. [2020-07-18 00:49:41,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:41,125 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2020-07-18 00:49:41,126 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2020-07-18 00:49:41,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:41,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:41,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:49:41,128 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:49:41,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-18 00:49:41,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2020-07-18 00:49:41,132 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 21 [2020-07-18 00:49:41,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:49:41,132 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2020-07-18 00:49:41,133 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-18 00:49:41,133 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 29 transitions. [2020-07-18 00:49:41,177 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:41,177 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2020-07-18 00:49:41,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-18 00:49:41,178 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:49:41,178 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-07-18 00:49:41,179 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:49:41,179 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:49:41,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:49:41,180 INFO L82 PathProgramCache]: Analyzing trace with hash -999978286, now seen corresponding path program 1 times [2020-07-18 00:49:41,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:49:41,180 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1776101783] [2020-07-18 00:49:41,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:49:41,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:41,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:41,631 INFO L280 TraceCheckUtils]: 0: Hoare triple {307#true} assume true; {307#true} is VALID [2020-07-18 00:49:41,632 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {307#true} {307#true} #67#return; {307#true} is VALID [2020-07-18 00:49:41,632 INFO L263 TraceCheckUtils]: 0: Hoare triple {307#true} call ULTIMATE.init(); {307#true} is VALID [2020-07-18 00:49:41,633 INFO L280 TraceCheckUtils]: 1: Hoare triple {307#true} assume true; {307#true} is VALID [2020-07-18 00:49:41,633 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {307#true} {307#true} #67#return; {307#true} is VALID [2020-07-18 00:49:41,634 INFO L263 TraceCheckUtils]: 3: Hoare triple {307#true} call #t~ret4 := main(); {307#true} is VALID [2020-07-18 00:49:41,634 INFO L280 TraceCheckUtils]: 4: Hoare triple {307#true} havoc ~i~0; {307#true} is VALID [2020-07-18 00:49:41,634 INFO L280 TraceCheckUtils]: 5: Hoare triple {307#true} havoc ~j~0; {307#true} is VALID [2020-07-18 00:49:41,634 INFO L280 TraceCheckUtils]: 6: Hoare triple {307#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {307#true} is VALID [2020-07-18 00:49:41,635 INFO L280 TraceCheckUtils]: 7: Hoare triple {307#true} ~i~0 := #t~nondet0; {307#true} is VALID [2020-07-18 00:49:41,635 INFO L280 TraceCheckUtils]: 8: Hoare triple {307#true} havoc #t~nondet0; {307#true} is VALID [2020-07-18 00:49:41,637 INFO L280 TraceCheckUtils]: 9: Hoare triple {307#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {307#true} is VALID [2020-07-18 00:49:41,637 INFO L280 TraceCheckUtils]: 10: Hoare triple {307#true} ~j~0 := #t~nondet1; {307#true} is VALID [2020-07-18 00:49:41,638 INFO L280 TraceCheckUtils]: 11: Hoare triple {307#true} havoc #t~nondet1; {307#true} is VALID [2020-07-18 00:49:41,638 INFO L280 TraceCheckUtils]: 12: Hoare triple {307#true} assume !!(~i~0 >= 0 && ~j~0 >= 0); {307#true} is VALID [2020-07-18 00:49:41,639 INFO L280 TraceCheckUtils]: 13: Hoare triple {307#true} ~x~0 := ~i~0; {311#(and (<= main_~i~0 main_~x~0) (<= main_~x~0 main_~i~0))} is VALID [2020-07-18 00:49:41,640 INFO L280 TraceCheckUtils]: 14: Hoare triple {311#(and (<= main_~i~0 main_~x~0) (<= main_~x~0 main_~i~0))} ~y~0 := ~j~0; {312#(and (<= (+ main_~x~0 main_~j~0) (+ main_~i~0 main_~y~0)) (<= (+ main_~i~0 main_~y~0) (+ main_~x~0 main_~j~0)))} is VALID [2020-07-18 00:49:41,641 INFO L280 TraceCheckUtils]: 15: Hoare triple {312#(and (<= (+ main_~x~0 main_~j~0) (+ main_~i~0 main_~y~0)) (<= (+ main_~i~0 main_~y~0) (+ main_~x~0 main_~j~0)))} assume !!(0 != ~x~0); {312#(and (<= (+ main_~x~0 main_~j~0) (+ main_~i~0 main_~y~0)) (<= (+ main_~i~0 main_~y~0) (+ main_~x~0 main_~j~0)))} is VALID [2020-07-18 00:49:41,643 INFO L280 TraceCheckUtils]: 16: Hoare triple {312#(and (<= (+ main_~x~0 main_~j~0) (+ main_~i~0 main_~y~0)) (<= (+ main_~i~0 main_~y~0) (+ main_~x~0 main_~j~0)))} #t~post2 := ~x~0; {313#(and (<= (+ main_~i~0 main_~y~0) (+ |main_#t~post2| main_~j~0)) (<= (+ |main_#t~post2| main_~j~0) (+ main_~i~0 main_~y~0)))} is VALID [2020-07-18 00:49:41,644 INFO L280 TraceCheckUtils]: 17: Hoare triple {313#(and (<= (+ main_~i~0 main_~y~0) (+ |main_#t~post2| main_~j~0)) (<= (+ |main_#t~post2| main_~j~0) (+ main_~i~0 main_~y~0)))} ~x~0 := #t~post2 - 1; {314#(and (<= (+ main_~x~0 main_~j~0 1) (+ main_~i~0 main_~y~0)) (<= (+ main_~i~0 main_~y~0) (+ main_~x~0 main_~j~0 1)))} is VALID [2020-07-18 00:49:41,645 INFO L280 TraceCheckUtils]: 18: Hoare triple {314#(and (<= (+ main_~x~0 main_~j~0 1) (+ main_~i~0 main_~y~0)) (<= (+ main_~i~0 main_~y~0) (+ main_~x~0 main_~j~0 1)))} havoc #t~post2; {314#(and (<= (+ main_~x~0 main_~j~0 1) (+ main_~i~0 main_~y~0)) (<= (+ main_~i~0 main_~y~0) (+ main_~x~0 main_~j~0 1)))} is VALID [2020-07-18 00:49:41,646 INFO L280 TraceCheckUtils]: 19: Hoare triple {314#(and (<= (+ main_~x~0 main_~j~0 1) (+ main_~i~0 main_~y~0)) (<= (+ main_~i~0 main_~y~0) (+ main_~x~0 main_~j~0 1)))} #t~post3 := ~y~0; {315#(and (<= (+ main_~x~0 main_~j~0 1) (+ main_~i~0 |main_#t~post3|)) (<= (+ main_~i~0 |main_#t~post3|) (+ main_~x~0 main_~j~0 1)))} is VALID [2020-07-18 00:49:41,648 INFO L280 TraceCheckUtils]: 20: Hoare triple {315#(and (<= (+ main_~x~0 main_~j~0 1) (+ main_~i~0 |main_#t~post3|)) (<= (+ main_~i~0 |main_#t~post3|) (+ main_~x~0 main_~j~0 1)))} ~y~0 := #t~post3 - 1; {316#(and (or (<= (+ main_~i~0 main_~y~0) (+ main_~x~0 main_~j~0)) (<= main_~y~0 0)) (or (<= (+ main_~x~0 main_~j~0) (+ main_~i~0 main_~y~0)) (< 0 (+ main_~y~0 1))))} is VALID [2020-07-18 00:49:41,649 INFO L280 TraceCheckUtils]: 21: Hoare triple {316#(and (or (<= (+ main_~i~0 main_~y~0) (+ main_~x~0 main_~j~0)) (<= main_~y~0 0)) (or (<= (+ main_~x~0 main_~j~0) (+ main_~i~0 main_~y~0)) (< 0 (+ main_~y~0 1))))} havoc #t~post3; {316#(and (or (<= (+ main_~i~0 main_~y~0) (+ main_~x~0 main_~j~0)) (<= main_~y~0 0)) (or (<= (+ main_~x~0 main_~j~0) (+ main_~i~0 main_~y~0)) (< 0 (+ main_~y~0 1))))} is VALID [2020-07-18 00:49:41,650 INFO L280 TraceCheckUtils]: 22: Hoare triple {316#(and (or (<= (+ main_~i~0 main_~y~0) (+ main_~x~0 main_~j~0)) (<= main_~y~0 0)) (or (<= (+ main_~x~0 main_~j~0) (+ main_~i~0 main_~y~0)) (< 0 (+ main_~y~0 1))))} assume !(0 != ~x~0); {317#(and (or (<= (+ main_~i~0 main_~y~0) main_~j~0) (<= main_~y~0 0)) (or (<= main_~j~0 (+ main_~i~0 main_~y~0)) (< 0 (+ main_~y~0 1))))} is VALID [2020-07-18 00:49:41,652 INFO L280 TraceCheckUtils]: 23: Hoare triple {317#(and (or (<= (+ main_~i~0 main_~y~0) main_~j~0) (<= main_~y~0 0)) (or (<= main_~j~0 (+ main_~i~0 main_~y~0)) (< 0 (+ main_~y~0 1))))} assume ~i~0 == ~j~0; {318#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2020-07-18 00:49:41,654 INFO L263 TraceCheckUtils]: 24: Hoare triple {318#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if 0 == ~y~0 then 1 else 0)); {319#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:49:41,655 INFO L280 TraceCheckUtils]: 25: Hoare triple {319#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {320#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:49:41,659 INFO L280 TraceCheckUtils]: 26: Hoare triple {320#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {308#false} is VALID [2020-07-18 00:49:41,659 INFO L280 TraceCheckUtils]: 27: Hoare triple {308#false} assume !false; {308#false} is VALID [2020-07-18 00:49:41,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:49:41,663 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:49:41,663 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1776101783] [2020-07-18 00:49:41,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:49:41,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-18 00:49:41,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76639310] [2020-07-18 00:49:41,665 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2020-07-18 00:49:41,665 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:49:41,665 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-18 00:49:41,699 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:41,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-18 00:49:41,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:49:41,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-18 00:49:41,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-07-18 00:49:41,701 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 12 states. [2020-07-18 00:49:42,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:42,321 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2020-07-18 00:49:42,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-18 00:49:42,321 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2020-07-18 00:49:42,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:49:42,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-18 00:49:42,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 31 transitions. [2020-07-18 00:49:42,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-18 00:49:42,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 31 transitions. [2020-07-18 00:49:42,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 31 transitions. [2020-07-18 00:49:42,363 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:42,364 INFO L225 Difference]: With dead ends: 31 [2020-07-18 00:49:42,364 INFO L226 Difference]: Without dead ends: 0 [2020-07-18 00:49:42,366 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2020-07-18 00:49:42,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-18 00:49:42,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-18 00:49:42,366 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:49:42,367 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-18 00:49:42,367 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 00:49:42,367 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 00:49:42,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:42,367 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 00:49:42,368 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:49:42,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:42,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:42,368 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 00:49:42,368 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 00:49:42,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:42,369 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 00:49:42,369 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:49:42,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:42,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:42,370 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:49:42,370 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:49:42,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-18 00:49:42,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-18 00:49:42,371 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2020-07-18 00:49:42,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:49:42,371 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-18 00:49:42,371 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-18 00:49:42,371 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-18 00:49:42,371 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:42,371 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:49:42,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:42,372 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:49:42,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-18 00:49:42,706 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-18 00:49:42,706 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-18 00:49:42,706 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-18 00:49:42,707 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-18 00:49:42,707 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-18 00:49:42,707 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-18 00:49:42,707 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-07-18 00:49:42,707 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-18 00:49:42,707 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-18 00:49:42,707 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-07-18 00:49:42,708 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-18 00:49:42,708 INFO L264 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (let ((.cse2 (<= main_~y~0 0)) (.cse3 (< 0 (+ main_~y~0 1)))) (or (let ((.cse1 (+ main_~i~0 main_~y~0)) (.cse0 (+ main_~x~0 main_~j~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0) .cse2 .cse3)) (and (<= main_~i~0 main_~x~0) .cse2 (<= main_~x~0 main_~i~0) .cse3))) [2020-07-18 00:49:42,708 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 28) the Hoare annotation is: true [2020-07-18 00:49:42,708 INFO L264 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (let ((.cse1 (+ main_~i~0 main_~y~0)) (.cse0 (+ main_~x~0 main_~j~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) [2020-07-18 00:49:42,708 INFO L264 CegarLoopResult]: At program point L21-1(line 21) the Hoare annotation is: (let ((.cse2 (+ main_~x~0 main_~j~0)) (.cse1 (+ |main_#t~post2| main_~j~0)) (.cse0 (+ main_~i~0 main_~y~0))) (and (<= .cse0 .cse1) (<= .cse2 .cse0) (<= .cse0 .cse2) (<= .cse1 .cse0))) [2020-07-18 00:49:42,709 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (and (<= main_~i~0 main_~x~0) (<= main_~x~0 main_~i~0)) [2020-07-18 00:49:42,709 INFO L264 CegarLoopResult]: At program point L21-2(line 21) the Hoare annotation is: (let ((.cse0 (+ main_~x~0 main_~j~0 1)) (.cse2 (+ |main_#t~post2| main_~j~0)) (.cse1 (+ main_~i~0 main_~y~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0) (<= .cse1 .cse2) (<= .cse2 .cse1))) [2020-07-18 00:49:42,709 INFO L271 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-07-18 00:49:42,709 INFO L271 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-07-18 00:49:42,709 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-07-18 00:49:42,709 INFO L271 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: true [2020-07-18 00:49:42,710 INFO L271 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: true [2020-07-18 00:49:42,710 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 28) the Hoare annotation is: true [2020-07-18 00:49:42,710 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 28) the Hoare annotation is: true [2020-07-18 00:49:42,710 INFO L271 CegarLoopResult]: At program point L24(lines 24 26) the Hoare annotation is: true [2020-07-18 00:49:42,710 INFO L264 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (let ((.cse1 (+ main_~i~0 main_~y~0)) (.cse0 (+ main_~x~0 main_~j~0 1))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) [2020-07-18 00:49:42,711 INFO L264 CegarLoopResult]: At program point L22-1(line 22) the Hoare annotation is: (let ((.cse1 (+ main_~i~0 main_~y~0)) (.cse2 (+ main_~i~0 |main_#t~post3|)) (.cse0 (+ main_~x~0 main_~j~0 1))) (and (<= .cse0 .cse1) (<= .cse0 .cse2) (<= .cse1 .cse0) (<= .cse2 .cse0))) [2020-07-18 00:49:42,711 INFO L264 CegarLoopResult]: At program point L22-2(line 22) the Hoare annotation is: (let ((.cse1 (+ main_~i~0 |main_#t~post3|)) (.cse0 (+ main_~x~0 main_~j~0 1)) (.cse3 (+ main_~i~0 main_~y~0)) (.cse2 (+ main_~x~0 main_~j~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0) (<= .cse2 .cse3) (<= .cse3 .cse2))) [2020-07-18 00:49:42,711 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-07-18 00:49:42,711 INFO L264 CegarLoopResult]: At program point L20-2(lines 20 23) the Hoare annotation is: (let ((.cse1 (+ main_~i~0 main_~y~0)) (.cse0 (+ main_~x~0 main_~j~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) [2020-07-18 00:49:42,712 INFO L264 CegarLoopResult]: At program point L20-3(lines 13 28) the Hoare annotation is: (let ((.cse5 (< 0 (+ main_~y~0 1))) (.cse4 (<= main_~y~0 0)) (.cse6 (+ main_~i~0 main_~y~0)) (.cse7 (+ main_~x~0 main_~j~0))) (let ((.cse1 (<= .cse6 .cse7)) (.cse0 (<= .cse7 .cse6)) (.cse2 (or (<= .cse6 main_~j~0) .cse4)) (.cse3 (or (<= main_~j~0 .cse6) .cse5))) (or (and .cse0 .cse1 .cse2 .cse3) (and (or .cse1 .cse4) (<= main_~i~0 main_~x~0) (or .cse0 .cse5) .cse2 (<= main_~x~0 main_~i~0) .cse3)))) [2020-07-18 00:49:42,712 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-07-18 00:49:42,712 INFO L271 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: true [2020-07-18 00:49:42,712 INFO L271 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: true [2020-07-18 00:49:42,712 INFO L271 CegarLoopResult]: At program point L16-2(line 16) the Hoare annotation is: true [2020-07-18 00:49:42,712 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-18 00:49:42,713 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 6 11) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-18 00:49:42,713 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-18 00:49:42,713 INFO L264 CegarLoopResult]: At program point L7(lines 7 9) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-18 00:49:42,713 INFO L264 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-18 00:49:42,713 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-18 00:49:42,718 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-18 00:49:42,719 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-18 00:49:42,720 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-18 00:49:42,720 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2020-07-18 00:49:42,721 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2020-07-18 00:49:42,736 INFO L163 areAnnotationChecker]: CFG has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-18 00:49:42,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 12:49:42 BoogieIcfgContainer [2020-07-18 00:49:42,751 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-18 00:49:42,754 INFO L168 Benchmark]: Toolchain (without parser) took 4097.25 ms. Allocated memory was 135.3 MB in the beginning and 259.5 MB in the end (delta: 124.3 MB). Free memory was 98.7 MB in the beginning and 221.1 MB in the end (delta: -122.4 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2020-07-18 00:49:42,755 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 135.3 MB. Free memory was 116.7 MB in the beginning and 116.5 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-07-18 00:49:42,756 INFO L168 Benchmark]: CACSL2BoogieTranslator took 267.72 ms. Allocated memory is still 135.3 MB. Free memory was 98.3 MB in the beginning and 88.6 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-07-18 00:49:42,757 INFO L168 Benchmark]: Boogie Preprocessor took 122.49 ms. Allocated memory was 135.3 MB in the beginning and 198.2 MB in the end (delta: 62.9 MB). Free memory was 88.6 MB in the beginning and 176.9 MB in the end (delta: -88.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 7.1 GB. [2020-07-18 00:49:42,758 INFO L168 Benchmark]: RCFGBuilder took 392.52 ms. Allocated memory is still 198.2 MB. Free memory was 176.2 MB in the beginning and 157.2 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. [2020-07-18 00:49:42,759 INFO L168 Benchmark]: TraceAbstraction took 3307.50 ms. Allocated memory was 198.2 MB in the beginning and 259.5 MB in the end (delta: 61.3 MB). Free memory was 156.4 MB in the beginning and 221.1 MB in the end (delta: -64.7 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-18 00:49:42,763 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 135.3 MB. Free memory was 116.7 MB in the beginning and 116.5 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 267.72 ms. Allocated memory is still 135.3 MB. Free memory was 98.3 MB in the beginning and 88.6 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 122.49 ms. Allocated memory was 135.3 MB in the beginning and 198.2 MB in the end (delta: 62.9 MB). Free memory was 88.6 MB in the beginning and 176.9 MB in the end (delta: -88.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 392.52 ms. Allocated memory is still 198.2 MB. Free memory was 176.2 MB in the beginning and 157.2 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3307.50 ms. Allocated memory was 198.2 MB in the beginning and 259.5 MB in the end (delta: 61.3 MB). Free memory was 156.4 MB in the beginning and 221.1 MB in the end (delta: -64.7 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: x + j <= i + y && i + y <= x + j - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 0 == \old(cond) || !(0 == cond) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 41 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 2.8s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 54 SDtfs, 40 SDslu, 253 SDs, 0 SdLazy, 177 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.8s 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 DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 36 LocationsWithAnnotation, 48 PreInvPairs, 70 NumberOfFragments, 355 HoareAnnotationTreeSize, 48 FomulaSimplifications, 104 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 36 FomulaSimplificationsInter, 33 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...