/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loops/for_bounded_loop1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 17:37:00,954 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 17:37:00,956 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 17:37:00,969 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 17:37:00,969 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 17:37:00,970 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 17:37:00,971 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 17:37:00,973 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 17:37:00,975 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 17:37:00,976 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 17:37:00,977 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 17:37:00,978 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 17:37:00,978 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 17:37:00,979 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 17:37:00,980 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 17:37:00,981 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 17:37:00,982 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 17:37:00,983 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 17:37:00,985 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 17:37:00,987 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 17:37:00,989 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 17:37:00,991 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 17:37:00,992 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 17:37:00,993 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 17:37:00,995 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 17:37:00,995 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 17:37:00,996 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 17:37:00,997 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 17:37:00,997 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 17:37:00,998 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 17:37:00,998 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 17:37:00,999 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 17:37:01,000 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 17:37:01,001 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 17:37:01,002 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 17:37:01,002 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 17:37:01,002 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 17:37:01,003 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 17:37:01,003 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 17:37:01,004 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 17:37:01,005 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 17:37:01,005 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 17:37:01,016 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 17:37:01,017 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 17:37:01,018 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 17:37:01,018 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 17:37:01,018 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 17:37:01,019 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 17:37:01,019 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 17:37:01,019 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 17:37:01,019 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 17:37:01,019 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 17:37:01,020 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 17:37:01,020 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 17:37:01,020 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 17:37:01,020 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 17:37:01,020 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 17:37:01,021 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 17:37:01,021 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 17:37:01,021 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 17:37:01,021 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 17:37:01,021 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 17:37:01,022 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 17:37:01,022 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 17:37:01,022 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-08 17:37:01,296 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 17:37:01,310 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 17:37:01,314 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 17:37:01,315 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 17:37:01,316 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 17:37:01,317 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/for_bounded_loop1.c [2020-07-08 17:37:01,393 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d6d9465d/bfbb54a44ad84b108b754ffa45124a99/FLAG793f25188 [2020-07-08 17:37:01,874 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 17:37:01,875 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/for_bounded_loop1.c [2020-07-08 17:37:01,881 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d6d9465d/bfbb54a44ad84b108b754ffa45124a99/FLAG793f25188 [2020-07-08 17:37:02,216 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d6d9465d/bfbb54a44ad84b108b754ffa45124a99 [2020-07-08 17:37:02,227 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 17:37:02,230 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 17:37:02,235 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 17:37:02,236 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 17:37:02,239 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 17:37:02,243 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 05:37:02" (1/1) ... [2020-07-08 17:37:02,246 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a382e37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:37:02, skipping insertion in model container [2020-07-08 17:37:02,246 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 05:37:02" (1/1) ... [2020-07-08 17:37:02,255 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 17:37:02,273 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 17:37:02,450 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 17:37:02,456 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 17:37:02,475 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 17:37:02,491 INFO L208 MainTranslator]: Completed translation [2020-07-08 17:37:02,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:37:02 WrapperNode [2020-07-08 17:37:02,492 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 17:37:02,493 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 17:37:02,493 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 17:37:02,493 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 17:37:02,507 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:37:02" (1/1) ... [2020-07-08 17:37:02,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:37:02" (1/1) ... [2020-07-08 17:37:02,513 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:37:02" (1/1) ... [2020-07-08 17:37:02,513 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:37:02" (1/1) ... [2020-07-08 17:37:02,519 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:37:02" (1/1) ... [2020-07-08 17:37:02,525 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:37:02" (1/1) ... [2020-07-08 17:37:02,526 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:37:02" (1/1) ... [2020-07-08 17:37:02,617 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 17:37:02,618 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 17:37:02,618 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 17:37:02,619 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 17:37:02,619 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:37:02" (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 17:37:02,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 17:37:02,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 17:37:02,681 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-08 17:37:02,682 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 17:37:02,682 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 17:37:02,682 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 17:37:02,682 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 17:37:02,682 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-08 17:37:02,682 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 17:37:02,682 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 17:37:02,683 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 17:37:02,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 17:37:02,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 17:37:03,019 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 17:37:03,019 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-08 17:37:03,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 05:37:03 BoogieIcfgContainer [2020-07-08 17:37:03,043 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 17:37:03,044 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 17:37:03,044 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 17:37:03,049 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 17:37:03,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 05:37:02" (1/3) ... [2020-07-08 17:37:03,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a39989e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 05:37:03, skipping insertion in model container [2020-07-08 17:37:03,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:37:02" (2/3) ... [2020-07-08 17:37:03,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a39989e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 05:37:03, skipping insertion in model container [2020-07-08 17:37:03,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 05:37:03" (3/3) ... [2020-07-08 17:37:03,053 INFO L109 eAbstractionObserver]: Analyzing ICFG for_bounded_loop1.c [2020-07-08 17:37:03,063 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 17:37:03,072 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 17:37:03,088 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 17:37:03,110 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 17:37:03,110 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 17:37:03,110 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-08 17:37:03,110 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 17:37:03,110 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 17:37:03,110 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 17:37:03,111 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 17:37:03,111 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 17:37:03,125 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2020-07-08 17:37:03,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-08 17:37:03,136 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:37:03,136 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:37:03,137 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:37:03,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:37:03,143 INFO L82 PathProgramCache]: Analyzing trace with hash 546510172, now seen corresponding path program 1 times [2020-07-08 17:37:03,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:37:03,152 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1251951690] [2020-07-08 17:37:03,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:37:03,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:03,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:03,312 INFO L280 TraceCheckUtils]: 0: Hoare triple {40#true} assume true; {40#true} is VALID [2020-07-08 17:37:03,312 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {40#true} {40#true} #66#return; {40#true} is VALID [2020-07-08 17:37:03,314 INFO L263 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {40#true} is VALID [2020-07-08 17:37:03,316 INFO L280 TraceCheckUtils]: 1: Hoare triple {40#true} assume true; {40#true} is VALID [2020-07-08 17:37:03,317 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} #66#return; {40#true} is VALID [2020-07-08 17:37:03,317 INFO L263 TraceCheckUtils]: 3: Hoare triple {40#true} call #t~ret3 := main(); {40#true} is VALID [2020-07-08 17:37:03,317 INFO L280 TraceCheckUtils]: 4: Hoare triple {40#true} ~i~0 := 0; {40#true} is VALID [2020-07-08 17:37:03,318 INFO L280 TraceCheckUtils]: 5: Hoare triple {40#true} ~x~0 := 0; {40#true} is VALID [2020-07-08 17:37:03,319 INFO L280 TraceCheckUtils]: 6: Hoare triple {40#true} ~y~0 := 0; {40#true} is VALID [2020-07-08 17:37:03,319 INFO L280 TraceCheckUtils]: 7: Hoare triple {40#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {40#true} is VALID [2020-07-08 17:37:03,320 INFO L280 TraceCheckUtils]: 8: Hoare triple {40#true} ~n~0 := #t~nondet0; {40#true} is VALID [2020-07-08 17:37:03,320 INFO L280 TraceCheckUtils]: 9: Hoare triple {40#true} havoc #t~nondet0; {40#true} is VALID [2020-07-08 17:37:03,320 INFO L280 TraceCheckUtils]: 10: Hoare triple {40#true} assume !!(~n~0 > 0); {40#true} is VALID [2020-07-08 17:37:03,321 INFO L280 TraceCheckUtils]: 11: Hoare triple {40#true} ~i~0 := 0; {40#true} is VALID [2020-07-08 17:37:03,322 INFO L280 TraceCheckUtils]: 12: Hoare triple {40#true} assume !true; {41#false} is VALID [2020-07-08 17:37:03,323 INFO L263 TraceCheckUtils]: 13: Hoare triple {41#false} call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); {41#false} is VALID [2020-07-08 17:37:03,323 INFO L280 TraceCheckUtils]: 14: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2020-07-08 17:37:03,323 INFO L280 TraceCheckUtils]: 15: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2020-07-08 17:37:03,324 INFO L280 TraceCheckUtils]: 16: Hoare triple {41#false} assume !false; {41#false} is VALID [2020-07-08 17:37:03,326 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 17:37:03,327 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:37:03,331 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1251951690] [2020-07-08 17:37:03,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:37:03,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-08 17:37:03,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230305754] [2020-07-08 17:37:03,342 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2020-07-08 17:37:03,347 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:37:03,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-08 17:37:03,413 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:03,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-08 17:37:03,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:37:03,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-08 17:37:03,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-08 17:37:03,426 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 2 states. [2020-07-08 17:37:03,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:03,568 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2020-07-08 17:37:03,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-08 17:37:03,569 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2020-07-08 17:37:03,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:37:03,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-08 17:37:03,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 75 transitions. [2020-07-08 17:37:03,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-08 17:37:03,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 75 transitions. [2020-07-08 17:37:03,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 75 transitions. [2020-07-08 17:37:03,756 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:03,774 INFO L225 Difference]: With dead ends: 61 [2020-07-08 17:37:03,774 INFO L226 Difference]: Without dead ends: 31 [2020-07-08 17:37:03,779 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 17:37:03,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-08 17:37:03,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-08 17:37:03,849 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:37:03,850 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2020-07-08 17:37:03,850 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2020-07-08 17:37:03,851 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2020-07-08 17:37:03,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:03,861 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2020-07-08 17:37:03,862 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2020-07-08 17:37:03,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:37:03,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:37:03,865 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2020-07-08 17:37:03,865 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2020-07-08 17:37:03,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:03,881 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2020-07-08 17:37:03,881 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2020-07-08 17:37:03,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:37:03,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:37:03,885 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:37:03,886 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:37:03,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-08 17:37:03,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2020-07-08 17:37:03,893 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 17 [2020-07-08 17:37:03,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:37:03,894 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2020-07-08 17:37:03,894 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-08 17:37:03,894 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 33 transitions. [2020-07-08 17:37:03,950 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:03,951 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2020-07-08 17:37:03,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-08 17:37:03,952 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:37:03,952 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:37:03,953 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 17:37:03,953 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:37:03,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:37:03,954 INFO L82 PathProgramCache]: Analyzing trace with hash 528039752, now seen corresponding path program 1 times [2020-07-08 17:37:03,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:37:03,954 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [429621207] [2020-07-08 17:37:03,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:37:03,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:04,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:04,030 INFO L280 TraceCheckUtils]: 0: Hoare triple {292#true} assume true; {292#true} is VALID [2020-07-08 17:37:04,031 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {292#true} {292#true} #66#return; {292#true} is VALID [2020-07-08 17:37:04,031 INFO L263 TraceCheckUtils]: 0: Hoare triple {292#true} call ULTIMATE.init(); {292#true} is VALID [2020-07-08 17:37:04,031 INFO L280 TraceCheckUtils]: 1: Hoare triple {292#true} assume true; {292#true} is VALID [2020-07-08 17:37:04,032 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {292#true} {292#true} #66#return; {292#true} is VALID [2020-07-08 17:37:04,032 INFO L263 TraceCheckUtils]: 3: Hoare triple {292#true} call #t~ret3 := main(); {292#true} is VALID [2020-07-08 17:37:04,032 INFO L280 TraceCheckUtils]: 4: Hoare triple {292#true} ~i~0 := 0; {292#true} is VALID [2020-07-08 17:37:04,033 INFO L280 TraceCheckUtils]: 5: Hoare triple {292#true} ~x~0 := 0; {292#true} is VALID [2020-07-08 17:37:04,033 INFO L280 TraceCheckUtils]: 6: Hoare triple {292#true} ~y~0 := 0; {292#true} is VALID [2020-07-08 17:37:04,034 INFO L280 TraceCheckUtils]: 7: Hoare triple {292#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {292#true} is VALID [2020-07-08 17:37:04,034 INFO L280 TraceCheckUtils]: 8: Hoare triple {292#true} ~n~0 := #t~nondet0; {292#true} is VALID [2020-07-08 17:37:04,034 INFO L280 TraceCheckUtils]: 9: Hoare triple {292#true} havoc #t~nondet0; {292#true} is VALID [2020-07-08 17:37:04,036 INFO L280 TraceCheckUtils]: 10: Hoare triple {292#true} assume !!(~n~0 > 0); {296#(<= 1 main_~n~0)} is VALID [2020-07-08 17:37:04,037 INFO L280 TraceCheckUtils]: 11: Hoare triple {296#(<= 1 main_~n~0)} ~i~0 := 0; {297#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2020-07-08 17:37:04,038 INFO L280 TraceCheckUtils]: 12: Hoare triple {297#(<= (+ main_~i~0 1) main_~n~0)} assume !(~i~0 < ~n~0); {293#false} is VALID [2020-07-08 17:37:04,039 INFO L263 TraceCheckUtils]: 13: Hoare triple {293#false} call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); {293#false} is VALID [2020-07-08 17:37:04,039 INFO L280 TraceCheckUtils]: 14: Hoare triple {293#false} ~cond := #in~cond; {293#false} is VALID [2020-07-08 17:37:04,040 INFO L280 TraceCheckUtils]: 15: Hoare triple {293#false} assume 0 == ~cond; {293#false} is VALID [2020-07-08 17:37:04,040 INFO L280 TraceCheckUtils]: 16: Hoare triple {293#false} assume !false; {293#false} is VALID [2020-07-08 17:37:04,042 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 17:37:04,043 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:37:04,043 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [429621207] [2020-07-08 17:37:04,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:37:04,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 17:37:04,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578291726] [2020-07-08 17:37:04,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-07-08 17:37:04,045 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:37:04,046 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 17:37:04,083 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:04,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 17:37:04,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:37:04,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 17:37:04,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 17:37:04,085 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 4 states. [2020-07-08 17:37:04,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:04,256 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2020-07-08 17:37:04,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 17:37:04,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-07-08 17:37:04,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:37:04,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 17:37:04,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2020-07-08 17:37:04,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 17:37:04,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2020-07-08 17:37:04,264 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 41 transitions. [2020-07-08 17:37:04,318 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:04,320 INFO L225 Difference]: With dead ends: 39 [2020-07-08 17:37:04,321 INFO L226 Difference]: Without dead ends: 32 [2020-07-08 17:37:04,322 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-08 17:37:04,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-08 17:37:04,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-08 17:37:04,363 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:37:04,363 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2020-07-08 17:37:04,363 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-08 17:37:04,363 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-08 17:37:04,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:04,366 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2020-07-08 17:37:04,366 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2020-07-08 17:37:04,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:37:04,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:37:04,368 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-08 17:37:04,368 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-08 17:37:04,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:04,371 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2020-07-08 17:37:04,371 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2020-07-08 17:37:04,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:37:04,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:37:04,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:37:04,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:37:04,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-08 17:37:04,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2020-07-08 17:37:04,376 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 17 [2020-07-08 17:37:04,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:37:04,376 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2020-07-08 17:37:04,376 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 17:37:04,377 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 34 transitions. [2020-07-08 17:37:04,431 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 17:37:04,431 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2020-07-08 17:37:04,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-08 17:37:04,432 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:37:04,432 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:37:04,433 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 17:37:04,433 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:37:04,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:37:04,433 INFO L82 PathProgramCache]: Analyzing trace with hash -789875431, now seen corresponding path program 1 times [2020-07-08 17:37:04,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:37:04,434 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2050654116] [2020-07-08 17:37:04,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:37:04,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:04,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:04,558 INFO L280 TraceCheckUtils]: 0: Hoare triple {508#true} assume true; {508#true} is VALID [2020-07-08 17:37:04,558 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {508#true} {508#true} #66#return; {508#true} is VALID [2020-07-08 17:37:04,559 INFO L263 TraceCheckUtils]: 0: Hoare triple {508#true} call ULTIMATE.init(); {508#true} is VALID [2020-07-08 17:37:04,559 INFO L280 TraceCheckUtils]: 1: Hoare triple {508#true} assume true; {508#true} is VALID [2020-07-08 17:37:04,559 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {508#true} {508#true} #66#return; {508#true} is VALID [2020-07-08 17:37:04,560 INFO L263 TraceCheckUtils]: 3: Hoare triple {508#true} call #t~ret3 := main(); {508#true} is VALID [2020-07-08 17:37:04,560 INFO L280 TraceCheckUtils]: 4: Hoare triple {508#true} ~i~0 := 0; {508#true} is VALID [2020-07-08 17:37:04,561 INFO L280 TraceCheckUtils]: 5: Hoare triple {508#true} ~x~0 := 0; {512#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2020-07-08 17:37:04,563 INFO L280 TraceCheckUtils]: 6: Hoare triple {512#(and (<= main_~x~0 0) (<= 0 main_~x~0))} ~y~0 := 0; {513#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2020-07-08 17:37:04,564 INFO L280 TraceCheckUtils]: 7: Hoare triple {513#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {513#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2020-07-08 17:37:04,565 INFO L280 TraceCheckUtils]: 8: Hoare triple {513#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} ~n~0 := #t~nondet0; {513#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2020-07-08 17:37:04,566 INFO L280 TraceCheckUtils]: 9: Hoare triple {513#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} havoc #t~nondet0; {513#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2020-07-08 17:37:04,567 INFO L280 TraceCheckUtils]: 10: Hoare triple {513#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} assume !!(~n~0 > 0); {513#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2020-07-08 17:37:04,569 INFO L280 TraceCheckUtils]: 11: Hoare triple {513#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} ~i~0 := 0; {513#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2020-07-08 17:37:04,570 INFO L280 TraceCheckUtils]: 12: Hoare triple {513#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} assume !!(~i~0 < ~n~0); {513#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2020-07-08 17:37:04,571 INFO L280 TraceCheckUtils]: 13: Hoare triple {513#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} ~x~0 := ~x~0 - ~y~0; {512#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2020-07-08 17:37:04,573 INFO L263 TraceCheckUtils]: 14: Hoare triple {512#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); {514#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 17:37:04,574 INFO L280 TraceCheckUtils]: 15: Hoare triple {514#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {515#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 17:37:04,576 INFO L280 TraceCheckUtils]: 16: Hoare triple {515#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {509#false} is VALID [2020-07-08 17:37:04,576 INFO L280 TraceCheckUtils]: 17: Hoare triple {509#false} assume !false; {509#false} is VALID [2020-07-08 17:37:04,578 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 17:37:04,578 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:37:04,579 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2050654116] [2020-07-08 17:37:04,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:37:04,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 17:37:04,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341160392] [2020-07-08 17:37:04,580 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-07-08 17:37:04,580 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:37:04,580 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 17:37:04,603 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:04,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 17:37:04,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:37:04,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 17:37:04,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-08 17:37:04,605 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 6 states. [2020-07-08 17:37:04,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:04,943 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2020-07-08 17:37:04,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-08 17:37:04,943 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-07-08 17:37:04,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:37:04,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 17:37:04,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2020-07-08 17:37:04,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 17:37:04,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2020-07-08 17:37:04,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 44 transitions. [2020-07-08 17:37:05,018 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:05,020 INFO L225 Difference]: With dead ends: 42 [2020-07-08 17:37:05,020 INFO L226 Difference]: Without dead ends: 40 [2020-07-08 17:37:05,021 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-08 17:37:05,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-08 17:37:05,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2020-07-08 17:37:05,104 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:37:05,104 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 36 states. [2020-07-08 17:37:05,104 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 36 states. [2020-07-08 17:37:05,104 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 36 states. [2020-07-08 17:37:05,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:05,108 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2020-07-08 17:37:05,108 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2020-07-08 17:37:05,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:37:05,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:37:05,109 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 40 states. [2020-07-08 17:37:05,109 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 40 states. [2020-07-08 17:37:05,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:05,112 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2020-07-08 17:37:05,112 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2020-07-08 17:37:05,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:37:05,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:37:05,113 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:37:05,113 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:37:05,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-08 17:37:05,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2020-07-08 17:37:05,116 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 18 [2020-07-08 17:37:05,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:37:05,116 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2020-07-08 17:37:05,116 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 17:37:05,117 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 37 transitions. [2020-07-08 17:37:05,166 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:05,167 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2020-07-08 17:37:05,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-08 17:37:05,168 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:37:05,168 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:37:05,168 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 17:37:05,169 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:37:05,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:37:05,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1565658423, now seen corresponding path program 1 times [2020-07-08 17:37:05,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:37:05,169 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1348542309] [2020-07-08 17:37:05,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:37:05,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:05,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:05,390 INFO L280 TraceCheckUtils]: 0: Hoare triple {758#true} assume true; {758#true} is VALID [2020-07-08 17:37:05,390 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {758#true} {758#true} #66#return; {758#true} is VALID [2020-07-08 17:37:05,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:37:05,399 INFO L280 TraceCheckUtils]: 0: Hoare triple {758#true} ~cond := #in~cond; {758#true} is VALID [2020-07-08 17:37:05,400 INFO L280 TraceCheckUtils]: 1: Hoare triple {758#true} assume !(0 == ~cond); {758#true} is VALID [2020-07-08 17:37:05,400 INFO L280 TraceCheckUtils]: 2: Hoare triple {758#true} assume true; {758#true} is VALID [2020-07-08 17:37:05,401 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {758#true} {762#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #70#return; {762#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2020-07-08 17:37:05,402 INFO L263 TraceCheckUtils]: 0: Hoare triple {758#true} call ULTIMATE.init(); {758#true} is VALID [2020-07-08 17:37:05,402 INFO L280 TraceCheckUtils]: 1: Hoare triple {758#true} assume true; {758#true} is VALID [2020-07-08 17:37:05,402 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {758#true} {758#true} #66#return; {758#true} is VALID [2020-07-08 17:37:05,403 INFO L263 TraceCheckUtils]: 3: Hoare triple {758#true} call #t~ret3 := main(); {758#true} is VALID [2020-07-08 17:37:05,403 INFO L280 TraceCheckUtils]: 4: Hoare triple {758#true} ~i~0 := 0; {758#true} is VALID [2020-07-08 17:37:05,404 INFO L280 TraceCheckUtils]: 5: Hoare triple {758#true} ~x~0 := 0; {762#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2020-07-08 17:37:05,405 INFO L280 TraceCheckUtils]: 6: Hoare triple {762#(and (<= main_~x~0 0) (<= 0 main_~x~0))} ~y~0 := 0; {763#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2020-07-08 17:37:05,406 INFO L280 TraceCheckUtils]: 7: Hoare triple {763#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {763#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2020-07-08 17:37:05,407 INFO L280 TraceCheckUtils]: 8: Hoare triple {763#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} ~n~0 := #t~nondet0; {763#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2020-07-08 17:37:05,408 INFO L280 TraceCheckUtils]: 9: Hoare triple {763#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} havoc #t~nondet0; {763#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2020-07-08 17:37:05,409 INFO L280 TraceCheckUtils]: 10: Hoare triple {763#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} assume !!(~n~0 > 0); {763#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2020-07-08 17:37:05,410 INFO L280 TraceCheckUtils]: 11: Hoare triple {763#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} ~i~0 := 0; {763#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2020-07-08 17:37:05,411 INFO L280 TraceCheckUtils]: 12: Hoare triple {763#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} assume !!(~i~0 < ~n~0); {763#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2020-07-08 17:37:05,420 INFO L280 TraceCheckUtils]: 13: Hoare triple {763#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} ~x~0 := ~x~0 - ~y~0; {762#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2020-07-08 17:37:05,420 INFO L263 TraceCheckUtils]: 14: Hoare triple {762#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); {758#true} is VALID [2020-07-08 17:37:05,420 INFO L280 TraceCheckUtils]: 15: Hoare triple {758#true} ~cond := #in~cond; {758#true} is VALID [2020-07-08 17:37:05,421 INFO L280 TraceCheckUtils]: 16: Hoare triple {758#true} assume !(0 == ~cond); {758#true} is VALID [2020-07-08 17:37:05,421 INFO L280 TraceCheckUtils]: 17: Hoare triple {758#true} assume true; {758#true} is VALID [2020-07-08 17:37:05,422 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {758#true} {762#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #70#return; {762#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2020-07-08 17:37:05,423 INFO L280 TraceCheckUtils]: 19: Hoare triple {762#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {762#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2020-07-08 17:37:05,424 INFO L280 TraceCheckUtils]: 20: Hoare triple {762#(and (<= main_~x~0 0) (<= 0 main_~x~0))} ~y~0 := #t~nondet2; {768#(and (or (<= 0 main_~x~0) (<= main_~y~0 0)) (or (<= main_~x~0 0) (< 0 (+ main_~y~0 1))))} is VALID [2020-07-08 17:37:05,424 INFO L280 TraceCheckUtils]: 21: Hoare triple {768#(and (or (<= 0 main_~x~0) (<= main_~y~0 0)) (or (<= main_~x~0 0) (< 0 (+ main_~y~0 1))))} havoc #t~nondet2; {768#(and (or (<= 0 main_~x~0) (<= main_~y~0 0)) (or (<= main_~x~0 0) (< 0 (+ main_~y~0 1))))} is VALID [2020-07-08 17:37:05,425 INFO L280 TraceCheckUtils]: 22: Hoare triple {768#(and (or (<= 0 main_~x~0) (<= main_~y~0 0)) (or (<= main_~x~0 0) (< 0 (+ main_~y~0 1))))} assume !!(0 != ~y~0); {769#(and (or (< 0 main_~y~0) (and (<= main_~x~0 0) (<= (+ main_~y~0 1) 0))) (or (<= 0 main_~x~0) (<= main_~y~0 0)))} is VALID [2020-07-08 17:37:05,427 INFO L280 TraceCheckUtils]: 23: Hoare triple {769#(and (or (< 0 main_~y~0) (and (<= main_~x~0 0) (<= (+ main_~y~0 1) 0))) (or (<= 0 main_~x~0) (<= main_~y~0 0)))} ~x~0 := ~x~0 + ~y~0; {770#(or (<= (+ main_~x~0 1) 0) (<= 1 main_~x~0))} is VALID [2020-07-08 17:37:05,428 INFO L263 TraceCheckUtils]: 24: Hoare triple {770#(or (<= (+ main_~x~0 1) 0) (<= 1 main_~x~0))} call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); {771#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 17:37:05,428 INFO L280 TraceCheckUtils]: 25: Hoare triple {771#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {772#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 17:37:05,429 INFO L280 TraceCheckUtils]: 26: Hoare triple {772#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {759#false} is VALID [2020-07-08 17:37:05,429 INFO L280 TraceCheckUtils]: 27: Hoare triple {759#false} assume !false; {759#false} is VALID [2020-07-08 17:37:05,431 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 17:37:05,432 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:37:05,432 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1348542309] [2020-07-08 17:37:05,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:37:05,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-08 17:37:05,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634963174] [2020-07-08 17:37:05,433 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2020-07-08 17:37:05,434 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:37:05,434 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-08 17:37:05,470 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-08 17:37:05,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-08 17:37:05,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:37:05,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-08 17:37:05,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-08 17:37:05,472 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 9 states. [2020-07-08 17:37:06,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:06,042 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-07-08 17:37:06,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-08 17:37:06,043 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2020-07-08 17:37:06,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:37:06,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 17:37:06,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2020-07-08 17:37:06,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 17:37:06,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2020-07-08 17:37:06,049 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 44 transitions. [2020-07-08 17:37:06,102 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:06,104 INFO L225 Difference]: With dead ends: 46 [2020-07-08 17:37:06,104 INFO L226 Difference]: Without dead ends: 42 [2020-07-08 17:37:06,105 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2020-07-08 17:37:06,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-08 17:37:06,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2020-07-08 17:37:06,187 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:37:06,187 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 38 states. [2020-07-08 17:37:06,187 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 38 states. [2020-07-08 17:37:06,187 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 38 states. [2020-07-08 17:37:06,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:06,190 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2020-07-08 17:37:06,191 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-07-08 17:37:06,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:37:06,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:37:06,192 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 42 states. [2020-07-08 17:37:06,192 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 42 states. [2020-07-08 17:37:06,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:37:06,195 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2020-07-08 17:37:06,195 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-07-08 17:37:06,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:37:06,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:37:06,196 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:37:06,196 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:37:06,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-08 17:37:06,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2020-07-08 17:37:06,198 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 28 [2020-07-08 17:37:06,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:37:06,199 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2020-07-08 17:37:06,199 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-08 17:37:06,199 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 38 transitions. [2020-07-08 17:37:06,249 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:37:06,250 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2020-07-08 17:37:06,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-08 17:37:06,251 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:37:06,251 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:37:06,251 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 17:37:06,252 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:37:06,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:37:06,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1612602333, now seen corresponding path program 1 times [2020-07-08 17:37:06,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:37:06,253 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1282879738] [2020-07-08 17:37:06,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:37:06,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 17:37:06,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 17:37:06,350 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:37:06,351 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-08 17:37:06,351 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-08 17:37:06,351 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-08 17:37:06,367 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 17:37:06,367 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 17:37:06,368 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 17:37:06,368 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-08 17:37:06,368 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-08 17:37:06,368 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-08 17:37:06,368 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 17:37:06,368 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 17:37:06,368 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 17:37:06,368 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-08 17:37:06,368 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-08 17:37:06,368 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-08 17:37:06,368 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-08 17:37:06,368 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-08 17:37:06,369 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 17:37:06,369 WARN L170 areAnnotationChecker]: L5-1 has no Hoare annotation [2020-07-08 17:37:06,369 WARN L170 areAnnotationChecker]: L5-3 has no Hoare annotation [2020-07-08 17:37:06,369 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2020-07-08 17:37:06,369 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-08 17:37:06,369 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-08 17:37:06,369 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2020-07-08 17:37:06,369 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-08 17:37:06,369 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 17:37:06,369 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 17:37:06,369 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 17:37:06,369 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2020-07-08 17:37:06,370 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-08 17:37:06,370 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2020-07-08 17:37:06,370 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 17:37:06,370 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2020-07-08 17:37:06,370 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-08 17:37:06,370 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2020-07-08 17:37:06,370 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 17:37:06,370 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-08 17:37:06,370 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-08 17:37:06,370 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2020-07-08 17:37:06,370 WARN L170 areAnnotationChecker]: L20-4 has no Hoare annotation [2020-07-08 17:37:06,370 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2020-07-08 17:37:06,370 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-08 17:37:06,370 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-08 17:37:06,371 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-08 17:37:06,371 WARN L170 areAnnotationChecker]: L20-5 has no Hoare annotation [2020-07-08 17:37:06,371 WARN L170 areAnnotationChecker]: L20-5 has no Hoare annotation [2020-07-08 17:37:06,371 WARN L170 areAnnotationChecker]: L20-5 has no Hoare annotation [2020-07-08 17:37:06,371 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2020-07-08 17:37:06,371 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-08 17:37:06,371 WARN L170 areAnnotationChecker]: L20-6 has no Hoare annotation [2020-07-08 17:37:06,371 WARN L170 areAnnotationChecker]: L20-6 has no Hoare annotation [2020-07-08 17:37:06,371 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-08 17:37:06,371 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-08 17:37:06,371 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-08 17:37:06,371 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-08 17:37:06,371 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-08 17:37:06,372 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 17:37:06,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 05:37:06 BoogieIcfgContainer [2020-07-08 17:37:06,375 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 17:37:06,378 INFO L168 Benchmark]: Toolchain (without parser) took 4148.19 ms. Allocated memory was 144.7 MB in the beginning and 250.1 MB in the end (delta: 105.4 MB). Free memory was 103.3 MB in the beginning and 172.2 MB in the end (delta: -68.9 MB). Peak memory consumption was 36.5 MB. Max. memory is 7.1 GB. [2020-07-08 17:37:06,379 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 144.7 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-08 17:37:06,380 INFO L168 Benchmark]: CACSL2BoogieTranslator took 256.76 ms. Allocated memory is still 144.7 MB. Free memory was 103.1 MB in the beginning and 92.9 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2020-07-08 17:37:06,381 INFO L168 Benchmark]: Boogie Preprocessor took 125.27 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 92.9 MB in the beginning and 182.4 MB in the end (delta: -89.5 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. [2020-07-08 17:37:06,382 INFO L168 Benchmark]: RCFGBuilder took 424.47 ms. Allocated memory is still 202.4 MB. Free memory was 182.4 MB in the beginning and 161.4 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. [2020-07-08 17:37:06,383 INFO L168 Benchmark]: TraceAbstraction took 3331.01 ms. Allocated memory was 202.4 MB in the beginning and 250.1 MB in the end (delta: 47.7 MB). Free memory was 161.4 MB in the beginning and 172.2 MB in the end (delta: -10.8 MB). Peak memory consumption was 36.9 MB. Max. memory is 7.1 GB. [2020-07-08 17:37:06,387 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.27 ms. Allocated memory is still 144.7 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 256.76 ms. Allocated memory is still 144.7 MB. Free memory was 103.1 MB in the beginning and 92.9 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 125.27 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 92.9 MB in the beginning and 182.4 MB in the end (delta: -89.5 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 424.47 ms. Allocated memory is still 202.4 MB. Free memory was 182.4 MB in the beginning and 161.4 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3331.01 ms. Allocated memory was 202.4 MB in the beginning and 250.1 MB in the end (delta: 47.7 MB). Free memory was 161.4 MB in the beginning and 172.2 MB in the end (delta: -10.8 MB). Peak memory consumption was 36.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 9]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int i=0, x=0, y=0; [L18] int n=__VERIFIER_nondet_int(); [L19] COND FALSE !(!(n>0)) [L20] i=0 [L20] COND TRUE i