/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/hhk2008.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 02:32:26,358 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 02:32:26,361 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 02:32:26,382 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 02:32:26,382 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 02:32:26,384 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 02:32:26,385 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 02:32:26,388 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 02:32:26,390 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 02:32:26,391 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 02:32:26,392 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 02:32:26,393 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 02:32:26,394 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 02:32:26,395 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 02:32:26,397 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 02:32:26,398 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 02:32:26,399 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 02:32:26,401 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 02:32:26,403 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 02:32:26,405 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 02:32:26,407 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 02:32:26,409 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 02:32:26,413 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 02:32:26,414 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 02:32:26,417 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 02:32:26,417 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 02:32:26,418 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 02:32:26,419 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 02:32:26,419 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 02:32:26,421 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 02:32:26,421 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 02:32:26,422 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 02:32:26,423 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 02:32:26,424 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 02:32:26,425 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 02:32:26,426 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 02:32:26,426 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 02:32:26,427 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 02:32:26,427 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 02:32:26,428 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 02:32:26,429 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 02:32:26,430 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 02:32:26,442 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 02:32:26,442 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 02:32:26,444 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 02:32:26,444 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 02:32:26,444 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 02:32:26,444 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 02:32:26,445 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 02:32:26,445 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 02:32:26,445 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 02:32:26,445 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 02:32:26,445 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 02:32:26,446 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 02:32:26,446 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 02:32:26,446 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 02:32:26,446 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 02:32:26,447 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 02:32:26,447 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 02:32:26,447 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 02:32:26,447 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 02:32:26,448 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 02:32:26,448 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 02:32:26,448 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 02:32:26,448 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-11 02:32:26,778 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 02:32:26,793 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 02:32:26,797 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 02:32:26,799 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 02:32:26,799 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 02:32:26,800 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/hhk2008.i [2020-07-11 02:32:26,869 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80e1fb664/a9244231b428471d87182c4bac882b86/FLAG50eac3c71 [2020-07-11 02:32:27,365 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 02:32:27,366 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/hhk2008.i [2020-07-11 02:32:27,373 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80e1fb664/a9244231b428471d87182c4bac882b86/FLAG50eac3c71 [2020-07-11 02:32:27,698 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80e1fb664/a9244231b428471d87182c4bac882b86 [2020-07-11 02:32:27,709 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 02:32:27,712 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 02:32:27,713 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 02:32:27,713 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 02:32:27,717 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 02:32:27,719 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:32:27" (1/1) ... [2020-07-11 02:32:27,722 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@733519c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:32:27, skipping insertion in model container [2020-07-11 02:32:27,723 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:32:27" (1/1) ... [2020-07-11 02:32:27,731 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 02:32:27,754 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 02:32:27,995 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:32:28,001 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 02:32:28,021 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:32:28,038 INFO L208 MainTranslator]: Completed translation [2020-07-11 02:32:28,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:32:28 WrapperNode [2020-07-11 02:32:28,039 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 02:32:28,040 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 02:32:28,040 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 02:32:28,040 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 02:32:28,056 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:32:28" (1/1) ... [2020-07-11 02:32:28,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:32:28" (1/1) ... [2020-07-11 02:32:28,064 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:32:28" (1/1) ... [2020-07-11 02:32:28,065 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:32:28" (1/1) ... [2020-07-11 02:32:28,072 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:32:28" (1/1) ... [2020-07-11 02:32:28,080 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:32:28" (1/1) ... [2020-07-11 02:32:28,086 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:32:28" (1/1) ... [2020-07-11 02:32:28,094 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 02:32:28,095 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 02:32:28,095 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 02:32:28,095 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 02:32:28,098 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:32:28" (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-11 02:32:28,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 02:32:28,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 02:32:28,252 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-11 02:32:28,252 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-11 02:32:28,252 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 02:32:28,252 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 02:32:28,252 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-11 02:32:28,252 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-11 02:32:28,252 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-11 02:32:28,253 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 02:32:28,253 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 02:32:28,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 02:32:28,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 02:32:28,576 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 02:32:28,577 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-11 02:32:28,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:32:28 BoogieIcfgContainer [2020-07-11 02:32:28,582 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 02:32:28,583 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 02:32:28,583 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 02:32:28,587 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 02:32:28,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 02:32:27" (1/3) ... [2020-07-11 02:32:28,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b7ad6ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:32:28, skipping insertion in model container [2020-07-11 02:32:28,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:32:28" (2/3) ... [2020-07-11 02:32:28,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b7ad6ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:32:28, skipping insertion in model container [2020-07-11 02:32:28,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:32:28" (3/3) ... [2020-07-11 02:32:28,591 INFO L109 eAbstractionObserver]: Analyzing ICFG hhk2008.i [2020-07-11 02:32:28,603 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 02:32:28,613 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 02:32:28,630 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 02:32:28,655 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 02:32:28,655 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 02:32:28,655 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 02:32:28,655 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 02:32:28,656 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 02:32:28,656 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 02:32:28,656 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 02:32:28,657 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 02:32:28,677 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-07-11 02:32:28,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-11 02:32:28,694 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:32:28,696 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-11 02:32:28,696 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:32:28,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:32:28,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1378758603, now seen corresponding path program 1 times [2020-07-11 02:32:28,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:32:28,711 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [129925629] [2020-07-11 02:32:28,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:32:28,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:29,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:29,242 INFO L280 TraceCheckUtils]: 0: Hoare triple {36#true} assume true; {36#true} is VALID [2020-07-11 02:32:29,243 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {36#true} {36#true} #62#return; {36#true} is VALID [2020-07-11 02:32:29,246 INFO L263 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {36#true} is VALID [2020-07-11 02:32:29,246 INFO L280 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2020-07-11 02:32:29,247 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #62#return; {36#true} is VALID [2020-07-11 02:32:29,248 INFO L263 TraceCheckUtils]: 3: Hoare triple {36#true} call #t~ret2 := main(); {36#true} is VALID [2020-07-11 02:32:29,248 INFO L280 TraceCheckUtils]: 4: Hoare triple {36#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {36#true} is VALID [2020-07-11 02:32:29,249 INFO L280 TraceCheckUtils]: 5: Hoare triple {36#true} ~a~0 := #t~nondet0; {36#true} is VALID [2020-07-11 02:32:29,249 INFO L280 TraceCheckUtils]: 6: Hoare triple {36#true} havoc #t~nondet0; {36#true} is VALID [2020-07-11 02:32:29,250 INFO L280 TraceCheckUtils]: 7: Hoare triple {36#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {36#true} is VALID [2020-07-11 02:32:29,250 INFO L280 TraceCheckUtils]: 8: Hoare triple {36#true} ~b~0 := #t~nondet1; {36#true} is VALID [2020-07-11 02:32:29,250 INFO L280 TraceCheckUtils]: 9: Hoare triple {36#true} havoc #t~nondet1; {36#true} is VALID [2020-07-11 02:32:29,251 INFO L280 TraceCheckUtils]: 10: Hoare triple {36#true} havoc ~res~0; {36#true} is VALID [2020-07-11 02:32:29,251 INFO L280 TraceCheckUtils]: 11: Hoare triple {36#true} havoc ~cnt~0; {36#true} is VALID [2020-07-11 02:32:29,252 INFO L280 TraceCheckUtils]: 12: Hoare triple {36#true} assume !!(~a~0 <= 1000000); {36#true} is VALID [2020-07-11 02:32:29,253 INFO L280 TraceCheckUtils]: 13: Hoare triple {36#true} assume !!(0 <= ~b~0 && ~b~0 <= 1000000); {40#(<= 0 main_~b~0)} is VALID [2020-07-11 02:32:29,255 INFO L280 TraceCheckUtils]: 14: Hoare triple {40#(<= 0 main_~b~0)} ~res~0 := ~a~0; {41#(and (<= main_~res~0 (+ main_~a~0 main_~b~0)) (or (<= (+ main_~a~0 main_~b~0) main_~res~0) (<= main_~a~0 main_~res~0)))} is VALID [2020-07-11 02:32:29,257 INFO L280 TraceCheckUtils]: 15: Hoare triple {41#(and (<= main_~res~0 (+ main_~a~0 main_~b~0)) (or (<= (+ main_~a~0 main_~b~0) main_~res~0) (<= main_~a~0 main_~res~0)))} ~cnt~0 := ~b~0; {42#(and (or (<= (+ main_~a~0 main_~b~0) (+ main_~res~0 main_~cnt~0)) (<= (+ main_~a~0 main_~b~0) main_~res~0)) (<= main_~res~0 (+ main_~a~0 main_~b~0)))} is VALID [2020-07-11 02:32:29,260 INFO L280 TraceCheckUtils]: 16: Hoare triple {42#(and (or (<= (+ main_~a~0 main_~b~0) (+ main_~res~0 main_~cnt~0)) (<= (+ main_~a~0 main_~b~0) main_~res~0)) (<= main_~res~0 (+ main_~a~0 main_~b~0)))} assume !(~cnt~0 > 0); {43#(and (<= (+ main_~a~0 main_~b~0) main_~res~0) (<= main_~res~0 (+ main_~a~0 main_~b~0)))} is VALID [2020-07-11 02:32:29,262 INFO L263 TraceCheckUtils]: 17: Hoare triple {43#(and (<= (+ main_~a~0 main_~b~0) main_~res~0) (<= main_~res~0 (+ main_~a~0 main_~b~0)))} call __VERIFIER_assert((if ~res~0 == ~a~0 + ~b~0 then 1 else 0)); {44#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-11 02:32:29,264 INFO L280 TraceCheckUtils]: 18: Hoare triple {44#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {45#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-11 02:32:29,265 INFO L280 TraceCheckUtils]: 19: Hoare triple {45#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {37#false} is VALID [2020-07-11 02:32:29,266 INFO L280 TraceCheckUtils]: 20: Hoare triple {37#false} assume !false; {37#false} is VALID [2020-07-11 02:32:29,270 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-11 02:32:29,272 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [129925629] [2020-07-11 02:32:29,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:32:29,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-11 02:32:29,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131145877] [2020-07-11 02:32:29,284 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-07-11 02:32:29,288 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:32:29,292 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-11 02:32:29,334 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-11 02:32:29,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-11 02:32:29,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:32:29,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-11 02:32:29,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-11 02:32:29,350 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 8 states. [2020-07-11 02:32:30,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:30,016 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2020-07-11 02:32:30,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-11 02:32:30,017 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-07-11 02:32:30,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:32:30,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 02:32:30,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 67 transitions. [2020-07-11 02:32:30,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 02:32:30,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 67 transitions. [2020-07-11 02:32:30,039 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 67 transitions. [2020-07-11 02:32:30,129 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:30,142 INFO L225 Difference]: With dead ends: 58 [2020-07-11 02:32:30,143 INFO L226 Difference]: Without dead ends: 27 [2020-07-11 02:32:30,147 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 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-11 02:32:30,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-11 02:32:30,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2020-07-11 02:32:30,217 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:32:30,218 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 25 states. [2020-07-11 02:32:30,219 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 25 states. [2020-07-11 02:32:30,219 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 25 states. [2020-07-11 02:32:30,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:30,224 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2020-07-11 02:32:30,224 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2020-07-11 02:32:30,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:30,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:30,225 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 27 states. [2020-07-11 02:32:30,225 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 27 states. [2020-07-11 02:32:30,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:30,230 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2020-07-11 02:32:30,230 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2020-07-11 02:32:30,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:30,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:30,231 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:32:30,231 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:32:30,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-11 02:32:30,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2020-07-11 02:32:30,236 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 21 [2020-07-11 02:32:30,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:32:30,236 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2020-07-11 02:32:30,236 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-11 02:32:30,237 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 25 transitions. [2020-07-11 02:32:30,270 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:30,271 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2020-07-11 02:32:30,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-11 02:32:30,272 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:32:30,272 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] [2020-07-11 02:32:30,273 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 02:32:30,273 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:32:30,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:32:30,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1865209823, now seen corresponding path program 1 times [2020-07-11 02:32:30,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:32:30,275 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1368921023] [2020-07-11 02:32:30,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:32:30,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:30,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:30,602 INFO L280 TraceCheckUtils]: 0: Hoare triple {276#true} assume true; {276#true} is VALID [2020-07-11 02:32:30,603 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {276#true} {276#true} #62#return; {276#true} is VALID [2020-07-11 02:32:30,603 INFO L263 TraceCheckUtils]: 0: Hoare triple {276#true} call ULTIMATE.init(); {276#true} is VALID [2020-07-11 02:32:30,604 INFO L280 TraceCheckUtils]: 1: Hoare triple {276#true} assume true; {276#true} is VALID [2020-07-11 02:32:30,604 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {276#true} {276#true} #62#return; {276#true} is VALID [2020-07-11 02:32:30,604 INFO L263 TraceCheckUtils]: 3: Hoare triple {276#true} call #t~ret2 := main(); {276#true} is VALID [2020-07-11 02:32:30,605 INFO L280 TraceCheckUtils]: 4: Hoare triple {276#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {276#true} is VALID [2020-07-11 02:32:30,605 INFO L280 TraceCheckUtils]: 5: Hoare triple {276#true} ~a~0 := #t~nondet0; {276#true} is VALID [2020-07-11 02:32:30,606 INFO L280 TraceCheckUtils]: 6: Hoare triple {276#true} havoc #t~nondet0; {276#true} is VALID [2020-07-11 02:32:30,607 INFO L280 TraceCheckUtils]: 7: Hoare triple {276#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {276#true} is VALID [2020-07-11 02:32:30,607 INFO L280 TraceCheckUtils]: 8: Hoare triple {276#true} ~b~0 := #t~nondet1; {276#true} is VALID [2020-07-11 02:32:30,607 INFO L280 TraceCheckUtils]: 9: Hoare triple {276#true} havoc #t~nondet1; {276#true} is VALID [2020-07-11 02:32:30,608 INFO L280 TraceCheckUtils]: 10: Hoare triple {276#true} havoc ~res~0; {276#true} is VALID [2020-07-11 02:32:30,608 INFO L280 TraceCheckUtils]: 11: Hoare triple {276#true} havoc ~cnt~0; {276#true} is VALID [2020-07-11 02:32:30,608 INFO L280 TraceCheckUtils]: 12: Hoare triple {276#true} assume !!(~a~0 <= 1000000); {276#true} is VALID [2020-07-11 02:32:30,609 INFO L280 TraceCheckUtils]: 13: Hoare triple {276#true} assume !!(0 <= ~b~0 && ~b~0 <= 1000000); {276#true} is VALID [2020-07-11 02:32:30,610 INFO L280 TraceCheckUtils]: 14: Hoare triple {276#true} ~res~0 := ~a~0; {280#(and (<= main_~res~0 main_~a~0) (<= main_~a~0 main_~res~0))} is VALID [2020-07-11 02:32:30,612 INFO L280 TraceCheckUtils]: 15: Hoare triple {280#(and (<= main_~res~0 main_~a~0) (<= main_~a~0 main_~res~0))} ~cnt~0 := ~b~0; {281#(and (<= (+ main_~a~0 main_~b~0) (+ main_~res~0 main_~cnt~0)) (<= (+ main_~res~0 main_~cnt~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-11 02:32:30,613 INFO L280 TraceCheckUtils]: 16: Hoare triple {281#(and (<= (+ main_~a~0 main_~b~0) (+ main_~res~0 main_~cnt~0)) (<= (+ main_~res~0 main_~cnt~0) (+ main_~a~0 main_~b~0)))} assume !!(~cnt~0 > 0); {282#(and (<= (+ main_~a~0 main_~b~0) (+ main_~res~0 main_~cnt~0)) (<= (+ main_~res~0 1) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-11 02:32:30,615 INFO L280 TraceCheckUtils]: 17: Hoare triple {282#(and (<= (+ main_~a~0 main_~b~0) (+ main_~res~0 main_~cnt~0)) (<= (+ main_~res~0 1) (+ main_~a~0 main_~b~0)))} ~cnt~0 := ~cnt~0 - 1; {283#(and (<= (+ main_~res~0 1) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (+ main_~res~0 main_~cnt~0 1)))} is VALID [2020-07-11 02:32:30,616 INFO L280 TraceCheckUtils]: 18: Hoare triple {283#(and (<= (+ main_~res~0 1) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (+ main_~res~0 main_~cnt~0 1)))} ~res~0 := 1 + ~res~0; {284#(and (or (<= (+ main_~a~0 main_~b~0) (+ main_~res~0 main_~cnt~0)) (<= (+ main_~a~0 main_~b~0) main_~res~0)) (<= main_~res~0 (+ main_~a~0 main_~b~0)))} is VALID [2020-07-11 02:32:30,618 INFO L280 TraceCheckUtils]: 19: Hoare triple {284#(and (or (<= (+ main_~a~0 main_~b~0) (+ main_~res~0 main_~cnt~0)) (<= (+ main_~a~0 main_~b~0) main_~res~0)) (<= main_~res~0 (+ main_~a~0 main_~b~0)))} assume !(~cnt~0 > 0); {285#(and (<= (+ main_~a~0 main_~b~0) main_~res~0) (<= main_~res~0 (+ main_~a~0 main_~b~0)))} is VALID [2020-07-11 02:32:30,620 INFO L263 TraceCheckUtils]: 20: Hoare triple {285#(and (<= (+ main_~a~0 main_~b~0) main_~res~0) (<= main_~res~0 (+ main_~a~0 main_~b~0)))} call __VERIFIER_assert((if ~res~0 == ~a~0 + ~b~0 then 1 else 0)); {286#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-11 02:32:30,621 INFO L280 TraceCheckUtils]: 21: Hoare triple {286#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {287#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-11 02:32:30,622 INFO L280 TraceCheckUtils]: 22: Hoare triple {287#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {277#false} is VALID [2020-07-11 02:32:30,622 INFO L280 TraceCheckUtils]: 23: Hoare triple {277#false} assume !false; {277#false} is VALID [2020-07-11 02:32:30,625 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-11 02:32:30,626 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1368921023] [2020-07-11 02:32:30,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:32:30,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-11 02:32:30,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236274827] [2020-07-11 02:32:30,631 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-07-11 02:32:30,632 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:32:30,633 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-11 02:32:30,667 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:30,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-11 02:32:30,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:32:30,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-11 02:32:30,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-07-11 02:32:30,669 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 10 states. [2020-07-11 02:32:31,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:31,124 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2020-07-11 02:32:31,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-11 02:32:31,124 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-07-11 02:32:31,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:32:31,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-11 02:32:31,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 34 transitions. [2020-07-11 02:32:31,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-11 02:32:31,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 34 transitions. [2020-07-11 02:32:31,130 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 34 transitions. [2020-07-11 02:32:31,173 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-11 02:32:31,175 INFO L225 Difference]: With dead ends: 34 [2020-07-11 02:32:31,175 INFO L226 Difference]: Without dead ends: 29 [2020-07-11 02:32:31,176 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2020-07-11 02:32:31,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-11 02:32:31,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2020-07-11 02:32:31,213 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:32:31,213 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 28 states. [2020-07-11 02:32:31,213 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 28 states. [2020-07-11 02:32:31,213 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 28 states. [2020-07-11 02:32:31,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:31,216 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2020-07-11 02:32:31,217 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2020-07-11 02:32:31,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:31,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:31,218 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 29 states. [2020-07-11 02:32:31,218 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 29 states. [2020-07-11 02:32:31,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:31,221 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2020-07-11 02:32:31,221 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2020-07-11 02:32:31,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:31,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:31,222 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:32:31,222 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:32:31,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-11 02:32:31,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2020-07-11 02:32:31,225 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 24 [2020-07-11 02:32:31,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:32:31,225 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2020-07-11 02:32:31,225 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-11 02:32:31,225 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 28 transitions. [2020-07-11 02:32:31,259 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-11 02:32:31,259 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2020-07-11 02:32:31,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-11 02:32:31,260 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:32:31,260 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:32:31,261 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 02:32:31,261 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:32:31,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:32:31,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1781119157, now seen corresponding path program 2 times [2020-07-11 02:32:31,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:32:31,262 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [646158559] [2020-07-11 02:32:31,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:32:31,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:31,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:31,538 INFO L280 TraceCheckUtils]: 0: Hoare triple {480#true} assume true; {480#true} is VALID [2020-07-11 02:32:31,538 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {480#true} {480#true} #62#return; {480#true} is VALID [2020-07-11 02:32:31,539 INFO L263 TraceCheckUtils]: 0: Hoare triple {480#true} call ULTIMATE.init(); {480#true} is VALID [2020-07-11 02:32:31,539 INFO L280 TraceCheckUtils]: 1: Hoare triple {480#true} assume true; {480#true} is VALID [2020-07-11 02:32:31,539 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {480#true} {480#true} #62#return; {480#true} is VALID [2020-07-11 02:32:31,540 INFO L263 TraceCheckUtils]: 3: Hoare triple {480#true} call #t~ret2 := main(); {480#true} is VALID [2020-07-11 02:32:31,540 INFO L280 TraceCheckUtils]: 4: Hoare triple {480#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {480#true} is VALID [2020-07-11 02:32:31,540 INFO L280 TraceCheckUtils]: 5: Hoare triple {480#true} ~a~0 := #t~nondet0; {480#true} is VALID [2020-07-11 02:32:31,540 INFO L280 TraceCheckUtils]: 6: Hoare triple {480#true} havoc #t~nondet0; {480#true} is VALID [2020-07-11 02:32:31,541 INFO L280 TraceCheckUtils]: 7: Hoare triple {480#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {480#true} is VALID [2020-07-11 02:32:31,541 INFO L280 TraceCheckUtils]: 8: Hoare triple {480#true} ~b~0 := #t~nondet1; {480#true} is VALID [2020-07-11 02:32:31,541 INFO L280 TraceCheckUtils]: 9: Hoare triple {480#true} havoc #t~nondet1; {480#true} is VALID [2020-07-11 02:32:31,542 INFO L280 TraceCheckUtils]: 10: Hoare triple {480#true} havoc ~res~0; {480#true} is VALID [2020-07-11 02:32:31,542 INFO L280 TraceCheckUtils]: 11: Hoare triple {480#true} havoc ~cnt~0; {480#true} is VALID [2020-07-11 02:32:31,543 INFO L280 TraceCheckUtils]: 12: Hoare triple {480#true} assume !!(~a~0 <= 1000000); {480#true} is VALID [2020-07-11 02:32:31,543 INFO L280 TraceCheckUtils]: 13: Hoare triple {480#true} assume !!(0 <= ~b~0 && ~b~0 <= 1000000); {480#true} is VALID [2020-07-11 02:32:31,548 INFO L280 TraceCheckUtils]: 14: Hoare triple {480#true} ~res~0 := ~a~0; {484#(and (<= main_~res~0 main_~a~0) (<= main_~a~0 main_~res~0))} is VALID [2020-07-11 02:32:31,549 INFO L280 TraceCheckUtils]: 15: Hoare triple {484#(and (<= main_~res~0 main_~a~0) (<= main_~a~0 main_~res~0))} ~cnt~0 := ~b~0; {485#(and (<= (+ main_~a~0 main_~b~0) (+ main_~res~0 main_~cnt~0)) (<= (+ main_~res~0 main_~cnt~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-11 02:32:31,550 INFO L280 TraceCheckUtils]: 16: Hoare triple {485#(and (<= (+ main_~a~0 main_~b~0) (+ main_~res~0 main_~cnt~0)) (<= (+ main_~res~0 main_~cnt~0) (+ main_~a~0 main_~b~0)))} assume !!(~cnt~0 > 0); {485#(and (<= (+ main_~a~0 main_~b~0) (+ main_~res~0 main_~cnt~0)) (<= (+ main_~res~0 main_~cnt~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-11 02:32:31,551 INFO L280 TraceCheckUtils]: 17: Hoare triple {485#(and (<= (+ main_~a~0 main_~b~0) (+ main_~res~0 main_~cnt~0)) (<= (+ main_~res~0 main_~cnt~0) (+ main_~a~0 main_~b~0)))} ~cnt~0 := ~cnt~0 - 1; {486#(and (<= (+ main_~a~0 main_~b~0) (+ main_~res~0 main_~cnt~0 1)) (<= (+ main_~res~0 main_~cnt~0 1) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-11 02:32:31,552 INFO L280 TraceCheckUtils]: 18: Hoare triple {486#(and (<= (+ main_~a~0 main_~b~0) (+ main_~res~0 main_~cnt~0 1)) (<= (+ main_~res~0 main_~cnt~0 1) (+ main_~a~0 main_~b~0)))} ~res~0 := 1 + ~res~0; {485#(and (<= (+ main_~a~0 main_~b~0) (+ main_~res~0 main_~cnt~0)) (<= (+ main_~res~0 main_~cnt~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-11 02:32:31,562 INFO L280 TraceCheckUtils]: 19: Hoare triple {485#(and (<= (+ main_~a~0 main_~b~0) (+ main_~res~0 main_~cnt~0)) (<= (+ main_~res~0 main_~cnt~0) (+ main_~a~0 main_~b~0)))} assume !!(~cnt~0 > 0); {487#(and (<= (+ main_~a~0 main_~b~0) (+ main_~res~0 main_~cnt~0)) (<= (+ main_~res~0 1) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-11 02:32:31,563 INFO L280 TraceCheckUtils]: 20: Hoare triple {487#(and (<= (+ main_~a~0 main_~b~0) (+ main_~res~0 main_~cnt~0)) (<= (+ main_~res~0 1) (+ main_~a~0 main_~b~0)))} ~cnt~0 := ~cnt~0 - 1; {488#(and (<= (+ main_~res~0 1) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (+ main_~res~0 main_~cnt~0 1)))} is VALID [2020-07-11 02:32:31,565 INFO L280 TraceCheckUtils]: 21: Hoare triple {488#(and (<= (+ main_~res~0 1) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (+ main_~res~0 main_~cnt~0 1)))} ~res~0 := 1 + ~res~0; {489#(and (or (<= (+ main_~a~0 main_~b~0) (+ main_~res~0 main_~cnt~0)) (<= (+ main_~a~0 main_~b~0) main_~res~0)) (<= main_~res~0 (+ main_~a~0 main_~b~0)))} is VALID [2020-07-11 02:32:31,566 INFO L280 TraceCheckUtils]: 22: Hoare triple {489#(and (or (<= (+ main_~a~0 main_~b~0) (+ main_~res~0 main_~cnt~0)) (<= (+ main_~a~0 main_~b~0) main_~res~0)) (<= main_~res~0 (+ main_~a~0 main_~b~0)))} assume !(~cnt~0 > 0); {490#(and (<= (+ main_~a~0 main_~b~0) main_~res~0) (<= main_~res~0 (+ main_~a~0 main_~b~0)))} is VALID [2020-07-11 02:32:31,567 INFO L263 TraceCheckUtils]: 23: Hoare triple {490#(and (<= (+ main_~a~0 main_~b~0) main_~res~0) (<= main_~res~0 (+ main_~a~0 main_~b~0)))} call __VERIFIER_assert((if ~res~0 == ~a~0 + ~b~0 then 1 else 0)); {491#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-11 02:32:31,568 INFO L280 TraceCheckUtils]: 24: Hoare triple {491#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {492#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-11 02:32:31,569 INFO L280 TraceCheckUtils]: 25: Hoare triple {492#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {481#false} is VALID [2020-07-11 02:32:31,570 INFO L280 TraceCheckUtils]: 26: Hoare triple {481#false} assume !false; {481#false} is VALID [2020-07-11 02:32:31,572 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-11 02:32:31,573 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [646158559] [2020-07-11 02:32:31,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:32:31,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-11 02:32:31,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496652210] [2020-07-11 02:32:31,575 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2020-07-11 02:32:31,575 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:32:31,575 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-11 02:32:31,616 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:31,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-11 02:32:31,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:32:31,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-11 02:32:31,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-07-11 02:32:31,617 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 11 states. [2020-07-11 02:32:32,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:32,192 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2020-07-11 02:32:32,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-11 02:32:32,192 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2020-07-11 02:32:32,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:32:32,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-11 02:32:32,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 27 transitions. [2020-07-11 02:32:32,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-11 02:32:32,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 27 transitions. [2020-07-11 02:32:32,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 27 transitions. [2020-07-11 02:32:32,236 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:32,236 INFO L225 Difference]: With dead ends: 28 [2020-07-11 02:32:32,236 INFO L226 Difference]: Without dead ends: 0 [2020-07-11 02:32:32,237 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2020-07-11 02:32:32,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-11 02:32:32,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-11 02:32:32,237 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:32:32,237 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-11 02:32:32,238 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 02:32:32,238 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 02:32:32,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:32,238 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 02:32:32,238 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 02:32:32,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:32,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:32,239 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 02:32:32,239 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 02:32:32,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:32,239 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 02:32:32,239 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 02:32:32,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:32,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:32,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:32:32,240 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:32:32,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-11 02:32:32,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-11 02:32:32,241 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2020-07-11 02:32:32,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:32:32,241 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-11 02:32:32,241 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-11 02:32:32,241 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-11 02:32:32,241 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-11 02:32:32,241 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 02:32:32,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:32,242 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 02:32:32,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-11 02:32:32,563 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-11 02:32:32,563 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-11 02:32:32,563 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-11 02:32:32,563 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-11 02:32:32,564 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-11 02:32:32,564 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-11 02:32:32,564 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-07-11 02:32:32,564 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-11 02:32:32,564 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-11 02:32:32,564 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-07-11 02:32:32,564 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-11 02:32:32,564 INFO L264 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (<= 0 main_~b~0) [2020-07-11 02:32:32,564 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 27) the Hoare annotation is: true [2020-07-11 02:32:32,565 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (let ((.cse1 (+ main_~res~0 main_~cnt~0 1)) (.cse0 (+ main_~a~0 main_~b~0))) (and (<= (+ main_~res~0 1) .cse0) (<= .cse0 .cse1) (<= .cse1 .cse0) (<= 0 main_~b~0))) [2020-07-11 02:32:32,565 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (<= 0 main_~b~0) [2020-07-11 02:32:32,565 INFO L264 CegarLoopResult]: At program point L21-2(lines 21 24) the Hoare annotation is: (let ((.cse1 (+ main_~res~0 main_~cnt~0)) (.cse0 (+ main_~a~0 main_~b~0))) (and (<= .cse0 .cse1) (<= main_~res~0 .cse0) (<= 0 main_~b~0) (<= .cse1 .cse0))) [2020-07-11 02:32:32,565 INFO L264 CegarLoopResult]: At program point L21-3(lines 21 24) the Hoare annotation is: (let ((.cse0 (+ main_~a~0 main_~b~0))) (and (<= .cse0 main_~res~0) (<= main_~res~0 .cse0) (<= 0 main_~b~0))) [2020-07-11 02:32:32,565 INFO L271 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-07-11 02:32:32,566 INFO L271 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-07-11 02:32:32,566 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-07-11 02:32:32,566 INFO L271 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: true [2020-07-11 02:32:32,566 INFO L271 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: true [2020-07-11 02:32:32,566 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 27) the Hoare annotation is: true [2020-07-11 02:32:32,566 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 27) the Hoare annotation is: true [2020-07-11 02:32:32,567 INFO L264 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (let ((.cse1 (+ main_~res~0 main_~cnt~0)) (.cse0 (+ main_~a~0 main_~b~0))) (and (<= .cse0 .cse1) (<= (+ main_~res~0 1) .cse0) (<= 0 main_~b~0) (<= .cse1 .cse0))) [2020-07-11 02:32:32,567 INFO L264 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (and (<= main_~res~0 main_~a~0) (<= main_~a~0 main_~res~0) (<= main_~res~0 (+ main_~a~0 main_~b~0))) [2020-07-11 02:32:32,567 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-07-11 02:32:32,567 INFO L271 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: true [2020-07-11 02:32:32,567 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-07-11 02:32:32,568 INFO L271 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: true [2020-07-11 02:32:32,568 INFO L271 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: true [2020-07-11 02:32:32,568 INFO L271 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: true [2020-07-11 02:32:32,568 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-11 02:32:32,568 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-11 02:32:32,568 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-11 02:32:32,569 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-11 02:32:32,569 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-11 02:32:32,569 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-11 02:32:32,573 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-11 02:32:32,575 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-11 02:32:32,575 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-11 02:32:32,576 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2020-07-11 02:32:32,576 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2020-07-11 02:32:32,583 INFO L163 areAnnotationChecker]: CFG has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-11 02:32:32,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 02:32:32 BoogieIcfgContainer [2020-07-11 02:32:32,600 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 02:32:32,603 INFO L168 Benchmark]: Toolchain (without parser) took 4891.34 ms. Allocated memory was 134.2 MB in the beginning and 255.9 MB in the end (delta: 121.6 MB). Free memory was 98.8 MB in the beginning and 140.0 MB in the end (delta: -41.1 MB). Peak memory consumption was 80.5 MB. Max. memory is 7.1 GB. [2020-07-11 02:32:32,604 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 134.2 MB. Free memory was 116.4 MB in the beginning and 116.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-11 02:32:32,605 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.84 ms. Allocated memory is still 134.2 MB. Free memory was 98.6 MB in the beginning and 88.9 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-07-11 02:32:32,606 INFO L168 Benchmark]: Boogie Preprocessor took 54.44 ms. Allocated memory is still 134.2 MB. Free memory was 88.9 MB in the beginning and 87.3 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2020-07-11 02:32:32,607 INFO L168 Benchmark]: RCFGBuilder took 487.34 ms. Allocated memory was 134.2 MB in the beginning and 199.2 MB in the end (delta: 65.0 MB). Free memory was 87.3 MB in the beginning and 159.8 MB in the end (delta: -72.5 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2020-07-11 02:32:32,608 INFO L168 Benchmark]: TraceAbstraction took 4016.59 ms. Allocated memory was 199.2 MB in the beginning and 255.9 MB in the end (delta: 56.6 MB). Free memory was 159.1 MB in the beginning and 140.0 MB in the end (delta: 19.1 MB). Peak memory consumption was 75.7 MB. Max. memory is 7.1 GB. [2020-07-11 02:32:32,612 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.24 ms. Allocated memory is still 134.2 MB. Free memory was 116.4 MB in the beginning and 116.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 326.84 ms. Allocated memory is still 134.2 MB. Free memory was 98.6 MB in the beginning and 88.9 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 54.44 ms. Allocated memory is still 134.2 MB. Free memory was 88.9 MB in the beginning and 87.3 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 487.34 ms. Allocated memory was 134.2 MB in the beginning and 199.2 MB in the end (delta: 65.0 MB). Free memory was 87.3 MB in the beginning and 159.8 MB in the end (delta: -72.5 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4016.59 ms. Allocated memory was 199.2 MB in the beginning and 255.9 MB in the end (delta: 56.6 MB). Free memory was 159.1 MB in the beginning and 140.0 MB in the end (delta: 19.1 MB). Peak memory consumption was 75.7 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: 21]: Loop Invariant Derived loop invariant: ((a + b <= res + cnt && res <= a + b) && 0 <= b) && res + cnt <= a + b - 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, 38 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3.5s, OverallIterations: 3, TraceHistogramMax: 2, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 66 SDtfs, 41 SDslu, 309 SDs, 0 SdLazy, 221 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred 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, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 33 LocationsWithAnnotation, 51 PreInvPairs, 73 NumberOfFragments, 158 HoareAnnotationTreeSize, 51 FomulaSimplifications, 237 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 33 FomulaSimplificationsInter, 93 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 72 NumberOfCodeBlocks, 72 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 69 ConstructedInterpolants, 0 QuantifiedInterpolants, 7816 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 1/6 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...