/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loop-lit/jm2006_variant.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 23:41:06,016 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 23:41:06,020 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 23:41:06,032 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 23:41:06,032 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 23:41:06,033 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 23:41:06,034 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 23:41:06,036 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 23:41:06,038 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 23:41:06,039 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 23:41:06,040 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 23:41:06,041 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 23:41:06,041 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 23:41:06,042 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 23:41:06,043 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 23:41:06,045 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 23:41:06,045 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 23:41:06,046 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 23:41:06,048 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 23:41:06,050 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 23:41:06,052 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 23:41:06,053 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 23:41:06,054 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 23:41:06,055 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 23:41:06,058 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 23:41:06,058 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 23:41:06,058 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 23:41:06,059 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 23:41:06,060 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 23:41:06,061 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 23:41:06,061 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 23:41:06,062 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 23:41:06,063 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 23:41:06,064 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 23:41:06,065 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 23:41:06,065 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 23:41:06,066 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 23:41:06,066 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 23:41:06,067 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 23:41:06,068 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 23:41:06,069 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 23:41:06,069 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 23:41:06,079 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 23:41:06,079 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 23:41:06,081 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 23:41:06,081 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 23:41:06,081 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 23:41:06,082 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 23:41:06,082 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 23:41:06,082 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 23:41:06,082 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 23:41:06,083 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 23:41:06,083 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 23:41:06,083 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 23:41:06,083 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 23:41:06,084 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 23:41:06,084 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 23:41:06,084 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 23:41:06,084 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 23:41:06,085 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 23:41:06,085 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 23:41:06,085 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 23:41:06,086 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 23:41:06,086 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 23:41:06,086 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-08 23:41:06,377 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 23:41:06,390 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 23:41:06,393 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 23:41:06,395 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 23:41:06,395 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 23:41:06,396 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/jm2006_variant.i [2020-07-08 23:41:06,457 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17c53a2aa/6e060b30181743cb8b5bd667840be917/FLAG86bebf039 [2020-07-08 23:41:06,879 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 23:41:06,879 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/jm2006_variant.i [2020-07-08 23:41:06,886 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17c53a2aa/6e060b30181743cb8b5bd667840be917/FLAG86bebf039 [2020-07-08 23:41:07,249 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17c53a2aa/6e060b30181743cb8b5bd667840be917 [2020-07-08 23:41:07,258 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 23:41:07,261 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 23:41:07,264 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 23:41:07,265 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 23:41:07,269 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 23:41:07,271 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 11:41:07" (1/1) ... [2020-07-08 23:41:07,275 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a1a3246 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:41:07, skipping insertion in model container [2020-07-08 23:41:07,275 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 11:41:07" (1/1) ... [2020-07-08 23:41:07,286 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 23:41:07,311 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 23:41:07,530 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 23:41:07,536 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 23:41:07,558 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 23:41:07,574 INFO L208 MainTranslator]: Completed translation [2020-07-08 23:41:07,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:41:07 WrapperNode [2020-07-08 23:41:07,575 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 23:41:07,575 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 23:41:07,576 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 23:41:07,576 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 23:41:07,589 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:41:07" (1/1) ... [2020-07-08 23:41:07,589 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:41:07" (1/1) ... [2020-07-08 23:41:07,594 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:41:07" (1/1) ... [2020-07-08 23:41:07,594 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:41:07" (1/1) ... [2020-07-08 23:41:07,599 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:41:07" (1/1) ... [2020-07-08 23:41:07,604 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:41:07" (1/1) ... [2020-07-08 23:41:07,605 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:41:07" (1/1) ... [2020-07-08 23:41:07,690 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 23:41:07,691 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 23:41:07,691 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 23:41:07,691 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 23:41:07,692 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:41:07" (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-08 23:41:07,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 23:41:07,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 23:41:07,752 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-08 23:41:07,753 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 23:41:07,753 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 23:41:07,753 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 23:41:07,753 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 23:41:07,753 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-08 23:41:07,753 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 23:41:07,753 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 23:41:07,754 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 23:41:07,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 23:41:07,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 23:41:08,045 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 23:41:08,045 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-08 23:41:08,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 11:41:08 BoogieIcfgContainer [2020-07-08 23:41:08,050 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 23:41:08,051 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 23:41:08,051 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 23:41:08,055 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 23:41:08,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 11:41:07" (1/3) ... [2020-07-08 23:41:08,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76e6c322 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 11:41:08, skipping insertion in model container [2020-07-08 23:41:08,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:41:07" (2/3) ... [2020-07-08 23:41:08,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76e6c322 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 11:41:08, skipping insertion in model container [2020-07-08 23:41:08,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 11:41:08" (3/3) ... [2020-07-08 23:41:08,059 INFO L109 eAbstractionObserver]: Analyzing ICFG jm2006_variant.i [2020-07-08 23:41:08,073 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 23:41:08,082 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 23:41:08,101 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 23:41:08,127 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 23:41:08,128 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 23:41:08,128 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-08 23:41:08,128 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 23:41:08,128 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 23:41:08,129 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 23:41:08,129 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 23:41:08,129 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 23:41:08,147 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2020-07-08 23:41:08,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-08 23:41:08,159 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:41:08,164 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] [2020-07-08 23:41:08,164 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:41:08,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:41:08,174 INFO L82 PathProgramCache]: Analyzing trace with hash 394160949, now seen corresponding path program 1 times [2020-07-08 23:41:08,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:41:08,184 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1435052692] [2020-07-08 23:41:08,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:41:08,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:41:08,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:41:08,333 INFO L280 TraceCheckUtils]: 0: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-08 23:41:08,334 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {43#true} {43#true} #74#return; {43#true} is VALID [2020-07-08 23:41:08,336 INFO L263 TraceCheckUtils]: 0: Hoare triple {43#true} call ULTIMATE.init(); {43#true} is VALID [2020-07-08 23:41:08,336 INFO L280 TraceCheckUtils]: 1: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-08 23:41:08,337 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {43#true} {43#true} #74#return; {43#true} is VALID [2020-07-08 23:41:08,337 INFO L263 TraceCheckUtils]: 3: Hoare triple {43#true} call #t~ret4 := main(); {43#true} is VALID [2020-07-08 23:41:08,338 INFO L280 TraceCheckUtils]: 4: Hoare triple {43#true} havoc ~i~0; {43#true} is VALID [2020-07-08 23:41:08,338 INFO L280 TraceCheckUtils]: 5: Hoare triple {43#true} havoc ~j~0; {43#true} is VALID [2020-07-08 23:41:08,338 INFO L280 TraceCheckUtils]: 6: Hoare triple {43#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {43#true} is VALID [2020-07-08 23:41:08,339 INFO L280 TraceCheckUtils]: 7: Hoare triple {43#true} ~i~0 := #t~nondet0; {43#true} is VALID [2020-07-08 23:41:08,339 INFO L280 TraceCheckUtils]: 8: Hoare triple {43#true} havoc #t~nondet0; {43#true} is VALID [2020-07-08 23:41:08,340 INFO L280 TraceCheckUtils]: 9: Hoare triple {43#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {43#true} is VALID [2020-07-08 23:41:08,340 INFO L280 TraceCheckUtils]: 10: Hoare triple {43#true} ~j~0 := #t~nondet1; {43#true} is VALID [2020-07-08 23:41:08,340 INFO L280 TraceCheckUtils]: 11: Hoare triple {43#true} havoc #t~nondet1; {43#true} is VALID [2020-07-08 23:41:08,341 INFO L280 TraceCheckUtils]: 12: Hoare triple {43#true} assume !!(~i~0 >= 0 && ~i~0 <= 1000000); {43#true} is VALID [2020-07-08 23:41:08,341 INFO L280 TraceCheckUtils]: 13: Hoare triple {43#true} assume !!(~j~0 >= 0); {43#true} is VALID [2020-07-08 23:41:08,342 INFO L280 TraceCheckUtils]: 14: Hoare triple {43#true} ~x~0 := ~i~0; {43#true} is VALID [2020-07-08 23:41:08,342 INFO L280 TraceCheckUtils]: 15: Hoare triple {43#true} ~y~0 := ~j~0; {43#true} is VALID [2020-07-08 23:41:08,342 INFO L280 TraceCheckUtils]: 16: Hoare triple {43#true} ~z~0 := 0; {43#true} is VALID [2020-07-08 23:41:08,345 INFO L280 TraceCheckUtils]: 17: Hoare triple {43#true} assume !true; {44#false} is VALID [2020-07-08 23:41:08,346 INFO L280 TraceCheckUtils]: 18: Hoare triple {44#false} assume ~i~0 == ~j~0; {44#false} is VALID [2020-07-08 23:41:08,346 INFO L263 TraceCheckUtils]: 19: Hoare triple {44#false} call __VERIFIER_assert((if ~y~0 == -~z~0 then 1 else 0)); {44#false} is VALID [2020-07-08 23:41:08,347 INFO L280 TraceCheckUtils]: 20: Hoare triple {44#false} ~cond := #in~cond; {44#false} is VALID [2020-07-08 23:41:08,347 INFO L280 TraceCheckUtils]: 21: Hoare triple {44#false} assume 0 == ~cond; {44#false} is VALID [2020-07-08 23:41:08,347 INFO L280 TraceCheckUtils]: 22: Hoare triple {44#false} assume !false; {44#false} is VALID [2020-07-08 23:41:08,350 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-08 23:41:08,351 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1435052692] [2020-07-08 23:41:08,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:41:08,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-08 23:41:08,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242022171] [2020-07-08 23:41:08,362 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2020-07-08 23:41:08,365 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:41:08,370 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-08 23:41:08,458 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:41:08,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-08 23:41:08,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:41:08,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-08 23:41:08,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-08 23:41:08,471 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 2 states. [2020-07-08 23:41:08,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:41:08,604 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2020-07-08 23:41:08,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-08 23:41:08,605 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2020-07-08 23:41:08,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:41:08,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-08 23:41:08,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 60 transitions. [2020-07-08 23:41:08,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-08 23:41:08,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 60 transitions. [2020-07-08 23:41:08,623 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 60 transitions. [2020-07-08 23:41:08,748 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:41:08,764 INFO L225 Difference]: With dead ends: 53 [2020-07-08 23:41:08,765 INFO L226 Difference]: Without dead ends: 31 [2020-07-08 23:41:08,775 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-08 23:41:08,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-08 23:41:08,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-08 23:41:08,830 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:41:08,830 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2020-07-08 23:41:08,830 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2020-07-08 23:41:08,831 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2020-07-08 23:41:08,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:41:08,837 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2020-07-08 23:41:08,837 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2020-07-08 23:41:08,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:41:08,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:41:08,838 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2020-07-08 23:41:08,839 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2020-07-08 23:41:08,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:41:08,848 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2020-07-08 23:41:08,848 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2020-07-08 23:41:08,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:41:08,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:41:08,859 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:41:08,860 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:41:08,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-08 23:41:08,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2020-07-08 23:41:08,868 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 23 [2020-07-08 23:41:08,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:41:08,869 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2020-07-08 23:41:08,869 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-08 23:41:08,870 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 31 transitions. [2020-07-08 23:41:08,916 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-08 23:41:08,916 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2020-07-08 23:41:08,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-08 23:41:08,917 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:41:08,917 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] [2020-07-08 23:41:08,918 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 23:41:08,920 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:41:08,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:41:08,920 INFO L82 PathProgramCache]: Analyzing trace with hash 79240288, now seen corresponding path program 1 times [2020-07-08 23:41:08,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:41:08,921 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [376059816] [2020-07-08 23:41:08,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:41:08,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:41:09,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:41:09,302 INFO L280 TraceCheckUtils]: 0: Hoare triple {279#true} assume true; {279#true} is VALID [2020-07-08 23:41:09,302 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {279#true} {279#true} #74#return; {279#true} is VALID [2020-07-08 23:41:09,303 INFO L263 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {279#true} is VALID [2020-07-08 23:41:09,303 INFO L280 TraceCheckUtils]: 1: Hoare triple {279#true} assume true; {279#true} is VALID [2020-07-08 23:41:09,303 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {279#true} {279#true} #74#return; {279#true} is VALID [2020-07-08 23:41:09,304 INFO L263 TraceCheckUtils]: 3: Hoare triple {279#true} call #t~ret4 := main(); {279#true} is VALID [2020-07-08 23:41:09,304 INFO L280 TraceCheckUtils]: 4: Hoare triple {279#true} havoc ~i~0; {279#true} is VALID [2020-07-08 23:41:09,304 INFO L280 TraceCheckUtils]: 5: Hoare triple {279#true} havoc ~j~0; {279#true} is VALID [2020-07-08 23:41:09,305 INFO L280 TraceCheckUtils]: 6: Hoare triple {279#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {279#true} is VALID [2020-07-08 23:41:09,305 INFO L280 TraceCheckUtils]: 7: Hoare triple {279#true} ~i~0 := #t~nondet0; {279#true} is VALID [2020-07-08 23:41:09,305 INFO L280 TraceCheckUtils]: 8: Hoare triple {279#true} havoc #t~nondet0; {279#true} is VALID [2020-07-08 23:41:09,305 INFO L280 TraceCheckUtils]: 9: Hoare triple {279#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {279#true} is VALID [2020-07-08 23:41:09,306 INFO L280 TraceCheckUtils]: 10: Hoare triple {279#true} ~j~0 := #t~nondet1; {279#true} is VALID [2020-07-08 23:41:09,306 INFO L280 TraceCheckUtils]: 11: Hoare triple {279#true} havoc #t~nondet1; {279#true} is VALID [2020-07-08 23:41:09,306 INFO L280 TraceCheckUtils]: 12: Hoare triple {279#true} assume !!(~i~0 >= 0 && ~i~0 <= 1000000); {279#true} is VALID [2020-07-08 23:41:09,307 INFO L280 TraceCheckUtils]: 13: Hoare triple {279#true} assume !!(~j~0 >= 0); {279#true} is VALID [2020-07-08 23:41:09,308 INFO L280 TraceCheckUtils]: 14: Hoare triple {279#true} ~x~0 := ~i~0; {283#(and (<= main_~i~0 main_~x~0) (<= main_~x~0 main_~i~0))} is VALID [2020-07-08 23:41:09,309 INFO L280 TraceCheckUtils]: 15: Hoare triple {283#(and (<= main_~i~0 main_~x~0) (<= main_~x~0 main_~i~0))} ~y~0 := ~j~0; {284#(and (<= (+ main_~y~0 main_~i~0) (+ main_~x~0 main_~j~0)) (<= (+ main_~x~0 main_~j~0) (+ main_~y~0 main_~i~0)))} is VALID [2020-07-08 23:41:09,310 INFO L280 TraceCheckUtils]: 16: Hoare triple {284#(and (<= (+ main_~y~0 main_~i~0) (+ main_~x~0 main_~j~0)) (<= (+ main_~x~0 main_~j~0) (+ main_~y~0 main_~i~0)))} ~z~0 := 0; {285#(and (or (< 0 (+ main_~y~0 main_~z~0 1)) (<= (+ main_~x~0 main_~j~0) (+ main_~y~0 main_~i~0 main_~z~0))) (or (<= (+ main_~y~0 main_~i~0 main_~z~0) (+ main_~x~0 main_~j~0)) (<= (+ main_~y~0 main_~z~0) 0)))} is VALID [2020-07-08 23:41:09,313 INFO L280 TraceCheckUtils]: 17: Hoare triple {285#(and (or (< 0 (+ main_~y~0 main_~z~0 1)) (<= (+ main_~x~0 main_~j~0) (+ main_~y~0 main_~i~0 main_~z~0))) (or (<= (+ main_~y~0 main_~i~0 main_~z~0) (+ main_~x~0 main_~j~0)) (<= (+ main_~y~0 main_~z~0) 0)))} assume !(0 != ~x~0); {286#(and (or (<= main_~j~0 (+ main_~y~0 main_~i~0 main_~z~0)) (< 0 (+ main_~y~0 main_~z~0 1))) (or (<= (+ main_~y~0 main_~i~0 main_~z~0) main_~j~0) (<= (+ main_~y~0 main_~z~0) 0)))} is VALID [2020-07-08 23:41:09,314 INFO L280 TraceCheckUtils]: 18: Hoare triple {286#(and (or (<= main_~j~0 (+ main_~y~0 main_~i~0 main_~z~0)) (< 0 (+ main_~y~0 main_~z~0 1))) (or (<= (+ main_~y~0 main_~i~0 main_~z~0) main_~j~0) (<= (+ main_~y~0 main_~z~0) 0)))} assume ~i~0 == ~j~0; {287#(and (<= (+ main_~y~0 main_~z~0) 0) (<= 0 (+ main_~y~0 main_~z~0)))} is VALID [2020-07-08 23:41:09,316 INFO L263 TraceCheckUtils]: 19: Hoare triple {287#(and (<= (+ main_~y~0 main_~z~0) 0) (<= 0 (+ main_~y~0 main_~z~0)))} call __VERIFIER_assert((if ~y~0 == -~z~0 then 1 else 0)); {288#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 23:41:09,317 INFO L280 TraceCheckUtils]: 20: Hoare triple {288#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {289#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 23:41:09,318 INFO L280 TraceCheckUtils]: 21: Hoare triple {289#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {280#false} is VALID [2020-07-08 23:41:09,318 INFO L280 TraceCheckUtils]: 22: Hoare triple {280#false} assume !false; {280#false} is VALID [2020-07-08 23:41:09,321 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-08 23:41:09,322 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [376059816] [2020-07-08 23:41:09,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:41:09,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-08 23:41:09,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096969846] [2020-07-08 23:41:09,324 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-07-08 23:41:09,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:41:09,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-08 23:41:09,354 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:41:09,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-08 23:41:09,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:41:09,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-08 23:41:09,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-07-08 23:41:09,355 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 9 states. [2020-07-08 23:41:09,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:41:09,914 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2020-07-08 23:41:09,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-08 23:41:09,915 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-07-08 23:41:09,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:41:09,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 23:41:09,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 40 transitions. [2020-07-08 23:41:09,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 23:41:09,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 40 transitions. [2020-07-08 23:41:09,922 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 40 transitions. [2020-07-08 23:41:09,977 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:41:09,979 INFO L225 Difference]: With dead ends: 40 [2020-07-08 23:41:09,979 INFO L226 Difference]: Without dead ends: 34 [2020-07-08 23:41:09,980 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2020-07-08 23:41:09,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-08 23:41:10,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2020-07-08 23:41:10,010 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:41:10,011 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 32 states. [2020-07-08 23:41:10,011 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 32 states. [2020-07-08 23:41:10,011 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 32 states. [2020-07-08 23:41:10,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:41:10,015 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2020-07-08 23:41:10,015 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2020-07-08 23:41:10,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:41:10,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:41:10,016 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 34 states. [2020-07-08 23:41:10,016 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 34 states. [2020-07-08 23:41:10,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:41:10,020 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2020-07-08 23:41:10,020 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2020-07-08 23:41:10,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:41:10,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:41:10,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:41:10,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:41:10,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-08 23:41:10,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2020-07-08 23:41:10,024 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 23 [2020-07-08 23:41:10,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:41:10,025 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2020-07-08 23:41:10,025 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-08 23:41:10,025 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 32 transitions. [2020-07-08 23:41:10,086 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:41:10,087 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2020-07-08 23:41:10,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-08 23:41:10,088 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:41:10,088 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, 1, 1, 1] [2020-07-08 23:41:10,089 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 23:41:10,089 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:41:10,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:41:10,091 INFO L82 PathProgramCache]: Analyzing trace with hash 821188708, now seen corresponding path program 1 times [2020-07-08 23:41:10,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:41:10,091 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [730440172] [2020-07-08 23:41:10,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:41:10,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:41:10,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:41:10,606 INFO L280 TraceCheckUtils]: 0: Hoare triple {514#true} assume true; {514#true} is VALID [2020-07-08 23:41:10,607 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {514#true} {514#true} #74#return; {514#true} is VALID [2020-07-08 23:41:10,607 INFO L263 TraceCheckUtils]: 0: Hoare triple {514#true} call ULTIMATE.init(); {514#true} is VALID [2020-07-08 23:41:10,607 INFO L280 TraceCheckUtils]: 1: Hoare triple {514#true} assume true; {514#true} is VALID [2020-07-08 23:41:10,608 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {514#true} {514#true} #74#return; {514#true} is VALID [2020-07-08 23:41:10,608 INFO L263 TraceCheckUtils]: 3: Hoare triple {514#true} call #t~ret4 := main(); {514#true} is VALID [2020-07-08 23:41:10,608 INFO L280 TraceCheckUtils]: 4: Hoare triple {514#true} havoc ~i~0; {514#true} is VALID [2020-07-08 23:41:10,608 INFO L280 TraceCheckUtils]: 5: Hoare triple {514#true} havoc ~j~0; {514#true} is VALID [2020-07-08 23:41:10,609 INFO L280 TraceCheckUtils]: 6: Hoare triple {514#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {514#true} is VALID [2020-07-08 23:41:10,609 INFO L280 TraceCheckUtils]: 7: Hoare triple {514#true} ~i~0 := #t~nondet0; {514#true} is VALID [2020-07-08 23:41:10,609 INFO L280 TraceCheckUtils]: 8: Hoare triple {514#true} havoc #t~nondet0; {514#true} is VALID [2020-07-08 23:41:10,610 INFO L280 TraceCheckUtils]: 9: Hoare triple {514#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {514#true} is VALID [2020-07-08 23:41:10,610 INFO L280 TraceCheckUtils]: 10: Hoare triple {514#true} ~j~0 := #t~nondet1; {514#true} is VALID [2020-07-08 23:41:10,610 INFO L280 TraceCheckUtils]: 11: Hoare triple {514#true} havoc #t~nondet1; {514#true} is VALID [2020-07-08 23:41:10,611 INFO L280 TraceCheckUtils]: 12: Hoare triple {514#true} assume !!(~i~0 >= 0 && ~i~0 <= 1000000); {514#true} is VALID [2020-07-08 23:41:10,611 INFO L280 TraceCheckUtils]: 13: Hoare triple {514#true} assume !!(~j~0 >= 0); {514#true} is VALID [2020-07-08 23:41:10,612 INFO L280 TraceCheckUtils]: 14: Hoare triple {514#true} ~x~0 := ~i~0; {518#(and (<= main_~i~0 main_~x~0) (<= main_~x~0 main_~i~0))} is VALID [2020-07-08 23:41:10,613 INFO L280 TraceCheckUtils]: 15: Hoare triple {518#(and (<= main_~i~0 main_~x~0) (<= main_~x~0 main_~i~0))} ~y~0 := ~j~0; {519#(and (<= (+ main_~y~0 main_~i~0) (+ main_~x~0 main_~j~0)) (<= (+ main_~x~0 main_~j~0) (+ main_~y~0 main_~i~0)))} is VALID [2020-07-08 23:41:10,614 INFO L280 TraceCheckUtils]: 16: Hoare triple {519#(and (<= (+ main_~y~0 main_~i~0) (+ main_~x~0 main_~j~0)) (<= (+ main_~x~0 main_~j~0) (+ main_~y~0 main_~i~0)))} ~z~0 := 0; {520#(and (<= (+ main_~y~0 main_~i~0 main_~z~0) (+ main_~x~0 main_~j~0)) (<= (+ main_~x~0 main_~j~0) (+ main_~y~0 main_~i~0 main_~z~0)))} is VALID [2020-07-08 23:41:10,615 INFO L280 TraceCheckUtils]: 17: Hoare triple {520#(and (<= (+ main_~y~0 main_~i~0 main_~z~0) (+ main_~x~0 main_~j~0)) (<= (+ main_~x~0 main_~j~0) (+ main_~y~0 main_~i~0 main_~z~0)))} assume !!(0 != ~x~0); {520#(and (<= (+ main_~y~0 main_~i~0 main_~z~0) (+ main_~x~0 main_~j~0)) (<= (+ main_~x~0 main_~j~0) (+ main_~y~0 main_~i~0 main_~z~0)))} is VALID [2020-07-08 23:41:10,616 INFO L280 TraceCheckUtils]: 18: Hoare triple {520#(and (<= (+ main_~y~0 main_~i~0 main_~z~0) (+ main_~x~0 main_~j~0)) (<= (+ main_~x~0 main_~j~0) (+ main_~y~0 main_~i~0 main_~z~0)))} #t~post2 := ~x~0; {521#(and (<= (+ main_~y~0 main_~i~0 main_~z~0) (+ |main_#t~post2| main_~j~0)) (<= (+ |main_#t~post2| main_~j~0) (+ main_~y~0 main_~i~0 main_~z~0)))} is VALID [2020-07-08 23:41:10,618 INFO L280 TraceCheckUtils]: 19: Hoare triple {521#(and (<= (+ main_~y~0 main_~i~0 main_~z~0) (+ |main_#t~post2| main_~j~0)) (<= (+ |main_#t~post2| main_~j~0) (+ main_~y~0 main_~i~0 main_~z~0)))} ~x~0 := #t~post2 - 1; {522#(and (<= (+ main_~y~0 main_~i~0 main_~z~0) (+ main_~x~0 main_~j~0 1)) (<= (+ main_~x~0 main_~j~0 1) (+ main_~y~0 main_~i~0 main_~z~0)))} is VALID [2020-07-08 23:41:10,619 INFO L280 TraceCheckUtils]: 20: Hoare triple {522#(and (<= (+ main_~y~0 main_~i~0 main_~z~0) (+ main_~x~0 main_~j~0 1)) (<= (+ main_~x~0 main_~j~0 1) (+ main_~y~0 main_~i~0 main_~z~0)))} havoc #t~post2; {522#(and (<= (+ main_~y~0 main_~i~0 main_~z~0) (+ main_~x~0 main_~j~0 1)) (<= (+ main_~x~0 main_~j~0 1) (+ main_~y~0 main_~i~0 main_~z~0)))} is VALID [2020-07-08 23:41:10,620 INFO L280 TraceCheckUtils]: 21: Hoare triple {522#(and (<= (+ main_~y~0 main_~i~0 main_~z~0) (+ main_~x~0 main_~j~0 1)) (<= (+ main_~x~0 main_~j~0 1) (+ main_~y~0 main_~i~0 main_~z~0)))} ~y~0 := ~y~0 - 2; {523#(and (<= (+ main_~x~0 main_~j~0) (+ main_~i~0 main_~y~0 main_~z~0 1)) (<= (+ main_~i~0 main_~y~0 main_~z~0 1) (+ main_~x~0 main_~j~0)))} is VALID [2020-07-08 23:41:10,621 INFO L280 TraceCheckUtils]: 22: Hoare triple {523#(and (<= (+ main_~x~0 main_~j~0) (+ main_~i~0 main_~y~0 main_~z~0 1)) (<= (+ main_~i~0 main_~y~0 main_~z~0 1) (+ main_~x~0 main_~j~0)))} #t~post3 := ~z~0; {524#(and (<= (+ main_~i~0 main_~y~0 |main_#t~post3| 1) (+ main_~x~0 main_~j~0)) (<= (+ main_~x~0 main_~j~0) (+ main_~i~0 main_~y~0 |main_#t~post3| 1)))} is VALID [2020-07-08 23:41:10,623 INFO L280 TraceCheckUtils]: 23: Hoare triple {524#(and (<= (+ main_~i~0 main_~y~0 |main_#t~post3| 1) (+ main_~x~0 main_~j~0)) (<= (+ main_~x~0 main_~j~0) (+ main_~i~0 main_~y~0 |main_#t~post3| 1)))} ~z~0 := 1 + #t~post3; {525#(and (or (<= (+ main_~x~0 main_~j~0) (+ main_~i~0 main_~y~0 main_~z~0)) (< 0 (+ main_~y~0 main_~z~0 1))) (or (<= (+ main_~i~0 main_~y~0 main_~z~0) (+ main_~x~0 main_~j~0)) (<= (+ main_~y~0 main_~z~0) 0)))} is VALID [2020-07-08 23:41:10,624 INFO L280 TraceCheckUtils]: 24: Hoare triple {525#(and (or (<= (+ main_~x~0 main_~j~0) (+ main_~i~0 main_~y~0 main_~z~0)) (< 0 (+ main_~y~0 main_~z~0 1))) (or (<= (+ main_~i~0 main_~y~0 main_~z~0) (+ main_~x~0 main_~j~0)) (<= (+ main_~y~0 main_~z~0) 0)))} havoc #t~post3; {525#(and (or (<= (+ main_~x~0 main_~j~0) (+ main_~i~0 main_~y~0 main_~z~0)) (< 0 (+ main_~y~0 main_~z~0 1))) (or (<= (+ main_~i~0 main_~y~0 main_~z~0) (+ main_~x~0 main_~j~0)) (<= (+ main_~y~0 main_~z~0) 0)))} is VALID [2020-07-08 23:41:10,626 INFO L280 TraceCheckUtils]: 25: Hoare triple {525#(and (or (<= (+ main_~x~0 main_~j~0) (+ main_~i~0 main_~y~0 main_~z~0)) (< 0 (+ main_~y~0 main_~z~0 1))) (or (<= (+ main_~i~0 main_~y~0 main_~z~0) (+ main_~x~0 main_~j~0)) (<= (+ main_~y~0 main_~z~0) 0)))} assume !(0 != ~x~0); {526#(and (or (<= (+ main_~y~0 main_~z~0) 0) (<= (+ main_~i~0 main_~y~0 main_~z~0) main_~j~0)) (or (< 0 (+ main_~y~0 main_~z~0 1)) (<= main_~j~0 (+ main_~i~0 main_~y~0 main_~z~0))))} is VALID [2020-07-08 23:41:10,627 INFO L280 TraceCheckUtils]: 26: Hoare triple {526#(and (or (<= (+ main_~y~0 main_~z~0) 0) (<= (+ main_~i~0 main_~y~0 main_~z~0) main_~j~0)) (or (< 0 (+ main_~y~0 main_~z~0 1)) (<= main_~j~0 (+ main_~i~0 main_~y~0 main_~z~0))))} assume ~i~0 == ~j~0; {527#(and (<= (+ main_~y~0 main_~z~0) 0) (<= 0 (+ main_~y~0 main_~z~0)))} is VALID [2020-07-08 23:41:10,628 INFO L263 TraceCheckUtils]: 27: Hoare triple {527#(and (<= (+ main_~y~0 main_~z~0) 0) (<= 0 (+ main_~y~0 main_~z~0)))} call __VERIFIER_assert((if ~y~0 == -~z~0 then 1 else 0)); {528#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 23:41:10,629 INFO L280 TraceCheckUtils]: 28: Hoare triple {528#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {529#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 23:41:10,630 INFO L280 TraceCheckUtils]: 29: Hoare triple {529#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {515#false} is VALID [2020-07-08 23:41:10,630 INFO L280 TraceCheckUtils]: 30: Hoare triple {515#false} assume !false; {515#false} is VALID [2020-07-08 23:41:10,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 23:41:10,634 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [730440172] [2020-07-08 23:41:10,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:41:10,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-07-08 23:41:10,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27566157] [2020-07-08 23:41:10,636 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2020-07-08 23:41:10,636 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:41:10,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-08 23:41:10,672 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-08 23:41:10,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-08 23:41:10,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:41:10,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-08 23:41:10,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-07-08 23:41:10,675 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 14 states. [2020-07-08 23:41:11,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:41:11,628 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2020-07-08 23:41:11,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-08 23:41:11,629 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2020-07-08 23:41:11,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:41:11,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 23:41:11,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 34 transitions. [2020-07-08 23:41:11,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 23:41:11,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 34 transitions. [2020-07-08 23:41:11,633 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 34 transitions. [2020-07-08 23:41:11,682 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:41:11,682 INFO L225 Difference]: With dead ends: 34 [2020-07-08 23:41:11,682 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 23:41:11,684 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2020-07-08 23:41:11,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 23:41:11,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 23:41:11,684 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:41:11,685 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 23:41:11,685 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 23:41:11,685 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 23:41:11,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:41:11,685 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 23:41:11,685 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 23:41:11,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:41:11,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:41:11,686 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 23:41:11,686 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 23:41:11,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:41:11,686 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 23:41:11,686 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 23:41:11,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:41:11,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:41:11,687 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:41:11,687 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:41:11,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 23:41:11,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 23:41:11,687 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2020-07-08 23:41:11,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:41:11,688 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 23:41:11,688 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-08 23:41:11,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-08 23:41:11,688 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-08 23:41:11,688 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 23:41:11,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:41:11,688 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 23:41:11,690 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 23:41:12,048 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-08 23:41:12,048 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-08 23:41:12,048 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-08 23:41:12,048 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 23:41:12,048 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 23:41:12,048 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-08 23:41:12,048 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-07-08 23:41:12,049 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-08 23:41:12,049 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-08 23:41:12,049 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-07-08 23:41:12,049 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-08 23:41:12,049 INFO L271 CegarLoopResult]: At program point L27(lines 27 29) the Hoare annotation is: true [2020-07-08 23:41:12,049 INFO L264 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (let ((.cse1 (+ main_~i~0 main_~y~0 main_~z~0 1)) (.cse0 (+ main_~x~0 main_~j~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) [2020-07-08 23:41:12,049 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 31) the Hoare annotation is: true [2020-07-08 23:41:12,050 INFO L264 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: (let ((.cse2 (+ main_~i~0 main_~y~0 |main_#t~post3| 1)) (.cse1 (+ main_~i~0 main_~y~0 main_~z~0 1)) (.cse0 (+ main_~x~0 main_~j~0))) (and (<= .cse0 .cse1) (<= .cse2 .cse0) (<= .cse0 .cse2) (<= .cse1 .cse0))) [2020-07-08 23:41:12,050 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (let ((.cse1 (+ main_~x~0 main_~j~0)) (.cse0 (+ main_~y~0 main_~i~0 main_~z~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) [2020-07-08 23:41:12,050 INFO L264 CegarLoopResult]: At program point L25-2(line 25) the Hoare annotation is: (let ((.cse2 (+ main_~i~0 main_~y~0 |main_#t~post3| 1)) (.cse1 (+ main_~x~0 main_~j~0)) (.cse0 (+ main_~y~0 main_~i~0 main_~z~0))) (and (<= .cse0 .cse1) (<= .cse2 .cse1) (<= .cse1 .cse2) (<= .cse1 .cse0))) [2020-07-08 23:41:12,050 INFO L264 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: (let ((.cse1 (+ main_~x~0 main_~j~0)) (.cse2 (+ |main_#t~post2| main_~j~0)) (.cse0 (+ main_~y~0 main_~i~0 main_~z~0))) (and (<= .cse0 .cse1) (<= .cse0 .cse2) (<= .cse1 .cse0) (<= .cse2 .cse0))) [2020-07-08 23:41:12,050 INFO L264 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (let ((.cse1 (+ main_~x~0 main_~j~0)) (.cse0 (+ main_~y~0 main_~i~0))) (and (<= main_~i~0 main_~x~0) (<= .cse0 .cse1) (<= main_~x~0 main_~i~0) (<= .cse1 .cse0))) [2020-07-08 23:41:12,051 INFO L264 CegarLoopResult]: At program point L23-2(line 23) the Hoare annotation is: (let ((.cse1 (+ main_~x~0 main_~j~0 1)) (.cse2 (+ |main_#t~post2| main_~j~0)) (.cse0 (+ main_~y~0 main_~i~0 main_~z~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0) (<= .cse0 .cse2) (<= .cse2 .cse0))) [2020-07-08 23:41:12,051 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-07-08 23:41:12,051 INFO L271 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-07-08 23:41:12,051 INFO L271 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-07-08 23:41:12,051 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-07-08 23:41:12,051 INFO L271 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: true [2020-07-08 23:41:12,051 INFO L271 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: true [2020-07-08 23:41:12,052 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 31) the Hoare annotation is: true [2020-07-08 23:41:12,052 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 31) the Hoare annotation is: true [2020-07-08 23:41:12,052 INFO L264 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: (let ((.cse5 (+ main_~y~0 main_~z~0))) (let ((.cse2 (<= .cse5 0)) (.cse3 (<= 0 .cse5)) (.cse1 (+ main_~x~0 main_~j~0))) (or (let ((.cse0 (+ main_~y~0 main_~i~0 main_~z~0))) (and (<= .cse0 .cse1) .cse2 (<= .cse1 .cse0) .cse3)) (let ((.cse4 (+ main_~y~0 main_~i~0))) (and (<= main_~i~0 main_~x~0) (<= .cse4 .cse1) .cse2 (<= main_~x~0 main_~i~0) .cse3 (<= .cse1 .cse4)))))) [2020-07-08 23:41:12,052 INFO L264 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: (let ((.cse1 (+ main_~x~0 main_~j~0 1)) (.cse0 (+ main_~y~0 main_~i~0 main_~z~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) [2020-07-08 23:41:12,052 INFO L264 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (and (<= main_~i~0 main_~x~0) (<= main_~x~0 main_~i~0)) [2020-07-08 23:41:12,052 INFO L264 CegarLoopResult]: At program point L22-2(lines 22 26) the Hoare annotation is: (let ((.cse1 (+ main_~x~0 main_~j~0)) (.cse0 (+ main_~y~0 main_~i~0 main_~z~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) [2020-07-08 23:41:12,053 INFO L264 CegarLoopResult]: At program point L22-3(lines 13 31) the Hoare annotation is: (let ((.cse4 (+ main_~y~0 main_~i~0 main_~z~0)) (.cse6 (+ main_~x~0 main_~j~0))) (let ((.cse2 (<= .cse4 .cse6)) (.cse1 (<= .cse6 .cse4)) (.cse3 (<= (+ main_~y~0 main_~z~0) 0)) (.cse0 (< 0 (+ main_~y~0 main_~z~0 1)))) (or (let ((.cse5 (+ main_~y~0 main_~i~0))) (and (<= main_~i~0 main_~x~0) (or .cse0 .cse1) (or .cse2 .cse3) (or (<= main_~j~0 .cse4) .cse0) (<= .cse5 .cse6) (or (<= .cse4 main_~j~0) .cse3) (<= main_~x~0 main_~i~0) (<= .cse6 .cse5))) (let ((.cse7 (+ main_~i~0 main_~y~0 main_~z~0))) (and .cse2 .cse1 (or .cse3 (<= .cse7 main_~j~0)) (or .cse0 (<= main_~j~0 .cse7))))))) [2020-07-08 23:41:12,053 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-07-08 23:41:12,053 INFO L271 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: true [2020-07-08 23:41:12,053 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-07-08 23:41:12,053 INFO L271 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: true [2020-07-08 23:41:12,054 INFO L271 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: true [2020-07-08 23:41:12,054 INFO L271 CegarLoopResult]: At program point L16-2(line 16) the Hoare annotation is: true [2020-07-08 23:41:12,054 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-08 23:41:12,054 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 6 11) the Hoare annotation is: true [2020-07-08 23:41:12,054 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-08 23:41:12,054 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-08 23:41:12,054 INFO L271 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: true [2020-07-08 23:41:12,055 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-08 23:41:12,060 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-08 23:41:12,065 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 23:41:12,065 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 23:41:12,066 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2020-07-08 23:41:12,066 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2020-07-08 23:41:12,084 INFO L163 areAnnotationChecker]: CFG has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 23:41:12,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 11:41:12 BoogieIcfgContainer [2020-07-08 23:41:12,097 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 23:41:12,100 INFO L168 Benchmark]: Toolchain (without parser) took 4839.34 ms. Allocated memory was 144.2 MB in the beginning and 250.1 MB in the end (delta: 105.9 MB). Free memory was 102.7 MB in the beginning and 103.7 MB in the end (delta: -997.5 kB). Peak memory consumption was 104.9 MB. Max. memory is 7.1 GB. [2020-07-08 23:41:12,101 INFO L168 Benchmark]: CDTParser took 1.52 ms. Allocated memory is still 144.2 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-08 23:41:12,102 INFO L168 Benchmark]: CACSL2BoogieTranslator took 310.50 ms. Allocated memory is still 144.2 MB. Free memory was 102.5 MB in the beginning and 92.7 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-08 23:41:12,103 INFO L168 Benchmark]: Boogie Preprocessor took 114.80 ms. Allocated memory was 144.2 MB in the beginning and 200.8 MB in the end (delta: 56.6 MB). Free memory was 92.7 MB in the beginning and 180.9 MB in the end (delta: -88.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. [2020-07-08 23:41:12,104 INFO L168 Benchmark]: RCFGBuilder took 359.65 ms. Allocated memory is still 200.8 MB. Free memory was 180.9 MB in the beginning and 159.4 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 7.1 GB. [2020-07-08 23:41:12,105 INFO L168 Benchmark]: TraceAbstraction took 4045.97 ms. Allocated memory was 200.8 MB in the beginning and 250.1 MB in the end (delta: 49.3 MB). Free memory was 158.7 MB in the beginning and 103.7 MB in the end (delta: 55.0 MB). Peak memory consumption was 104.3 MB. Max. memory is 7.1 GB. [2020-07-08 23:41:12,109 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 1.52 ms. Allocated memory is still 144.2 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 310.50 ms. Allocated memory is still 144.2 MB. Free memory was 102.5 MB in the beginning and 92.7 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 114.80 ms. Allocated memory was 144.2 MB in the beginning and 200.8 MB in the end (delta: 56.6 MB). Free memory was 92.7 MB in the beginning and 180.9 MB in the end (delta: -88.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 359.65 ms. Allocated memory is still 200.8 MB. Free memory was 180.9 MB in the beginning and 159.4 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4045.97 ms. Allocated memory was 200.8 MB in the beginning and 250.1 MB in the end (delta: 49.3 MB). Free memory was 158.7 MB in the beginning and 103.7 MB in the end (delta: 55.0 MB). Peak memory consumption was 104.3 MB. 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: 22]: Loop Invariant Derived loop invariant: y + i + z <= x + j && x + j <= y + i + z - 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: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3.5s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 89 SDtfs, 34 SDslu, 249 SDs, 0 SdLazy, 234 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred 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.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 40 LocationsWithAnnotation, 52 PreInvPairs, 68 NumberOfFragments, 456 HoareAnnotationTreeSize, 52 FomulaSimplifications, 159 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 40 FomulaSimplificationsInter, 5 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 77 NumberOfCodeBlocks, 77 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 74 ConstructedInterpolants, 0 QuantifiedInterpolants, 11018 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 0/1 InterpolantCoveringCapability, 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...