/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/locks/test_locks_6.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:16:43,697 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:16:43,699 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:16:43,711 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:16:43,712 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:16:43,713 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:16:43,714 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:16:43,716 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:16:43,718 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:16:43,718 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:16:43,719 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:16:43,721 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:16:43,721 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:16:43,722 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:16:43,723 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:16:43,724 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:16:43,725 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:16:43,726 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:16:43,727 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:16:43,729 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:16:43,731 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:16:43,732 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:16:43,733 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:16:43,733 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:16:43,735 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:16:43,736 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:16:43,736 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:16:43,737 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:16:43,737 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:16:43,738 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:16:43,738 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:16:43,739 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:16:43,740 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:16:43,741 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:16:43,742 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:16:43,742 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:16:43,742 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:16:43,743 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:16:43,743 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:16:43,744 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:16:43,744 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:16:43,745 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 00:16:43,754 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:16:43,754 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:16:43,755 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:16:43,756 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:16:43,756 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:16:43,756 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:16:43,756 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:16:43,756 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:16:43,756 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:16:43,757 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:16:43,757 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:16:43,757 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:16:43,757 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:16:43,757 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:16:43,758 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:16:43,758 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:16:43,758 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:16:43,758 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:16:43,759 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:16:43,759 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:16:43,759 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:16:43,759 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:16:43,759 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:16:44,034 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:16:44,048 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:16:44,051 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:16:44,053 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:16:44,053 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:16:44,054 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_6.c [2020-07-18 00:16:44,130 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e682eae19/2c8bc80e23e44ba9bf486218651d6384/FLAG83199eb96 [2020-07-18 00:16:44,573 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:16:44,574 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c [2020-07-18 00:16:44,585 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e682eae19/2c8bc80e23e44ba9bf486218651d6384/FLAG83199eb96 [2020-07-18 00:16:44,968 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e682eae19/2c8bc80e23e44ba9bf486218651d6384 [2020-07-18 00:16:44,979 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:16:44,982 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:16:44,984 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:16:44,984 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:16:44,988 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:16:44,990 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:16:44" (1/1) ... [2020-07-18 00:16:44,992 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f897e6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:16:44, skipping insertion in model container [2020-07-18 00:16:44,993 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:16:44" (1/1) ... [2020-07-18 00:16:45,003 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:16:45,025 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:16:45,236 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:16:45,241 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:16:45,263 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:16:45,275 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:16:45,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:16:45 WrapperNode [2020-07-18 00:16:45,275 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:16:45,276 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:16:45,276 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:16:45,276 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:16:45,290 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:16:45" (1/1) ... [2020-07-18 00:16:45,290 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:16:45" (1/1) ... [2020-07-18 00:16:45,296 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:16:45" (1/1) ... [2020-07-18 00:16:45,296 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:16:45" (1/1) ... [2020-07-18 00:16:45,303 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:16:45" (1/1) ... [2020-07-18 00:16:45,312 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:16:45" (1/1) ... [2020-07-18 00:16:45,314 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:16:45" (1/1) ... [2020-07-18 00:16:45,398 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:16:45,398 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:16:45,398 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:16:45,399 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:16:45,403 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:16:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:16:45,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:16:45,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:16:45,461 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:16:45,461 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:16:45,461 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 00:16:45,462 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:16:45,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:16:45,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:16:45,895 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:16:45,896 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-18 00:16:45,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:16:45 BoogieIcfgContainer [2020-07-18 00:16:45,900 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:16:45,902 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:16:45,902 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:16:45,905 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:16:45,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:16:44" (1/3) ... [2020-07-18 00:16:45,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22ed5585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:16:45, skipping insertion in model container [2020-07-18 00:16:45,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:16:45" (2/3) ... [2020-07-18 00:16:45,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22ed5585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:16:45, skipping insertion in model container [2020-07-18 00:16:45,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:16:45" (3/3) ... [2020-07-18 00:16:45,909 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2020-07-18 00:16:45,920 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:16:45,928 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:16:45,942 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:16:45,964 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:16:45,965 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:16:45,965 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:16:45,965 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:16:45,965 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:16:45,965 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:16:45,965 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:16:45,966 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:16:45,986 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2020-07-18 00:16:45,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-07-18 00:16:45,999 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:16:46,000 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:16:46,001 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:16:46,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:16:46,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1400694048, now seen corresponding path program 1 times [2020-07-18 00:16:46,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:16:46,015 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1833181685] [2020-07-18 00:16:46,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:16:46,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:16:46,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:16:46,229 INFO L280 TraceCheckUtils]: 0: Hoare triple {81#true} assume true; {81#true} is VALID [2020-07-18 00:16:46,230 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {81#true} {81#true} #175#return; {81#true} is VALID [2020-07-18 00:16:46,232 INFO L263 TraceCheckUtils]: 0: Hoare triple {81#true} call ULTIMATE.init(); {81#true} is VALID [2020-07-18 00:16:46,233 INFO L280 TraceCheckUtils]: 1: Hoare triple {81#true} assume true; {81#true} is VALID [2020-07-18 00:16:46,233 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {81#true} {81#true} #175#return; {81#true} is VALID [2020-07-18 00:16:46,234 INFO L263 TraceCheckUtils]: 3: Hoare triple {81#true} call #t~ret7 := main(); {81#true} is VALID [2020-07-18 00:16:46,234 INFO L280 TraceCheckUtils]: 4: Hoare triple {81#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {81#true} is VALID [2020-07-18 00:16:46,235 INFO L280 TraceCheckUtils]: 5: Hoare triple {81#true} ~p1~0 := #t~nondet0; {81#true} is VALID [2020-07-18 00:16:46,235 INFO L280 TraceCheckUtils]: 6: Hoare triple {81#true} havoc #t~nondet0; {81#true} is VALID [2020-07-18 00:16:46,236 INFO L280 TraceCheckUtils]: 7: Hoare triple {81#true} havoc ~lk1~0; {81#true} is VALID [2020-07-18 00:16:46,236 INFO L280 TraceCheckUtils]: 8: Hoare triple {81#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {81#true} is VALID [2020-07-18 00:16:46,237 INFO L280 TraceCheckUtils]: 9: Hoare triple {81#true} ~p2~0 := #t~nondet1; {81#true} is VALID [2020-07-18 00:16:46,237 INFO L280 TraceCheckUtils]: 10: Hoare triple {81#true} havoc #t~nondet1; {81#true} is VALID [2020-07-18 00:16:46,238 INFO L280 TraceCheckUtils]: 11: Hoare triple {81#true} havoc ~lk2~0; {81#true} is VALID [2020-07-18 00:16:46,238 INFO L280 TraceCheckUtils]: 12: Hoare triple {81#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {81#true} is VALID [2020-07-18 00:16:46,238 INFO L280 TraceCheckUtils]: 13: Hoare triple {81#true} ~p3~0 := #t~nondet2; {81#true} is VALID [2020-07-18 00:16:46,239 INFO L280 TraceCheckUtils]: 14: Hoare triple {81#true} havoc #t~nondet2; {81#true} is VALID [2020-07-18 00:16:46,239 INFO L280 TraceCheckUtils]: 15: Hoare triple {81#true} havoc ~lk3~0; {81#true} is VALID [2020-07-18 00:16:46,240 INFO L280 TraceCheckUtils]: 16: Hoare triple {81#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {81#true} is VALID [2020-07-18 00:16:46,240 INFO L280 TraceCheckUtils]: 17: Hoare triple {81#true} ~p4~0 := #t~nondet3; {81#true} is VALID [2020-07-18 00:16:46,241 INFO L280 TraceCheckUtils]: 18: Hoare triple {81#true} havoc #t~nondet3; {81#true} is VALID [2020-07-18 00:16:46,241 INFO L280 TraceCheckUtils]: 19: Hoare triple {81#true} havoc ~lk4~0; {81#true} is VALID [2020-07-18 00:16:46,242 INFO L280 TraceCheckUtils]: 20: Hoare triple {81#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {81#true} is VALID [2020-07-18 00:16:46,242 INFO L280 TraceCheckUtils]: 21: Hoare triple {81#true} ~p5~0 := #t~nondet4; {81#true} is VALID [2020-07-18 00:16:46,243 INFO L280 TraceCheckUtils]: 22: Hoare triple {81#true} havoc #t~nondet4; {81#true} is VALID [2020-07-18 00:16:46,243 INFO L280 TraceCheckUtils]: 23: Hoare triple {81#true} havoc ~lk5~0; {81#true} is VALID [2020-07-18 00:16:46,243 INFO L280 TraceCheckUtils]: 24: Hoare triple {81#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {81#true} is VALID [2020-07-18 00:16:46,244 INFO L280 TraceCheckUtils]: 25: Hoare triple {81#true} ~p6~0 := #t~nondet5; {81#true} is VALID [2020-07-18 00:16:46,245 INFO L280 TraceCheckUtils]: 26: Hoare triple {81#true} havoc #t~nondet5; {81#true} is VALID [2020-07-18 00:16:46,245 INFO L280 TraceCheckUtils]: 27: Hoare triple {81#true} havoc ~lk6~0; {81#true} is VALID [2020-07-18 00:16:46,245 INFO L280 TraceCheckUtils]: 28: Hoare triple {81#true} havoc ~cond~0; {81#true} is VALID [2020-07-18 00:16:46,246 INFO L280 TraceCheckUtils]: 29: Hoare triple {81#true} assume !false; {81#true} is VALID [2020-07-18 00:16:46,246 INFO L280 TraceCheckUtils]: 30: Hoare triple {81#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {81#true} is VALID [2020-07-18 00:16:46,247 INFO L280 TraceCheckUtils]: 31: Hoare triple {81#true} ~cond~0 := #t~nondet6; {81#true} is VALID [2020-07-18 00:16:46,247 INFO L280 TraceCheckUtils]: 32: Hoare triple {81#true} havoc #t~nondet6; {81#true} is VALID [2020-07-18 00:16:46,248 INFO L280 TraceCheckUtils]: 33: Hoare triple {81#true} assume !(0 == ~cond~0); {81#true} is VALID [2020-07-18 00:16:46,248 INFO L280 TraceCheckUtils]: 34: Hoare triple {81#true} ~lk1~0 := 0; {81#true} is VALID [2020-07-18 00:16:46,248 INFO L280 TraceCheckUtils]: 35: Hoare triple {81#true} ~lk2~0 := 0; {81#true} is VALID [2020-07-18 00:16:46,249 INFO L280 TraceCheckUtils]: 36: Hoare triple {81#true} ~lk3~0 := 0; {81#true} is VALID [2020-07-18 00:16:46,249 INFO L280 TraceCheckUtils]: 37: Hoare triple {81#true} ~lk4~0 := 0; {81#true} is VALID [2020-07-18 00:16:46,250 INFO L280 TraceCheckUtils]: 38: Hoare triple {81#true} ~lk5~0 := 0; {81#true} is VALID [2020-07-18 00:16:46,250 INFO L280 TraceCheckUtils]: 39: Hoare triple {81#true} ~lk6~0 := 0; {81#true} is VALID [2020-07-18 00:16:46,253 INFO L280 TraceCheckUtils]: 40: Hoare triple {81#true} assume !(0 != ~p1~0); {85#(= 0 main_~p1~0)} is VALID [2020-07-18 00:16:46,255 INFO L280 TraceCheckUtils]: 41: Hoare triple {85#(= 0 main_~p1~0)} assume !(0 != ~p2~0); {85#(= 0 main_~p1~0)} is VALID [2020-07-18 00:16:46,256 INFO L280 TraceCheckUtils]: 42: Hoare triple {85#(= 0 main_~p1~0)} assume !(0 != ~p3~0); {85#(= 0 main_~p1~0)} is VALID [2020-07-18 00:16:46,257 INFO L280 TraceCheckUtils]: 43: Hoare triple {85#(= 0 main_~p1~0)} assume !(0 != ~p4~0); {85#(= 0 main_~p1~0)} is VALID [2020-07-18 00:16:46,258 INFO L280 TraceCheckUtils]: 44: Hoare triple {85#(= 0 main_~p1~0)} assume !(0 != ~p5~0); {85#(= 0 main_~p1~0)} is VALID [2020-07-18 00:16:46,259 INFO L280 TraceCheckUtils]: 45: Hoare triple {85#(= 0 main_~p1~0)} assume !(0 != ~p6~0); {85#(= 0 main_~p1~0)} is VALID [2020-07-18 00:16:46,260 INFO L280 TraceCheckUtils]: 46: Hoare triple {85#(= 0 main_~p1~0)} assume 0 != ~p1~0; {82#false} is VALID [2020-07-18 00:16:46,260 INFO L280 TraceCheckUtils]: 47: Hoare triple {82#false} assume 1 != ~lk1~0; {82#false} is VALID [2020-07-18 00:16:46,261 INFO L280 TraceCheckUtils]: 48: Hoare triple {82#false} assume !false; {82#false} is VALID [2020-07-18 00:16:46,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-18 00:16:46,273 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:16:46,275 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1833181685] [2020-07-18 00:16:46,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:16:46,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:16:46,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101988257] [2020-07-18 00:16:46,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2020-07-18 00:16:46,288 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:16:46,292 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:16:46,374 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:16:46,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:16:46,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:16:46,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:16:46,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:16:46,387 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 3 states. [2020-07-18 00:16:46,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:16:46,823 INFO L93 Difference]: Finished difference Result 169 states and 229 transitions. [2020-07-18 00:16:46,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:16:46,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2020-07-18 00:16:46,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:16:46,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:16:46,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 229 transitions. [2020-07-18 00:16:46,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:16:46,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 229 transitions. [2020-07-18 00:16:46,852 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 229 transitions. [2020-07-18 00:16:47,135 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 229 edges. 229 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:16:47,171 INFO L225 Difference]: With dead ends: 169 [2020-07-18 00:16:47,171 INFO L226 Difference]: Without dead ends: 112 [2020-07-18 00:16:47,180 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:16:47,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-07-18 00:16:47,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2020-07-18 00:16:47,338 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:16:47,339 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand 110 states. [2020-07-18 00:16:47,340 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 110 states. [2020-07-18 00:16:47,340 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 110 states. [2020-07-18 00:16:47,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:16:47,351 INFO L93 Difference]: Finished difference Result 112 states and 143 transitions. [2020-07-18 00:16:47,352 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 143 transitions. [2020-07-18 00:16:47,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:16:47,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:16:47,355 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 112 states. [2020-07-18 00:16:47,355 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 112 states. [2020-07-18 00:16:47,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:16:47,365 INFO L93 Difference]: Finished difference Result 112 states and 143 transitions. [2020-07-18 00:16:47,366 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 143 transitions. [2020-07-18 00:16:47,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:16:47,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:16:47,367 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:16:47,368 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:16:47,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-07-18 00:16:47,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 142 transitions. [2020-07-18 00:16:47,376 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 142 transitions. Word has length 49 [2020-07-18 00:16:47,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:16:47,377 INFO L479 AbstractCegarLoop]: Abstraction has 110 states and 142 transitions. [2020-07-18 00:16:47,377 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:16:47,377 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 110 states and 142 transitions. [2020-07-18 00:16:47,541 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:16:47,541 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 142 transitions. [2020-07-18 00:16:47,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-18 00:16:47,544 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:16:47,544 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:16:47,545 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:16:47,545 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:16:47,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:16:47,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1290717684, now seen corresponding path program 1 times [2020-07-18 00:16:47,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:16:47,546 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1459028502] [2020-07-18 00:16:47,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:16:47,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:16:47,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:16:47,636 INFO L280 TraceCheckUtils]: 0: Hoare triple {870#true} assume true; {870#true} is VALID [2020-07-18 00:16:47,636 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {870#true} {870#true} #175#return; {870#true} is VALID [2020-07-18 00:16:47,637 INFO L263 TraceCheckUtils]: 0: Hoare triple {870#true} call ULTIMATE.init(); {870#true} is VALID [2020-07-18 00:16:47,637 INFO L280 TraceCheckUtils]: 1: Hoare triple {870#true} assume true; {870#true} is VALID [2020-07-18 00:16:47,638 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {870#true} {870#true} #175#return; {870#true} is VALID [2020-07-18 00:16:47,638 INFO L263 TraceCheckUtils]: 3: Hoare triple {870#true} call #t~ret7 := main(); {870#true} is VALID [2020-07-18 00:16:47,638 INFO L280 TraceCheckUtils]: 4: Hoare triple {870#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {870#true} is VALID [2020-07-18 00:16:47,639 INFO L280 TraceCheckUtils]: 5: Hoare triple {870#true} ~p1~0 := #t~nondet0; {870#true} is VALID [2020-07-18 00:16:47,639 INFO L280 TraceCheckUtils]: 6: Hoare triple {870#true} havoc #t~nondet0; {870#true} is VALID [2020-07-18 00:16:47,639 INFO L280 TraceCheckUtils]: 7: Hoare triple {870#true} havoc ~lk1~0; {870#true} is VALID [2020-07-18 00:16:47,640 INFO L280 TraceCheckUtils]: 8: Hoare triple {870#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {870#true} is VALID [2020-07-18 00:16:47,640 INFO L280 TraceCheckUtils]: 9: Hoare triple {870#true} ~p2~0 := #t~nondet1; {870#true} is VALID [2020-07-18 00:16:47,640 INFO L280 TraceCheckUtils]: 10: Hoare triple {870#true} havoc #t~nondet1; {870#true} is VALID [2020-07-18 00:16:47,641 INFO L280 TraceCheckUtils]: 11: Hoare triple {870#true} havoc ~lk2~0; {870#true} is VALID [2020-07-18 00:16:47,641 INFO L280 TraceCheckUtils]: 12: Hoare triple {870#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {870#true} is VALID [2020-07-18 00:16:47,641 INFO L280 TraceCheckUtils]: 13: Hoare triple {870#true} ~p3~0 := #t~nondet2; {870#true} is VALID [2020-07-18 00:16:47,642 INFO L280 TraceCheckUtils]: 14: Hoare triple {870#true} havoc #t~nondet2; {870#true} is VALID [2020-07-18 00:16:47,642 INFO L280 TraceCheckUtils]: 15: Hoare triple {870#true} havoc ~lk3~0; {870#true} is VALID [2020-07-18 00:16:47,642 INFO L280 TraceCheckUtils]: 16: Hoare triple {870#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {870#true} is VALID [2020-07-18 00:16:47,643 INFO L280 TraceCheckUtils]: 17: Hoare triple {870#true} ~p4~0 := #t~nondet3; {870#true} is VALID [2020-07-18 00:16:47,643 INFO L280 TraceCheckUtils]: 18: Hoare triple {870#true} havoc #t~nondet3; {870#true} is VALID [2020-07-18 00:16:47,644 INFO L280 TraceCheckUtils]: 19: Hoare triple {870#true} havoc ~lk4~0; {870#true} is VALID [2020-07-18 00:16:47,644 INFO L280 TraceCheckUtils]: 20: Hoare triple {870#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {870#true} is VALID [2020-07-18 00:16:47,644 INFO L280 TraceCheckUtils]: 21: Hoare triple {870#true} ~p5~0 := #t~nondet4; {870#true} is VALID [2020-07-18 00:16:47,645 INFO L280 TraceCheckUtils]: 22: Hoare triple {870#true} havoc #t~nondet4; {870#true} is VALID [2020-07-18 00:16:47,645 INFO L280 TraceCheckUtils]: 23: Hoare triple {870#true} havoc ~lk5~0; {870#true} is VALID [2020-07-18 00:16:47,645 INFO L280 TraceCheckUtils]: 24: Hoare triple {870#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {870#true} is VALID [2020-07-18 00:16:47,646 INFO L280 TraceCheckUtils]: 25: Hoare triple {870#true} ~p6~0 := #t~nondet5; {870#true} is VALID [2020-07-18 00:16:47,646 INFO L280 TraceCheckUtils]: 26: Hoare triple {870#true} havoc #t~nondet5; {870#true} is VALID [2020-07-18 00:16:47,646 INFO L280 TraceCheckUtils]: 27: Hoare triple {870#true} havoc ~lk6~0; {870#true} is VALID [2020-07-18 00:16:47,647 INFO L280 TraceCheckUtils]: 28: Hoare triple {870#true} havoc ~cond~0; {870#true} is VALID [2020-07-18 00:16:47,647 INFO L280 TraceCheckUtils]: 29: Hoare triple {870#true} assume !false; {870#true} is VALID [2020-07-18 00:16:47,647 INFO L280 TraceCheckUtils]: 30: Hoare triple {870#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {870#true} is VALID [2020-07-18 00:16:47,648 INFO L280 TraceCheckUtils]: 31: Hoare triple {870#true} ~cond~0 := #t~nondet6; {870#true} is VALID [2020-07-18 00:16:47,648 INFO L280 TraceCheckUtils]: 32: Hoare triple {870#true} havoc #t~nondet6; {870#true} is VALID [2020-07-18 00:16:47,649 INFO L280 TraceCheckUtils]: 33: Hoare triple {870#true} assume !(0 == ~cond~0); {870#true} is VALID [2020-07-18 00:16:47,649 INFO L280 TraceCheckUtils]: 34: Hoare triple {870#true} ~lk1~0 := 0; {870#true} is VALID [2020-07-18 00:16:47,649 INFO L280 TraceCheckUtils]: 35: Hoare triple {870#true} ~lk2~0 := 0; {870#true} is VALID [2020-07-18 00:16:47,650 INFO L280 TraceCheckUtils]: 36: Hoare triple {870#true} ~lk3~0 := 0; {870#true} is VALID [2020-07-18 00:16:47,650 INFO L280 TraceCheckUtils]: 37: Hoare triple {870#true} ~lk4~0 := 0; {870#true} is VALID [2020-07-18 00:16:47,650 INFO L280 TraceCheckUtils]: 38: Hoare triple {870#true} ~lk5~0 := 0; {870#true} is VALID [2020-07-18 00:16:47,651 INFO L280 TraceCheckUtils]: 39: Hoare triple {870#true} ~lk6~0 := 0; {870#true} is VALID [2020-07-18 00:16:47,651 INFO L280 TraceCheckUtils]: 40: Hoare triple {870#true} assume 0 != ~p1~0; {870#true} is VALID [2020-07-18 00:16:47,652 INFO L280 TraceCheckUtils]: 41: Hoare triple {870#true} ~lk1~0 := 1; {874#(= 1 main_~lk1~0)} is VALID [2020-07-18 00:16:47,654 INFO L280 TraceCheckUtils]: 42: Hoare triple {874#(= 1 main_~lk1~0)} assume !(0 != ~p2~0); {874#(= 1 main_~lk1~0)} is VALID [2020-07-18 00:16:47,655 INFO L280 TraceCheckUtils]: 43: Hoare triple {874#(= 1 main_~lk1~0)} assume !(0 != ~p3~0); {874#(= 1 main_~lk1~0)} is VALID [2020-07-18 00:16:47,656 INFO L280 TraceCheckUtils]: 44: Hoare triple {874#(= 1 main_~lk1~0)} assume !(0 != ~p4~0); {874#(= 1 main_~lk1~0)} is VALID [2020-07-18 00:16:47,657 INFO L280 TraceCheckUtils]: 45: Hoare triple {874#(= 1 main_~lk1~0)} assume !(0 != ~p5~0); {874#(= 1 main_~lk1~0)} is VALID [2020-07-18 00:16:47,658 INFO L280 TraceCheckUtils]: 46: Hoare triple {874#(= 1 main_~lk1~0)} assume !(0 != ~p6~0); {874#(= 1 main_~lk1~0)} is VALID [2020-07-18 00:16:47,659 INFO L280 TraceCheckUtils]: 47: Hoare triple {874#(= 1 main_~lk1~0)} assume 0 != ~p1~0; {874#(= 1 main_~lk1~0)} is VALID [2020-07-18 00:16:47,660 INFO L280 TraceCheckUtils]: 48: Hoare triple {874#(= 1 main_~lk1~0)} assume 1 != ~lk1~0; {871#false} is VALID [2020-07-18 00:16:47,660 INFO L280 TraceCheckUtils]: 49: Hoare triple {871#false} assume !false; {871#false} is VALID [2020-07-18 00:16:47,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:16:47,666 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:16:47,666 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1459028502] [2020-07-18 00:16:47,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:16:47,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:16:47,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907107201] [2020-07-18 00:16:47,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-07-18 00:16:47,669 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:16:47,669 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:16:47,727 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:16:47,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:16:47,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:16:47,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:16:47,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:16:47,729 INFO L87 Difference]: Start difference. First operand 110 states and 142 transitions. Second operand 3 states. [2020-07-18 00:16:48,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:16:48,004 INFO L93 Difference]: Finished difference Result 135 states and 175 transitions. [2020-07-18 00:16:48,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:16:48,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-07-18 00:16:48,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:16:48,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:16:48,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2020-07-18 00:16:48,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:16:48,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2020-07-18 00:16:48,013 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 138 transitions. [2020-07-18 00:16:48,142 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:16:48,150 INFO L225 Difference]: With dead ends: 135 [2020-07-18 00:16:48,150 INFO L226 Difference]: Without dead ends: 133 [2020-07-18 00:16:48,152 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:16:48,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-07-18 00:16:48,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 110. [2020-07-18 00:16:48,275 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:16:48,276 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand 110 states. [2020-07-18 00:16:48,276 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 110 states. [2020-07-18 00:16:48,276 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 110 states. [2020-07-18 00:16:48,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:16:48,283 INFO L93 Difference]: Finished difference Result 133 states and 173 transitions. [2020-07-18 00:16:48,283 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 173 transitions. [2020-07-18 00:16:48,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:16:48,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:16:48,285 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 133 states. [2020-07-18 00:16:48,285 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 133 states. [2020-07-18 00:16:48,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:16:48,292 INFO L93 Difference]: Finished difference Result 133 states and 173 transitions. [2020-07-18 00:16:48,293 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 173 transitions. [2020-07-18 00:16:48,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:16:48,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:16:48,294 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:16:48,294 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:16:48,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-07-18 00:16:48,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 141 transitions. [2020-07-18 00:16:48,300 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 141 transitions. Word has length 50 [2020-07-18 00:16:48,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:16:48,300 INFO L479 AbstractCegarLoop]: Abstraction has 110 states and 141 transitions. [2020-07-18 00:16:48,301 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:16:48,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 110 states and 141 transitions. [2020-07-18 00:16:48,430 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:16:48,431 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 141 transitions. [2020-07-18 00:16:48,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-18 00:16:48,432 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:16:48,432 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:16:48,433 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:16:48,433 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:16:48,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:16:48,433 INFO L82 PathProgramCache]: Analyzing trace with hash 472087846, now seen corresponding path program 1 times [2020-07-18 00:16:48,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:16:48,434 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [198612579] [2020-07-18 00:16:48,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:16:48,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:16:48,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:16:48,504 INFO L280 TraceCheckUtils]: 0: Hoare triple {1633#true} assume true; {1633#true} is VALID [2020-07-18 00:16:48,504 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1633#true} {1633#true} #175#return; {1633#true} is VALID [2020-07-18 00:16:48,504 INFO L263 TraceCheckUtils]: 0: Hoare triple {1633#true} call ULTIMATE.init(); {1633#true} is VALID [2020-07-18 00:16:48,505 INFO L280 TraceCheckUtils]: 1: Hoare triple {1633#true} assume true; {1633#true} is VALID [2020-07-18 00:16:48,505 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1633#true} {1633#true} #175#return; {1633#true} is VALID [2020-07-18 00:16:48,505 INFO L263 TraceCheckUtils]: 3: Hoare triple {1633#true} call #t~ret7 := main(); {1633#true} is VALID [2020-07-18 00:16:48,506 INFO L280 TraceCheckUtils]: 4: Hoare triple {1633#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1633#true} is VALID [2020-07-18 00:16:48,506 INFO L280 TraceCheckUtils]: 5: Hoare triple {1633#true} ~p1~0 := #t~nondet0; {1633#true} is VALID [2020-07-18 00:16:48,506 INFO L280 TraceCheckUtils]: 6: Hoare triple {1633#true} havoc #t~nondet0; {1633#true} is VALID [2020-07-18 00:16:48,506 INFO L280 TraceCheckUtils]: 7: Hoare triple {1633#true} havoc ~lk1~0; {1633#true} is VALID [2020-07-18 00:16:48,507 INFO L280 TraceCheckUtils]: 8: Hoare triple {1633#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1633#true} is VALID [2020-07-18 00:16:48,507 INFO L280 TraceCheckUtils]: 9: Hoare triple {1633#true} ~p2~0 := #t~nondet1; {1633#true} is VALID [2020-07-18 00:16:48,507 INFO L280 TraceCheckUtils]: 10: Hoare triple {1633#true} havoc #t~nondet1; {1633#true} is VALID [2020-07-18 00:16:48,508 INFO L280 TraceCheckUtils]: 11: Hoare triple {1633#true} havoc ~lk2~0; {1633#true} is VALID [2020-07-18 00:16:48,508 INFO L280 TraceCheckUtils]: 12: Hoare triple {1633#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1633#true} is VALID [2020-07-18 00:16:48,508 INFO L280 TraceCheckUtils]: 13: Hoare triple {1633#true} ~p3~0 := #t~nondet2; {1633#true} is VALID [2020-07-18 00:16:48,508 INFO L280 TraceCheckUtils]: 14: Hoare triple {1633#true} havoc #t~nondet2; {1633#true} is VALID [2020-07-18 00:16:48,509 INFO L280 TraceCheckUtils]: 15: Hoare triple {1633#true} havoc ~lk3~0; {1633#true} is VALID [2020-07-18 00:16:48,509 INFO L280 TraceCheckUtils]: 16: Hoare triple {1633#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1633#true} is VALID [2020-07-18 00:16:48,509 INFO L280 TraceCheckUtils]: 17: Hoare triple {1633#true} ~p4~0 := #t~nondet3; {1633#true} is VALID [2020-07-18 00:16:48,510 INFO L280 TraceCheckUtils]: 18: Hoare triple {1633#true} havoc #t~nondet3; {1633#true} is VALID [2020-07-18 00:16:48,510 INFO L280 TraceCheckUtils]: 19: Hoare triple {1633#true} havoc ~lk4~0; {1633#true} is VALID [2020-07-18 00:16:48,510 INFO L280 TraceCheckUtils]: 20: Hoare triple {1633#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1633#true} is VALID [2020-07-18 00:16:48,510 INFO L280 TraceCheckUtils]: 21: Hoare triple {1633#true} ~p5~0 := #t~nondet4; {1633#true} is VALID [2020-07-18 00:16:48,511 INFO L280 TraceCheckUtils]: 22: Hoare triple {1633#true} havoc #t~nondet4; {1633#true} is VALID [2020-07-18 00:16:48,511 INFO L280 TraceCheckUtils]: 23: Hoare triple {1633#true} havoc ~lk5~0; {1633#true} is VALID [2020-07-18 00:16:48,511 INFO L280 TraceCheckUtils]: 24: Hoare triple {1633#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1633#true} is VALID [2020-07-18 00:16:48,512 INFO L280 TraceCheckUtils]: 25: Hoare triple {1633#true} ~p6~0 := #t~nondet5; {1633#true} is VALID [2020-07-18 00:16:48,512 INFO L280 TraceCheckUtils]: 26: Hoare triple {1633#true} havoc #t~nondet5; {1633#true} is VALID [2020-07-18 00:16:48,512 INFO L280 TraceCheckUtils]: 27: Hoare triple {1633#true} havoc ~lk6~0; {1633#true} is VALID [2020-07-18 00:16:48,512 INFO L280 TraceCheckUtils]: 28: Hoare triple {1633#true} havoc ~cond~0; {1633#true} is VALID [2020-07-18 00:16:48,513 INFO L280 TraceCheckUtils]: 29: Hoare triple {1633#true} assume !false; {1633#true} is VALID [2020-07-18 00:16:48,513 INFO L280 TraceCheckUtils]: 30: Hoare triple {1633#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {1633#true} is VALID [2020-07-18 00:16:48,513 INFO L280 TraceCheckUtils]: 31: Hoare triple {1633#true} ~cond~0 := #t~nondet6; {1633#true} is VALID [2020-07-18 00:16:48,513 INFO L280 TraceCheckUtils]: 32: Hoare triple {1633#true} havoc #t~nondet6; {1633#true} is VALID [2020-07-18 00:16:48,514 INFO L280 TraceCheckUtils]: 33: Hoare triple {1633#true} assume !(0 == ~cond~0); {1633#true} is VALID [2020-07-18 00:16:48,514 INFO L280 TraceCheckUtils]: 34: Hoare triple {1633#true} ~lk1~0 := 0; {1633#true} is VALID [2020-07-18 00:16:48,514 INFO L280 TraceCheckUtils]: 35: Hoare triple {1633#true} ~lk2~0 := 0; {1633#true} is VALID [2020-07-18 00:16:48,514 INFO L280 TraceCheckUtils]: 36: Hoare triple {1633#true} ~lk3~0 := 0; {1633#true} is VALID [2020-07-18 00:16:48,515 INFO L280 TraceCheckUtils]: 37: Hoare triple {1633#true} ~lk4~0 := 0; {1633#true} is VALID [2020-07-18 00:16:48,515 INFO L280 TraceCheckUtils]: 38: Hoare triple {1633#true} ~lk5~0 := 0; {1633#true} is VALID [2020-07-18 00:16:48,515 INFO L280 TraceCheckUtils]: 39: Hoare triple {1633#true} ~lk6~0 := 0; {1633#true} is VALID [2020-07-18 00:16:48,516 INFO L280 TraceCheckUtils]: 40: Hoare triple {1633#true} assume !(0 != ~p1~0); {1633#true} is VALID [2020-07-18 00:16:48,516 INFO L280 TraceCheckUtils]: 41: Hoare triple {1633#true} assume !(0 != ~p2~0); {1637#(= 0 main_~p2~0)} is VALID [2020-07-18 00:16:48,517 INFO L280 TraceCheckUtils]: 42: Hoare triple {1637#(= 0 main_~p2~0)} assume !(0 != ~p3~0); {1637#(= 0 main_~p2~0)} is VALID [2020-07-18 00:16:48,517 INFO L280 TraceCheckUtils]: 43: Hoare triple {1637#(= 0 main_~p2~0)} assume !(0 != ~p4~0); {1637#(= 0 main_~p2~0)} is VALID [2020-07-18 00:16:48,518 INFO L280 TraceCheckUtils]: 44: Hoare triple {1637#(= 0 main_~p2~0)} assume !(0 != ~p5~0); {1637#(= 0 main_~p2~0)} is VALID [2020-07-18 00:16:48,519 INFO L280 TraceCheckUtils]: 45: Hoare triple {1637#(= 0 main_~p2~0)} assume !(0 != ~p6~0); {1637#(= 0 main_~p2~0)} is VALID [2020-07-18 00:16:48,519 INFO L280 TraceCheckUtils]: 46: Hoare triple {1637#(= 0 main_~p2~0)} assume !(0 != ~p1~0); {1637#(= 0 main_~p2~0)} is VALID [2020-07-18 00:16:48,520 INFO L280 TraceCheckUtils]: 47: Hoare triple {1637#(= 0 main_~p2~0)} assume 0 != ~p2~0; {1634#false} is VALID [2020-07-18 00:16:48,520 INFO L280 TraceCheckUtils]: 48: Hoare triple {1634#false} assume 1 != ~lk2~0; {1634#false} is VALID [2020-07-18 00:16:48,521 INFO L280 TraceCheckUtils]: 49: Hoare triple {1634#false} assume !false; {1634#false} is VALID [2020-07-18 00:16:48,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:16:48,524 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:16:48,524 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [198612579] [2020-07-18 00:16:48,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:16:48,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:16:48,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132371829] [2020-07-18 00:16:48,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-07-18 00:16:48,526 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:16:48,526 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:16:48,586 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:16:48,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:16:48,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:16:48,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:16:48,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:16:48,588 INFO L87 Difference]: Start difference. First operand 110 states and 141 transitions. Second operand 3 states. [2020-07-18 00:16:48,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:16:48,959 INFO L93 Difference]: Finished difference Result 266 states and 357 transitions. [2020-07-18 00:16:48,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:16:48,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-07-18 00:16:48,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:16:48,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:16:48,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 202 transitions. [2020-07-18 00:16:48,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:16:48,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 202 transitions. [2020-07-18 00:16:48,971 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 202 transitions. [2020-07-18 00:16:49,151 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:16:49,158 INFO L225 Difference]: With dead ends: 266 [2020-07-18 00:16:49,158 INFO L226 Difference]: Without dead ends: 185 [2020-07-18 00:16:49,160 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:16:49,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-07-18 00:16:49,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2020-07-18 00:16:49,384 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:16:49,384 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand 183 states. [2020-07-18 00:16:49,384 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand 183 states. [2020-07-18 00:16:49,384 INFO L87 Difference]: Start difference. First operand 185 states. Second operand 183 states. [2020-07-18 00:16:49,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:16:49,392 INFO L93 Difference]: Finished difference Result 185 states and 241 transitions. [2020-07-18 00:16:49,392 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 241 transitions. [2020-07-18 00:16:49,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:16:49,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:16:49,393 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand 185 states. [2020-07-18 00:16:49,393 INFO L87 Difference]: Start difference. First operand 183 states. Second operand 185 states. [2020-07-18 00:16:49,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:16:49,401 INFO L93 Difference]: Finished difference Result 185 states and 241 transitions. [2020-07-18 00:16:49,401 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 241 transitions. [2020-07-18 00:16:49,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:16:49,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:16:49,402 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:16:49,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:16:49,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-07-18 00:16:49,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 240 transitions. [2020-07-18 00:16:49,410 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 240 transitions. Word has length 50 [2020-07-18 00:16:49,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:16:49,411 INFO L479 AbstractCegarLoop]: Abstraction has 183 states and 240 transitions. [2020-07-18 00:16:49,411 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:16:49,411 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 183 states and 240 transitions. [2020-07-18 00:16:49,627 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 240 edges. 240 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:16:49,628 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 240 transitions. [2020-07-18 00:16:49,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-18 00:16:49,629 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:16:49,629 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:16:49,630 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:16:49,630 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:16:49,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:16:49,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1750067028, now seen corresponding path program 1 times [2020-07-18 00:16:49,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:16:49,631 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [556453503] [2020-07-18 00:16:49,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:16:49,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:16:49,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:16:49,704 INFO L280 TraceCheckUtils]: 0: Hoare triple {2908#true} assume true; {2908#true} is VALID [2020-07-18 00:16:49,704 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2908#true} {2908#true} #175#return; {2908#true} is VALID [2020-07-18 00:16:49,705 INFO L263 TraceCheckUtils]: 0: Hoare triple {2908#true} call ULTIMATE.init(); {2908#true} is VALID [2020-07-18 00:16:49,705 INFO L280 TraceCheckUtils]: 1: Hoare triple {2908#true} assume true; {2908#true} is VALID [2020-07-18 00:16:49,705 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2908#true} {2908#true} #175#return; {2908#true} is VALID [2020-07-18 00:16:49,706 INFO L263 TraceCheckUtils]: 3: Hoare triple {2908#true} call #t~ret7 := main(); {2908#true} is VALID [2020-07-18 00:16:49,706 INFO L280 TraceCheckUtils]: 4: Hoare triple {2908#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {2908#true} is VALID [2020-07-18 00:16:49,706 INFO L280 TraceCheckUtils]: 5: Hoare triple {2908#true} ~p1~0 := #t~nondet0; {2908#true} is VALID [2020-07-18 00:16:49,707 INFO L280 TraceCheckUtils]: 6: Hoare triple {2908#true} havoc #t~nondet0; {2908#true} is VALID [2020-07-18 00:16:49,708 INFO L280 TraceCheckUtils]: 7: Hoare triple {2908#true} havoc ~lk1~0; {2908#true} is VALID [2020-07-18 00:16:49,708 INFO L280 TraceCheckUtils]: 8: Hoare triple {2908#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2908#true} is VALID [2020-07-18 00:16:49,708 INFO L280 TraceCheckUtils]: 9: Hoare triple {2908#true} ~p2~0 := #t~nondet1; {2908#true} is VALID [2020-07-18 00:16:49,708 INFO L280 TraceCheckUtils]: 10: Hoare triple {2908#true} havoc #t~nondet1; {2908#true} is VALID [2020-07-18 00:16:49,709 INFO L280 TraceCheckUtils]: 11: Hoare triple {2908#true} havoc ~lk2~0; {2908#true} is VALID [2020-07-18 00:16:49,709 INFO L280 TraceCheckUtils]: 12: Hoare triple {2908#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2908#true} is VALID [2020-07-18 00:16:49,713 INFO L280 TraceCheckUtils]: 13: Hoare triple {2908#true} ~p3~0 := #t~nondet2; {2908#true} is VALID [2020-07-18 00:16:49,714 INFO L280 TraceCheckUtils]: 14: Hoare triple {2908#true} havoc #t~nondet2; {2908#true} is VALID [2020-07-18 00:16:49,714 INFO L280 TraceCheckUtils]: 15: Hoare triple {2908#true} havoc ~lk3~0; {2908#true} is VALID [2020-07-18 00:16:49,714 INFO L280 TraceCheckUtils]: 16: Hoare triple {2908#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2908#true} is VALID [2020-07-18 00:16:49,715 INFO L280 TraceCheckUtils]: 17: Hoare triple {2908#true} ~p4~0 := #t~nondet3; {2908#true} is VALID [2020-07-18 00:16:49,715 INFO L280 TraceCheckUtils]: 18: Hoare triple {2908#true} havoc #t~nondet3; {2908#true} is VALID [2020-07-18 00:16:49,715 INFO L280 TraceCheckUtils]: 19: Hoare triple {2908#true} havoc ~lk4~0; {2908#true} is VALID [2020-07-18 00:16:49,716 INFO L280 TraceCheckUtils]: 20: Hoare triple {2908#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {2908#true} is VALID [2020-07-18 00:16:49,717 INFO L280 TraceCheckUtils]: 21: Hoare triple {2908#true} ~p5~0 := #t~nondet4; {2908#true} is VALID [2020-07-18 00:16:49,717 INFO L280 TraceCheckUtils]: 22: Hoare triple {2908#true} havoc #t~nondet4; {2908#true} is VALID [2020-07-18 00:16:49,717 INFO L280 TraceCheckUtils]: 23: Hoare triple {2908#true} havoc ~lk5~0; {2908#true} is VALID [2020-07-18 00:16:49,718 INFO L280 TraceCheckUtils]: 24: Hoare triple {2908#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {2908#true} is VALID [2020-07-18 00:16:49,718 INFO L280 TraceCheckUtils]: 25: Hoare triple {2908#true} ~p6~0 := #t~nondet5; {2908#true} is VALID [2020-07-18 00:16:49,718 INFO L280 TraceCheckUtils]: 26: Hoare triple {2908#true} havoc #t~nondet5; {2908#true} is VALID [2020-07-18 00:16:49,718 INFO L280 TraceCheckUtils]: 27: Hoare triple {2908#true} havoc ~lk6~0; {2908#true} is VALID [2020-07-18 00:16:49,718 INFO L280 TraceCheckUtils]: 28: Hoare triple {2908#true} havoc ~cond~0; {2908#true} is VALID [2020-07-18 00:16:49,719 INFO L280 TraceCheckUtils]: 29: Hoare triple {2908#true} assume !false; {2908#true} is VALID [2020-07-18 00:16:49,719 INFO L280 TraceCheckUtils]: 30: Hoare triple {2908#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {2908#true} is VALID [2020-07-18 00:16:49,719 INFO L280 TraceCheckUtils]: 31: Hoare triple {2908#true} ~cond~0 := #t~nondet6; {2908#true} is VALID [2020-07-18 00:16:49,719 INFO L280 TraceCheckUtils]: 32: Hoare triple {2908#true} havoc #t~nondet6; {2908#true} is VALID [2020-07-18 00:16:49,720 INFO L280 TraceCheckUtils]: 33: Hoare triple {2908#true} assume !(0 == ~cond~0); {2908#true} is VALID [2020-07-18 00:16:49,720 INFO L280 TraceCheckUtils]: 34: Hoare triple {2908#true} ~lk1~0 := 0; {2908#true} is VALID [2020-07-18 00:16:49,720 INFO L280 TraceCheckUtils]: 35: Hoare triple {2908#true} ~lk2~0 := 0; {2908#true} is VALID [2020-07-18 00:16:49,720 INFO L280 TraceCheckUtils]: 36: Hoare triple {2908#true} ~lk3~0 := 0; {2908#true} is VALID [2020-07-18 00:16:49,721 INFO L280 TraceCheckUtils]: 37: Hoare triple {2908#true} ~lk4~0 := 0; {2908#true} is VALID [2020-07-18 00:16:49,721 INFO L280 TraceCheckUtils]: 38: Hoare triple {2908#true} ~lk5~0 := 0; {2908#true} is VALID [2020-07-18 00:16:49,721 INFO L280 TraceCheckUtils]: 39: Hoare triple {2908#true} ~lk6~0 := 0; {2908#true} is VALID [2020-07-18 00:16:49,721 INFO L280 TraceCheckUtils]: 40: Hoare triple {2908#true} assume !(0 != ~p1~0); {2908#true} is VALID [2020-07-18 00:16:49,722 INFO L280 TraceCheckUtils]: 41: Hoare triple {2908#true} assume !(0 != ~p2~0); {2908#true} is VALID [2020-07-18 00:16:49,730 INFO L280 TraceCheckUtils]: 42: Hoare triple {2908#true} assume !(0 != ~p3~0); {2912#(= 0 main_~p3~0)} is VALID [2020-07-18 00:16:49,731 INFO L280 TraceCheckUtils]: 43: Hoare triple {2912#(= 0 main_~p3~0)} assume !(0 != ~p4~0); {2912#(= 0 main_~p3~0)} is VALID [2020-07-18 00:16:49,731 INFO L280 TraceCheckUtils]: 44: Hoare triple {2912#(= 0 main_~p3~0)} assume !(0 != ~p5~0); {2912#(= 0 main_~p3~0)} is VALID [2020-07-18 00:16:49,732 INFO L280 TraceCheckUtils]: 45: Hoare triple {2912#(= 0 main_~p3~0)} assume !(0 != ~p6~0); {2912#(= 0 main_~p3~0)} is VALID [2020-07-18 00:16:49,732 INFO L280 TraceCheckUtils]: 46: Hoare triple {2912#(= 0 main_~p3~0)} assume !(0 != ~p1~0); {2912#(= 0 main_~p3~0)} is VALID [2020-07-18 00:16:49,739 INFO L280 TraceCheckUtils]: 47: Hoare triple {2912#(= 0 main_~p3~0)} assume !(0 != ~p2~0); {2912#(= 0 main_~p3~0)} is VALID [2020-07-18 00:16:49,739 INFO L280 TraceCheckUtils]: 48: Hoare triple {2912#(= 0 main_~p3~0)} assume 0 != ~p3~0; {2909#false} is VALID [2020-07-18 00:16:49,740 INFO L280 TraceCheckUtils]: 49: Hoare triple {2909#false} assume 1 != ~lk3~0; {2909#false} is VALID [2020-07-18 00:16:49,740 INFO L280 TraceCheckUtils]: 50: Hoare triple {2909#false} assume !false; {2909#false} is VALID [2020-07-18 00:16:49,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:16:49,742 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:16:49,743 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [556453503] [2020-07-18 00:16:49,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:16:49,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:16:49,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347405424] [2020-07-18 00:16:49,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-07-18 00:16:49,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:16:49,744 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:16:49,794 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:16:49,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:16:49,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:16:49,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:16:49,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:16:49,796 INFO L87 Difference]: Start difference. First operand 183 states and 240 transitions. Second operand 3 states. [2020-07-18 00:16:50,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:16:50,447 INFO L93 Difference]: Finished difference Result 479 states and 646 transitions. [2020-07-18 00:16:50,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:16:50,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-07-18 00:16:50,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:16:50,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:16:50,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 202 transitions. [2020-07-18 00:16:50,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:16:50,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 202 transitions. [2020-07-18 00:16:50,458 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 202 transitions. [2020-07-18 00:16:50,642 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:16:50,652 INFO L225 Difference]: With dead ends: 479 [2020-07-18 00:16:50,652 INFO L226 Difference]: Without dead ends: 325 [2020-07-18 00:16:50,659 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:16:50,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2020-07-18 00:16:51,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 323. [2020-07-18 00:16:51,030 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:16:51,030 INFO L82 GeneralOperation]: Start isEquivalent. First operand 325 states. Second operand 323 states. [2020-07-18 00:16:51,030 INFO L74 IsIncluded]: Start isIncluded. First operand 325 states. Second operand 323 states. [2020-07-18 00:16:51,030 INFO L87 Difference]: Start difference. First operand 325 states. Second operand 323 states. [2020-07-18 00:16:51,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:16:51,044 INFO L93 Difference]: Finished difference Result 325 states and 427 transitions. [2020-07-18 00:16:51,044 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 427 transitions. [2020-07-18 00:16:51,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:16:51,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:16:51,045 INFO L74 IsIncluded]: Start isIncluded. First operand 323 states. Second operand 325 states. [2020-07-18 00:16:51,045 INFO L87 Difference]: Start difference. First operand 323 states. Second operand 325 states. [2020-07-18 00:16:51,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:16:51,058 INFO L93 Difference]: Finished difference Result 325 states and 427 transitions. [2020-07-18 00:16:51,059 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 427 transitions. [2020-07-18 00:16:51,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:16:51,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:16:51,060 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:16:51,060 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:16:51,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-07-18 00:16:51,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 426 transitions. [2020-07-18 00:16:51,072 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 426 transitions. Word has length 51 [2020-07-18 00:16:51,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:16:51,073 INFO L479 AbstractCegarLoop]: Abstraction has 323 states and 426 transitions. [2020-07-18 00:16:51,073 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:16:51,073 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 323 states and 426 transitions. [2020-07-18 00:16:51,534 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 426 edges. 426 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:16:51,534 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 426 transitions. [2020-07-18 00:16:51,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-18 00:16:51,535 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:16:51,535 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:16:51,536 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 00:16:51,536 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:16:51,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:16:51,537 INFO L82 PathProgramCache]: Analyzing trace with hash -17356107, now seen corresponding path program 1 times [2020-07-18 00:16:51,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:16:51,537 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2002531269] [2020-07-18 00:16:51,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:16:51,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:16:51,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:16:51,579 INFO L280 TraceCheckUtils]: 0: Hoare triple {5169#true} assume true; {5169#true} is VALID [2020-07-18 00:16:51,579 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {5169#true} {5169#true} #175#return; {5169#true} is VALID [2020-07-18 00:16:51,580 INFO L263 TraceCheckUtils]: 0: Hoare triple {5169#true} call ULTIMATE.init(); {5169#true} is VALID [2020-07-18 00:16:51,580 INFO L280 TraceCheckUtils]: 1: Hoare triple {5169#true} assume true; {5169#true} is VALID [2020-07-18 00:16:51,580 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5169#true} {5169#true} #175#return; {5169#true} is VALID [2020-07-18 00:16:51,580 INFO L263 TraceCheckUtils]: 3: Hoare triple {5169#true} call #t~ret7 := main(); {5169#true} is VALID [2020-07-18 00:16:51,581 INFO L280 TraceCheckUtils]: 4: Hoare triple {5169#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {5169#true} is VALID [2020-07-18 00:16:51,581 INFO L280 TraceCheckUtils]: 5: Hoare triple {5169#true} ~p1~0 := #t~nondet0; {5169#true} is VALID [2020-07-18 00:16:51,581 INFO L280 TraceCheckUtils]: 6: Hoare triple {5169#true} havoc #t~nondet0; {5169#true} is VALID [2020-07-18 00:16:51,581 INFO L280 TraceCheckUtils]: 7: Hoare triple {5169#true} havoc ~lk1~0; {5169#true} is VALID [2020-07-18 00:16:51,582 INFO L280 TraceCheckUtils]: 8: Hoare triple {5169#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {5169#true} is VALID [2020-07-18 00:16:51,582 INFO L280 TraceCheckUtils]: 9: Hoare triple {5169#true} ~p2~0 := #t~nondet1; {5169#true} is VALID [2020-07-18 00:16:51,582 INFO L280 TraceCheckUtils]: 10: Hoare triple {5169#true} havoc #t~nondet1; {5169#true} is VALID [2020-07-18 00:16:51,582 INFO L280 TraceCheckUtils]: 11: Hoare triple {5169#true} havoc ~lk2~0; {5169#true} is VALID [2020-07-18 00:16:51,583 INFO L280 TraceCheckUtils]: 12: Hoare triple {5169#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {5169#true} is VALID [2020-07-18 00:16:51,583 INFO L280 TraceCheckUtils]: 13: Hoare triple {5169#true} ~p3~0 := #t~nondet2; {5169#true} is VALID [2020-07-18 00:16:51,583 INFO L280 TraceCheckUtils]: 14: Hoare triple {5169#true} havoc #t~nondet2; {5169#true} is VALID [2020-07-18 00:16:51,583 INFO L280 TraceCheckUtils]: 15: Hoare triple {5169#true} havoc ~lk3~0; {5169#true} is VALID [2020-07-18 00:16:51,584 INFO L280 TraceCheckUtils]: 16: Hoare triple {5169#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {5169#true} is VALID [2020-07-18 00:16:51,584 INFO L280 TraceCheckUtils]: 17: Hoare triple {5169#true} ~p4~0 := #t~nondet3; {5169#true} is VALID [2020-07-18 00:16:51,584 INFO L280 TraceCheckUtils]: 18: Hoare triple {5169#true} havoc #t~nondet3; {5169#true} is VALID [2020-07-18 00:16:51,584 INFO L280 TraceCheckUtils]: 19: Hoare triple {5169#true} havoc ~lk4~0; {5169#true} is VALID [2020-07-18 00:16:51,585 INFO L280 TraceCheckUtils]: 20: Hoare triple {5169#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {5169#true} is VALID [2020-07-18 00:16:51,585 INFO L280 TraceCheckUtils]: 21: Hoare triple {5169#true} ~p5~0 := #t~nondet4; {5169#true} is VALID [2020-07-18 00:16:51,585 INFO L280 TraceCheckUtils]: 22: Hoare triple {5169#true} havoc #t~nondet4; {5169#true} is VALID [2020-07-18 00:16:51,585 INFO L280 TraceCheckUtils]: 23: Hoare triple {5169#true} havoc ~lk5~0; {5169#true} is VALID [2020-07-18 00:16:51,585 INFO L280 TraceCheckUtils]: 24: Hoare triple {5169#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {5169#true} is VALID [2020-07-18 00:16:51,586 INFO L280 TraceCheckUtils]: 25: Hoare triple {5169#true} ~p6~0 := #t~nondet5; {5169#true} is VALID [2020-07-18 00:16:51,586 INFO L280 TraceCheckUtils]: 26: Hoare triple {5169#true} havoc #t~nondet5; {5169#true} is VALID [2020-07-18 00:16:51,586 INFO L280 TraceCheckUtils]: 27: Hoare triple {5169#true} havoc ~lk6~0; {5169#true} is VALID [2020-07-18 00:16:51,586 INFO L280 TraceCheckUtils]: 28: Hoare triple {5169#true} havoc ~cond~0; {5169#true} is VALID [2020-07-18 00:16:51,587 INFO L280 TraceCheckUtils]: 29: Hoare triple {5169#true} assume !false; {5169#true} is VALID [2020-07-18 00:16:51,587 INFO L280 TraceCheckUtils]: 30: Hoare triple {5169#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {5169#true} is VALID [2020-07-18 00:16:51,587 INFO L280 TraceCheckUtils]: 31: Hoare triple {5169#true} ~cond~0 := #t~nondet6; {5169#true} is VALID [2020-07-18 00:16:51,587 INFO L280 TraceCheckUtils]: 32: Hoare triple {5169#true} havoc #t~nondet6; {5169#true} is VALID [2020-07-18 00:16:51,588 INFO L280 TraceCheckUtils]: 33: Hoare triple {5169#true} assume !(0 == ~cond~0); {5169#true} is VALID [2020-07-18 00:16:51,588 INFO L280 TraceCheckUtils]: 34: Hoare triple {5169#true} ~lk1~0 := 0; {5169#true} is VALID [2020-07-18 00:16:51,588 INFO L280 TraceCheckUtils]: 35: Hoare triple {5169#true} ~lk2~0 := 0; {5169#true} is VALID [2020-07-18 00:16:51,588 INFO L280 TraceCheckUtils]: 36: Hoare triple {5169#true} ~lk3~0 := 0; {5169#true} is VALID [2020-07-18 00:16:51,588 INFO L280 TraceCheckUtils]: 37: Hoare triple {5169#true} ~lk4~0 := 0; {5169#true} is VALID [2020-07-18 00:16:51,589 INFO L280 TraceCheckUtils]: 38: Hoare triple {5169#true} ~lk5~0 := 0; {5169#true} is VALID [2020-07-18 00:16:51,589 INFO L280 TraceCheckUtils]: 39: Hoare triple {5169#true} ~lk6~0 := 0; {5169#true} is VALID [2020-07-18 00:16:51,589 INFO L280 TraceCheckUtils]: 40: Hoare triple {5169#true} assume !(0 != ~p1~0); {5169#true} is VALID [2020-07-18 00:16:51,589 INFO L280 TraceCheckUtils]: 41: Hoare triple {5169#true} assume 0 != ~p2~0; {5169#true} is VALID [2020-07-18 00:16:51,590 INFO L280 TraceCheckUtils]: 42: Hoare triple {5169#true} ~lk2~0 := 1; {5173#(= 1 main_~lk2~0)} is VALID [2020-07-18 00:16:51,591 INFO L280 TraceCheckUtils]: 43: Hoare triple {5173#(= 1 main_~lk2~0)} assume !(0 != ~p3~0); {5173#(= 1 main_~lk2~0)} is VALID [2020-07-18 00:16:51,591 INFO L280 TraceCheckUtils]: 44: Hoare triple {5173#(= 1 main_~lk2~0)} assume !(0 != ~p4~0); {5173#(= 1 main_~lk2~0)} is VALID [2020-07-18 00:16:51,592 INFO L280 TraceCheckUtils]: 45: Hoare triple {5173#(= 1 main_~lk2~0)} assume !(0 != ~p5~0); {5173#(= 1 main_~lk2~0)} is VALID [2020-07-18 00:16:51,592 INFO L280 TraceCheckUtils]: 46: Hoare triple {5173#(= 1 main_~lk2~0)} assume !(0 != ~p6~0); {5173#(= 1 main_~lk2~0)} is VALID [2020-07-18 00:16:51,593 INFO L280 TraceCheckUtils]: 47: Hoare triple {5173#(= 1 main_~lk2~0)} assume !(0 != ~p1~0); {5173#(= 1 main_~lk2~0)} is VALID [2020-07-18 00:16:51,594 INFO L280 TraceCheckUtils]: 48: Hoare triple {5173#(= 1 main_~lk2~0)} assume 0 != ~p2~0; {5173#(= 1 main_~lk2~0)} is VALID [2020-07-18 00:16:51,594 INFO L280 TraceCheckUtils]: 49: Hoare triple {5173#(= 1 main_~lk2~0)} assume 1 != ~lk2~0; {5170#false} is VALID [2020-07-18 00:16:51,594 INFO L280 TraceCheckUtils]: 50: Hoare triple {5170#false} assume !false; {5170#false} is VALID [2020-07-18 00:16:51,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:16:51,597 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:16:51,597 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2002531269] [2020-07-18 00:16:51,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:16:51,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:16:51,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436701164] [2020-07-18 00:16:51,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-07-18 00:16:51,598 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:16:51,598 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:16:51,639 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:16:51,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:16:51,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:16:51,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:16:51,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:16:51,640 INFO L87 Difference]: Start difference. First operand 323 states and 426 transitions. Second operand 3 states. [2020-07-18 00:16:52,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:16:52,297 INFO L93 Difference]: Finished difference Result 399 states and 528 transitions. [2020-07-18 00:16:52,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:16:52,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-07-18 00:16:52,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:16:52,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:16:52,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2020-07-18 00:16:52,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:16:52,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2020-07-18 00:16:52,303 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 134 transitions. [2020-07-18 00:16:52,454 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:16:52,465 INFO L225 Difference]: With dead ends: 399 [2020-07-18 00:16:52,466 INFO L226 Difference]: Without dead ends: 397 [2020-07-18 00:16:52,466 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:16:52,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2020-07-18 00:16:52,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 323. [2020-07-18 00:16:52,885 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:16:52,885 INFO L82 GeneralOperation]: Start isEquivalent. First operand 397 states. Second operand 323 states. [2020-07-18 00:16:52,885 INFO L74 IsIncluded]: Start isIncluded. First operand 397 states. Second operand 323 states. [2020-07-18 00:16:52,885 INFO L87 Difference]: Start difference. First operand 397 states. Second operand 323 states. [2020-07-18 00:16:52,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:16:52,902 INFO L93 Difference]: Finished difference Result 397 states and 523 transitions. [2020-07-18 00:16:52,902 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 523 transitions. [2020-07-18 00:16:52,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:16:52,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:16:52,904 INFO L74 IsIncluded]: Start isIncluded. First operand 323 states. Second operand 397 states. [2020-07-18 00:16:52,904 INFO L87 Difference]: Start difference. First operand 323 states. Second operand 397 states. [2020-07-18 00:16:52,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:16:52,920 INFO L93 Difference]: Finished difference Result 397 states and 523 transitions. [2020-07-18 00:16:52,921 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 523 transitions. [2020-07-18 00:16:52,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:16:52,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:16:52,922 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:16:52,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:16:52,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-07-18 00:16:52,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 422 transitions. [2020-07-18 00:16:52,934 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 422 transitions. Word has length 51 [2020-07-18 00:16:52,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:16:52,934 INFO L479 AbstractCegarLoop]: Abstraction has 323 states and 422 transitions. [2020-07-18 00:16:52,935 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:16:52,935 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 323 states and 422 transitions. [2020-07-18 00:16:53,405 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 422 edges. 422 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:16:53,406 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 422 transitions. [2020-07-18 00:16:53,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-18 00:16:53,407 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:16:53,407 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:16:53,408 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-18 00:16:53,408 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:16:53,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:16:53,408 INFO L82 PathProgramCache]: Analyzing trace with hash 802147488, now seen corresponding path program 1 times [2020-07-18 00:16:53,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:16:53,408 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [4427119] [2020-07-18 00:16:53,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:16:53,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:16:53,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:16:53,460 INFO L280 TraceCheckUtils]: 0: Hoare triple {7414#true} assume true; {7414#true} is VALID [2020-07-18 00:16:53,461 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {7414#true} {7414#true} #175#return; {7414#true} is VALID [2020-07-18 00:16:53,461 INFO L263 TraceCheckUtils]: 0: Hoare triple {7414#true} call ULTIMATE.init(); {7414#true} is VALID [2020-07-18 00:16:53,461 INFO L280 TraceCheckUtils]: 1: Hoare triple {7414#true} assume true; {7414#true} is VALID [2020-07-18 00:16:53,461 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {7414#true} {7414#true} #175#return; {7414#true} is VALID [2020-07-18 00:16:53,462 INFO L263 TraceCheckUtils]: 3: Hoare triple {7414#true} call #t~ret7 := main(); {7414#true} is VALID [2020-07-18 00:16:53,462 INFO L280 TraceCheckUtils]: 4: Hoare triple {7414#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {7414#true} is VALID [2020-07-18 00:16:53,462 INFO L280 TraceCheckUtils]: 5: Hoare triple {7414#true} ~p1~0 := #t~nondet0; {7414#true} is VALID [2020-07-18 00:16:53,462 INFO L280 TraceCheckUtils]: 6: Hoare triple {7414#true} havoc #t~nondet0; {7414#true} is VALID [2020-07-18 00:16:53,463 INFO L280 TraceCheckUtils]: 7: Hoare triple {7414#true} havoc ~lk1~0; {7414#true} is VALID [2020-07-18 00:16:53,463 INFO L280 TraceCheckUtils]: 8: Hoare triple {7414#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {7414#true} is VALID [2020-07-18 00:16:53,463 INFO L280 TraceCheckUtils]: 9: Hoare triple {7414#true} ~p2~0 := #t~nondet1; {7414#true} is VALID [2020-07-18 00:16:53,464 INFO L280 TraceCheckUtils]: 10: Hoare triple {7414#true} havoc #t~nondet1; {7414#true} is VALID [2020-07-18 00:16:53,464 INFO L280 TraceCheckUtils]: 11: Hoare triple {7414#true} havoc ~lk2~0; {7414#true} is VALID [2020-07-18 00:16:53,464 INFO L280 TraceCheckUtils]: 12: Hoare triple {7414#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {7414#true} is VALID [2020-07-18 00:16:53,465 INFO L280 TraceCheckUtils]: 13: Hoare triple {7414#true} ~p3~0 := #t~nondet2; {7414#true} is VALID [2020-07-18 00:16:53,465 INFO L280 TraceCheckUtils]: 14: Hoare triple {7414#true} havoc #t~nondet2; {7414#true} is VALID [2020-07-18 00:16:53,465 INFO L280 TraceCheckUtils]: 15: Hoare triple {7414#true} havoc ~lk3~0; {7414#true} is VALID [2020-07-18 00:16:53,465 INFO L280 TraceCheckUtils]: 16: Hoare triple {7414#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {7414#true} is VALID [2020-07-18 00:16:53,466 INFO L280 TraceCheckUtils]: 17: Hoare triple {7414#true} ~p4~0 := #t~nondet3; {7414#true} is VALID [2020-07-18 00:16:53,466 INFO L280 TraceCheckUtils]: 18: Hoare triple {7414#true} havoc #t~nondet3; {7414#true} is VALID [2020-07-18 00:16:53,466 INFO L280 TraceCheckUtils]: 19: Hoare triple {7414#true} havoc ~lk4~0; {7414#true} is VALID [2020-07-18 00:16:53,466 INFO L280 TraceCheckUtils]: 20: Hoare triple {7414#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {7414#true} is VALID [2020-07-18 00:16:53,467 INFO L280 TraceCheckUtils]: 21: Hoare triple {7414#true} ~p5~0 := #t~nondet4; {7414#true} is VALID [2020-07-18 00:16:53,467 INFO L280 TraceCheckUtils]: 22: Hoare triple {7414#true} havoc #t~nondet4; {7414#true} is VALID [2020-07-18 00:16:53,467 INFO L280 TraceCheckUtils]: 23: Hoare triple {7414#true} havoc ~lk5~0; {7414#true} is VALID [2020-07-18 00:16:53,467 INFO L280 TraceCheckUtils]: 24: Hoare triple {7414#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {7414#true} is VALID [2020-07-18 00:16:53,468 INFO L280 TraceCheckUtils]: 25: Hoare triple {7414#true} ~p6~0 := #t~nondet5; {7414#true} is VALID [2020-07-18 00:16:53,468 INFO L280 TraceCheckUtils]: 26: Hoare triple {7414#true} havoc #t~nondet5; {7414#true} is VALID [2020-07-18 00:16:53,468 INFO L280 TraceCheckUtils]: 27: Hoare triple {7414#true} havoc ~lk6~0; {7414#true} is VALID [2020-07-18 00:16:53,468 INFO L280 TraceCheckUtils]: 28: Hoare triple {7414#true} havoc ~cond~0; {7414#true} is VALID [2020-07-18 00:16:53,468 INFO L280 TraceCheckUtils]: 29: Hoare triple {7414#true} assume !false; {7414#true} is VALID [2020-07-18 00:16:53,469 INFO L280 TraceCheckUtils]: 30: Hoare triple {7414#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {7414#true} is VALID [2020-07-18 00:16:53,469 INFO L280 TraceCheckUtils]: 31: Hoare triple {7414#true} ~cond~0 := #t~nondet6; {7414#true} is VALID [2020-07-18 00:16:53,469 INFO L280 TraceCheckUtils]: 32: Hoare triple {7414#true} havoc #t~nondet6; {7414#true} is VALID [2020-07-18 00:16:53,469 INFO L280 TraceCheckUtils]: 33: Hoare triple {7414#true} assume !(0 == ~cond~0); {7414#true} is VALID [2020-07-18 00:16:53,470 INFO L280 TraceCheckUtils]: 34: Hoare triple {7414#true} ~lk1~0 := 0; {7414#true} is VALID [2020-07-18 00:16:53,470 INFO L280 TraceCheckUtils]: 35: Hoare triple {7414#true} ~lk2~0 := 0; {7414#true} is VALID [2020-07-18 00:16:53,470 INFO L280 TraceCheckUtils]: 36: Hoare triple {7414#true} ~lk3~0 := 0; {7414#true} is VALID [2020-07-18 00:16:53,470 INFO L280 TraceCheckUtils]: 37: Hoare triple {7414#true} ~lk4~0 := 0; {7414#true} is VALID [2020-07-18 00:16:53,470 INFO L280 TraceCheckUtils]: 38: Hoare triple {7414#true} ~lk5~0 := 0; {7414#true} is VALID [2020-07-18 00:16:53,471 INFO L280 TraceCheckUtils]: 39: Hoare triple {7414#true} ~lk6~0 := 0; {7414#true} is VALID [2020-07-18 00:16:53,471 INFO L280 TraceCheckUtils]: 40: Hoare triple {7414#true} assume !(0 != ~p1~0); {7414#true} is VALID [2020-07-18 00:16:53,471 INFO L280 TraceCheckUtils]: 41: Hoare triple {7414#true} assume !(0 != ~p2~0); {7414#true} is VALID [2020-07-18 00:16:53,471 INFO L280 TraceCheckUtils]: 42: Hoare triple {7414#true} assume 0 != ~p3~0; {7414#true} is VALID [2020-07-18 00:16:53,472 INFO L280 TraceCheckUtils]: 43: Hoare triple {7414#true} ~lk3~0 := 1; {7418#(= 1 main_~lk3~0)} is VALID [2020-07-18 00:16:53,478 INFO L280 TraceCheckUtils]: 44: Hoare triple {7418#(= 1 main_~lk3~0)} assume !(0 != ~p4~0); {7418#(= 1 main_~lk3~0)} is VALID [2020-07-18 00:16:53,478 INFO L280 TraceCheckUtils]: 45: Hoare triple {7418#(= 1 main_~lk3~0)} assume !(0 != ~p5~0); {7418#(= 1 main_~lk3~0)} is VALID [2020-07-18 00:16:53,479 INFO L280 TraceCheckUtils]: 46: Hoare triple {7418#(= 1 main_~lk3~0)} assume !(0 != ~p6~0); {7418#(= 1 main_~lk3~0)} is VALID [2020-07-18 00:16:53,479 INFO L280 TraceCheckUtils]: 47: Hoare triple {7418#(= 1 main_~lk3~0)} assume !(0 != ~p1~0); {7418#(= 1 main_~lk3~0)} is VALID [2020-07-18 00:16:53,480 INFO L280 TraceCheckUtils]: 48: Hoare triple {7418#(= 1 main_~lk3~0)} assume !(0 != ~p2~0); {7418#(= 1 main_~lk3~0)} is VALID [2020-07-18 00:16:53,480 INFO L280 TraceCheckUtils]: 49: Hoare triple {7418#(= 1 main_~lk3~0)} assume 0 != ~p3~0; {7418#(= 1 main_~lk3~0)} is VALID [2020-07-18 00:16:53,481 INFO L280 TraceCheckUtils]: 50: Hoare triple {7418#(= 1 main_~lk3~0)} assume 1 != ~lk3~0; {7415#false} is VALID [2020-07-18 00:16:53,481 INFO L280 TraceCheckUtils]: 51: Hoare triple {7415#false} assume !false; {7415#false} is VALID [2020-07-18 00:16:53,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:16:53,484 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:16:53,485 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [4427119] [2020-07-18 00:16:53,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:16:53,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:16:53,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582661867] [2020-07-18 00:16:53,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-07-18 00:16:53,489 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:16:53,489 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:16:53,532 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:16:53,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:16:53,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:16:53,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:16:53,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:16:53,533 INFO L87 Difference]: Start difference. First operand 323 states and 422 transitions. Second operand 3 states. [2020-07-18 00:16:54,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:16:54,324 INFO L93 Difference]: Finished difference Result 395 states and 516 transitions. [2020-07-18 00:16:54,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:16:54,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-07-18 00:16:54,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:16:54,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:16:54,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2020-07-18 00:16:54,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:16:54,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2020-07-18 00:16:54,329 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 130 transitions. [2020-07-18 00:16:54,452 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:16:54,465 INFO L225 Difference]: With dead ends: 395 [2020-07-18 00:16:54,465 INFO L226 Difference]: Without dead ends: 393 [2020-07-18 00:16:54,466 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:16:54,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2020-07-18 00:16:54,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 323. [2020-07-18 00:16:54,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:16:54,953 INFO L82 GeneralOperation]: Start isEquivalent. First operand 393 states. Second operand 323 states. [2020-07-18 00:16:54,953 INFO L74 IsIncluded]: Start isIncluded. First operand 393 states. Second operand 323 states. [2020-07-18 00:16:54,953 INFO L87 Difference]: Start difference. First operand 393 states. Second operand 323 states. [2020-07-18 00:16:54,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:16:54,966 INFO L93 Difference]: Finished difference Result 393 states and 511 transitions. [2020-07-18 00:16:54,966 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 511 transitions. [2020-07-18 00:16:54,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:16:54,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:16:54,967 INFO L74 IsIncluded]: Start isIncluded. First operand 323 states. Second operand 393 states. [2020-07-18 00:16:54,968 INFO L87 Difference]: Start difference. First operand 323 states. Second operand 393 states. [2020-07-18 00:16:54,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:16:54,981 INFO L93 Difference]: Finished difference Result 393 states and 511 transitions. [2020-07-18 00:16:54,981 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 511 transitions. [2020-07-18 00:16:54,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:16:54,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:16:54,982 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:16:54,982 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:16:54,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-07-18 00:16:54,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 418 transitions. [2020-07-18 00:16:54,992 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 418 transitions. Word has length 52 [2020-07-18 00:16:54,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:16:54,992 INFO L479 AbstractCegarLoop]: Abstraction has 323 states and 418 transitions. [2020-07-18 00:16:54,992 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:16:54,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 323 states and 418 transitions. [2020-07-18 00:16:55,471 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 418 edges. 418 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:16:55,472 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 418 transitions. [2020-07-18 00:16:55,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-18 00:16:55,473 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:16:55,473 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:16:55,474 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-18 00:16:55,474 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:16:55,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:16:55,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1582250918, now seen corresponding path program 1 times [2020-07-18 00:16:55,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:16:55,475 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1178791762] [2020-07-18 00:16:55,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:16:55,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:16:55,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:16:55,518 INFO L280 TraceCheckUtils]: 0: Hoare triple {9643#true} assume true; {9643#true} is VALID [2020-07-18 00:16:55,518 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {9643#true} {9643#true} #175#return; {9643#true} is VALID [2020-07-18 00:16:55,518 INFO L263 TraceCheckUtils]: 0: Hoare triple {9643#true} call ULTIMATE.init(); {9643#true} is VALID [2020-07-18 00:16:55,519 INFO L280 TraceCheckUtils]: 1: Hoare triple {9643#true} assume true; {9643#true} is VALID [2020-07-18 00:16:55,519 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {9643#true} {9643#true} #175#return; {9643#true} is VALID [2020-07-18 00:16:55,519 INFO L263 TraceCheckUtils]: 3: Hoare triple {9643#true} call #t~ret7 := main(); {9643#true} is VALID [2020-07-18 00:16:55,519 INFO L280 TraceCheckUtils]: 4: Hoare triple {9643#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {9643#true} is VALID [2020-07-18 00:16:55,519 INFO L280 TraceCheckUtils]: 5: Hoare triple {9643#true} ~p1~0 := #t~nondet0; {9643#true} is VALID [2020-07-18 00:16:55,520 INFO L280 TraceCheckUtils]: 6: Hoare triple {9643#true} havoc #t~nondet0; {9643#true} is VALID [2020-07-18 00:16:55,520 INFO L280 TraceCheckUtils]: 7: Hoare triple {9643#true} havoc ~lk1~0; {9643#true} is VALID [2020-07-18 00:16:55,520 INFO L280 TraceCheckUtils]: 8: Hoare triple {9643#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {9643#true} is VALID [2020-07-18 00:16:55,520 INFO L280 TraceCheckUtils]: 9: Hoare triple {9643#true} ~p2~0 := #t~nondet1; {9643#true} is VALID [2020-07-18 00:16:55,520 INFO L280 TraceCheckUtils]: 10: Hoare triple {9643#true} havoc #t~nondet1; {9643#true} is VALID [2020-07-18 00:16:55,521 INFO L280 TraceCheckUtils]: 11: Hoare triple {9643#true} havoc ~lk2~0; {9643#true} is VALID [2020-07-18 00:16:55,521 INFO L280 TraceCheckUtils]: 12: Hoare triple {9643#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {9643#true} is VALID [2020-07-18 00:16:55,521 INFO L280 TraceCheckUtils]: 13: Hoare triple {9643#true} ~p3~0 := #t~nondet2; {9643#true} is VALID [2020-07-18 00:16:55,521 INFO L280 TraceCheckUtils]: 14: Hoare triple {9643#true} havoc #t~nondet2; {9643#true} is VALID [2020-07-18 00:16:55,521 INFO L280 TraceCheckUtils]: 15: Hoare triple {9643#true} havoc ~lk3~0; {9643#true} is VALID [2020-07-18 00:16:55,522 INFO L280 TraceCheckUtils]: 16: Hoare triple {9643#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {9643#true} is VALID [2020-07-18 00:16:55,522 INFO L280 TraceCheckUtils]: 17: Hoare triple {9643#true} ~p4~0 := #t~nondet3; {9643#true} is VALID [2020-07-18 00:16:55,522 INFO L280 TraceCheckUtils]: 18: Hoare triple {9643#true} havoc #t~nondet3; {9643#true} is VALID [2020-07-18 00:16:55,522 INFO L280 TraceCheckUtils]: 19: Hoare triple {9643#true} havoc ~lk4~0; {9643#true} is VALID [2020-07-18 00:16:55,523 INFO L280 TraceCheckUtils]: 20: Hoare triple {9643#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {9643#true} is VALID [2020-07-18 00:16:55,523 INFO L280 TraceCheckUtils]: 21: Hoare triple {9643#true} ~p5~0 := #t~nondet4; {9643#true} is VALID [2020-07-18 00:16:55,523 INFO L280 TraceCheckUtils]: 22: Hoare triple {9643#true} havoc #t~nondet4; {9643#true} is VALID [2020-07-18 00:16:55,523 INFO L280 TraceCheckUtils]: 23: Hoare triple {9643#true} havoc ~lk5~0; {9643#true} is VALID [2020-07-18 00:16:55,523 INFO L280 TraceCheckUtils]: 24: Hoare triple {9643#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {9643#true} is VALID [2020-07-18 00:16:55,524 INFO L280 TraceCheckUtils]: 25: Hoare triple {9643#true} ~p6~0 := #t~nondet5; {9643#true} is VALID [2020-07-18 00:16:55,524 INFO L280 TraceCheckUtils]: 26: Hoare triple {9643#true} havoc #t~nondet5; {9643#true} is VALID [2020-07-18 00:16:55,524 INFO L280 TraceCheckUtils]: 27: Hoare triple {9643#true} havoc ~lk6~0; {9643#true} is VALID [2020-07-18 00:16:55,524 INFO L280 TraceCheckUtils]: 28: Hoare triple {9643#true} havoc ~cond~0; {9643#true} is VALID [2020-07-18 00:16:55,524 INFO L280 TraceCheckUtils]: 29: Hoare triple {9643#true} assume !false; {9643#true} is VALID [2020-07-18 00:16:55,525 INFO L280 TraceCheckUtils]: 30: Hoare triple {9643#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {9643#true} is VALID [2020-07-18 00:16:55,525 INFO L280 TraceCheckUtils]: 31: Hoare triple {9643#true} ~cond~0 := #t~nondet6; {9643#true} is VALID [2020-07-18 00:16:55,525 INFO L280 TraceCheckUtils]: 32: Hoare triple {9643#true} havoc #t~nondet6; {9643#true} is VALID [2020-07-18 00:16:55,525 INFO L280 TraceCheckUtils]: 33: Hoare triple {9643#true} assume !(0 == ~cond~0); {9643#true} is VALID [2020-07-18 00:16:55,526 INFO L280 TraceCheckUtils]: 34: Hoare triple {9643#true} ~lk1~0 := 0; {9643#true} is VALID [2020-07-18 00:16:55,526 INFO L280 TraceCheckUtils]: 35: Hoare triple {9643#true} ~lk2~0 := 0; {9643#true} is VALID [2020-07-18 00:16:55,526 INFO L280 TraceCheckUtils]: 36: Hoare triple {9643#true} ~lk3~0 := 0; {9643#true} is VALID [2020-07-18 00:16:55,526 INFO L280 TraceCheckUtils]: 37: Hoare triple {9643#true} ~lk4~0 := 0; {9643#true} is VALID [2020-07-18 00:16:55,526 INFO L280 TraceCheckUtils]: 38: Hoare triple {9643#true} ~lk5~0 := 0; {9643#true} is VALID [2020-07-18 00:16:55,526 INFO L280 TraceCheckUtils]: 39: Hoare triple {9643#true} ~lk6~0 := 0; {9643#true} is VALID [2020-07-18 00:16:55,527 INFO L280 TraceCheckUtils]: 40: Hoare triple {9643#true} assume !(0 != ~p1~0); {9643#true} is VALID [2020-07-18 00:16:55,527 INFO L280 TraceCheckUtils]: 41: Hoare triple {9643#true} assume !(0 != ~p2~0); {9643#true} is VALID [2020-07-18 00:16:55,527 INFO L280 TraceCheckUtils]: 42: Hoare triple {9643#true} assume !(0 != ~p3~0); {9643#true} is VALID [2020-07-18 00:16:55,527 INFO L280 TraceCheckUtils]: 43: Hoare triple {9643#true} assume !(0 != ~p4~0); {9647#(= 0 main_~p4~0)} is VALID [2020-07-18 00:16:55,528 INFO L280 TraceCheckUtils]: 44: Hoare triple {9647#(= 0 main_~p4~0)} assume !(0 != ~p5~0); {9647#(= 0 main_~p4~0)} is VALID [2020-07-18 00:16:55,528 INFO L280 TraceCheckUtils]: 45: Hoare triple {9647#(= 0 main_~p4~0)} assume !(0 != ~p6~0); {9647#(= 0 main_~p4~0)} is VALID [2020-07-18 00:16:55,529 INFO L280 TraceCheckUtils]: 46: Hoare triple {9647#(= 0 main_~p4~0)} assume !(0 != ~p1~0); {9647#(= 0 main_~p4~0)} is VALID [2020-07-18 00:16:55,529 INFO L280 TraceCheckUtils]: 47: Hoare triple {9647#(= 0 main_~p4~0)} assume !(0 != ~p2~0); {9647#(= 0 main_~p4~0)} is VALID [2020-07-18 00:16:55,529 INFO L280 TraceCheckUtils]: 48: Hoare triple {9647#(= 0 main_~p4~0)} assume !(0 != ~p3~0); {9647#(= 0 main_~p4~0)} is VALID [2020-07-18 00:16:55,530 INFO L280 TraceCheckUtils]: 49: Hoare triple {9647#(= 0 main_~p4~0)} assume 0 != ~p4~0; {9644#false} is VALID [2020-07-18 00:16:55,530 INFO L280 TraceCheckUtils]: 50: Hoare triple {9644#false} assume 1 != ~lk4~0; {9644#false} is VALID [2020-07-18 00:16:55,530 INFO L280 TraceCheckUtils]: 51: Hoare triple {9644#false} assume !false; {9644#false} is VALID [2020-07-18 00:16:55,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:16:55,532 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:16:55,533 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1178791762] [2020-07-18 00:16:55,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:16:55,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:16:55,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182891064] [2020-07-18 00:16:55,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-07-18 00:16:55,534 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:16:55,534 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:16:55,580 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:16:55,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:16:55,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:16:55,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:16:55,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:16:55,582 INFO L87 Difference]: Start difference. First operand 323 states and 418 transitions. Second operand 3 states. [2020-07-18 00:16:56,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:16:56,857 INFO L93 Difference]: Finished difference Result 887 states and 1164 transitions. [2020-07-18 00:16:56,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:16:56,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-07-18 00:16:56,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:16:56,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:16:56,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 196 transitions. [2020-07-18 00:16:56,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:16:56,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 196 transitions. [2020-07-18 00:16:56,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 196 transitions. [2020-07-18 00:16:57,027 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 196 edges. 196 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:16:57,065 INFO L225 Difference]: With dead ends: 887 [2020-07-18 00:16:57,066 INFO L226 Difference]: Without dead ends: 593 [2020-07-18 00:16:57,069 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:16:57,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-07-18 00:16:57,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 591. [2020-07-18 00:16:57,998 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:16:57,998 INFO L82 GeneralOperation]: Start isEquivalent. First operand 593 states. Second operand 591 states. [2020-07-18 00:16:57,999 INFO L74 IsIncluded]: Start isIncluded. First operand 593 states. Second operand 591 states. [2020-07-18 00:16:57,999 INFO L87 Difference]: Start difference. First operand 593 states. Second operand 591 states. [2020-07-18 00:16:58,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:16:58,022 INFO L93 Difference]: Finished difference Result 593 states and 759 transitions. [2020-07-18 00:16:58,022 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 759 transitions. [2020-07-18 00:16:58,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:16:58,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:16:58,024 INFO L74 IsIncluded]: Start isIncluded. First operand 591 states. Second operand 593 states. [2020-07-18 00:16:58,024 INFO L87 Difference]: Start difference. First operand 591 states. Second operand 593 states. [2020-07-18 00:16:58,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:16:58,048 INFO L93 Difference]: Finished difference Result 593 states and 759 transitions. [2020-07-18 00:16:58,048 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 759 transitions. [2020-07-18 00:16:58,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:16:58,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:16:58,049 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:16:58,050 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:16:58,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-07-18 00:16:58,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 758 transitions. [2020-07-18 00:16:58,073 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 758 transitions. Word has length 52 [2020-07-18 00:16:58,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:16:58,074 INFO L479 AbstractCegarLoop]: Abstraction has 591 states and 758 transitions. [2020-07-18 00:16:58,074 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:16:58,074 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 591 states and 758 transitions. [2020-07-18 00:16:58,945 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 758 edges. 758 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:16:58,946 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 758 transitions. [2020-07-18 00:16:58,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-07-18 00:16:58,947 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:16:58,948 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:16:58,948 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-18 00:16:58,948 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:16:58,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:16:58,949 INFO L82 PathProgramCache]: Analyzing trace with hash 436955529, now seen corresponding path program 1 times [2020-07-18 00:16:58,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:16:58,950 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1991929812] [2020-07-18 00:16:58,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:16:58,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:16:58,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:16:58,987 INFO L280 TraceCheckUtils]: 0: Hoare triple {13792#true} assume true; {13792#true} is VALID [2020-07-18 00:16:58,987 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {13792#true} {13792#true} #175#return; {13792#true} is VALID [2020-07-18 00:16:58,988 INFO L263 TraceCheckUtils]: 0: Hoare triple {13792#true} call ULTIMATE.init(); {13792#true} is VALID [2020-07-18 00:16:58,988 INFO L280 TraceCheckUtils]: 1: Hoare triple {13792#true} assume true; {13792#true} is VALID [2020-07-18 00:16:58,988 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {13792#true} {13792#true} #175#return; {13792#true} is VALID [2020-07-18 00:16:58,988 INFO L263 TraceCheckUtils]: 3: Hoare triple {13792#true} call #t~ret7 := main(); {13792#true} is VALID [2020-07-18 00:16:58,988 INFO L280 TraceCheckUtils]: 4: Hoare triple {13792#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {13792#true} is VALID [2020-07-18 00:16:58,988 INFO L280 TraceCheckUtils]: 5: Hoare triple {13792#true} ~p1~0 := #t~nondet0; {13792#true} is VALID [2020-07-18 00:16:58,988 INFO L280 TraceCheckUtils]: 6: Hoare triple {13792#true} havoc #t~nondet0; {13792#true} is VALID [2020-07-18 00:16:58,989 INFO L280 TraceCheckUtils]: 7: Hoare triple {13792#true} havoc ~lk1~0; {13792#true} is VALID [2020-07-18 00:16:58,989 INFO L280 TraceCheckUtils]: 8: Hoare triple {13792#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {13792#true} is VALID [2020-07-18 00:16:58,989 INFO L280 TraceCheckUtils]: 9: Hoare triple {13792#true} ~p2~0 := #t~nondet1; {13792#true} is VALID [2020-07-18 00:16:58,989 INFO L280 TraceCheckUtils]: 10: Hoare triple {13792#true} havoc #t~nondet1; {13792#true} is VALID [2020-07-18 00:16:58,989 INFO L280 TraceCheckUtils]: 11: Hoare triple {13792#true} havoc ~lk2~0; {13792#true} is VALID [2020-07-18 00:16:58,990 INFO L280 TraceCheckUtils]: 12: Hoare triple {13792#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {13792#true} is VALID [2020-07-18 00:16:58,990 INFO L280 TraceCheckUtils]: 13: Hoare triple {13792#true} ~p3~0 := #t~nondet2; {13792#true} is VALID [2020-07-18 00:16:58,990 INFO L280 TraceCheckUtils]: 14: Hoare triple {13792#true} havoc #t~nondet2; {13792#true} is VALID [2020-07-18 00:16:58,990 INFO L280 TraceCheckUtils]: 15: Hoare triple {13792#true} havoc ~lk3~0; {13792#true} is VALID [2020-07-18 00:16:58,990 INFO L280 TraceCheckUtils]: 16: Hoare triple {13792#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {13792#true} is VALID [2020-07-18 00:16:58,991 INFO L280 TraceCheckUtils]: 17: Hoare triple {13792#true} ~p4~0 := #t~nondet3; {13792#true} is VALID [2020-07-18 00:16:58,991 INFO L280 TraceCheckUtils]: 18: Hoare triple {13792#true} havoc #t~nondet3; {13792#true} is VALID [2020-07-18 00:16:58,991 INFO L280 TraceCheckUtils]: 19: Hoare triple {13792#true} havoc ~lk4~0; {13792#true} is VALID [2020-07-18 00:16:58,991 INFO L280 TraceCheckUtils]: 20: Hoare triple {13792#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {13792#true} is VALID [2020-07-18 00:16:58,992 INFO L280 TraceCheckUtils]: 21: Hoare triple {13792#true} ~p5~0 := #t~nondet4; {13792#true} is VALID [2020-07-18 00:16:58,992 INFO L280 TraceCheckUtils]: 22: Hoare triple {13792#true} havoc #t~nondet4; {13792#true} is VALID [2020-07-18 00:16:58,992 INFO L280 TraceCheckUtils]: 23: Hoare triple {13792#true} havoc ~lk5~0; {13792#true} is VALID [2020-07-18 00:16:58,992 INFO L280 TraceCheckUtils]: 24: Hoare triple {13792#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {13792#true} is VALID [2020-07-18 00:16:58,992 INFO L280 TraceCheckUtils]: 25: Hoare triple {13792#true} ~p6~0 := #t~nondet5; {13792#true} is VALID [2020-07-18 00:16:58,992 INFO L280 TraceCheckUtils]: 26: Hoare triple {13792#true} havoc #t~nondet5; {13792#true} is VALID [2020-07-18 00:16:58,993 INFO L280 TraceCheckUtils]: 27: Hoare triple {13792#true} havoc ~lk6~0; {13792#true} is VALID [2020-07-18 00:16:58,993 INFO L280 TraceCheckUtils]: 28: Hoare triple {13792#true} havoc ~cond~0; {13792#true} is VALID [2020-07-18 00:16:58,993 INFO L280 TraceCheckUtils]: 29: Hoare triple {13792#true} assume !false; {13792#true} is VALID [2020-07-18 00:16:58,993 INFO L280 TraceCheckUtils]: 30: Hoare triple {13792#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {13792#true} is VALID [2020-07-18 00:16:58,993 INFO L280 TraceCheckUtils]: 31: Hoare triple {13792#true} ~cond~0 := #t~nondet6; {13792#true} is VALID [2020-07-18 00:16:58,993 INFO L280 TraceCheckUtils]: 32: Hoare triple {13792#true} havoc #t~nondet6; {13792#true} is VALID [2020-07-18 00:16:58,993 INFO L280 TraceCheckUtils]: 33: Hoare triple {13792#true} assume !(0 == ~cond~0); {13792#true} is VALID [2020-07-18 00:16:58,994 INFO L280 TraceCheckUtils]: 34: Hoare triple {13792#true} ~lk1~0 := 0; {13792#true} is VALID [2020-07-18 00:16:58,994 INFO L280 TraceCheckUtils]: 35: Hoare triple {13792#true} ~lk2~0 := 0; {13792#true} is VALID [2020-07-18 00:16:58,994 INFO L280 TraceCheckUtils]: 36: Hoare triple {13792#true} ~lk3~0 := 0; {13792#true} is VALID [2020-07-18 00:16:58,994 INFO L280 TraceCheckUtils]: 37: Hoare triple {13792#true} ~lk4~0 := 0; {13792#true} is VALID [2020-07-18 00:16:58,994 INFO L280 TraceCheckUtils]: 38: Hoare triple {13792#true} ~lk5~0 := 0; {13792#true} is VALID [2020-07-18 00:16:58,994 INFO L280 TraceCheckUtils]: 39: Hoare triple {13792#true} ~lk6~0 := 0; {13792#true} is VALID [2020-07-18 00:16:58,994 INFO L280 TraceCheckUtils]: 40: Hoare triple {13792#true} assume !(0 != ~p1~0); {13792#true} is VALID [2020-07-18 00:16:58,995 INFO L280 TraceCheckUtils]: 41: Hoare triple {13792#true} assume !(0 != ~p2~0); {13792#true} is VALID [2020-07-18 00:16:58,995 INFO L280 TraceCheckUtils]: 42: Hoare triple {13792#true} assume !(0 != ~p3~0); {13792#true} is VALID [2020-07-18 00:16:58,995 INFO L280 TraceCheckUtils]: 43: Hoare triple {13792#true} assume 0 != ~p4~0; {13792#true} is VALID [2020-07-18 00:16:58,996 INFO L280 TraceCheckUtils]: 44: Hoare triple {13792#true} ~lk4~0 := 1; {13796#(= 1 main_~lk4~0)} is VALID [2020-07-18 00:16:58,997 INFO L280 TraceCheckUtils]: 45: Hoare triple {13796#(= 1 main_~lk4~0)} assume !(0 != ~p5~0); {13796#(= 1 main_~lk4~0)} is VALID [2020-07-18 00:16:58,997 INFO L280 TraceCheckUtils]: 46: Hoare triple {13796#(= 1 main_~lk4~0)} assume !(0 != ~p6~0); {13796#(= 1 main_~lk4~0)} is VALID [2020-07-18 00:16:58,997 INFO L280 TraceCheckUtils]: 47: Hoare triple {13796#(= 1 main_~lk4~0)} assume !(0 != ~p1~0); {13796#(= 1 main_~lk4~0)} is VALID [2020-07-18 00:16:58,998 INFO L280 TraceCheckUtils]: 48: Hoare triple {13796#(= 1 main_~lk4~0)} assume !(0 != ~p2~0); {13796#(= 1 main_~lk4~0)} is VALID [2020-07-18 00:16:58,998 INFO L280 TraceCheckUtils]: 49: Hoare triple {13796#(= 1 main_~lk4~0)} assume !(0 != ~p3~0); {13796#(= 1 main_~lk4~0)} is VALID [2020-07-18 00:16:58,999 INFO L280 TraceCheckUtils]: 50: Hoare triple {13796#(= 1 main_~lk4~0)} assume 0 != ~p4~0; {13796#(= 1 main_~lk4~0)} is VALID [2020-07-18 00:16:58,999 INFO L280 TraceCheckUtils]: 51: Hoare triple {13796#(= 1 main_~lk4~0)} assume 1 != ~lk4~0; {13793#false} is VALID [2020-07-18 00:16:59,000 INFO L280 TraceCheckUtils]: 52: Hoare triple {13793#false} assume !false; {13793#false} is VALID [2020-07-18 00:16:59,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:16:59,002 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:16:59,003 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1991929812] [2020-07-18 00:16:59,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:16:59,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:16:59,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809110963] [2020-07-18 00:16:59,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2020-07-18 00:16:59,004 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:16:59,004 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:16:59,057 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:16:59,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:16:59,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:16:59,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:16:59,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:16:59,059 INFO L87 Difference]: Start difference. First operand 591 states and 758 transitions. Second operand 3 states. [2020-07-18 00:17:00,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:00,465 INFO L93 Difference]: Finished difference Result 715 states and 912 transitions. [2020-07-18 00:17:00,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:17:00,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2020-07-18 00:17:00,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:17:00,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:17:00,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2020-07-18 00:17:00,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:17:00,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2020-07-18 00:17:00,472 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 126 transitions. [2020-07-18 00:17:00,582 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:00,617 INFO L225 Difference]: With dead ends: 715 [2020-07-18 00:17:00,617 INFO L226 Difference]: Without dead ends: 713 [2020-07-18 00:17:00,618 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:17:00,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2020-07-18 00:17:01,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 591. [2020-07-18 00:17:01,634 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:17:01,634 INFO L82 GeneralOperation]: Start isEquivalent. First operand 713 states. Second operand 591 states. [2020-07-18 00:17:01,635 INFO L74 IsIncluded]: Start isIncluded. First operand 713 states. Second operand 591 states. [2020-07-18 00:17:01,635 INFO L87 Difference]: Start difference. First operand 713 states. Second operand 591 states. [2020-07-18 00:17:01,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:01,666 INFO L93 Difference]: Finished difference Result 713 states and 903 transitions. [2020-07-18 00:17:01,666 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 903 transitions. [2020-07-18 00:17:01,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:17:01,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:17:01,668 INFO L74 IsIncluded]: Start isIncluded. First operand 591 states. Second operand 713 states. [2020-07-18 00:17:01,668 INFO L87 Difference]: Start difference. First operand 591 states. Second operand 713 states. [2020-07-18 00:17:01,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:01,699 INFO L93 Difference]: Finished difference Result 713 states and 903 transitions. [2020-07-18 00:17:01,699 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 903 transitions. [2020-07-18 00:17:01,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:17:01,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:17:01,702 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:17:01,702 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:17:01,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-07-18 00:17:01,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 750 transitions. [2020-07-18 00:17:01,726 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 750 transitions. Word has length 53 [2020-07-18 00:17:01,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:17:01,727 INFO L479 AbstractCegarLoop]: Abstraction has 591 states and 750 transitions. [2020-07-18 00:17:01,727 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:17:01,727 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 591 states and 750 transitions. [2020-07-18 00:17:02,562 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 750 edges. 750 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:02,562 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 750 transitions. [2020-07-18 00:17:02,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-07-18 00:17:02,564 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:17:02,564 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:17:02,565 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-18 00:17:02,565 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:17:02,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:17:02,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1804891768, now seen corresponding path program 1 times [2020-07-18 00:17:02,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:17:02,566 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [688592790] [2020-07-18 00:17:02,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:17:02,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:17:02,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:17:02,623 INFO L280 TraceCheckUtils]: 0: Hoare triple {17837#true} assume true; {17837#true} is VALID [2020-07-18 00:17:02,623 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {17837#true} {17837#true} #175#return; {17837#true} is VALID [2020-07-18 00:17:02,623 INFO L263 TraceCheckUtils]: 0: Hoare triple {17837#true} call ULTIMATE.init(); {17837#true} is VALID [2020-07-18 00:17:02,624 INFO L280 TraceCheckUtils]: 1: Hoare triple {17837#true} assume true; {17837#true} is VALID [2020-07-18 00:17:02,624 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {17837#true} {17837#true} #175#return; {17837#true} is VALID [2020-07-18 00:17:02,624 INFO L263 TraceCheckUtils]: 3: Hoare triple {17837#true} call #t~ret7 := main(); {17837#true} is VALID [2020-07-18 00:17:02,624 INFO L280 TraceCheckUtils]: 4: Hoare triple {17837#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {17837#true} is VALID [2020-07-18 00:17:02,624 INFO L280 TraceCheckUtils]: 5: Hoare triple {17837#true} ~p1~0 := #t~nondet0; {17837#true} is VALID [2020-07-18 00:17:02,624 INFO L280 TraceCheckUtils]: 6: Hoare triple {17837#true} havoc #t~nondet0; {17837#true} is VALID [2020-07-18 00:17:02,625 INFO L280 TraceCheckUtils]: 7: Hoare triple {17837#true} havoc ~lk1~0; {17837#true} is VALID [2020-07-18 00:17:02,625 INFO L280 TraceCheckUtils]: 8: Hoare triple {17837#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {17837#true} is VALID [2020-07-18 00:17:02,625 INFO L280 TraceCheckUtils]: 9: Hoare triple {17837#true} ~p2~0 := #t~nondet1; {17837#true} is VALID [2020-07-18 00:17:02,625 INFO L280 TraceCheckUtils]: 10: Hoare triple {17837#true} havoc #t~nondet1; {17837#true} is VALID [2020-07-18 00:17:02,625 INFO L280 TraceCheckUtils]: 11: Hoare triple {17837#true} havoc ~lk2~0; {17837#true} is VALID [2020-07-18 00:17:02,625 INFO L280 TraceCheckUtils]: 12: Hoare triple {17837#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {17837#true} is VALID [2020-07-18 00:17:02,626 INFO L280 TraceCheckUtils]: 13: Hoare triple {17837#true} ~p3~0 := #t~nondet2; {17837#true} is VALID [2020-07-18 00:17:02,626 INFO L280 TraceCheckUtils]: 14: Hoare triple {17837#true} havoc #t~nondet2; {17837#true} is VALID [2020-07-18 00:17:02,626 INFO L280 TraceCheckUtils]: 15: Hoare triple {17837#true} havoc ~lk3~0; {17837#true} is VALID [2020-07-18 00:17:02,626 INFO L280 TraceCheckUtils]: 16: Hoare triple {17837#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {17837#true} is VALID [2020-07-18 00:17:02,626 INFO L280 TraceCheckUtils]: 17: Hoare triple {17837#true} ~p4~0 := #t~nondet3; {17837#true} is VALID [2020-07-18 00:17:02,626 INFO L280 TraceCheckUtils]: 18: Hoare triple {17837#true} havoc #t~nondet3; {17837#true} is VALID [2020-07-18 00:17:02,626 INFO L280 TraceCheckUtils]: 19: Hoare triple {17837#true} havoc ~lk4~0; {17837#true} is VALID [2020-07-18 00:17:02,627 INFO L280 TraceCheckUtils]: 20: Hoare triple {17837#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {17837#true} is VALID [2020-07-18 00:17:02,627 INFO L280 TraceCheckUtils]: 21: Hoare triple {17837#true} ~p5~0 := #t~nondet4; {17837#true} is VALID [2020-07-18 00:17:02,627 INFO L280 TraceCheckUtils]: 22: Hoare triple {17837#true} havoc #t~nondet4; {17837#true} is VALID [2020-07-18 00:17:02,627 INFO L280 TraceCheckUtils]: 23: Hoare triple {17837#true} havoc ~lk5~0; {17837#true} is VALID [2020-07-18 00:17:02,627 INFO L280 TraceCheckUtils]: 24: Hoare triple {17837#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {17837#true} is VALID [2020-07-18 00:17:02,627 INFO L280 TraceCheckUtils]: 25: Hoare triple {17837#true} ~p6~0 := #t~nondet5; {17837#true} is VALID [2020-07-18 00:17:02,627 INFO L280 TraceCheckUtils]: 26: Hoare triple {17837#true} havoc #t~nondet5; {17837#true} is VALID [2020-07-18 00:17:02,628 INFO L280 TraceCheckUtils]: 27: Hoare triple {17837#true} havoc ~lk6~0; {17837#true} is VALID [2020-07-18 00:17:02,628 INFO L280 TraceCheckUtils]: 28: Hoare triple {17837#true} havoc ~cond~0; {17837#true} is VALID [2020-07-18 00:17:02,628 INFO L280 TraceCheckUtils]: 29: Hoare triple {17837#true} assume !false; {17837#true} is VALID [2020-07-18 00:17:02,628 INFO L280 TraceCheckUtils]: 30: Hoare triple {17837#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {17837#true} is VALID [2020-07-18 00:17:02,628 INFO L280 TraceCheckUtils]: 31: Hoare triple {17837#true} ~cond~0 := #t~nondet6; {17837#true} is VALID [2020-07-18 00:17:02,628 INFO L280 TraceCheckUtils]: 32: Hoare triple {17837#true} havoc #t~nondet6; {17837#true} is VALID [2020-07-18 00:17:02,628 INFO L280 TraceCheckUtils]: 33: Hoare triple {17837#true} assume !(0 == ~cond~0); {17837#true} is VALID [2020-07-18 00:17:02,629 INFO L280 TraceCheckUtils]: 34: Hoare triple {17837#true} ~lk1~0 := 0; {17837#true} is VALID [2020-07-18 00:17:02,629 INFO L280 TraceCheckUtils]: 35: Hoare triple {17837#true} ~lk2~0 := 0; {17837#true} is VALID [2020-07-18 00:17:02,629 INFO L280 TraceCheckUtils]: 36: Hoare triple {17837#true} ~lk3~0 := 0; {17837#true} is VALID [2020-07-18 00:17:02,629 INFO L280 TraceCheckUtils]: 37: Hoare triple {17837#true} ~lk4~0 := 0; {17837#true} is VALID [2020-07-18 00:17:02,629 INFO L280 TraceCheckUtils]: 38: Hoare triple {17837#true} ~lk5~0 := 0; {17837#true} is VALID [2020-07-18 00:17:02,630 INFO L280 TraceCheckUtils]: 39: Hoare triple {17837#true} ~lk6~0 := 0; {17837#true} is VALID [2020-07-18 00:17:02,630 INFO L280 TraceCheckUtils]: 40: Hoare triple {17837#true} assume !(0 != ~p1~0); {17837#true} is VALID [2020-07-18 00:17:02,630 INFO L280 TraceCheckUtils]: 41: Hoare triple {17837#true} assume !(0 != ~p2~0); {17837#true} is VALID [2020-07-18 00:17:02,630 INFO L280 TraceCheckUtils]: 42: Hoare triple {17837#true} assume !(0 != ~p3~0); {17837#true} is VALID [2020-07-18 00:17:02,630 INFO L280 TraceCheckUtils]: 43: Hoare triple {17837#true} assume !(0 != ~p4~0); {17837#true} is VALID [2020-07-18 00:17:02,631 INFO L280 TraceCheckUtils]: 44: Hoare triple {17837#true} assume !(0 != ~p5~0); {17841#(= 0 main_~p5~0)} is VALID [2020-07-18 00:17:02,633 INFO L280 TraceCheckUtils]: 45: Hoare triple {17841#(= 0 main_~p5~0)} assume !(0 != ~p6~0); {17841#(= 0 main_~p5~0)} is VALID [2020-07-18 00:17:02,636 INFO L280 TraceCheckUtils]: 46: Hoare triple {17841#(= 0 main_~p5~0)} assume !(0 != ~p1~0); {17841#(= 0 main_~p5~0)} is VALID [2020-07-18 00:17:02,637 INFO L280 TraceCheckUtils]: 47: Hoare triple {17841#(= 0 main_~p5~0)} assume !(0 != ~p2~0); {17841#(= 0 main_~p5~0)} is VALID [2020-07-18 00:17:02,638 INFO L280 TraceCheckUtils]: 48: Hoare triple {17841#(= 0 main_~p5~0)} assume !(0 != ~p3~0); {17841#(= 0 main_~p5~0)} is VALID [2020-07-18 00:17:02,639 INFO L280 TraceCheckUtils]: 49: Hoare triple {17841#(= 0 main_~p5~0)} assume !(0 != ~p4~0); {17841#(= 0 main_~p5~0)} is VALID [2020-07-18 00:17:02,640 INFO L280 TraceCheckUtils]: 50: Hoare triple {17841#(= 0 main_~p5~0)} assume 0 != ~p5~0; {17838#false} is VALID [2020-07-18 00:17:02,640 INFO L280 TraceCheckUtils]: 51: Hoare triple {17838#false} assume 1 != ~lk5~0; {17838#false} is VALID [2020-07-18 00:17:02,640 INFO L280 TraceCheckUtils]: 52: Hoare triple {17838#false} assume !false; {17838#false} is VALID [2020-07-18 00:17:02,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:17:02,644 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:17:02,644 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [688592790] [2020-07-18 00:17:02,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:17:02,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:17:02,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437499331] [2020-07-18 00:17:02,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2020-07-18 00:17:02,645 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:17:02,645 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:17:02,696 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:02,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:17:02,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:17:02,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:17:02,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:17:02,698 INFO L87 Difference]: Start difference. First operand 591 states and 750 transitions. Second operand 3 states. [2020-07-18 00:17:05,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:05,427 INFO L93 Difference]: Finished difference Result 1667 states and 2128 transitions. [2020-07-18 00:17:05,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:17:05,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2020-07-18 00:17:05,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:17:05,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:17:05,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 193 transitions. [2020-07-18 00:17:05,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:17:05,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 193 transitions. [2020-07-18 00:17:05,433 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 193 transitions. [2020-07-18 00:17:05,612 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 193 edges. 193 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:05,680 INFO L225 Difference]: With dead ends: 1667 [2020-07-18 00:17:05,681 INFO L226 Difference]: Without dead ends: 1105 [2020-07-18 00:17:05,682 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:17:05,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2020-07-18 00:17:07,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 1103. [2020-07-18 00:17:07,916 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:17:07,916 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1105 states. Second operand 1103 states. [2020-07-18 00:17:07,916 INFO L74 IsIncluded]: Start isIncluded. First operand 1105 states. Second operand 1103 states. [2020-07-18 00:17:07,916 INFO L87 Difference]: Start difference. First operand 1105 states. Second operand 1103 states. [2020-07-18 00:17:07,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:07,980 INFO L93 Difference]: Finished difference Result 1105 states and 1375 transitions. [2020-07-18 00:17:07,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 1375 transitions. [2020-07-18 00:17:07,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:17:07,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:17:07,984 INFO L74 IsIncluded]: Start isIncluded. First operand 1103 states. Second operand 1105 states. [2020-07-18 00:17:07,984 INFO L87 Difference]: Start difference. First operand 1103 states. Second operand 1105 states. [2020-07-18 00:17:08,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:08,053 INFO L93 Difference]: Finished difference Result 1105 states and 1375 transitions. [2020-07-18 00:17:08,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 1375 transitions. [2020-07-18 00:17:08,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:17:08,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:17:08,056 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:17:08,057 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:17:08,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1103 states. [2020-07-18 00:17:08,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1374 transitions. [2020-07-18 00:17:08,130 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1374 transitions. Word has length 53 [2020-07-18 00:17:08,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:17:08,130 INFO L479 AbstractCegarLoop]: Abstraction has 1103 states and 1374 transitions. [2020-07-18 00:17:08,130 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:17:08,131 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 1103 states and 1374 transitions. [2020-07-18 00:17:09,723 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 1374 edges. 1374 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:09,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1374 transitions. [2020-07-18 00:17:09,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-18 00:17:09,725 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:17:09,725 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:17:09,725 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-18 00:17:09,726 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:17:09,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:17:09,726 INFO L82 PathProgramCache]: Analyzing trace with hash 2000907060, now seen corresponding path program 1 times [2020-07-18 00:17:09,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:17:09,726 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1604000418] [2020-07-18 00:17:09,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:17:09,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:17:09,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:17:09,794 INFO L280 TraceCheckUtils]: 0: Hoare triple {25594#true} assume true; {25594#true} is VALID [2020-07-18 00:17:09,794 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {25594#true} {25594#true} #175#return; {25594#true} is VALID [2020-07-18 00:17:09,795 INFO L263 TraceCheckUtils]: 0: Hoare triple {25594#true} call ULTIMATE.init(); {25594#true} is VALID [2020-07-18 00:17:09,795 INFO L280 TraceCheckUtils]: 1: Hoare triple {25594#true} assume true; {25594#true} is VALID [2020-07-18 00:17:09,795 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {25594#true} {25594#true} #175#return; {25594#true} is VALID [2020-07-18 00:17:09,796 INFO L263 TraceCheckUtils]: 3: Hoare triple {25594#true} call #t~ret7 := main(); {25594#true} is VALID [2020-07-18 00:17:09,796 INFO L280 TraceCheckUtils]: 4: Hoare triple {25594#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {25594#true} is VALID [2020-07-18 00:17:09,796 INFO L280 TraceCheckUtils]: 5: Hoare triple {25594#true} ~p1~0 := #t~nondet0; {25594#true} is VALID [2020-07-18 00:17:09,796 INFO L280 TraceCheckUtils]: 6: Hoare triple {25594#true} havoc #t~nondet0; {25594#true} is VALID [2020-07-18 00:17:09,796 INFO L280 TraceCheckUtils]: 7: Hoare triple {25594#true} havoc ~lk1~0; {25594#true} is VALID [2020-07-18 00:17:09,797 INFO L280 TraceCheckUtils]: 8: Hoare triple {25594#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {25594#true} is VALID [2020-07-18 00:17:09,797 INFO L280 TraceCheckUtils]: 9: Hoare triple {25594#true} ~p2~0 := #t~nondet1; {25594#true} is VALID [2020-07-18 00:17:09,797 INFO L280 TraceCheckUtils]: 10: Hoare triple {25594#true} havoc #t~nondet1; {25594#true} is VALID [2020-07-18 00:17:09,797 INFO L280 TraceCheckUtils]: 11: Hoare triple {25594#true} havoc ~lk2~0; {25594#true} is VALID [2020-07-18 00:17:09,797 INFO L280 TraceCheckUtils]: 12: Hoare triple {25594#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {25594#true} is VALID [2020-07-18 00:17:09,798 INFO L280 TraceCheckUtils]: 13: Hoare triple {25594#true} ~p3~0 := #t~nondet2; {25594#true} is VALID [2020-07-18 00:17:09,798 INFO L280 TraceCheckUtils]: 14: Hoare triple {25594#true} havoc #t~nondet2; {25594#true} is VALID [2020-07-18 00:17:09,798 INFO L280 TraceCheckUtils]: 15: Hoare triple {25594#true} havoc ~lk3~0; {25594#true} is VALID [2020-07-18 00:17:09,798 INFO L280 TraceCheckUtils]: 16: Hoare triple {25594#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {25594#true} is VALID [2020-07-18 00:17:09,798 INFO L280 TraceCheckUtils]: 17: Hoare triple {25594#true} ~p4~0 := #t~nondet3; {25594#true} is VALID [2020-07-18 00:17:09,799 INFO L280 TraceCheckUtils]: 18: Hoare triple {25594#true} havoc #t~nondet3; {25594#true} is VALID [2020-07-18 00:17:09,799 INFO L280 TraceCheckUtils]: 19: Hoare triple {25594#true} havoc ~lk4~0; {25594#true} is VALID [2020-07-18 00:17:09,799 INFO L280 TraceCheckUtils]: 20: Hoare triple {25594#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {25594#true} is VALID [2020-07-18 00:17:09,799 INFO L280 TraceCheckUtils]: 21: Hoare triple {25594#true} ~p5~0 := #t~nondet4; {25594#true} is VALID [2020-07-18 00:17:09,799 INFO L280 TraceCheckUtils]: 22: Hoare triple {25594#true} havoc #t~nondet4; {25594#true} is VALID [2020-07-18 00:17:09,800 INFO L280 TraceCheckUtils]: 23: Hoare triple {25594#true} havoc ~lk5~0; {25594#true} is VALID [2020-07-18 00:17:09,800 INFO L280 TraceCheckUtils]: 24: Hoare triple {25594#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {25594#true} is VALID [2020-07-18 00:17:09,800 INFO L280 TraceCheckUtils]: 25: Hoare triple {25594#true} ~p6~0 := #t~nondet5; {25594#true} is VALID [2020-07-18 00:17:09,800 INFO L280 TraceCheckUtils]: 26: Hoare triple {25594#true} havoc #t~nondet5; {25594#true} is VALID [2020-07-18 00:17:09,800 INFO L280 TraceCheckUtils]: 27: Hoare triple {25594#true} havoc ~lk6~0; {25594#true} is VALID [2020-07-18 00:17:09,801 INFO L280 TraceCheckUtils]: 28: Hoare triple {25594#true} havoc ~cond~0; {25594#true} is VALID [2020-07-18 00:17:09,801 INFO L280 TraceCheckUtils]: 29: Hoare triple {25594#true} assume !false; {25594#true} is VALID [2020-07-18 00:17:09,809 INFO L280 TraceCheckUtils]: 30: Hoare triple {25594#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {25594#true} is VALID [2020-07-18 00:17:09,810 INFO L280 TraceCheckUtils]: 31: Hoare triple {25594#true} ~cond~0 := #t~nondet6; {25594#true} is VALID [2020-07-18 00:17:09,810 INFO L280 TraceCheckUtils]: 32: Hoare triple {25594#true} havoc #t~nondet6; {25594#true} is VALID [2020-07-18 00:17:09,810 INFO L280 TraceCheckUtils]: 33: Hoare triple {25594#true} assume !(0 == ~cond~0); {25594#true} is VALID [2020-07-18 00:17:09,810 INFO L280 TraceCheckUtils]: 34: Hoare triple {25594#true} ~lk1~0 := 0; {25594#true} is VALID [2020-07-18 00:17:09,811 INFO L280 TraceCheckUtils]: 35: Hoare triple {25594#true} ~lk2~0 := 0; {25594#true} is VALID [2020-07-18 00:17:09,811 INFO L280 TraceCheckUtils]: 36: Hoare triple {25594#true} ~lk3~0 := 0; {25594#true} is VALID [2020-07-18 00:17:09,811 INFO L280 TraceCheckUtils]: 37: Hoare triple {25594#true} ~lk4~0 := 0; {25594#true} is VALID [2020-07-18 00:17:09,811 INFO L280 TraceCheckUtils]: 38: Hoare triple {25594#true} ~lk5~0 := 0; {25594#true} is VALID [2020-07-18 00:17:09,811 INFO L280 TraceCheckUtils]: 39: Hoare triple {25594#true} ~lk6~0 := 0; {25594#true} is VALID [2020-07-18 00:17:09,812 INFO L280 TraceCheckUtils]: 40: Hoare triple {25594#true} assume !(0 != ~p1~0); {25594#true} is VALID [2020-07-18 00:17:09,812 INFO L280 TraceCheckUtils]: 41: Hoare triple {25594#true} assume !(0 != ~p2~0); {25594#true} is VALID [2020-07-18 00:17:09,812 INFO L280 TraceCheckUtils]: 42: Hoare triple {25594#true} assume !(0 != ~p3~0); {25594#true} is VALID [2020-07-18 00:17:09,815 INFO L280 TraceCheckUtils]: 43: Hoare triple {25594#true} assume !(0 != ~p4~0); {25594#true} is VALID [2020-07-18 00:17:09,816 INFO L280 TraceCheckUtils]: 44: Hoare triple {25594#true} assume 0 != ~p5~0; {25594#true} is VALID [2020-07-18 00:17:09,824 INFO L280 TraceCheckUtils]: 45: Hoare triple {25594#true} ~lk5~0 := 1; {25598#(= 1 main_~lk5~0)} is VALID [2020-07-18 00:17:09,824 INFO L280 TraceCheckUtils]: 46: Hoare triple {25598#(= 1 main_~lk5~0)} assume !(0 != ~p6~0); {25598#(= 1 main_~lk5~0)} is VALID [2020-07-18 00:17:09,825 INFO L280 TraceCheckUtils]: 47: Hoare triple {25598#(= 1 main_~lk5~0)} assume !(0 != ~p1~0); {25598#(= 1 main_~lk5~0)} is VALID [2020-07-18 00:17:09,826 INFO L280 TraceCheckUtils]: 48: Hoare triple {25598#(= 1 main_~lk5~0)} assume !(0 != ~p2~0); {25598#(= 1 main_~lk5~0)} is VALID [2020-07-18 00:17:09,826 INFO L280 TraceCheckUtils]: 49: Hoare triple {25598#(= 1 main_~lk5~0)} assume !(0 != ~p3~0); {25598#(= 1 main_~lk5~0)} is VALID [2020-07-18 00:17:09,827 INFO L280 TraceCheckUtils]: 50: Hoare triple {25598#(= 1 main_~lk5~0)} assume !(0 != ~p4~0); {25598#(= 1 main_~lk5~0)} is VALID [2020-07-18 00:17:09,827 INFO L280 TraceCheckUtils]: 51: Hoare triple {25598#(= 1 main_~lk5~0)} assume 0 != ~p5~0; {25598#(= 1 main_~lk5~0)} is VALID [2020-07-18 00:17:09,828 INFO L280 TraceCheckUtils]: 52: Hoare triple {25598#(= 1 main_~lk5~0)} assume 1 != ~lk5~0; {25595#false} is VALID [2020-07-18 00:17:09,828 INFO L280 TraceCheckUtils]: 53: Hoare triple {25595#false} assume !false; {25595#false} is VALID [2020-07-18 00:17:09,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:17:09,830 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:17:09,830 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1604000418] [2020-07-18 00:17:09,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:17:09,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:17:09,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574794529] [2020-07-18 00:17:09,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2020-07-18 00:17:09,832 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:17:09,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:17:09,877 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:09,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:17:09,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:17:09,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:17:09,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:17:09,878 INFO L87 Difference]: Start difference. First operand 1103 states and 1374 transitions. Second operand 3 states. [2020-07-18 00:17:12,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:12,906 INFO L93 Difference]: Finished difference Result 1315 states and 1616 transitions. [2020-07-18 00:17:12,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:17:12,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2020-07-18 00:17:12,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:17:12,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:17:12,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2020-07-18 00:17:12,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:17:12,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2020-07-18 00:17:12,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 122 transitions. [2020-07-18 00:17:13,031 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:13,149 INFO L225 Difference]: With dead ends: 1315 [2020-07-18 00:17:13,149 INFO L226 Difference]: Without dead ends: 1313 [2020-07-18 00:17:13,151 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:17:13,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2020-07-18 00:17:15,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 1103. [2020-07-18 00:17:15,460 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:17:15,460 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1313 states. Second operand 1103 states. [2020-07-18 00:17:15,460 INFO L74 IsIncluded]: Start isIncluded. First operand 1313 states. Second operand 1103 states. [2020-07-18 00:17:15,460 INFO L87 Difference]: Start difference. First operand 1313 states. Second operand 1103 states. [2020-07-18 00:17:15,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:15,548 INFO L93 Difference]: Finished difference Result 1313 states and 1599 transitions. [2020-07-18 00:17:15,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1599 transitions. [2020-07-18 00:17:15,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:17:15,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:17:15,551 INFO L74 IsIncluded]: Start isIncluded. First operand 1103 states. Second operand 1313 states. [2020-07-18 00:17:15,551 INFO L87 Difference]: Start difference. First operand 1103 states. Second operand 1313 states. [2020-07-18 00:17:15,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:15,650 INFO L93 Difference]: Finished difference Result 1313 states and 1599 transitions. [2020-07-18 00:17:15,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1599 transitions. [2020-07-18 00:17:15,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:17:15,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:17:15,655 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:17:15,655 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:17:15,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1103 states. [2020-07-18 00:17:15,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1358 transitions. [2020-07-18 00:17:15,727 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1358 transitions. Word has length 54 [2020-07-18 00:17:15,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:17:15,727 INFO L479 AbstractCegarLoop]: Abstraction has 1103 states and 1358 transitions. [2020-07-18 00:17:15,727 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:17:15,727 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 1103 states and 1358 transitions. [2020-07-18 00:17:17,398 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 1358 edges. 1358 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:17,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1358 transitions. [2020-07-18 00:17:17,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-18 00:17:17,399 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:17:17,400 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:17:17,400 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-18 00:17:17,400 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:17:17,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:17:17,404 INFO L82 PathProgramCache]: Analyzing trace with hash -116823154, now seen corresponding path program 1 times [2020-07-18 00:17:17,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:17:17,404 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [393370170] [2020-07-18 00:17:17,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:17:17,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:17:17,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:17:17,461 INFO L280 TraceCheckUtils]: 0: Hoare triple {33063#true} assume true; {33063#true} is VALID [2020-07-18 00:17:17,462 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {33063#true} {33063#true} #175#return; {33063#true} is VALID [2020-07-18 00:17:17,462 INFO L263 TraceCheckUtils]: 0: Hoare triple {33063#true} call ULTIMATE.init(); {33063#true} is VALID [2020-07-18 00:17:17,462 INFO L280 TraceCheckUtils]: 1: Hoare triple {33063#true} assume true; {33063#true} is VALID [2020-07-18 00:17:17,462 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {33063#true} {33063#true} #175#return; {33063#true} is VALID [2020-07-18 00:17:17,463 INFO L263 TraceCheckUtils]: 3: Hoare triple {33063#true} call #t~ret7 := main(); {33063#true} is VALID [2020-07-18 00:17:17,463 INFO L280 TraceCheckUtils]: 4: Hoare triple {33063#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {33063#true} is VALID [2020-07-18 00:17:17,463 INFO L280 TraceCheckUtils]: 5: Hoare triple {33063#true} ~p1~0 := #t~nondet0; {33063#true} is VALID [2020-07-18 00:17:17,463 INFO L280 TraceCheckUtils]: 6: Hoare triple {33063#true} havoc #t~nondet0; {33063#true} is VALID [2020-07-18 00:17:17,463 INFO L280 TraceCheckUtils]: 7: Hoare triple {33063#true} havoc ~lk1~0; {33063#true} is VALID [2020-07-18 00:17:17,463 INFO L280 TraceCheckUtils]: 8: Hoare triple {33063#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {33063#true} is VALID [2020-07-18 00:17:17,464 INFO L280 TraceCheckUtils]: 9: Hoare triple {33063#true} ~p2~0 := #t~nondet1; {33063#true} is VALID [2020-07-18 00:17:17,464 INFO L280 TraceCheckUtils]: 10: Hoare triple {33063#true} havoc #t~nondet1; {33063#true} is VALID [2020-07-18 00:17:17,464 INFO L280 TraceCheckUtils]: 11: Hoare triple {33063#true} havoc ~lk2~0; {33063#true} is VALID [2020-07-18 00:17:17,464 INFO L280 TraceCheckUtils]: 12: Hoare triple {33063#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {33063#true} is VALID [2020-07-18 00:17:17,464 INFO L280 TraceCheckUtils]: 13: Hoare triple {33063#true} ~p3~0 := #t~nondet2; {33063#true} is VALID [2020-07-18 00:17:17,465 INFO L280 TraceCheckUtils]: 14: Hoare triple {33063#true} havoc #t~nondet2; {33063#true} is VALID [2020-07-18 00:17:17,465 INFO L280 TraceCheckUtils]: 15: Hoare triple {33063#true} havoc ~lk3~0; {33063#true} is VALID [2020-07-18 00:17:17,465 INFO L280 TraceCheckUtils]: 16: Hoare triple {33063#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {33063#true} is VALID [2020-07-18 00:17:17,465 INFO L280 TraceCheckUtils]: 17: Hoare triple {33063#true} ~p4~0 := #t~nondet3; {33063#true} is VALID [2020-07-18 00:17:17,465 INFO L280 TraceCheckUtils]: 18: Hoare triple {33063#true} havoc #t~nondet3; {33063#true} is VALID [2020-07-18 00:17:17,466 INFO L280 TraceCheckUtils]: 19: Hoare triple {33063#true} havoc ~lk4~0; {33063#true} is VALID [2020-07-18 00:17:17,466 INFO L280 TraceCheckUtils]: 20: Hoare triple {33063#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {33063#true} is VALID [2020-07-18 00:17:17,466 INFO L280 TraceCheckUtils]: 21: Hoare triple {33063#true} ~p5~0 := #t~nondet4; {33063#true} is VALID [2020-07-18 00:17:17,466 INFO L280 TraceCheckUtils]: 22: Hoare triple {33063#true} havoc #t~nondet4; {33063#true} is VALID [2020-07-18 00:17:17,466 INFO L280 TraceCheckUtils]: 23: Hoare triple {33063#true} havoc ~lk5~0; {33063#true} is VALID [2020-07-18 00:17:17,467 INFO L280 TraceCheckUtils]: 24: Hoare triple {33063#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {33063#true} is VALID [2020-07-18 00:17:17,467 INFO L280 TraceCheckUtils]: 25: Hoare triple {33063#true} ~p6~0 := #t~nondet5; {33063#true} is VALID [2020-07-18 00:17:17,467 INFO L280 TraceCheckUtils]: 26: Hoare triple {33063#true} havoc #t~nondet5; {33063#true} is VALID [2020-07-18 00:17:17,467 INFO L280 TraceCheckUtils]: 27: Hoare triple {33063#true} havoc ~lk6~0; {33063#true} is VALID [2020-07-18 00:17:17,467 INFO L280 TraceCheckUtils]: 28: Hoare triple {33063#true} havoc ~cond~0; {33063#true} is VALID [2020-07-18 00:17:17,467 INFO L280 TraceCheckUtils]: 29: Hoare triple {33063#true} assume !false; {33063#true} is VALID [2020-07-18 00:17:17,467 INFO L280 TraceCheckUtils]: 30: Hoare triple {33063#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {33063#true} is VALID [2020-07-18 00:17:17,468 INFO L280 TraceCheckUtils]: 31: Hoare triple {33063#true} ~cond~0 := #t~nondet6; {33063#true} is VALID [2020-07-18 00:17:17,468 INFO L280 TraceCheckUtils]: 32: Hoare triple {33063#true} havoc #t~nondet6; {33063#true} is VALID [2020-07-18 00:17:17,468 INFO L280 TraceCheckUtils]: 33: Hoare triple {33063#true} assume !(0 == ~cond~0); {33063#true} is VALID [2020-07-18 00:17:17,468 INFO L280 TraceCheckUtils]: 34: Hoare triple {33063#true} ~lk1~0 := 0; {33063#true} is VALID [2020-07-18 00:17:17,468 INFO L280 TraceCheckUtils]: 35: Hoare triple {33063#true} ~lk2~0 := 0; {33063#true} is VALID [2020-07-18 00:17:17,468 INFO L280 TraceCheckUtils]: 36: Hoare triple {33063#true} ~lk3~0 := 0; {33063#true} is VALID [2020-07-18 00:17:17,468 INFO L280 TraceCheckUtils]: 37: Hoare triple {33063#true} ~lk4~0 := 0; {33063#true} is VALID [2020-07-18 00:17:17,468 INFO L280 TraceCheckUtils]: 38: Hoare triple {33063#true} ~lk5~0 := 0; {33063#true} is VALID [2020-07-18 00:17:17,469 INFO L280 TraceCheckUtils]: 39: Hoare triple {33063#true} ~lk6~0 := 0; {33063#true} is VALID [2020-07-18 00:17:17,469 INFO L280 TraceCheckUtils]: 40: Hoare triple {33063#true} assume !(0 != ~p1~0); {33063#true} is VALID [2020-07-18 00:17:17,469 INFO L280 TraceCheckUtils]: 41: Hoare triple {33063#true} assume !(0 != ~p2~0); {33063#true} is VALID [2020-07-18 00:17:17,469 INFO L280 TraceCheckUtils]: 42: Hoare triple {33063#true} assume !(0 != ~p3~0); {33063#true} is VALID [2020-07-18 00:17:17,469 INFO L280 TraceCheckUtils]: 43: Hoare triple {33063#true} assume !(0 != ~p4~0); {33063#true} is VALID [2020-07-18 00:17:17,469 INFO L280 TraceCheckUtils]: 44: Hoare triple {33063#true} assume !(0 != ~p5~0); {33063#true} is VALID [2020-07-18 00:17:17,470 INFO L280 TraceCheckUtils]: 45: Hoare triple {33063#true} assume !(0 != ~p6~0); {33067#(= 0 main_~p6~0)} is VALID [2020-07-18 00:17:17,470 INFO L280 TraceCheckUtils]: 46: Hoare triple {33067#(= 0 main_~p6~0)} assume !(0 != ~p1~0); {33067#(= 0 main_~p6~0)} is VALID [2020-07-18 00:17:17,470 INFO L280 TraceCheckUtils]: 47: Hoare triple {33067#(= 0 main_~p6~0)} assume !(0 != ~p2~0); {33067#(= 0 main_~p6~0)} is VALID [2020-07-18 00:17:17,471 INFO L280 TraceCheckUtils]: 48: Hoare triple {33067#(= 0 main_~p6~0)} assume !(0 != ~p3~0); {33067#(= 0 main_~p6~0)} is VALID [2020-07-18 00:17:17,471 INFO L280 TraceCheckUtils]: 49: Hoare triple {33067#(= 0 main_~p6~0)} assume !(0 != ~p4~0); {33067#(= 0 main_~p6~0)} is VALID [2020-07-18 00:17:17,472 INFO L280 TraceCheckUtils]: 50: Hoare triple {33067#(= 0 main_~p6~0)} assume !(0 != ~p5~0); {33067#(= 0 main_~p6~0)} is VALID [2020-07-18 00:17:17,472 INFO L280 TraceCheckUtils]: 51: Hoare triple {33067#(= 0 main_~p6~0)} assume 0 != ~p6~0; {33064#false} is VALID [2020-07-18 00:17:17,472 INFO L280 TraceCheckUtils]: 52: Hoare triple {33064#false} assume 1 != ~lk6~0; {33064#false} is VALID [2020-07-18 00:17:17,472 INFO L280 TraceCheckUtils]: 53: Hoare triple {33064#false} assume !false; {33064#false} is VALID [2020-07-18 00:17:17,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:17:17,474 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:17:17,474 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [393370170] [2020-07-18 00:17:17,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:17:17,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:17:17,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824017402] [2020-07-18 00:17:17,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2020-07-18 00:17:17,475 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:17:17,475 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:17:17,520 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:17,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:17:17,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:17:17,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:17:17,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:17:17,521 INFO L87 Difference]: Start difference. First operand 1103 states and 1358 transitions. Second operand 3 states. [2020-07-18 00:17:23,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:23,269 INFO L93 Difference]: Finished difference Result 3153 states and 3887 transitions. [2020-07-18 00:17:23,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:17:23,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2020-07-18 00:17:23,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:17:23,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:17:23,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2020-07-18 00:17:23,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:17:23,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2020-07-18 00:17:23,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 189 transitions. [2020-07-18 00:17:23,448 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:23,501 INFO L225 Difference]: With dead ends: 3153 [2020-07-18 00:17:23,502 INFO L226 Difference]: Without dead ends: 1103 [2020-07-18 00:17:23,505 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:17:23,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2020-07-18 00:17:25,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 1103. [2020-07-18 00:17:25,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:17:25,881 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1103 states. Second operand 1103 states. [2020-07-18 00:17:25,881 INFO L74 IsIncluded]: Start isIncluded. First operand 1103 states. Second operand 1103 states. [2020-07-18 00:17:25,882 INFO L87 Difference]: Start difference. First operand 1103 states. Second operand 1103 states. [2020-07-18 00:17:25,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:25,933 INFO L93 Difference]: Finished difference Result 1103 states and 1294 transitions. [2020-07-18 00:17:25,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1294 transitions. [2020-07-18 00:17:25,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:17:25,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:17:25,935 INFO L74 IsIncluded]: Start isIncluded. First operand 1103 states. Second operand 1103 states. [2020-07-18 00:17:25,935 INFO L87 Difference]: Start difference. First operand 1103 states. Second operand 1103 states. [2020-07-18 00:17:25,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:25,993 INFO L93 Difference]: Finished difference Result 1103 states and 1294 transitions. [2020-07-18 00:17:25,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1294 transitions. [2020-07-18 00:17:25,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:17:25,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:17:25,997 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:17:25,997 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:17:25,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1103 states. [2020-07-18 00:17:26,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1294 transitions. [2020-07-18 00:17:26,057 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1294 transitions. Word has length 54 [2020-07-18 00:17:26,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:17:26,058 INFO L479 AbstractCegarLoop]: Abstraction has 1103 states and 1294 transitions. [2020-07-18 00:17:26,058 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:17:26,058 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 1103 states and 1294 transitions. [2020-07-18 00:17:27,698 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 1294 edges. 1294 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:27,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1294 transitions. [2020-07-18 00:17:27,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-07-18 00:17:27,700 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:17:27,700 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:17:27,701 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-18 00:17:27,701 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:17:27,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:17:27,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1056202659, now seen corresponding path program 1 times [2020-07-18 00:17:27,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:17:27,702 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2006311643] [2020-07-18 00:17:27,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:17:27,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:17:27,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:17:27,742 INFO L280 TraceCheckUtils]: 0: Hoare triple {43788#true} assume true; {43788#true} is VALID [2020-07-18 00:17:27,742 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {43788#true} {43788#true} #175#return; {43788#true} is VALID [2020-07-18 00:17:27,742 INFO L263 TraceCheckUtils]: 0: Hoare triple {43788#true} call ULTIMATE.init(); {43788#true} is VALID [2020-07-18 00:17:27,743 INFO L280 TraceCheckUtils]: 1: Hoare triple {43788#true} assume true; {43788#true} is VALID [2020-07-18 00:17:27,743 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {43788#true} {43788#true} #175#return; {43788#true} is VALID [2020-07-18 00:17:27,743 INFO L263 TraceCheckUtils]: 3: Hoare triple {43788#true} call #t~ret7 := main(); {43788#true} is VALID [2020-07-18 00:17:27,743 INFO L280 TraceCheckUtils]: 4: Hoare triple {43788#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {43788#true} is VALID [2020-07-18 00:17:27,743 INFO L280 TraceCheckUtils]: 5: Hoare triple {43788#true} ~p1~0 := #t~nondet0; {43788#true} is VALID [2020-07-18 00:17:27,743 INFO L280 TraceCheckUtils]: 6: Hoare triple {43788#true} havoc #t~nondet0; {43788#true} is VALID [2020-07-18 00:17:27,744 INFO L280 TraceCheckUtils]: 7: Hoare triple {43788#true} havoc ~lk1~0; {43788#true} is VALID [2020-07-18 00:17:27,744 INFO L280 TraceCheckUtils]: 8: Hoare triple {43788#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {43788#true} is VALID [2020-07-18 00:17:27,744 INFO L280 TraceCheckUtils]: 9: Hoare triple {43788#true} ~p2~0 := #t~nondet1; {43788#true} is VALID [2020-07-18 00:17:27,744 INFO L280 TraceCheckUtils]: 10: Hoare triple {43788#true} havoc #t~nondet1; {43788#true} is VALID [2020-07-18 00:17:27,744 INFO L280 TraceCheckUtils]: 11: Hoare triple {43788#true} havoc ~lk2~0; {43788#true} is VALID [2020-07-18 00:17:27,745 INFO L280 TraceCheckUtils]: 12: Hoare triple {43788#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {43788#true} is VALID [2020-07-18 00:17:27,745 INFO L280 TraceCheckUtils]: 13: Hoare triple {43788#true} ~p3~0 := #t~nondet2; {43788#true} is VALID [2020-07-18 00:17:27,745 INFO L280 TraceCheckUtils]: 14: Hoare triple {43788#true} havoc #t~nondet2; {43788#true} is VALID [2020-07-18 00:17:27,745 INFO L280 TraceCheckUtils]: 15: Hoare triple {43788#true} havoc ~lk3~0; {43788#true} is VALID [2020-07-18 00:17:27,745 INFO L280 TraceCheckUtils]: 16: Hoare triple {43788#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {43788#true} is VALID [2020-07-18 00:17:27,746 INFO L280 TraceCheckUtils]: 17: Hoare triple {43788#true} ~p4~0 := #t~nondet3; {43788#true} is VALID [2020-07-18 00:17:27,746 INFO L280 TraceCheckUtils]: 18: Hoare triple {43788#true} havoc #t~nondet3; {43788#true} is VALID [2020-07-18 00:17:27,746 INFO L280 TraceCheckUtils]: 19: Hoare triple {43788#true} havoc ~lk4~0; {43788#true} is VALID [2020-07-18 00:17:27,746 INFO L280 TraceCheckUtils]: 20: Hoare triple {43788#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {43788#true} is VALID [2020-07-18 00:17:27,746 INFO L280 TraceCheckUtils]: 21: Hoare triple {43788#true} ~p5~0 := #t~nondet4; {43788#true} is VALID [2020-07-18 00:17:27,747 INFO L280 TraceCheckUtils]: 22: Hoare triple {43788#true} havoc #t~nondet4; {43788#true} is VALID [2020-07-18 00:17:27,747 INFO L280 TraceCheckUtils]: 23: Hoare triple {43788#true} havoc ~lk5~0; {43788#true} is VALID [2020-07-18 00:17:27,747 INFO L280 TraceCheckUtils]: 24: Hoare triple {43788#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {43788#true} is VALID [2020-07-18 00:17:27,747 INFO L280 TraceCheckUtils]: 25: Hoare triple {43788#true} ~p6~0 := #t~nondet5; {43788#true} is VALID [2020-07-18 00:17:27,747 INFO L280 TraceCheckUtils]: 26: Hoare triple {43788#true} havoc #t~nondet5; {43788#true} is VALID [2020-07-18 00:17:27,748 INFO L280 TraceCheckUtils]: 27: Hoare triple {43788#true} havoc ~lk6~0; {43788#true} is VALID [2020-07-18 00:17:27,748 INFO L280 TraceCheckUtils]: 28: Hoare triple {43788#true} havoc ~cond~0; {43788#true} is VALID [2020-07-18 00:17:27,748 INFO L280 TraceCheckUtils]: 29: Hoare triple {43788#true} assume !false; {43788#true} is VALID [2020-07-18 00:17:27,748 INFO L280 TraceCheckUtils]: 30: Hoare triple {43788#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {43788#true} is VALID [2020-07-18 00:17:27,748 INFO L280 TraceCheckUtils]: 31: Hoare triple {43788#true} ~cond~0 := #t~nondet6; {43788#true} is VALID [2020-07-18 00:17:27,749 INFO L280 TraceCheckUtils]: 32: Hoare triple {43788#true} havoc #t~nondet6; {43788#true} is VALID [2020-07-18 00:17:27,749 INFO L280 TraceCheckUtils]: 33: Hoare triple {43788#true} assume !(0 == ~cond~0); {43788#true} is VALID [2020-07-18 00:17:27,749 INFO L280 TraceCheckUtils]: 34: Hoare triple {43788#true} ~lk1~0 := 0; {43788#true} is VALID [2020-07-18 00:17:27,749 INFO L280 TraceCheckUtils]: 35: Hoare triple {43788#true} ~lk2~0 := 0; {43788#true} is VALID [2020-07-18 00:17:27,749 INFO L280 TraceCheckUtils]: 36: Hoare triple {43788#true} ~lk3~0 := 0; {43788#true} is VALID [2020-07-18 00:17:27,750 INFO L280 TraceCheckUtils]: 37: Hoare triple {43788#true} ~lk4~0 := 0; {43788#true} is VALID [2020-07-18 00:17:27,750 INFO L280 TraceCheckUtils]: 38: Hoare triple {43788#true} ~lk5~0 := 0; {43788#true} is VALID [2020-07-18 00:17:27,750 INFO L280 TraceCheckUtils]: 39: Hoare triple {43788#true} ~lk6~0 := 0; {43788#true} is VALID [2020-07-18 00:17:27,750 INFO L280 TraceCheckUtils]: 40: Hoare triple {43788#true} assume !(0 != ~p1~0); {43788#true} is VALID [2020-07-18 00:17:27,750 INFO L280 TraceCheckUtils]: 41: Hoare triple {43788#true} assume !(0 != ~p2~0); {43788#true} is VALID [2020-07-18 00:17:27,751 INFO L280 TraceCheckUtils]: 42: Hoare triple {43788#true} assume !(0 != ~p3~0); {43788#true} is VALID [2020-07-18 00:17:27,751 INFO L280 TraceCheckUtils]: 43: Hoare triple {43788#true} assume !(0 != ~p4~0); {43788#true} is VALID [2020-07-18 00:17:27,751 INFO L280 TraceCheckUtils]: 44: Hoare triple {43788#true} assume !(0 != ~p5~0); {43788#true} is VALID [2020-07-18 00:17:27,752 INFO L280 TraceCheckUtils]: 45: Hoare triple {43788#true} assume 0 != ~p6~0; {43788#true} is VALID [2020-07-18 00:17:27,753 INFO L280 TraceCheckUtils]: 46: Hoare triple {43788#true} ~lk6~0 := 1; {43792#(= 1 main_~lk6~0)} is VALID [2020-07-18 00:17:27,753 INFO L280 TraceCheckUtils]: 47: Hoare triple {43792#(= 1 main_~lk6~0)} assume !(0 != ~p1~0); {43792#(= 1 main_~lk6~0)} is VALID [2020-07-18 00:17:27,754 INFO L280 TraceCheckUtils]: 48: Hoare triple {43792#(= 1 main_~lk6~0)} assume !(0 != ~p2~0); {43792#(= 1 main_~lk6~0)} is VALID [2020-07-18 00:17:27,754 INFO L280 TraceCheckUtils]: 49: Hoare triple {43792#(= 1 main_~lk6~0)} assume !(0 != ~p3~0); {43792#(= 1 main_~lk6~0)} is VALID [2020-07-18 00:17:27,755 INFO L280 TraceCheckUtils]: 50: Hoare triple {43792#(= 1 main_~lk6~0)} assume !(0 != ~p4~0); {43792#(= 1 main_~lk6~0)} is VALID [2020-07-18 00:17:27,755 INFO L280 TraceCheckUtils]: 51: Hoare triple {43792#(= 1 main_~lk6~0)} assume !(0 != ~p5~0); {43792#(= 1 main_~lk6~0)} is VALID [2020-07-18 00:17:27,756 INFO L280 TraceCheckUtils]: 52: Hoare triple {43792#(= 1 main_~lk6~0)} assume 0 != ~p6~0; {43792#(= 1 main_~lk6~0)} is VALID [2020-07-18 00:17:27,756 INFO L280 TraceCheckUtils]: 53: Hoare triple {43792#(= 1 main_~lk6~0)} assume 1 != ~lk6~0; {43789#false} is VALID [2020-07-18 00:17:27,757 INFO L280 TraceCheckUtils]: 54: Hoare triple {43789#false} assume !false; {43789#false} is VALID [2020-07-18 00:17:27,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:17:27,759 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:17:27,759 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2006311643] [2020-07-18 00:17:27,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:17:27,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:17:27,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053873270] [2020-07-18 00:17:27,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2020-07-18 00:17:27,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:17:27,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:17:27,801 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:27,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:17:27,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:17:27,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:17:27,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:17:27,802 INFO L87 Difference]: Start difference. First operand 1103 states and 1294 transitions. Second operand 3 states. [2020-07-18 00:17:30,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:30,435 INFO L93 Difference]: Finished difference Result 1103 states and 1294 transitions. [2020-07-18 00:17:30,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:17:30,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2020-07-18 00:17:30,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:17:30,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:17:30,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2020-07-18 00:17:30,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:17:30,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2020-07-18 00:17:30,437 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 82 transitions. [2020-07-18 00:17:30,511 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:30,511 INFO L225 Difference]: With dead ends: 1103 [2020-07-18 00:17:30,512 INFO L226 Difference]: Without dead ends: 0 [2020-07-18 00:17:30,515 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:17:30,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-18 00:17:30,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-18 00:17:30,515 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:17:30,515 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-18 00:17:30,516 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 00:17:30,516 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 00:17:30,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:30,516 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 00:17:30,516 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:17:30,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:17:30,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:17:30,517 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 00:17:30,517 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 00:17:30,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:30,517 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 00:17:30,517 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:17:30,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:17:30,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:17:30,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:17:30,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:17:30,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-18 00:17:30,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-18 00:17:30,518 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2020-07-18 00:17:30,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:17:30,519 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-18 00:17:30,519 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:17:30,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-18 00:17:30,519 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:30,519 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:17:30,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:17:30,519 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-18 00:17:30,522 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-18 00:17:30,650 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 15 [2020-07-18 00:17:31,603 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-18 00:17:31,939 WARN L193 SmtUtils]: Spent 306.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-18 00:17:32,329 WARN L193 SmtUtils]: Spent 377.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-07-18 00:17:33,318 WARN L193 SmtUtils]: Spent 899.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-07-18 00:17:33,467 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-18 00:17:33,734 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-18 00:17:34,138 WARN L193 SmtUtils]: Spent 396.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-07-18 00:17:34,489 WARN L193 SmtUtils]: Spent 338.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-18 00:17:34,648 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-07-18 00:17:34,933 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-07-18 00:17:35,314 WARN L193 SmtUtils]: Spent 338.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-18 00:17:35,461 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-18 00:17:35,461 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-18 00:17:35,461 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-18 00:17:35,461 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-18 00:17:35,461 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-18 00:17:35,461 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-18 00:17:35,462 INFO L264 CegarLoopResult]: At program point L93(line 93) the Hoare annotation is: (let ((.cse0 (= 1 main_~lk5~0))) (or (and (= 0 main_~p6~0) .cse0) (and (= 1 main_~lk6~0) .cse0))) [2020-07-18 00:17:35,462 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 4 107) the Hoare annotation is: true [2020-07-18 00:17:35,462 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-07-18 00:17:35,462 INFO L264 CegarLoopResult]: At program point L77-1(lines 27 102) the Hoare annotation is: (let ((.cse4 (= 0 main_~p3~0)) (.cse3 (= 1 main_~lk5~0)) (.cse1 (= 0 main_~p4~0)) (.cse6 (= 0 main_~p6~0)) (.cse0 (= 1 main_~lk6~0)) (.cse2 (= 1 main_~lk3~0)) (.cse7 (= 0 main_~p5~0)) (.cse5 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse3 .cse5) (and .cse2 .cse6 .cse3 .cse5) (and .cse0 .cse4 .cse1 .cse3) (and .cse1 .cse2 .cse6 .cse3) (and .cse4 .cse1 .cse7 .cse6) (and .cse0 .cse2 .cse3 .cse5) (and .cse4 .cse1 .cse6 .cse3) (and .cse0 .cse1 .cse2 .cse7) (and .cse0 .cse4 .cse1 .cse7) (and .cse2 .cse7 .cse6 .cse5) (and .cse4 .cse7 .cse6 .cse5) (and .cse0 .cse4 .cse7 .cse5) (and .cse4 .cse6 .cse3 .cse5) (and .cse1 .cse2 .cse7 .cse6) (and .cse0 .cse2 .cse7 .cse5))) [2020-07-18 00:17:35,462 INFO L271 CegarLoopResult]: At program point L36(line 36) the Hoare annotation is: true [2020-07-18 00:17:35,462 INFO L264 CegarLoopResult]: At program point L94(line 94) the Hoare annotation is: (let ((.cse0 (= 1 main_~lk5~0))) (or (and (= 0 main_~p6~0) .cse0) (and (= 1 main_~lk6~0) .cse0))) [2020-07-18 00:17:35,463 INFO L271 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-07-18 00:17:35,463 INFO L271 CegarLoopResult]: At program point L28-1(line 28) the Hoare annotation is: true [2020-07-18 00:17:35,463 INFO L271 CegarLoopResult]: At program point L28-2(line 28) the Hoare annotation is: true [2020-07-18 00:17:35,464 INFO L264 CegarLoopResult]: At program point L78(line 78) the Hoare annotation is: (let ((.cse1 (= 1 main_~lk3~0)) (.cse3 (= 0 main_~p6~0)) (.cse6 (= 1 main_~lk5~0)) (.cse4 (= 1 main_~lk4~0)) (.cse5 (= 1 main_~lk6~0)) (.cse7 (= 0 main_~p3~0)) (.cse0 (= 1 main_~lk2~0)) (.cse8 (= 0 main_~p4~0)) (.cse2 (= 0 main_~p5~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse4) (and .cse7 .cse0 .cse8 .cse3 .cse6) (and .cse5 .cse7 .cse0 .cse8 .cse6) (and .cse5 .cse0 .cse8 .cse1 .cse2) (and .cse5 .cse7 .cse0 .cse6 .cse4) (and .cse7 .cse0 .cse2 .cse3 .cse4) (and .cse0 .cse8 .cse1 .cse3 .cse6) (and .cse5 .cse0 .cse1 .cse2 .cse4) (and .cse5 .cse7 .cse0 .cse2 .cse4) (and .cse5 .cse0 .cse8 .cse1 .cse6) (and .cse7 .cse0 .cse3 .cse6 .cse4) (and .cse0 .cse8 .cse1 .cse2 .cse3) (and .cse7 .cse0 .cse8 .cse2 .cse3) (and .cse0 .cse1 .cse3 .cse6 .cse4) (and .cse5 .cse7 .cse0 .cse8 .cse2))) [2020-07-18 00:17:35,464 INFO L271 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-07-18 00:17:35,464 INFO L271 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-07-18 00:17:35,464 INFO L271 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-07-18 00:17:35,464 INFO L271 CegarLoopResult]: At program point L103(lines 5 107) the Hoare annotation is: true [2020-07-18 00:17:35,464 INFO L271 CegarLoopResult]: At program point L29(lines 29 31) the Hoare annotation is: true [2020-07-18 00:17:35,465 INFO L264 CegarLoopResult]: At program point L62-1(lines 27 102) the Hoare annotation is: (let ((.cse1 (= 0 main_~p4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse3 (= 1 main_~lk5~0)) (.cse5 (= 0 main_~p3~0)) (.cse9 (= 0 main_~p1~0)) (.cse7 (= 0 main_~p2~0)) (.cse2 (= 1 main_~lk3~0)) (.cse6 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk1~0)) (.cse8 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse4) (and .cse5 .cse7 .cse3 .cse4 .cse8) (and .cse7 .cse2 .cse9 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse9 .cse3) (and .cse1 .cse7 .cse2 .cse6 .cse4) (and .cse5 .cse7 .cse9 .cse3 .cse8) (and .cse7 .cse2 .cse3 .cse4 .cse8) (and .cse5 .cse0 .cse1 .cse9 .cse3) (and .cse0 .cse2 .cse6 .cse4 .cse8) (and .cse1 .cse7 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse9 .cse3 .cse8) (and .cse5 .cse7 .cse6 .cse4 .cse8) (and .cse5 .cse0 .cse1 .cse6 .cse9) (and .cse5 .cse1 .cse7 .cse6 .cse4) (and .cse0 .cse2 .cse6 .cse9 .cse8) (and .cse5 .cse0 .cse1 .cse3 .cse4) (and .cse1 .cse7 .cse2 .cse9 .cse3) (and .cse5 .cse1 .cse7 .cse3 .cse4) (and .cse1 .cse7 .cse2 .cse6 .cse9) (and .cse5 .cse0 .cse6 .cse4 .cse8) (and .cse0 .cse2 .cse3 .cse4 .cse8) (and .cse7 .cse2 .cse6 .cse9 .cse8) (and .cse5 .cse1 .cse7 .cse9 .cse3) (and .cse0 .cse1 .cse2 .cse6 .cse9) (and .cse5 .cse0 .cse6 .cse9 .cse8) (and .cse0 .cse2 .cse9 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse6 .cse4) (and .cse5 .cse1 .cse7 .cse6 .cse9) (and .cse5 .cse0 .cse3 .cse4 .cse8) (and .cse5 .cse7 .cse6 .cse9 .cse8) (and .cse7 .cse2 .cse6 .cse4 .cse8))) [2020-07-18 00:17:35,465 INFO L264 CegarLoopResult]: At program point L87-1(lines 27 102) the Hoare annotation is: (let ((.cse1 (= 1 main_~lk5~0)) (.cse2 (= 1 main_~lk6~0)) (.cse3 (= 0 main_~p5~0)) (.cse0 (= 0 main_~p6~0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and .cse2 .cse3) (and .cse3 .cse0))) [2020-07-18 00:17:35,465 INFO L271 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-07-18 00:17:35,465 INFO L264 CegarLoopResult]: At program point L54-1(lines 27 102) the Hoare annotation is: (let ((.cse5 (= 0 main_~p1~0)) (.cse3 (= 0 main_~p3~0)) (.cse0 (= 1 main_~lk2~0)) (.cse4 (= 0 main_~p2~0)) (.cse1 (= 1 main_~lk3~0)) (.cse2 (= 1 main_~lk1~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse4 .cse1 .cse5) (and .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse5) (and .cse3 .cse0 .cse5) (and .cse3 .cse0 .cse2) (and .cse4 .cse1 .cse2))) [2020-07-18 00:17:35,465 INFO L271 CegarLoopResult]: At program point L21-1(line 21) the Hoare annotation is: true [2020-07-18 00:17:35,465 INFO L271 CegarLoopResult]: At program point L21-2(line 21) the Hoare annotation is: true [2020-07-18 00:17:35,466 INFO L264 CegarLoopResult]: At program point L79(line 79) the Hoare annotation is: (let ((.cse1 (= 1 main_~lk3~0)) (.cse3 (= 0 main_~p6~0)) (.cse7 (= 1 main_~lk5~0)) (.cse4 (= 1 main_~lk4~0)) (.cse8 (= 1 main_~lk6~0)) (.cse5 (= 0 main_~p3~0)) (.cse0 (= 1 main_~lk2~0)) (.cse6 (= 0 main_~p4~0)) (.cse2 (= 0 main_~p5~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse6 .cse3 .cse7) (and .cse8 .cse0 .cse1 .cse7 .cse4) (and .cse8 .cse5 .cse0 .cse6 .cse7) (and .cse8 .cse0 .cse6 .cse1 .cse2) (and .cse8 .cse5 .cse0 .cse7 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse4) (and .cse0 .cse6 .cse1 .cse3 .cse7) (and .cse8 .cse0 .cse1 .cse2 .cse4) (and .cse8 .cse5 .cse0 .cse2 .cse4) (and .cse8 .cse0 .cse6 .cse1 .cse7) (and .cse5 .cse0 .cse3 .cse7 .cse4) (and .cse0 .cse6 .cse1 .cse2 .cse3) (and .cse5 .cse0 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse3 .cse7 .cse4) (and .cse8 .cse5 .cse0 .cse6 .cse2))) [2020-07-18 00:17:35,466 INFO L271 CegarLoopResult]: At program point L46(lines 46 48) the Hoare annotation is: true [2020-07-18 00:17:35,466 INFO L271 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: true [2020-07-18 00:17:35,466 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 4 107) the Hoare annotation is: true [2020-07-18 00:17:35,466 INFO L264 CegarLoopResult]: At program point L46-2(lines 27 102) the Hoare annotation is: (or (= 0 main_~p1~0) (= 1 main_~lk1~0)) [2020-07-18 00:17:35,466 INFO L271 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: true [2020-07-18 00:17:35,466 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 105) the Hoare annotation is: false [2020-07-18 00:17:35,467 INFO L264 CegarLoopResult]: At program point L63(line 63) the Hoare annotation is: (let ((.cse7 (= 0 main_~p2~0)) (.cse4 (= 0 main_~p3~0)) (.cse2 (= 0 main_~p1~0)) (.cse3 (= 1 main_~lk4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse5 (= 0 main_~p4~0)) (.cse1 (= 1 main_~lk3~0)) (.cse6 (= 1 main_~lk1~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse6) (and .cse7 .cse1 .cse6 .cse3) (and .cse5 .cse7 .cse1 .cse6) (and .cse4 .cse0 .cse6 .cse3) (and .cse4 .cse7 .cse6 .cse3) (and .cse7 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse7 .cse6) (and .cse5 .cse7 .cse1 .cse2) (and .cse4 .cse0 .cse5 .cse2) (and .cse4 .cse5 .cse7 .cse2) (and .cse4 .cse7 .cse2 .cse3) (and .cse4 .cse0 .cse2 .cse3) (and .cse0 .cse5 .cse1 .cse2) (and .cse0 .cse1 .cse6 .cse3) (and .cse0 .cse5 .cse1 .cse6))) [2020-07-18 00:17:35,467 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 107) the Hoare annotation is: true [2020-07-18 00:17:35,467 INFO L264 CegarLoopResult]: At program point L88(line 88) the Hoare annotation is: (let ((.cse1 (= 0 main_~p6~0)) (.cse0 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk6~0)) (.cse3 (= 1 main_~lk5~0)) (.cse2 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse2) (and .cse4 .cse0 .cse2) (and .cse4 .cse3 .cse2))) [2020-07-18 00:17:35,467 INFO L264 CegarLoopResult]: At program point L55(line 55) the Hoare annotation is: (let ((.cse0 (= 0 main_~p2~0)) (.cse1 (= 0 main_~p1~0)) (.cse3 (= 1 main_~lk2~0)) (.cse2 (= 1 main_~lk1~0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and .cse3 .cse1) (and .cse3 .cse2))) [2020-07-18 00:17:35,467 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-07-18 00:17:35,467 INFO L271 CegarLoopResult]: At program point L47(line 47) the Hoare annotation is: true [2020-07-18 00:17:35,468 INFO L264 CegarLoopResult]: At program point L72-1(lines 27 102) the Hoare annotation is: (let ((.cse3 (= 0 main_~p6~0)) (.cse9 (= 1 main_~lk5~0)) (.cse4 (= 1 main_~lk4~0)) (.cse6 (= 0 main_~p2~0)) (.cse1 (= 1 main_~lk3~0)) (.cse7 (= 1 main_~lk6~0)) (.cse8 (= 0 main_~p3~0)) (.cse0 (= 1 main_~lk2~0)) (.cse5 (= 0 main_~p4~0)) (.cse2 (= 0 main_~p5~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse1 .cse2 .cse3) (and .cse7 .cse8 .cse0 .cse5 .cse9) (and .cse8 .cse5 .cse6 .cse2 .cse3) (and .cse7 .cse8 .cse6 .cse9 .cse4) (and .cse8 .cse6 .cse3 .cse9 .cse4) (and .cse6 .cse1 .cse2 .cse3 .cse4) (and .cse7 .cse8 .cse0 .cse9 .cse4) (and .cse5 .cse6 .cse1 .cse3 .cse9) (and .cse7 .cse8 .cse6 .cse2 .cse4) (and .cse0 .cse5 .cse1 .cse3 .cse9) (and .cse7 .cse0 .cse1 .cse2 .cse4) (and .cse7 .cse0 .cse5 .cse1 .cse9) (and .cse8 .cse0 .cse3 .cse9 .cse4) (and .cse8 .cse0 .cse5 .cse2 .cse3) (and .cse0 .cse5 .cse1 .cse2 .cse3) (and .cse8 .cse0 .cse5 .cse3 .cse9) (and .cse7 .cse0 .cse1 .cse9 .cse4) (and .cse6 .cse1 .cse3 .cse9 .cse4) (and .cse7 .cse0 .cse5 .cse1 .cse2) (and .cse7 .cse6 .cse1 .cse2 .cse4) (and .cse8 .cse0 .cse2 .cse3 .cse4) (and .cse7 .cse5 .cse6 .cse1 .cse9) (and .cse8 .cse5 .cse6 .cse3 .cse9) (and .cse8 .cse6 .cse2 .cse3 .cse4) (and .cse7 .cse8 .cse0 .cse2 .cse4) (and .cse7 .cse8 .cse5 .cse6 .cse9) (and .cse7 .cse6 .cse1 .cse9 .cse4) (and .cse0 .cse1 .cse3 .cse9 .cse4) (and .cse7 .cse8 .cse5 .cse6 .cse2) (and .cse7 .cse5 .cse6 .cse1 .cse2) (and .cse7 .cse8 .cse0 .cse5 .cse2))) [2020-07-18 00:17:35,468 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-07-18 00:17:35,468 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-07-18 00:17:35,468 INFO L271 CegarLoopResult]: At program point L97-1(lines 27 102) the Hoare annotation is: true [2020-07-18 00:17:35,468 INFO L264 CegarLoopResult]: At program point L89(line 89) the Hoare annotation is: (let ((.cse1 (= 0 main_~p6~0)) (.cse0 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk6~0)) (.cse3 (= 1 main_~lk5~0)) (.cse2 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse2) (and .cse4 .cse0 .cse2) (and .cse4 .cse3 .cse2))) [2020-07-18 00:17:35,468 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-07-18 00:17:35,469 INFO L271 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: true [2020-07-18 00:17:35,469 INFO L271 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: true [2020-07-18 00:17:35,469 INFO L264 CegarLoopResult]: At program point L106(line 106) the Hoare annotation is: false [2020-07-18 00:17:35,469 INFO L264 CegarLoopResult]: At program point L73(line 73) the Hoare annotation is: (let ((.cse8 (= 0 main_~p5~0)) (.cse9 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p2~0)) (.cse7 (= 1 main_~lk3~0)) (.cse5 (= 1 main_~lk4~0)) (.cse0 (= 0 main_~p3~0)) (.cse10 (= 1 main_~lk2~0)) (.cse6 (= 0 main_~p4~0)) (.cse2 (= 0 main_~p6~0)) (.cse3 (= 1 main_~lk5~0)) (.cse4 (= 1 main_~lk1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse1 .cse7 .cse8 .cse2 .cse4) (and .cse1 .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse9 .cse0 .cse6 .cse1 .cse8 .cse4) (and .cse6 .cse1 .cse7 .cse2 .cse3 .cse4) (and .cse9 .cse0 .cse10 .cse6 .cse3 .cse4) (and .cse9 .cse10 .cse7 .cse3 .cse4 .cse5) (and .cse9 .cse10 .cse7 .cse8 .cse4 .cse5) (and .cse9 .cse6 .cse1 .cse7 .cse3 .cse4) (and .cse0 .cse1 .cse8 .cse2 .cse4 .cse5) (and .cse9 .cse0 .cse10 .cse6 .cse8 .cse4) (and .cse9 .cse1 .cse7 .cse8 .cse4 .cse5) (and .cse1 .cse7 .cse8 .cse2 .cse4 .cse5) (and .cse9 .cse10 .cse6 .cse7 .cse8 .cse4) (and .cse10 .cse6 .cse7 .cse8 .cse2 .cse4) (and .cse10 .cse6 .cse7 .cse2 .cse3 .cse4) (and .cse0 .cse10 .cse6 .cse8 .cse2 .cse4) (and .cse0 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse9 .cse10 .cse6 .cse7 .cse3 .cse4) (and .cse9 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse9 .cse6 .cse1 .cse7 .cse8 .cse4) (and .cse0 .cse10 .cse8 .cse2 .cse4 .cse5) (and .cse9 .cse0 .cse10 .cse3 .cse4 .cse5) (and .cse9 .cse0 .cse1 .cse8 .cse4 .cse5) (and .cse10 .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse1 .cse8 .cse2 .cse4) (and .cse9 .cse0 .cse10 .cse8 .cse4 .cse5) (and .cse10 .cse7 .cse8 .cse2 .cse4 .cse5) (and .cse9 .cse0 .cse6 .cse1 .cse3 .cse4) (and .cse0 .cse6 .cse1 .cse2 .cse3 .cse4) (and .cse9 .cse1 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse10 .cse6 .cse2 .cse3 .cse4))) [2020-07-18 00:17:35,469 INFO L271 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: true [2020-07-18 00:17:35,469 INFO L271 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: true [2020-07-18 00:17:35,470 INFO L264 CegarLoopResult]: At program point L98(line 98) the Hoare annotation is: (= 1 main_~lk6~0) [2020-07-18 00:17:35,470 INFO L264 CegarLoopResult]: At program point L98-1(lines 5 107) the Hoare annotation is: false [2020-07-18 00:17:35,470 INFO L271 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: true [2020-07-18 00:17:35,470 INFO L264 CegarLoopResult]: At program point L82-1(lines 27 102) the Hoare annotation is: (let ((.cse4 (= 0 main_~p6~0)) (.cse2 (= 1 main_~lk5~0)) (.cse5 (= 1 main_~lk4~0)) (.cse0 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p4~0)) (.cse3 (= 0 main_~p5~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse4 .cse2 .cse5) (and .cse1 .cse4 .cse2) (and .cse0 .cse3 .cse5) (and .cse1 .cse3 .cse4) (and .cse0 .cse2 .cse5) (and .cse0 .cse1 .cse3))) [2020-07-18 00:17:35,470 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-07-18 00:17:35,471 INFO L264 CegarLoopResult]: At program point L74(line 74) the Hoare annotation is: (let ((.cse8 (= 0 main_~p5~0)) (.cse9 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p2~0)) (.cse7 (= 1 main_~lk3~0)) (.cse5 (= 1 main_~lk4~0)) (.cse0 (= 0 main_~p3~0)) (.cse10 (= 1 main_~lk2~0)) (.cse6 (= 0 main_~p4~0)) (.cse2 (= 0 main_~p6~0)) (.cse3 (= 1 main_~lk5~0)) (.cse4 (= 1 main_~lk1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse1 .cse7 .cse8 .cse2 .cse4) (and .cse1 .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse9 .cse0 .cse6 .cse1 .cse8 .cse4) (and .cse6 .cse1 .cse7 .cse2 .cse3 .cse4) (and .cse9 .cse0 .cse10 .cse6 .cse3 .cse4) (and .cse9 .cse10 .cse7 .cse3 .cse4 .cse5) (and .cse9 .cse10 .cse7 .cse8 .cse4 .cse5) (and .cse9 .cse6 .cse1 .cse7 .cse3 .cse4) (and .cse9 .cse1 .cse7 .cse8 .cse4 .cse5) (and .cse0 .cse1 .cse8 .cse2 .cse4 .cse5) (and .cse9 .cse0 .cse10 .cse6 .cse8 .cse4) (and .cse1 .cse7 .cse8 .cse2 .cse4 .cse5) (and .cse9 .cse10 .cse6 .cse7 .cse8 .cse4) (and .cse10 .cse6 .cse7 .cse8 .cse2 .cse4) (and .cse10 .cse6 .cse7 .cse2 .cse3 .cse4) (and .cse0 .cse10 .cse6 .cse8 .cse2 .cse4) (and .cse0 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse9 .cse10 .cse6 .cse7 .cse3 .cse4) (and .cse9 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse9 .cse6 .cse1 .cse7 .cse8 .cse4) (and .cse0 .cse10 .cse8 .cse2 .cse4 .cse5) (and .cse9 .cse0 .cse10 .cse3 .cse4 .cse5) (and .cse9 .cse0 .cse10 .cse8 .cse4 .cse5) (and .cse10 .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse1 .cse8 .cse2 .cse4) (and .cse9 .cse0 .cse1 .cse8 .cse4 .cse5) (and .cse10 .cse7 .cse8 .cse2 .cse4 .cse5) (and .cse0 .cse6 .cse1 .cse2 .cse3 .cse4) (and .cse9 .cse0 .cse6 .cse1 .cse3 .cse4) (and .cse9 .cse1 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse10 .cse6 .cse2 .cse3 .cse4))) [2020-07-18 00:17:35,471 INFO L264 CegarLoopResult]: At program point L99(line 99) the Hoare annotation is: (= 1 main_~lk6~0) [2020-07-18 00:17:35,471 INFO L264 CegarLoopResult]: At program point L66-1(lines 27 102) the Hoare annotation is: (let ((.cse2 (= 0 main_~p5~0)) (.cse11 (= 1 main_~lk6~0)) (.cse6 (= 0 main_~p2~0)) (.cse10 (= 1 main_~lk3~0)) (.cse9 (= 0 main_~p4~0)) (.cse8 (= 1 main_~lk1~0)) (.cse0 (= 0 main_~p3~0)) (.cse1 (= 1 main_~lk2~0)) (.cse3 (= 0 main_~p6~0)) (.cse4 (= 0 main_~p1~0)) (.cse7 (= 1 main_~lk5~0)) (.cse5 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse3 .cse7 .cse8 .cse5) (and .cse0 .cse9 .cse6 .cse3 .cse4 .cse7) (and .cse9 .cse6 .cse10 .cse2 .cse3 .cse8) (and .cse11 .cse0 .cse1 .cse4 .cse7 .cse5) (and .cse6 .cse10 .cse3 .cse7 .cse8 .cse5) (and .cse11 .cse1 .cse9 .cse10 .cse4 .cse7) (and .cse11 .cse0 .cse9 .cse6 .cse2 .cse4) (and .cse6 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse8 .cse5) (and .cse1 .cse10 .cse3 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse6 .cse2 .cse4 .cse5) (and .cse0 .cse9 .cse6 .cse2 .cse3 .cse4) (and .cse1 .cse9 .cse10 .cse2 .cse3 .cse8) (and .cse1 .cse9 .cse10 .cse3 .cse7 .cse8) (and .cse1 .cse9 .cse10 .cse2 .cse3 .cse4) (and .cse11 .cse1 .cse10 .cse2 .cse4 .cse5) (and .cse11 .cse1 .cse9 .cse10 .cse7 .cse8) (and .cse11 .cse0 .cse6 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse6 .cse7 .cse8 .cse5) (and .cse1 .cse9 .cse10 .cse3 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse9 .cse6 .cse10 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse6 .cse2 .cse8 .cse5) (and .cse1 .cse10 .cse3 .cse7 .cse8 .cse5) (and .cse6 .cse10 .cse3 .cse4 .cse7 .cse5) (and .cse0 .cse9 .cse6 .cse3 .cse7 .cse8) (and .cse11 .cse0 .cse9 .cse6 .cse7 .cse8) (and .cse11 .cse0 .cse1 .cse9 .cse2 .cse4) (and .cse11 .cse1 .cse9 .cse10 .cse2 .cse4) (and .cse11 .cse6 .cse10 .cse2 .cse4 .cse5) (and .cse9 .cse6 .cse10 .cse3 .cse4 .cse7) (and .cse11 .cse1 .cse10 .cse4 .cse7 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse4 .cse5) (and .cse11 .cse6 .cse10 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse9 .cse6 .cse2 .cse8) (and .cse9 .cse6 .cse10 .cse3 .cse7 .cse8) (and .cse11 .cse0 .cse1 .cse9 .cse7 .cse8) (and .cse11 .cse1 .cse10 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse9 .cse4 .cse7) (and .cse11 .cse1 .cse10 .cse2 .cse8 .cse5) (and .cse11 .cse0 .cse9 .cse6 .cse4 .cse7) (and .cse11 .cse9 .cse6 .cse10 .cse4 .cse7) (and .cse11 .cse9 .cse6 .cse10 .cse7 .cse8) (and .cse11 .cse0 .cse1 .cse9 .cse2 .cse8) (and .cse11 .cse6 .cse10 .cse2 .cse8 .cse5) (and .cse6 .cse10 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse1 .cse9 .cse10 .cse2 .cse8) (and .cse0 .cse6 .cse3 .cse4 .cse7 .cse5) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse8) (and .cse0 .cse1 .cse3 .cse7 .cse8 .cse5) (and .cse11 .cse9 .cse6 .cse10 .cse2 .cse4) (and .cse11 .cse9 .cse6 .cse10 .cse2 .cse8) (and .cse0 .cse1 .cse9 .cse3 .cse4 .cse7) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4) (and .cse11 .cse0 .cse1 .cse2 .cse8 .cse5) (and .cse0 .cse9 .cse6 .cse2 .cse3 .cse8) (and .cse1 .cse10 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse2 .cse4 .cse5) (and .cse11 .cse6 .cse10 .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse9 .cse3 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse4 .cse7 .cse5))) [2020-07-18 00:17:35,472 INFO L271 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-07-18 00:17:35,472 INFO L264 CegarLoopResult]: At program point L58-1(lines 27 102) the Hoare annotation is: (let ((.cse7 (= 0 main_~p2~0)) (.cse4 (= 0 main_~p3~0)) (.cse2 (= 0 main_~p1~0)) (.cse5 (= 0 main_~p4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse1 (= 1 main_~lk3~0)) (.cse6 (= 1 main_~lk1~0)) (.cse3 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse6) (and .cse7 .cse1 .cse6 .cse3) (and .cse4 .cse0 .cse6 .cse3) (and .cse5 .cse7 .cse1 .cse6) (and .cse4 .cse7 .cse6 .cse3) (and .cse7 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse7 .cse6) (and .cse5 .cse7 .cse1 .cse2) (and .cse4 .cse0 .cse5 .cse2) (and .cse4 .cse5 .cse7 .cse2) (and .cse4 .cse7 .cse2 .cse3) (and .cse4 .cse0 .cse2 .cse3) (and .cse0 .cse5 .cse1 .cse2) (and .cse0 .cse5 .cse1 .cse6) (and .cse0 .cse1 .cse6 .cse3))) [2020-07-18 00:17:35,472 INFO L264 CegarLoopResult]: At program point L83(line 83) the Hoare annotation is: (let ((.cse2 (= 1 main_~lk5~0)) (.cse5 (= 0 main_~p4~0)) (.cse1 (= 0 main_~p6~0)) (.cse4 (= 1 main_~lk6~0)) (.cse0 (= 1 main_~lk3~0)) (.cse6 (= 0 main_~p5~0)) (.cse3 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse1 .cse2) (and .cse4 .cse0 .cse2 .cse3) (and .cse4 .cse5 .cse0 .cse6) (and .cse0 .cse6 .cse1 .cse3) (and .cse5 .cse0 .cse6 .cse1) (and .cse4 .cse0 .cse6 .cse3))) [2020-07-18 00:17:35,472 INFO L264 CegarLoopResult]: At program point L50-1(lines 27 102) the Hoare annotation is: (let ((.cse0 (= 0 main_~p2~0)) (.cse1 (= 0 main_~p1~0)) (.cse3 (= 1 main_~lk2~0)) (.cse2 (= 1 main_~lk1~0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and .cse3 .cse1) (and .cse3 .cse2))) [2020-07-18 00:17:35,472 INFO L271 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: true [2020-07-18 00:17:35,473 INFO L271 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-07-18 00:17:35,473 INFO L271 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: true [2020-07-18 00:17:35,473 INFO L271 CegarLoopResult]: At program point L9-2(line 9) the Hoare annotation is: true [2020-07-18 00:17:35,473 INFO L264 CegarLoopResult]: At program point L67(line 67) the Hoare annotation is: (let ((.cse1 (= 0 main_~p4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse3 (= 1 main_~lk5~0)) (.cse5 (= 0 main_~p3~0)) (.cse9 (= 0 main_~p1~0)) (.cse7 (= 0 main_~p2~0)) (.cse2 (= 1 main_~lk3~0)) (.cse6 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk1~0)) (.cse8 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse4) (and .cse5 .cse7 .cse3 .cse4 .cse8) (and .cse7 .cse2 .cse9 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse9 .cse3) (and .cse1 .cse7 .cse2 .cse6 .cse4) (and .cse5 .cse7 .cse9 .cse3 .cse8) (and .cse7 .cse2 .cse3 .cse4 .cse8) (and .cse5 .cse0 .cse1 .cse9 .cse3) (and .cse0 .cse2 .cse6 .cse4 .cse8) (and .cse1 .cse7 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse9 .cse3 .cse8) (and .cse5 .cse7 .cse6 .cse4 .cse8) (and .cse5 .cse0 .cse1 .cse6 .cse9) (and .cse5 .cse1 .cse7 .cse6 .cse4) (and .cse0 .cse2 .cse6 .cse9 .cse8) (and .cse5 .cse0 .cse1 .cse3 .cse4) (and .cse1 .cse7 .cse2 .cse9 .cse3) (and .cse5 .cse1 .cse7 .cse3 .cse4) (and .cse1 .cse7 .cse2 .cse6 .cse9) (and .cse7 .cse2 .cse6 .cse9 .cse8) (and .cse0 .cse2 .cse3 .cse4 .cse8) (and .cse5 .cse0 .cse6 .cse4 .cse8) (and .cse0 .cse1 .cse2 .cse6 .cse9) (and .cse5 .cse1 .cse7 .cse9 .cse3) (and .cse0 .cse2 .cse9 .cse3 .cse8) (and .cse5 .cse0 .cse6 .cse9 .cse8) (and .cse0 .cse1 .cse2 .cse6 .cse4) (and .cse5 .cse1 .cse7 .cse6 .cse9) (and .cse5 .cse0 .cse3 .cse4 .cse8) (and .cse5 .cse7 .cse6 .cse9 .cse8) (and .cse7 .cse2 .cse6 .cse4 .cse8))) [2020-07-18 00:17:35,473 INFO L271 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: true [2020-07-18 00:17:35,474 INFO L264 CegarLoopResult]: At program point L59(line 59) the Hoare annotation is: (let ((.cse5 (= 0 main_~p1~0)) (.cse3 (= 0 main_~p3~0)) (.cse0 (= 1 main_~lk2~0)) (.cse4 (= 0 main_~p2~0)) (.cse1 (= 1 main_~lk3~0)) (.cse2 (= 1 main_~lk1~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse4 .cse1 .cse5) (and .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse5) (and .cse3 .cse0 .cse5) (and .cse3 .cse0 .cse2) (and .cse4 .cse1 .cse2))) [2020-07-18 00:17:35,474 INFO L264 CegarLoopResult]: At program point L92-1(lines 27 102) the Hoare annotation is: (or (= 1 main_~lk6~0) (= 0 main_~p6~0)) [2020-07-18 00:17:35,474 INFO L264 CegarLoopResult]: At program point L84(line 84) the Hoare annotation is: (let ((.cse2 (= 1 main_~lk5~0)) (.cse5 (= 0 main_~p4~0)) (.cse1 (= 0 main_~p6~0)) (.cse4 (= 1 main_~lk6~0)) (.cse0 (= 1 main_~lk3~0)) (.cse6 (= 0 main_~p5~0)) (.cse3 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse1 .cse2) (and .cse4 .cse0 .cse2 .cse3) (and .cse4 .cse5 .cse0 .cse6) (and .cse0 .cse6 .cse1 .cse3) (and .cse5 .cse0 .cse6 .cse1) (and .cse4 .cse0 .cse6 .cse3))) [2020-07-18 00:17:35,474 INFO L264 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: (or (= 0 main_~p1~0) (= 1 main_~lk1~0)) [2020-07-18 00:17:35,474 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-07-18 00:17:35,474 INFO L271 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: true [2020-07-18 00:17:35,474 INFO L271 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: true [2020-07-18 00:17:35,474 INFO L271 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: true [2020-07-18 00:17:35,533 INFO L163 areAnnotationChecker]: CFG has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-18 00:17:35,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 12:17:35 BoogieIcfgContainer [2020-07-18 00:17:35,545 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-18 00:17:35,547 INFO L168 Benchmark]: Toolchain (without parser) took 50566.21 ms. Allocated memory was 143.1 MB in the beginning and 570.9 MB in the end (delta: 427.8 MB). Free memory was 100.2 MB in the beginning and 441.8 MB in the end (delta: -341.7 MB). Peak memory consumption was 86.2 MB. Max. memory is 7.1 GB. [2020-07-18 00:17:35,548 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 143.1 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-18 00:17:35,548 INFO L168 Benchmark]: CACSL2BoogieTranslator took 291.34 ms. Allocated memory is still 143.1 MB. Free memory was 99.8 MB in the beginning and 89.3 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2020-07-18 00:17:35,549 INFO L168 Benchmark]: Boogie Preprocessor took 122.01 ms. Allocated memory was 143.1 MB in the beginning and 199.8 MB in the end (delta: 56.6 MB). Free memory was 89.3 MB in the beginning and 179.6 MB in the end (delta: -90.2 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. [2020-07-18 00:17:35,549 INFO L168 Benchmark]: RCFGBuilder took 502.35 ms. Allocated memory is still 199.8 MB. Free memory was 179.6 MB in the beginning and 148.3 MB in the end (delta: 31.3 MB). Peak memory consumption was 31.3 MB. Max. memory is 7.1 GB. [2020-07-18 00:17:35,550 INFO L168 Benchmark]: TraceAbstraction took 49643.22 ms. Allocated memory was 199.8 MB in the beginning and 570.9 MB in the end (delta: 371.2 MB). Free memory was 148.3 MB in the beginning and 441.8 MB in the end (delta: -293.6 MB). Peak memory consumption was 77.6 MB. Max. memory is 7.1 GB. [2020-07-18 00:17:35,553 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.25 ms. Allocated memory is still 143.1 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 291.34 ms. Allocated memory is still 143.1 MB. Free memory was 99.8 MB in the beginning and 89.3 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 122.01 ms. Allocated memory was 143.1 MB in the beginning and 199.8 MB in the end (delta: 56.6 MB). Free memory was 89.3 MB in the beginning and 179.6 MB in the end (delta: -90.2 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 502.35 ms. Allocated memory is still 199.8 MB. Free memory was 179.6 MB in the beginning and 148.3 MB in the end (delta: 31.3 MB). Peak memory consumption was 31.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 49643.22 ms. Allocated memory was 199.8 MB in the beginning and 570.9 MB in the end (delta: 371.2 MB). Free memory was 148.3 MB in the beginning and 441.8 MB in the end (delta: -293.6 MB). Peak memory consumption was 77.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 105]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 4]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 44.5s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 22.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1351 SDtfs, 477 SDslu, 950 SDs, 0 SdLazy, 59 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1103occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.6s AutomataMinimizationTime, 12 MinimizatonAttempts, 509 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 78 LocationsWithAnnotation, 78 PreInvPairs, 2134 NumberOfFragments, 5844 HoareAnnotationTreeSize, 78 FomulaSimplifications, 32094 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 78 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 3.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...