/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_8.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:17:05,617 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:17:05,620 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:17:05,636 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:17:05,637 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:17:05,639 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:17:05,641 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:17:05,648 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:17:05,653 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:17:05,654 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:17:05,655 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:17:05,656 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:17:05,657 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:17:05,658 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:17:05,661 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:17:05,662 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:17:05,664 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:17:05,665 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:17:05,667 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:17:05,672 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:17:05,674 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:17:05,678 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:17:05,681 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:17:05,681 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:17:05,684 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:17:05,684 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:17:05,684 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:17:05,688 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:17:05,689 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:17:05,690 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:17:05,691 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:17:05,692 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:17:05,693 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:17:05,694 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:17:05,697 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:17:05,698 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:17:05,698 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:17:05,699 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:17:05,699 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:17:05,700 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:17:05,701 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:17:05,702 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:17:05,717 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:17:05,717 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:17:05,720 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:17:05,720 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:17:05,720 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:17:05,720 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:17:05,720 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:17:05,721 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:17:05,721 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:17:05,721 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:17:05,722 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:17:05,722 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:17:05,722 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:17:05,723 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:17:05,723 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:17:05,723 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:17:05,723 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:17:05,724 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:17:05,724 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:17:05,724 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:17:05,724 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:17:05,724 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:17:05,725 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:17:05,976 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:17:05,990 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:17:05,995 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:17:05,996 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:17:05,997 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:17:05,998 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_8.c [2020-07-18 00:17:06,071 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9b91ee31/80cfbea365f8476cb1baa3f2216f2e47/FLAG0cfb87b16 [2020-07-18 00:17:06,577 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:17:06,578 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_8.c [2020-07-18 00:17:06,588 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9b91ee31/80cfbea365f8476cb1baa3f2216f2e47/FLAG0cfb87b16 [2020-07-18 00:17:06,889 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9b91ee31/80cfbea365f8476cb1baa3f2216f2e47 [2020-07-18 00:17:06,898 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:17:06,901 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:17:06,902 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:17:06,903 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:17:06,906 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:17:06,908 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:17:06" (1/1) ... [2020-07-18 00:17:06,911 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fc51f36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:17:06, skipping insertion in model container [2020-07-18 00:17:06,911 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:17:06" (1/1) ... [2020-07-18 00:17:06,919 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:17:06,946 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:17:07,113 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:17:07,124 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:17:07,178 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:17:07,192 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:17:07,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:17:07 WrapperNode [2020-07-18 00:17:07,193 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:17:07,194 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:17:07,194 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:17:07,194 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:17:07,292 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:17:07" (1/1) ... [2020-07-18 00:17:07,292 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:17:07" (1/1) ... [2020-07-18 00:17:07,299 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:17:07" (1/1) ... [2020-07-18 00:17:07,299 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:17:07" (1/1) ... [2020-07-18 00:17:07,306 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:17:07" (1/1) ... [2020-07-18 00:17:07,315 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:17:07" (1/1) ... [2020-07-18 00:17:07,317 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:17:07" (1/1) ... [2020-07-18 00:17:07,319 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:17:07,319 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:17:07,320 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:17:07,320 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:17:07,321 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:17:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:17:07,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:17:07,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:17:07,393 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:17:07,393 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:17:07,394 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 00:17:07,394 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:17:07,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:17:07,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:17:07,951 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:17:07,952 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-18 00:17:07,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:17:07 BoogieIcfgContainer [2020-07-18 00:17:07,957 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:17:07,958 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:17:07,959 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:17:07,962 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:17:07,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:17:06" (1/3) ... [2020-07-18 00:17:07,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32f77935 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:17:07, skipping insertion in model container [2020-07-18 00:17:07,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:17:07" (2/3) ... [2020-07-18 00:17:07,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32f77935 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:17:07, skipping insertion in model container [2020-07-18 00:17:07,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:17:07" (3/3) ... [2020-07-18 00:17:07,966 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2020-07-18 00:17:07,977 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:17:07,986 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:17:08,001 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:17:08,024 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:17:08,024 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:17:08,024 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:17:08,024 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:17:08,025 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:17:08,025 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:17:08,025 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:17:08,025 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:17:08,043 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2020-07-18 00:17:08,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-07-18 00:17:08,057 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:17:08,059 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, 1, 1, 1, 1, 1, 1] [2020-07-18 00:17:08,059 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:17:08,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:17:08,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1717644884, now seen corresponding path program 1 times [2020-07-18 00:17:08,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:17:08,076 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [936214520] [2020-07-18 00:17:08,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:17:08,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:17:08,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:17:08,316 INFO L280 TraceCheckUtils]: 0: Hoare triple {101#true} assume true; {101#true} is VALID [2020-07-18 00:17:08,317 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {101#true} {101#true} #223#return; {101#true} is VALID [2020-07-18 00:17:08,319 INFO L263 TraceCheckUtils]: 0: Hoare triple {101#true} call ULTIMATE.init(); {101#true} is VALID [2020-07-18 00:17:08,320 INFO L280 TraceCheckUtils]: 1: Hoare triple {101#true} assume true; {101#true} is VALID [2020-07-18 00:17:08,320 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {101#true} {101#true} #223#return; {101#true} is VALID [2020-07-18 00:17:08,321 INFO L263 TraceCheckUtils]: 3: Hoare triple {101#true} call #t~ret9 := main(); {101#true} is VALID [2020-07-18 00:17:08,321 INFO L280 TraceCheckUtils]: 4: Hoare triple {101#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {101#true} is VALID [2020-07-18 00:17:08,322 INFO L280 TraceCheckUtils]: 5: Hoare triple {101#true} ~p1~0 := #t~nondet0; {101#true} is VALID [2020-07-18 00:17:08,322 INFO L280 TraceCheckUtils]: 6: Hoare triple {101#true} havoc #t~nondet0; {101#true} is VALID [2020-07-18 00:17:08,323 INFO L280 TraceCheckUtils]: 7: Hoare triple {101#true} havoc ~lk1~0; {101#true} is VALID [2020-07-18 00:17:08,323 INFO L280 TraceCheckUtils]: 8: Hoare triple {101#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {101#true} is VALID [2020-07-18 00:17:08,324 INFO L280 TraceCheckUtils]: 9: Hoare triple {101#true} ~p2~0 := #t~nondet1; {101#true} is VALID [2020-07-18 00:17:08,324 INFO L280 TraceCheckUtils]: 10: Hoare triple {101#true} havoc #t~nondet1; {101#true} is VALID [2020-07-18 00:17:08,324 INFO L280 TraceCheckUtils]: 11: Hoare triple {101#true} havoc ~lk2~0; {101#true} is VALID [2020-07-18 00:17:08,325 INFO L280 TraceCheckUtils]: 12: Hoare triple {101#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {101#true} is VALID [2020-07-18 00:17:08,325 INFO L280 TraceCheckUtils]: 13: Hoare triple {101#true} ~p3~0 := #t~nondet2; {101#true} is VALID [2020-07-18 00:17:08,326 INFO L280 TraceCheckUtils]: 14: Hoare triple {101#true} havoc #t~nondet2; {101#true} is VALID [2020-07-18 00:17:08,326 INFO L280 TraceCheckUtils]: 15: Hoare triple {101#true} havoc ~lk3~0; {101#true} is VALID [2020-07-18 00:17:08,326 INFO L280 TraceCheckUtils]: 16: Hoare triple {101#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {101#true} is VALID [2020-07-18 00:17:08,327 INFO L280 TraceCheckUtils]: 17: Hoare triple {101#true} ~p4~0 := #t~nondet3; {101#true} is VALID [2020-07-18 00:17:08,328 INFO L280 TraceCheckUtils]: 18: Hoare triple {101#true} havoc #t~nondet3; {101#true} is VALID [2020-07-18 00:17:08,328 INFO L280 TraceCheckUtils]: 19: Hoare triple {101#true} havoc ~lk4~0; {101#true} is VALID [2020-07-18 00:17:08,328 INFO L280 TraceCheckUtils]: 20: Hoare triple {101#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {101#true} is VALID [2020-07-18 00:17:08,329 INFO L280 TraceCheckUtils]: 21: Hoare triple {101#true} ~p5~0 := #t~nondet4; {101#true} is VALID [2020-07-18 00:17:08,329 INFO L280 TraceCheckUtils]: 22: Hoare triple {101#true} havoc #t~nondet4; {101#true} is VALID [2020-07-18 00:17:08,330 INFO L280 TraceCheckUtils]: 23: Hoare triple {101#true} havoc ~lk5~0; {101#true} is VALID [2020-07-18 00:17:08,330 INFO L280 TraceCheckUtils]: 24: Hoare triple {101#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {101#true} is VALID [2020-07-18 00:17:08,330 INFO L280 TraceCheckUtils]: 25: Hoare triple {101#true} ~p6~0 := #t~nondet5; {101#true} is VALID [2020-07-18 00:17:08,331 INFO L280 TraceCheckUtils]: 26: Hoare triple {101#true} havoc #t~nondet5; {101#true} is VALID [2020-07-18 00:17:08,331 INFO L280 TraceCheckUtils]: 27: Hoare triple {101#true} havoc ~lk6~0; {101#true} is VALID [2020-07-18 00:17:08,332 INFO L280 TraceCheckUtils]: 28: Hoare triple {101#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {101#true} is VALID [2020-07-18 00:17:08,332 INFO L280 TraceCheckUtils]: 29: Hoare triple {101#true} ~p7~0 := #t~nondet6; {101#true} is VALID [2020-07-18 00:17:08,332 INFO L280 TraceCheckUtils]: 30: Hoare triple {101#true} havoc #t~nondet6; {101#true} is VALID [2020-07-18 00:17:08,333 INFO L280 TraceCheckUtils]: 31: Hoare triple {101#true} havoc ~lk7~0; {101#true} is VALID [2020-07-18 00:17:08,333 INFO L280 TraceCheckUtils]: 32: Hoare triple {101#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {101#true} is VALID [2020-07-18 00:17:08,334 INFO L280 TraceCheckUtils]: 33: Hoare triple {101#true} ~p8~0 := #t~nondet7; {101#true} is VALID [2020-07-18 00:17:08,334 INFO L280 TraceCheckUtils]: 34: Hoare triple {101#true} havoc #t~nondet7; {101#true} is VALID [2020-07-18 00:17:08,334 INFO L280 TraceCheckUtils]: 35: Hoare triple {101#true} havoc ~lk8~0; {101#true} is VALID [2020-07-18 00:17:08,335 INFO L280 TraceCheckUtils]: 36: Hoare triple {101#true} havoc ~cond~0; {101#true} is VALID [2020-07-18 00:17:08,335 INFO L280 TraceCheckUtils]: 37: Hoare triple {101#true} assume !false; {101#true} is VALID [2020-07-18 00:17:08,336 INFO L280 TraceCheckUtils]: 38: Hoare triple {101#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {101#true} is VALID [2020-07-18 00:17:08,336 INFO L280 TraceCheckUtils]: 39: Hoare triple {101#true} ~cond~0 := #t~nondet8; {101#true} is VALID [2020-07-18 00:17:08,336 INFO L280 TraceCheckUtils]: 40: Hoare triple {101#true} havoc #t~nondet8; {101#true} is VALID [2020-07-18 00:17:08,337 INFO L280 TraceCheckUtils]: 41: Hoare triple {101#true} assume !(0 == ~cond~0); {101#true} is VALID [2020-07-18 00:17:08,337 INFO L280 TraceCheckUtils]: 42: Hoare triple {101#true} ~lk1~0 := 0; {101#true} is VALID [2020-07-18 00:17:08,338 INFO L280 TraceCheckUtils]: 43: Hoare triple {101#true} ~lk2~0 := 0; {101#true} is VALID [2020-07-18 00:17:08,338 INFO L280 TraceCheckUtils]: 44: Hoare triple {101#true} ~lk3~0 := 0; {101#true} is VALID [2020-07-18 00:17:08,338 INFO L280 TraceCheckUtils]: 45: Hoare triple {101#true} ~lk4~0 := 0; {101#true} is VALID [2020-07-18 00:17:08,339 INFO L280 TraceCheckUtils]: 46: Hoare triple {101#true} ~lk5~0 := 0; {101#true} is VALID [2020-07-18 00:17:08,339 INFO L280 TraceCheckUtils]: 47: Hoare triple {101#true} ~lk6~0 := 0; {101#true} is VALID [2020-07-18 00:17:08,340 INFO L280 TraceCheckUtils]: 48: Hoare triple {101#true} ~lk7~0 := 0; {101#true} is VALID [2020-07-18 00:17:08,340 INFO L280 TraceCheckUtils]: 49: Hoare triple {101#true} ~lk8~0 := 0; {101#true} is VALID [2020-07-18 00:17:08,341 INFO L280 TraceCheckUtils]: 50: Hoare triple {101#true} assume !(0 != ~p1~0); {105#(= 0 main_~p1~0)} is VALID [2020-07-18 00:17:08,343 INFO L280 TraceCheckUtils]: 51: Hoare triple {105#(= 0 main_~p1~0)} assume !(0 != ~p2~0); {105#(= 0 main_~p1~0)} is VALID [2020-07-18 00:17:08,345 INFO L280 TraceCheckUtils]: 52: Hoare triple {105#(= 0 main_~p1~0)} assume !(0 != ~p3~0); {105#(= 0 main_~p1~0)} is VALID [2020-07-18 00:17:08,347 INFO L280 TraceCheckUtils]: 53: Hoare triple {105#(= 0 main_~p1~0)} assume !(0 != ~p4~0); {105#(= 0 main_~p1~0)} is VALID [2020-07-18 00:17:08,349 INFO L280 TraceCheckUtils]: 54: Hoare triple {105#(= 0 main_~p1~0)} assume !(0 != ~p5~0); {105#(= 0 main_~p1~0)} is VALID [2020-07-18 00:17:08,350 INFO L280 TraceCheckUtils]: 55: Hoare triple {105#(= 0 main_~p1~0)} assume !(0 != ~p6~0); {105#(= 0 main_~p1~0)} is VALID [2020-07-18 00:17:08,351 INFO L280 TraceCheckUtils]: 56: Hoare triple {105#(= 0 main_~p1~0)} assume !(0 != ~p7~0); {105#(= 0 main_~p1~0)} is VALID [2020-07-18 00:17:08,352 INFO L280 TraceCheckUtils]: 57: Hoare triple {105#(= 0 main_~p1~0)} assume !(0 != ~p8~0); {105#(= 0 main_~p1~0)} is VALID [2020-07-18 00:17:08,353 INFO L280 TraceCheckUtils]: 58: Hoare triple {105#(= 0 main_~p1~0)} assume 0 != ~p1~0; {102#false} is VALID [2020-07-18 00:17:08,353 INFO L280 TraceCheckUtils]: 59: Hoare triple {102#false} assume 1 != ~lk1~0; {102#false} is VALID [2020-07-18 00:17:08,353 INFO L280 TraceCheckUtils]: 60: Hoare triple {102#false} assume !false; {102#false} is VALID [2020-07-18 00:17:08,362 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:08,365 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:17:08,367 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [936214520] [2020-07-18 00:17:08,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:17:08,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:17:08,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826228828] [2020-07-18 00:17:08,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-07-18 00:17:08,381 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:17:08,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:17:08,475 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:08,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:17:08,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:17:08,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:17:08,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:17:08,488 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 3 states. [2020-07-18 00:17:09,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:09,067 INFO L93 Difference]: Finished difference Result 213 states and 291 transitions. [2020-07-18 00:17:09,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:17:09,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-07-18 00:17:09,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:17:09,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:17:09,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 291 transitions. [2020-07-18 00:17:09,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:17:09,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 291 transitions. [2020-07-18 00:17:09,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 291 transitions. [2020-07-18 00:17:09,423 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 291 edges. 291 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:09,467 INFO L225 Difference]: With dead ends: 213 [2020-07-18 00:17:09,467 INFO L226 Difference]: Without dead ends: 144 [2020-07-18 00:17:09,475 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:09,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-07-18 00:17:09,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2020-07-18 00:17:09,643 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:17:09,644 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand 142 states. [2020-07-18 00:17:09,645 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 142 states. [2020-07-18 00:17:09,645 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 142 states. [2020-07-18 00:17:09,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:09,657 INFO L93 Difference]: Finished difference Result 144 states and 187 transitions. [2020-07-18 00:17:09,657 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 187 transitions. [2020-07-18 00:17:09,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:17:09,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:17:09,660 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 144 states. [2020-07-18 00:17:09,660 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 144 states. [2020-07-18 00:17:09,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:09,671 INFO L93 Difference]: Finished difference Result 144 states and 187 transitions. [2020-07-18 00:17:09,671 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 187 transitions. [2020-07-18 00:17:09,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:17:09,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:17:09,674 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:17:09,674 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:17:09,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-07-18 00:17:09,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 186 transitions. [2020-07-18 00:17:09,684 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 186 transitions. Word has length 61 [2020-07-18 00:17:09,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:17:09,685 INFO L479 AbstractCegarLoop]: Abstraction has 142 states and 186 transitions. [2020-07-18 00:17:09,685 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:17:09,685 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 142 states and 186 transitions. [2020-07-18 00:17:09,879 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:09,880 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 186 transitions. [2020-07-18 00:17:09,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-07-18 00:17:09,882 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:17:09,882 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, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:17:09,883 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:17:09,883 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:17:09,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:17:09,884 INFO L82 PathProgramCache]: Analyzing trace with hash 16380224, now seen corresponding path program 1 times [2020-07-18 00:17:09,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:17:09,884 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [408454164] [2020-07-18 00:17:09,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:17:09,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:17:09,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:17:09,970 INFO L280 TraceCheckUtils]: 0: Hoare triple {1106#true} assume true; {1106#true} is VALID [2020-07-18 00:17:09,970 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1106#true} {1106#true} #223#return; {1106#true} is VALID [2020-07-18 00:17:09,970 INFO L263 TraceCheckUtils]: 0: Hoare triple {1106#true} call ULTIMATE.init(); {1106#true} is VALID [2020-07-18 00:17:09,971 INFO L280 TraceCheckUtils]: 1: Hoare triple {1106#true} assume true; {1106#true} is VALID [2020-07-18 00:17:09,971 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1106#true} {1106#true} #223#return; {1106#true} is VALID [2020-07-18 00:17:09,971 INFO L263 TraceCheckUtils]: 3: Hoare triple {1106#true} call #t~ret9 := main(); {1106#true} is VALID [2020-07-18 00:17:09,972 INFO L280 TraceCheckUtils]: 4: Hoare triple {1106#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1106#true} is VALID [2020-07-18 00:17:09,972 INFO L280 TraceCheckUtils]: 5: Hoare triple {1106#true} ~p1~0 := #t~nondet0; {1106#true} is VALID [2020-07-18 00:17:09,972 INFO L280 TraceCheckUtils]: 6: Hoare triple {1106#true} havoc #t~nondet0; {1106#true} is VALID [2020-07-18 00:17:09,973 INFO L280 TraceCheckUtils]: 7: Hoare triple {1106#true} havoc ~lk1~0; {1106#true} is VALID [2020-07-18 00:17:09,973 INFO L280 TraceCheckUtils]: 8: Hoare triple {1106#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1106#true} is VALID [2020-07-18 00:17:09,973 INFO L280 TraceCheckUtils]: 9: Hoare triple {1106#true} ~p2~0 := #t~nondet1; {1106#true} is VALID [2020-07-18 00:17:09,973 INFO L280 TraceCheckUtils]: 10: Hoare triple {1106#true} havoc #t~nondet1; {1106#true} is VALID [2020-07-18 00:17:09,974 INFO L280 TraceCheckUtils]: 11: Hoare triple {1106#true} havoc ~lk2~0; {1106#true} is VALID [2020-07-18 00:17:09,974 INFO L280 TraceCheckUtils]: 12: Hoare triple {1106#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1106#true} is VALID [2020-07-18 00:17:09,974 INFO L280 TraceCheckUtils]: 13: Hoare triple {1106#true} ~p3~0 := #t~nondet2; {1106#true} is VALID [2020-07-18 00:17:09,975 INFO L280 TraceCheckUtils]: 14: Hoare triple {1106#true} havoc #t~nondet2; {1106#true} is VALID [2020-07-18 00:17:09,975 INFO L280 TraceCheckUtils]: 15: Hoare triple {1106#true} havoc ~lk3~0; {1106#true} is VALID [2020-07-18 00:17:09,975 INFO L280 TraceCheckUtils]: 16: Hoare triple {1106#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1106#true} is VALID [2020-07-18 00:17:09,975 INFO L280 TraceCheckUtils]: 17: Hoare triple {1106#true} ~p4~0 := #t~nondet3; {1106#true} is VALID [2020-07-18 00:17:09,976 INFO L280 TraceCheckUtils]: 18: Hoare triple {1106#true} havoc #t~nondet3; {1106#true} is VALID [2020-07-18 00:17:09,976 INFO L280 TraceCheckUtils]: 19: Hoare triple {1106#true} havoc ~lk4~0; {1106#true} is VALID [2020-07-18 00:17:09,976 INFO L280 TraceCheckUtils]: 20: Hoare triple {1106#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1106#true} is VALID [2020-07-18 00:17:09,976 INFO L280 TraceCheckUtils]: 21: Hoare triple {1106#true} ~p5~0 := #t~nondet4; {1106#true} is VALID [2020-07-18 00:17:09,977 INFO L280 TraceCheckUtils]: 22: Hoare triple {1106#true} havoc #t~nondet4; {1106#true} is VALID [2020-07-18 00:17:09,977 INFO L280 TraceCheckUtils]: 23: Hoare triple {1106#true} havoc ~lk5~0; {1106#true} is VALID [2020-07-18 00:17:09,977 INFO L280 TraceCheckUtils]: 24: Hoare triple {1106#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1106#true} is VALID [2020-07-18 00:17:09,978 INFO L280 TraceCheckUtils]: 25: Hoare triple {1106#true} ~p6~0 := #t~nondet5; {1106#true} is VALID [2020-07-18 00:17:09,978 INFO L280 TraceCheckUtils]: 26: Hoare triple {1106#true} havoc #t~nondet5; {1106#true} is VALID [2020-07-18 00:17:09,978 INFO L280 TraceCheckUtils]: 27: Hoare triple {1106#true} havoc ~lk6~0; {1106#true} is VALID [2020-07-18 00:17:09,979 INFO L280 TraceCheckUtils]: 28: Hoare triple {1106#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {1106#true} is VALID [2020-07-18 00:17:09,979 INFO L280 TraceCheckUtils]: 29: Hoare triple {1106#true} ~p7~0 := #t~nondet6; {1106#true} is VALID [2020-07-18 00:17:09,979 INFO L280 TraceCheckUtils]: 30: Hoare triple {1106#true} havoc #t~nondet6; {1106#true} is VALID [2020-07-18 00:17:09,979 INFO L280 TraceCheckUtils]: 31: Hoare triple {1106#true} havoc ~lk7~0; {1106#true} is VALID [2020-07-18 00:17:09,980 INFO L280 TraceCheckUtils]: 32: Hoare triple {1106#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {1106#true} is VALID [2020-07-18 00:17:09,980 INFO L280 TraceCheckUtils]: 33: Hoare triple {1106#true} ~p8~0 := #t~nondet7; {1106#true} is VALID [2020-07-18 00:17:09,980 INFO L280 TraceCheckUtils]: 34: Hoare triple {1106#true} havoc #t~nondet7; {1106#true} is VALID [2020-07-18 00:17:09,981 INFO L280 TraceCheckUtils]: 35: Hoare triple {1106#true} havoc ~lk8~0; {1106#true} is VALID [2020-07-18 00:17:09,981 INFO L280 TraceCheckUtils]: 36: Hoare triple {1106#true} havoc ~cond~0; {1106#true} is VALID [2020-07-18 00:17:09,981 INFO L280 TraceCheckUtils]: 37: Hoare triple {1106#true} assume !false; {1106#true} is VALID [2020-07-18 00:17:09,981 INFO L280 TraceCheckUtils]: 38: Hoare triple {1106#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {1106#true} is VALID [2020-07-18 00:17:09,982 INFO L280 TraceCheckUtils]: 39: Hoare triple {1106#true} ~cond~0 := #t~nondet8; {1106#true} is VALID [2020-07-18 00:17:09,982 INFO L280 TraceCheckUtils]: 40: Hoare triple {1106#true} havoc #t~nondet8; {1106#true} is VALID [2020-07-18 00:17:09,982 INFO L280 TraceCheckUtils]: 41: Hoare triple {1106#true} assume !(0 == ~cond~0); {1106#true} is VALID [2020-07-18 00:17:09,983 INFO L280 TraceCheckUtils]: 42: Hoare triple {1106#true} ~lk1~0 := 0; {1106#true} is VALID [2020-07-18 00:17:09,983 INFO L280 TraceCheckUtils]: 43: Hoare triple {1106#true} ~lk2~0 := 0; {1106#true} is VALID [2020-07-18 00:17:09,983 INFO L280 TraceCheckUtils]: 44: Hoare triple {1106#true} ~lk3~0 := 0; {1106#true} is VALID [2020-07-18 00:17:09,983 INFO L280 TraceCheckUtils]: 45: Hoare triple {1106#true} ~lk4~0 := 0; {1106#true} is VALID [2020-07-18 00:17:09,984 INFO L280 TraceCheckUtils]: 46: Hoare triple {1106#true} ~lk5~0 := 0; {1106#true} is VALID [2020-07-18 00:17:09,984 INFO L280 TraceCheckUtils]: 47: Hoare triple {1106#true} ~lk6~0 := 0; {1106#true} is VALID [2020-07-18 00:17:09,984 INFO L280 TraceCheckUtils]: 48: Hoare triple {1106#true} ~lk7~0 := 0; {1106#true} is VALID [2020-07-18 00:17:09,985 INFO L280 TraceCheckUtils]: 49: Hoare triple {1106#true} ~lk8~0 := 0; {1106#true} is VALID [2020-07-18 00:17:09,985 INFO L280 TraceCheckUtils]: 50: Hoare triple {1106#true} assume 0 != ~p1~0; {1106#true} is VALID [2020-07-18 00:17:09,986 INFO L280 TraceCheckUtils]: 51: Hoare triple {1106#true} ~lk1~0 := 1; {1110#(= 1 main_~lk1~0)} is VALID [2020-07-18 00:17:09,986 INFO L280 TraceCheckUtils]: 52: Hoare triple {1110#(= 1 main_~lk1~0)} assume !(0 != ~p2~0); {1110#(= 1 main_~lk1~0)} is VALID [2020-07-18 00:17:09,987 INFO L280 TraceCheckUtils]: 53: Hoare triple {1110#(= 1 main_~lk1~0)} assume !(0 != ~p3~0); {1110#(= 1 main_~lk1~0)} is VALID [2020-07-18 00:17:09,988 INFO L280 TraceCheckUtils]: 54: Hoare triple {1110#(= 1 main_~lk1~0)} assume !(0 != ~p4~0); {1110#(= 1 main_~lk1~0)} is VALID [2020-07-18 00:17:09,988 INFO L280 TraceCheckUtils]: 55: Hoare triple {1110#(= 1 main_~lk1~0)} assume !(0 != ~p5~0); {1110#(= 1 main_~lk1~0)} is VALID [2020-07-18 00:17:09,989 INFO L280 TraceCheckUtils]: 56: Hoare triple {1110#(= 1 main_~lk1~0)} assume !(0 != ~p6~0); {1110#(= 1 main_~lk1~0)} is VALID [2020-07-18 00:17:09,990 INFO L280 TraceCheckUtils]: 57: Hoare triple {1110#(= 1 main_~lk1~0)} assume !(0 != ~p7~0); {1110#(= 1 main_~lk1~0)} is VALID [2020-07-18 00:17:09,990 INFO L280 TraceCheckUtils]: 58: Hoare triple {1110#(= 1 main_~lk1~0)} assume !(0 != ~p8~0); {1110#(= 1 main_~lk1~0)} is VALID [2020-07-18 00:17:09,991 INFO L280 TraceCheckUtils]: 59: Hoare triple {1110#(= 1 main_~lk1~0)} assume 0 != ~p1~0; {1110#(= 1 main_~lk1~0)} is VALID [2020-07-18 00:17:09,992 INFO L280 TraceCheckUtils]: 60: Hoare triple {1110#(= 1 main_~lk1~0)} assume 1 != ~lk1~0; {1107#false} is VALID [2020-07-18 00:17:09,992 INFO L280 TraceCheckUtils]: 61: Hoare triple {1107#false} assume !false; {1107#false} is VALID [2020-07-18 00:17:09,996 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,996 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:17:09,997 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [408454164] [2020-07-18 00:17:09,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:17:09,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:17:09,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098128339] [2020-07-18 00:17:09,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2020-07-18 00:17:09,999 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:17:09,999 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:17:10,064 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:10,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:17:10,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:17:10,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:17:10,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:17:10,066 INFO L87 Difference]: Start difference. First operand 142 states and 186 transitions. Second operand 3 states. [2020-07-18 00:17:10,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:10,384 INFO L93 Difference]: Finished difference Result 173 states and 229 transitions. [2020-07-18 00:17:10,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:17:10,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2020-07-18 00:17:10,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:17:10,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:17:10,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2020-07-18 00:17:10,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:17:10,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2020-07-18 00:17:10,396 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 180 transitions. [2020-07-18 00:17:10,566 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:10,573 INFO L225 Difference]: With dead ends: 173 [2020-07-18 00:17:10,573 INFO L226 Difference]: Without dead ends: 171 [2020-07-18 00:17:10,576 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:10,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-07-18 00:17:10,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 142. [2020-07-18 00:17:10,721 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:17:10,722 INFO L82 GeneralOperation]: Start isEquivalent. First operand 171 states. Second operand 142 states. [2020-07-18 00:17:10,722 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand 142 states. [2020-07-18 00:17:10,722 INFO L87 Difference]: Start difference. First operand 171 states. Second operand 142 states. [2020-07-18 00:17:10,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:10,740 INFO L93 Difference]: Finished difference Result 171 states and 227 transitions. [2020-07-18 00:17:10,740 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 227 transitions. [2020-07-18 00:17:10,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:17:10,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:17:10,741 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 171 states. [2020-07-18 00:17:10,742 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 171 states. [2020-07-18 00:17:10,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:10,755 INFO L93 Difference]: Finished difference Result 171 states and 227 transitions. [2020-07-18 00:17:10,755 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 227 transitions. [2020-07-18 00:17:10,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:17:10,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:17:10,756 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:17:10,756 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:17:10,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-07-18 00:17:10,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 185 transitions. [2020-07-18 00:17:10,766 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 185 transitions. Word has length 62 [2020-07-18 00:17:10,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:17:10,767 INFO L479 AbstractCegarLoop]: Abstraction has 142 states and 185 transitions. [2020-07-18 00:17:10,767 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:17:10,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 142 states and 185 transitions. [2020-07-18 00:17:10,974 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 185 edges. 185 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:10,974 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 185 transitions. [2020-07-18 00:17:10,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-07-18 00:17:10,977 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:17:10,977 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, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:17:10,977 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:17:10,978 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:17:10,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:17:10,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1707628474, now seen corresponding path program 1 times [2020-07-18 00:17:10,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:17:10,979 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [702483547] [2020-07-18 00:17:10,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:17:11,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:17:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:17:11,039 INFO L280 TraceCheckUtils]: 0: Hoare triple {2085#true} assume true; {2085#true} is VALID [2020-07-18 00:17:11,040 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2085#true} {2085#true} #223#return; {2085#true} is VALID [2020-07-18 00:17:11,040 INFO L263 TraceCheckUtils]: 0: Hoare triple {2085#true} call ULTIMATE.init(); {2085#true} is VALID [2020-07-18 00:17:11,041 INFO L280 TraceCheckUtils]: 1: Hoare triple {2085#true} assume true; {2085#true} is VALID [2020-07-18 00:17:11,041 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2085#true} {2085#true} #223#return; {2085#true} is VALID [2020-07-18 00:17:11,041 INFO L263 TraceCheckUtils]: 3: Hoare triple {2085#true} call #t~ret9 := main(); {2085#true} is VALID [2020-07-18 00:17:11,041 INFO L280 TraceCheckUtils]: 4: Hoare triple {2085#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {2085#true} is VALID [2020-07-18 00:17:11,042 INFO L280 TraceCheckUtils]: 5: Hoare triple {2085#true} ~p1~0 := #t~nondet0; {2085#true} is VALID [2020-07-18 00:17:11,042 INFO L280 TraceCheckUtils]: 6: Hoare triple {2085#true} havoc #t~nondet0; {2085#true} is VALID [2020-07-18 00:17:11,042 INFO L280 TraceCheckUtils]: 7: Hoare triple {2085#true} havoc ~lk1~0; {2085#true} is VALID [2020-07-18 00:17:11,042 INFO L280 TraceCheckUtils]: 8: Hoare triple {2085#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2085#true} is VALID [2020-07-18 00:17:11,043 INFO L280 TraceCheckUtils]: 9: Hoare triple {2085#true} ~p2~0 := #t~nondet1; {2085#true} is VALID [2020-07-18 00:17:11,043 INFO L280 TraceCheckUtils]: 10: Hoare triple {2085#true} havoc #t~nondet1; {2085#true} is VALID [2020-07-18 00:17:11,043 INFO L280 TraceCheckUtils]: 11: Hoare triple {2085#true} havoc ~lk2~0; {2085#true} is VALID [2020-07-18 00:17:11,043 INFO L280 TraceCheckUtils]: 12: Hoare triple {2085#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2085#true} is VALID [2020-07-18 00:17:11,044 INFO L280 TraceCheckUtils]: 13: Hoare triple {2085#true} ~p3~0 := #t~nondet2; {2085#true} is VALID [2020-07-18 00:17:11,044 INFO L280 TraceCheckUtils]: 14: Hoare triple {2085#true} havoc #t~nondet2; {2085#true} is VALID [2020-07-18 00:17:11,044 INFO L280 TraceCheckUtils]: 15: Hoare triple {2085#true} havoc ~lk3~0; {2085#true} is VALID [2020-07-18 00:17:11,044 INFO L280 TraceCheckUtils]: 16: Hoare triple {2085#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2085#true} is VALID [2020-07-18 00:17:11,045 INFO L280 TraceCheckUtils]: 17: Hoare triple {2085#true} ~p4~0 := #t~nondet3; {2085#true} is VALID [2020-07-18 00:17:11,045 INFO L280 TraceCheckUtils]: 18: Hoare triple {2085#true} havoc #t~nondet3; {2085#true} is VALID [2020-07-18 00:17:11,045 INFO L280 TraceCheckUtils]: 19: Hoare triple {2085#true} havoc ~lk4~0; {2085#true} is VALID [2020-07-18 00:17:11,045 INFO L280 TraceCheckUtils]: 20: Hoare triple {2085#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {2085#true} is VALID [2020-07-18 00:17:11,046 INFO L280 TraceCheckUtils]: 21: Hoare triple {2085#true} ~p5~0 := #t~nondet4; {2085#true} is VALID [2020-07-18 00:17:11,046 INFO L280 TraceCheckUtils]: 22: Hoare triple {2085#true} havoc #t~nondet4; {2085#true} is VALID [2020-07-18 00:17:11,046 INFO L280 TraceCheckUtils]: 23: Hoare triple {2085#true} havoc ~lk5~0; {2085#true} is VALID [2020-07-18 00:17:11,046 INFO L280 TraceCheckUtils]: 24: Hoare triple {2085#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {2085#true} is VALID [2020-07-18 00:17:11,047 INFO L280 TraceCheckUtils]: 25: Hoare triple {2085#true} ~p6~0 := #t~nondet5; {2085#true} is VALID [2020-07-18 00:17:11,047 INFO L280 TraceCheckUtils]: 26: Hoare triple {2085#true} havoc #t~nondet5; {2085#true} is VALID [2020-07-18 00:17:11,047 INFO L280 TraceCheckUtils]: 27: Hoare triple {2085#true} havoc ~lk6~0; {2085#true} is VALID [2020-07-18 00:17:11,047 INFO L280 TraceCheckUtils]: 28: Hoare triple {2085#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {2085#true} is VALID [2020-07-18 00:17:11,048 INFO L280 TraceCheckUtils]: 29: Hoare triple {2085#true} ~p7~0 := #t~nondet6; {2085#true} is VALID [2020-07-18 00:17:11,048 INFO L280 TraceCheckUtils]: 30: Hoare triple {2085#true} havoc #t~nondet6; {2085#true} is VALID [2020-07-18 00:17:11,048 INFO L280 TraceCheckUtils]: 31: Hoare triple {2085#true} havoc ~lk7~0; {2085#true} is VALID [2020-07-18 00:17:11,048 INFO L280 TraceCheckUtils]: 32: Hoare triple {2085#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {2085#true} is VALID [2020-07-18 00:17:11,049 INFO L280 TraceCheckUtils]: 33: Hoare triple {2085#true} ~p8~0 := #t~nondet7; {2085#true} is VALID [2020-07-18 00:17:11,049 INFO L280 TraceCheckUtils]: 34: Hoare triple {2085#true} havoc #t~nondet7; {2085#true} is VALID [2020-07-18 00:17:11,049 INFO L280 TraceCheckUtils]: 35: Hoare triple {2085#true} havoc ~lk8~0; {2085#true} is VALID [2020-07-18 00:17:11,049 INFO L280 TraceCheckUtils]: 36: Hoare triple {2085#true} havoc ~cond~0; {2085#true} is VALID [2020-07-18 00:17:11,050 INFO L280 TraceCheckUtils]: 37: Hoare triple {2085#true} assume !false; {2085#true} is VALID [2020-07-18 00:17:11,050 INFO L280 TraceCheckUtils]: 38: Hoare triple {2085#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {2085#true} is VALID [2020-07-18 00:17:11,050 INFO L280 TraceCheckUtils]: 39: Hoare triple {2085#true} ~cond~0 := #t~nondet8; {2085#true} is VALID [2020-07-18 00:17:11,050 INFO L280 TraceCheckUtils]: 40: Hoare triple {2085#true} havoc #t~nondet8; {2085#true} is VALID [2020-07-18 00:17:11,050 INFO L280 TraceCheckUtils]: 41: Hoare triple {2085#true} assume !(0 == ~cond~0); {2085#true} is VALID [2020-07-18 00:17:11,051 INFO L280 TraceCheckUtils]: 42: Hoare triple {2085#true} ~lk1~0 := 0; {2085#true} is VALID [2020-07-18 00:17:11,051 INFO L280 TraceCheckUtils]: 43: Hoare triple {2085#true} ~lk2~0 := 0; {2085#true} is VALID [2020-07-18 00:17:11,051 INFO L280 TraceCheckUtils]: 44: Hoare triple {2085#true} ~lk3~0 := 0; {2085#true} is VALID [2020-07-18 00:17:11,051 INFO L280 TraceCheckUtils]: 45: Hoare triple {2085#true} ~lk4~0 := 0; {2085#true} is VALID [2020-07-18 00:17:11,052 INFO L280 TraceCheckUtils]: 46: Hoare triple {2085#true} ~lk5~0 := 0; {2085#true} is VALID [2020-07-18 00:17:11,052 INFO L280 TraceCheckUtils]: 47: Hoare triple {2085#true} ~lk6~0 := 0; {2085#true} is VALID [2020-07-18 00:17:11,052 INFO L280 TraceCheckUtils]: 48: Hoare triple {2085#true} ~lk7~0 := 0; {2085#true} is VALID [2020-07-18 00:17:11,052 INFO L280 TraceCheckUtils]: 49: Hoare triple {2085#true} ~lk8~0 := 0; {2085#true} is VALID [2020-07-18 00:17:11,053 INFO L280 TraceCheckUtils]: 50: Hoare triple {2085#true} assume !(0 != ~p1~0); {2085#true} is VALID [2020-07-18 00:17:11,053 INFO L280 TraceCheckUtils]: 51: Hoare triple {2085#true} assume !(0 != ~p2~0); {2089#(= 0 main_~p2~0)} is VALID [2020-07-18 00:17:11,054 INFO L280 TraceCheckUtils]: 52: Hoare triple {2089#(= 0 main_~p2~0)} assume !(0 != ~p3~0); {2089#(= 0 main_~p2~0)} is VALID [2020-07-18 00:17:11,055 INFO L280 TraceCheckUtils]: 53: Hoare triple {2089#(= 0 main_~p2~0)} assume !(0 != ~p4~0); {2089#(= 0 main_~p2~0)} is VALID [2020-07-18 00:17:11,055 INFO L280 TraceCheckUtils]: 54: Hoare triple {2089#(= 0 main_~p2~0)} assume !(0 != ~p5~0); {2089#(= 0 main_~p2~0)} is VALID [2020-07-18 00:17:11,056 INFO L280 TraceCheckUtils]: 55: Hoare triple {2089#(= 0 main_~p2~0)} assume !(0 != ~p6~0); {2089#(= 0 main_~p2~0)} is VALID [2020-07-18 00:17:11,056 INFO L280 TraceCheckUtils]: 56: Hoare triple {2089#(= 0 main_~p2~0)} assume !(0 != ~p7~0); {2089#(= 0 main_~p2~0)} is VALID [2020-07-18 00:17:11,057 INFO L280 TraceCheckUtils]: 57: Hoare triple {2089#(= 0 main_~p2~0)} assume !(0 != ~p8~0); {2089#(= 0 main_~p2~0)} is VALID [2020-07-18 00:17:11,057 INFO L280 TraceCheckUtils]: 58: Hoare triple {2089#(= 0 main_~p2~0)} assume !(0 != ~p1~0); {2089#(= 0 main_~p2~0)} is VALID [2020-07-18 00:17:11,058 INFO L280 TraceCheckUtils]: 59: Hoare triple {2089#(= 0 main_~p2~0)} assume 0 != ~p2~0; {2086#false} is VALID [2020-07-18 00:17:11,058 INFO L280 TraceCheckUtils]: 60: Hoare triple {2086#false} assume 1 != ~lk2~0; {2086#false} is VALID [2020-07-18 00:17:11,059 INFO L280 TraceCheckUtils]: 61: Hoare triple {2086#false} assume !false; {2086#false} is VALID [2020-07-18 00:17:11,062 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:11,062 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:17:11,063 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [702483547] [2020-07-18 00:17:11,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:17:11,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:17:11,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987633657] [2020-07-18 00:17:11,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2020-07-18 00:17:11,064 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:17:11,064 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:17:11,125 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:11,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:17:11,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:17:11,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:17:11,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:17:11,126 INFO L87 Difference]: Start difference. First operand 142 states and 185 transitions. Second operand 3 states. [2020-07-18 00:17:11,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:11,553 INFO L93 Difference]: Finished difference Result 346 states and 473 transitions. [2020-07-18 00:17:11,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:17:11,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2020-07-18 00:17:11,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:17:11,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:17:11,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 264 transitions. [2020-07-18 00:17:11,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:17:11,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 264 transitions. [2020-07-18 00:17:11,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 264 transitions. [2020-07-18 00:17:11,812 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 264 edges. 264 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:11,819 INFO L225 Difference]: With dead ends: 346 [2020-07-18 00:17:11,822 INFO L226 Difference]: Without dead ends: 241 [2020-07-18 00:17:11,824 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:11,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2020-07-18 00:17:12,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 239. [2020-07-18 00:17:12,072 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:17:12,073 INFO L82 GeneralOperation]: Start isEquivalent. First operand 241 states. Second operand 239 states. [2020-07-18 00:17:12,073 INFO L74 IsIncluded]: Start isIncluded. First operand 241 states. Second operand 239 states. [2020-07-18 00:17:12,074 INFO L87 Difference]: Start difference. First operand 241 states. Second operand 239 states. [2020-07-18 00:17:12,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:12,086 INFO L93 Difference]: Finished difference Result 241 states and 321 transitions. [2020-07-18 00:17:12,086 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 321 transitions. [2020-07-18 00:17:12,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:17:12,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:17:12,087 INFO L74 IsIncluded]: Start isIncluded. First operand 239 states. Second operand 241 states. [2020-07-18 00:17:12,087 INFO L87 Difference]: Start difference. First operand 239 states. Second operand 241 states. [2020-07-18 00:17:12,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:12,098 INFO L93 Difference]: Finished difference Result 241 states and 321 transitions. [2020-07-18 00:17:12,098 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 321 transitions. [2020-07-18 00:17:12,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:17:12,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:17:12,099 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:17:12,099 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:17:12,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2020-07-18 00:17:12,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 320 transitions. [2020-07-18 00:17:12,109 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 320 transitions. Word has length 62 [2020-07-18 00:17:12,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:17:12,110 INFO L479 AbstractCegarLoop]: Abstraction has 239 states and 320 transitions. [2020-07-18 00:17:12,110 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:17:12,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 239 states and 320 transitions. [2020-07-18 00:17:12,439 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 320 edges. 320 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:12,440 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 320 transitions. [2020-07-18 00:17:12,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-07-18 00:17:12,441 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:17:12,441 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:17:12,441 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:17:12,441 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:17:12,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:17:12,442 INFO L82 PathProgramCache]: Analyzing trace with hash -298745719, now seen corresponding path program 1 times [2020-07-18 00:17:12,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:17:12,442 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1057813021] [2020-07-18 00:17:12,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:17:12,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:17:12,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:17:12,549 INFO L280 TraceCheckUtils]: 0: Hoare triple {3744#true} assume true; {3744#true} is VALID [2020-07-18 00:17:12,550 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3744#true} {3744#true} #223#return; {3744#true} is VALID [2020-07-18 00:17:12,551 INFO L263 TraceCheckUtils]: 0: Hoare triple {3744#true} call ULTIMATE.init(); {3744#true} is VALID [2020-07-18 00:17:12,551 INFO L280 TraceCheckUtils]: 1: Hoare triple {3744#true} assume true; {3744#true} is VALID [2020-07-18 00:17:12,552 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3744#true} {3744#true} #223#return; {3744#true} is VALID [2020-07-18 00:17:12,552 INFO L263 TraceCheckUtils]: 3: Hoare triple {3744#true} call #t~ret9 := main(); {3744#true} is VALID [2020-07-18 00:17:12,552 INFO L280 TraceCheckUtils]: 4: Hoare triple {3744#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {3744#true} is VALID [2020-07-18 00:17:12,552 INFO L280 TraceCheckUtils]: 5: Hoare triple {3744#true} ~p1~0 := #t~nondet0; {3744#true} is VALID [2020-07-18 00:17:12,553 INFO L280 TraceCheckUtils]: 6: Hoare triple {3744#true} havoc #t~nondet0; {3744#true} is VALID [2020-07-18 00:17:12,553 INFO L280 TraceCheckUtils]: 7: Hoare triple {3744#true} havoc ~lk1~0; {3744#true} is VALID [2020-07-18 00:17:12,553 INFO L280 TraceCheckUtils]: 8: Hoare triple {3744#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3744#true} is VALID [2020-07-18 00:17:12,553 INFO L280 TraceCheckUtils]: 9: Hoare triple {3744#true} ~p2~0 := #t~nondet1; {3744#true} is VALID [2020-07-18 00:17:12,553 INFO L280 TraceCheckUtils]: 10: Hoare triple {3744#true} havoc #t~nondet1; {3744#true} is VALID [2020-07-18 00:17:12,554 INFO L280 TraceCheckUtils]: 11: Hoare triple {3744#true} havoc ~lk2~0; {3744#true} is VALID [2020-07-18 00:17:12,554 INFO L280 TraceCheckUtils]: 12: Hoare triple {3744#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3744#true} is VALID [2020-07-18 00:17:12,554 INFO L280 TraceCheckUtils]: 13: Hoare triple {3744#true} ~p3~0 := #t~nondet2; {3744#true} is VALID [2020-07-18 00:17:12,554 INFO L280 TraceCheckUtils]: 14: Hoare triple {3744#true} havoc #t~nondet2; {3744#true} is VALID [2020-07-18 00:17:12,555 INFO L280 TraceCheckUtils]: 15: Hoare triple {3744#true} havoc ~lk3~0; {3744#true} is VALID [2020-07-18 00:17:12,555 INFO L280 TraceCheckUtils]: 16: Hoare triple {3744#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {3744#true} is VALID [2020-07-18 00:17:12,555 INFO L280 TraceCheckUtils]: 17: Hoare triple {3744#true} ~p4~0 := #t~nondet3; {3744#true} is VALID [2020-07-18 00:17:12,555 INFO L280 TraceCheckUtils]: 18: Hoare triple {3744#true} havoc #t~nondet3; {3744#true} is VALID [2020-07-18 00:17:12,556 INFO L280 TraceCheckUtils]: 19: Hoare triple {3744#true} havoc ~lk4~0; {3744#true} is VALID [2020-07-18 00:17:12,556 INFO L280 TraceCheckUtils]: 20: Hoare triple {3744#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {3744#true} is VALID [2020-07-18 00:17:12,556 INFO L280 TraceCheckUtils]: 21: Hoare triple {3744#true} ~p5~0 := #t~nondet4; {3744#true} is VALID [2020-07-18 00:17:12,556 INFO L280 TraceCheckUtils]: 22: Hoare triple {3744#true} havoc #t~nondet4; {3744#true} is VALID [2020-07-18 00:17:12,557 INFO L280 TraceCheckUtils]: 23: Hoare triple {3744#true} havoc ~lk5~0; {3744#true} is VALID [2020-07-18 00:17:12,557 INFO L280 TraceCheckUtils]: 24: Hoare triple {3744#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {3744#true} is VALID [2020-07-18 00:17:12,557 INFO L280 TraceCheckUtils]: 25: Hoare triple {3744#true} ~p6~0 := #t~nondet5; {3744#true} is VALID [2020-07-18 00:17:12,557 INFO L280 TraceCheckUtils]: 26: Hoare triple {3744#true} havoc #t~nondet5; {3744#true} is VALID [2020-07-18 00:17:12,557 INFO L280 TraceCheckUtils]: 27: Hoare triple {3744#true} havoc ~lk6~0; {3744#true} is VALID [2020-07-18 00:17:12,558 INFO L280 TraceCheckUtils]: 28: Hoare triple {3744#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {3744#true} is VALID [2020-07-18 00:17:12,558 INFO L280 TraceCheckUtils]: 29: Hoare triple {3744#true} ~p7~0 := #t~nondet6; {3744#true} is VALID [2020-07-18 00:17:12,558 INFO L280 TraceCheckUtils]: 30: Hoare triple {3744#true} havoc #t~nondet6; {3744#true} is VALID [2020-07-18 00:17:12,558 INFO L280 TraceCheckUtils]: 31: Hoare triple {3744#true} havoc ~lk7~0; {3744#true} is VALID [2020-07-18 00:17:12,559 INFO L280 TraceCheckUtils]: 32: Hoare triple {3744#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {3744#true} is VALID [2020-07-18 00:17:12,559 INFO L280 TraceCheckUtils]: 33: Hoare triple {3744#true} ~p8~0 := #t~nondet7; {3744#true} is VALID [2020-07-18 00:17:12,559 INFO L280 TraceCheckUtils]: 34: Hoare triple {3744#true} havoc #t~nondet7; {3744#true} is VALID [2020-07-18 00:17:12,559 INFO L280 TraceCheckUtils]: 35: Hoare triple {3744#true} havoc ~lk8~0; {3744#true} is VALID [2020-07-18 00:17:12,560 INFO L280 TraceCheckUtils]: 36: Hoare triple {3744#true} havoc ~cond~0; {3744#true} is VALID [2020-07-18 00:17:12,560 INFO L280 TraceCheckUtils]: 37: Hoare triple {3744#true} assume !false; {3744#true} is VALID [2020-07-18 00:17:12,560 INFO L280 TraceCheckUtils]: 38: Hoare triple {3744#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {3744#true} is VALID [2020-07-18 00:17:12,560 INFO L280 TraceCheckUtils]: 39: Hoare triple {3744#true} ~cond~0 := #t~nondet8; {3744#true} is VALID [2020-07-18 00:17:12,561 INFO L280 TraceCheckUtils]: 40: Hoare triple {3744#true} havoc #t~nondet8; {3744#true} is VALID [2020-07-18 00:17:12,561 INFO L280 TraceCheckUtils]: 41: Hoare triple {3744#true} assume !(0 == ~cond~0); {3744#true} is VALID [2020-07-18 00:17:12,561 INFO L280 TraceCheckUtils]: 42: Hoare triple {3744#true} ~lk1~0 := 0; {3744#true} is VALID [2020-07-18 00:17:12,561 INFO L280 TraceCheckUtils]: 43: Hoare triple {3744#true} ~lk2~0 := 0; {3744#true} is VALID [2020-07-18 00:17:12,562 INFO L280 TraceCheckUtils]: 44: Hoare triple {3744#true} ~lk3~0 := 0; {3744#true} is VALID [2020-07-18 00:17:12,562 INFO L280 TraceCheckUtils]: 45: Hoare triple {3744#true} ~lk4~0 := 0; {3744#true} is VALID [2020-07-18 00:17:12,562 INFO L280 TraceCheckUtils]: 46: Hoare triple {3744#true} ~lk5~0 := 0; {3744#true} is VALID [2020-07-18 00:17:12,562 INFO L280 TraceCheckUtils]: 47: Hoare triple {3744#true} ~lk6~0 := 0; {3744#true} is VALID [2020-07-18 00:17:12,562 INFO L280 TraceCheckUtils]: 48: Hoare triple {3744#true} ~lk7~0 := 0; {3744#true} is VALID [2020-07-18 00:17:12,562 INFO L280 TraceCheckUtils]: 49: Hoare triple {3744#true} ~lk8~0 := 0; {3744#true} is VALID [2020-07-18 00:17:12,563 INFO L280 TraceCheckUtils]: 50: Hoare triple {3744#true} assume !(0 != ~p1~0); {3744#true} is VALID [2020-07-18 00:17:12,563 INFO L280 TraceCheckUtils]: 51: Hoare triple {3744#true} assume 0 != ~p2~0; {3744#true} is VALID [2020-07-18 00:17:12,563 INFO L280 TraceCheckUtils]: 52: Hoare triple {3744#true} ~lk2~0 := 1; {3748#(= 1 main_~lk2~0)} is VALID [2020-07-18 00:17:12,564 INFO L280 TraceCheckUtils]: 53: Hoare triple {3748#(= 1 main_~lk2~0)} assume !(0 != ~p3~0); {3748#(= 1 main_~lk2~0)} is VALID [2020-07-18 00:17:12,564 INFO L280 TraceCheckUtils]: 54: Hoare triple {3748#(= 1 main_~lk2~0)} assume !(0 != ~p4~0); {3748#(= 1 main_~lk2~0)} is VALID [2020-07-18 00:17:12,565 INFO L280 TraceCheckUtils]: 55: Hoare triple {3748#(= 1 main_~lk2~0)} assume !(0 != ~p5~0); {3748#(= 1 main_~lk2~0)} is VALID [2020-07-18 00:17:12,565 INFO L280 TraceCheckUtils]: 56: Hoare triple {3748#(= 1 main_~lk2~0)} assume !(0 != ~p6~0); {3748#(= 1 main_~lk2~0)} is VALID [2020-07-18 00:17:12,565 INFO L280 TraceCheckUtils]: 57: Hoare triple {3748#(= 1 main_~lk2~0)} assume !(0 != ~p7~0); {3748#(= 1 main_~lk2~0)} is VALID [2020-07-18 00:17:12,566 INFO L280 TraceCheckUtils]: 58: Hoare triple {3748#(= 1 main_~lk2~0)} assume !(0 != ~p8~0); {3748#(= 1 main_~lk2~0)} is VALID [2020-07-18 00:17:12,567 INFO L280 TraceCheckUtils]: 59: Hoare triple {3748#(= 1 main_~lk2~0)} assume !(0 != ~p1~0); {3748#(= 1 main_~lk2~0)} is VALID [2020-07-18 00:17:12,568 INFO L280 TraceCheckUtils]: 60: Hoare triple {3748#(= 1 main_~lk2~0)} assume 0 != ~p2~0; {3748#(= 1 main_~lk2~0)} is VALID [2020-07-18 00:17:12,570 INFO L280 TraceCheckUtils]: 61: Hoare triple {3748#(= 1 main_~lk2~0)} assume 1 != ~lk2~0; {3745#false} is VALID [2020-07-18 00:17:12,571 INFO L280 TraceCheckUtils]: 62: Hoare triple {3745#false} assume !false; {3745#false} is VALID [2020-07-18 00:17:12,573 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:12,574 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:17:12,574 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1057813021] [2020-07-18 00:17:12,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:17:12,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:17:12,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022634618] [2020-07-18 00:17:12,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2020-07-18 00:17:12,576 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:17:12,576 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:17:12,632 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:12,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:17:12,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:17:12,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:17:12,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:17:12,633 INFO L87 Difference]: Start difference. First operand 239 states and 320 transitions. Second operand 3 states. [2020-07-18 00:17:13,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:13,126 INFO L93 Difference]: Finished difference Result 293 states and 396 transitions. [2020-07-18 00:17:13,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:17:13,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2020-07-18 00:17:13,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:17:13,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:17:13,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2020-07-18 00:17:13,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:17:13,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2020-07-18 00:17:13,132 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 176 transitions. [2020-07-18 00:17:13,283 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:13,291 INFO L225 Difference]: With dead ends: 293 [2020-07-18 00:17:13,291 INFO L226 Difference]: Without dead ends: 291 [2020-07-18 00:17:13,292 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,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-07-18 00:17:13,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 239. [2020-07-18 00:17:13,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:17:13,530 INFO L82 GeneralOperation]: Start isEquivalent. First operand 291 states. Second operand 239 states. [2020-07-18 00:17:13,530 INFO L74 IsIncluded]: Start isIncluded. First operand 291 states. Second operand 239 states. [2020-07-18 00:17:13,530 INFO L87 Difference]: Start difference. First operand 291 states. Second operand 239 states. [2020-07-18 00:17:13,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:13,541 INFO L93 Difference]: Finished difference Result 291 states and 393 transitions. [2020-07-18 00:17:13,541 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 393 transitions. [2020-07-18 00:17:13,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:17:13,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:17:13,542 INFO L74 IsIncluded]: Start isIncluded. First operand 239 states. Second operand 291 states. [2020-07-18 00:17:13,543 INFO L87 Difference]: Start difference. First operand 239 states. Second operand 291 states. [2020-07-18 00:17:13,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:13,553 INFO L93 Difference]: Finished difference Result 291 states and 393 transitions. [2020-07-18 00:17:13,553 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 393 transitions. [2020-07-18 00:17:13,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:17:13,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:17:13,554 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:17:13,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:17:13,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2020-07-18 00:17:13,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 318 transitions. [2020-07-18 00:17:13,562 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 318 transitions. Word has length 63 [2020-07-18 00:17:13,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:17:13,563 INFO L479 AbstractCegarLoop]: Abstraction has 239 states and 318 transitions. [2020-07-18 00:17:13,563 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:17:13,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 239 states and 318 transitions. [2020-07-18 00:17:13,867 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 318 edges. 318 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:13,867 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 318 transitions. [2020-07-18 00:17:13,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-07-18 00:17:13,868 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:17:13,868 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:17:13,869 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 00:17:13,869 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:17:13,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:17:13,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1397120136, now seen corresponding path program 1 times [2020-07-18 00:17:13,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:17:13,870 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1227377179] [2020-07-18 00:17:13,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:17:13,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:17:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:17:13,914 INFO L280 TraceCheckUtils]: 0: Hoare triple {5397#true} assume true; {5397#true} is VALID [2020-07-18 00:17:13,915 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {5397#true} {5397#true} #223#return; {5397#true} is VALID [2020-07-18 00:17:13,915 INFO L263 TraceCheckUtils]: 0: Hoare triple {5397#true} call ULTIMATE.init(); {5397#true} is VALID [2020-07-18 00:17:13,915 INFO L280 TraceCheckUtils]: 1: Hoare triple {5397#true} assume true; {5397#true} is VALID [2020-07-18 00:17:13,916 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5397#true} {5397#true} #223#return; {5397#true} is VALID [2020-07-18 00:17:13,916 INFO L263 TraceCheckUtils]: 3: Hoare triple {5397#true} call #t~ret9 := main(); {5397#true} is VALID [2020-07-18 00:17:13,916 INFO L280 TraceCheckUtils]: 4: Hoare triple {5397#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {5397#true} is VALID [2020-07-18 00:17:13,917 INFO L280 TraceCheckUtils]: 5: Hoare triple {5397#true} ~p1~0 := #t~nondet0; {5397#true} is VALID [2020-07-18 00:17:13,917 INFO L280 TraceCheckUtils]: 6: Hoare triple {5397#true} havoc #t~nondet0; {5397#true} is VALID [2020-07-18 00:17:13,917 INFO L280 TraceCheckUtils]: 7: Hoare triple {5397#true} havoc ~lk1~0; {5397#true} is VALID [2020-07-18 00:17:13,917 INFO L280 TraceCheckUtils]: 8: Hoare triple {5397#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {5397#true} is VALID [2020-07-18 00:17:13,918 INFO L280 TraceCheckUtils]: 9: Hoare triple {5397#true} ~p2~0 := #t~nondet1; {5397#true} is VALID [2020-07-18 00:17:13,918 INFO L280 TraceCheckUtils]: 10: Hoare triple {5397#true} havoc #t~nondet1; {5397#true} is VALID [2020-07-18 00:17:13,918 INFO L280 TraceCheckUtils]: 11: Hoare triple {5397#true} havoc ~lk2~0; {5397#true} is VALID [2020-07-18 00:17:13,918 INFO L280 TraceCheckUtils]: 12: Hoare triple {5397#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {5397#true} is VALID [2020-07-18 00:17:13,919 INFO L280 TraceCheckUtils]: 13: Hoare triple {5397#true} ~p3~0 := #t~nondet2; {5397#true} is VALID [2020-07-18 00:17:13,919 INFO L280 TraceCheckUtils]: 14: Hoare triple {5397#true} havoc #t~nondet2; {5397#true} is VALID [2020-07-18 00:17:13,919 INFO L280 TraceCheckUtils]: 15: Hoare triple {5397#true} havoc ~lk3~0; {5397#true} is VALID [2020-07-18 00:17:13,919 INFO L280 TraceCheckUtils]: 16: Hoare triple {5397#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {5397#true} is VALID [2020-07-18 00:17:13,920 INFO L280 TraceCheckUtils]: 17: Hoare triple {5397#true} ~p4~0 := #t~nondet3; {5397#true} is VALID [2020-07-18 00:17:13,920 INFO L280 TraceCheckUtils]: 18: Hoare triple {5397#true} havoc #t~nondet3; {5397#true} is VALID [2020-07-18 00:17:13,920 INFO L280 TraceCheckUtils]: 19: Hoare triple {5397#true} havoc ~lk4~0; {5397#true} is VALID [2020-07-18 00:17:13,920 INFO L280 TraceCheckUtils]: 20: Hoare triple {5397#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {5397#true} is VALID [2020-07-18 00:17:13,921 INFO L280 TraceCheckUtils]: 21: Hoare triple {5397#true} ~p5~0 := #t~nondet4; {5397#true} is VALID [2020-07-18 00:17:13,921 INFO L280 TraceCheckUtils]: 22: Hoare triple {5397#true} havoc #t~nondet4; {5397#true} is VALID [2020-07-18 00:17:13,921 INFO L280 TraceCheckUtils]: 23: Hoare triple {5397#true} havoc ~lk5~0; {5397#true} is VALID [2020-07-18 00:17:13,921 INFO L280 TraceCheckUtils]: 24: Hoare triple {5397#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {5397#true} is VALID [2020-07-18 00:17:13,921 INFO L280 TraceCheckUtils]: 25: Hoare triple {5397#true} ~p6~0 := #t~nondet5; {5397#true} is VALID [2020-07-18 00:17:13,922 INFO L280 TraceCheckUtils]: 26: Hoare triple {5397#true} havoc #t~nondet5; {5397#true} is VALID [2020-07-18 00:17:13,922 INFO L280 TraceCheckUtils]: 27: Hoare triple {5397#true} havoc ~lk6~0; {5397#true} is VALID [2020-07-18 00:17:13,922 INFO L280 TraceCheckUtils]: 28: Hoare triple {5397#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {5397#true} is VALID [2020-07-18 00:17:13,922 INFO L280 TraceCheckUtils]: 29: Hoare triple {5397#true} ~p7~0 := #t~nondet6; {5397#true} is VALID [2020-07-18 00:17:13,923 INFO L280 TraceCheckUtils]: 30: Hoare triple {5397#true} havoc #t~nondet6; {5397#true} is VALID [2020-07-18 00:17:13,923 INFO L280 TraceCheckUtils]: 31: Hoare triple {5397#true} havoc ~lk7~0; {5397#true} is VALID [2020-07-18 00:17:13,923 INFO L280 TraceCheckUtils]: 32: Hoare triple {5397#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {5397#true} is VALID [2020-07-18 00:17:13,923 INFO L280 TraceCheckUtils]: 33: Hoare triple {5397#true} ~p8~0 := #t~nondet7; {5397#true} is VALID [2020-07-18 00:17:13,923 INFO L280 TraceCheckUtils]: 34: Hoare triple {5397#true} havoc #t~nondet7; {5397#true} is VALID [2020-07-18 00:17:13,924 INFO L280 TraceCheckUtils]: 35: Hoare triple {5397#true} havoc ~lk8~0; {5397#true} is VALID [2020-07-18 00:17:13,924 INFO L280 TraceCheckUtils]: 36: Hoare triple {5397#true} havoc ~cond~0; {5397#true} is VALID [2020-07-18 00:17:13,924 INFO L280 TraceCheckUtils]: 37: Hoare triple {5397#true} assume !false; {5397#true} is VALID [2020-07-18 00:17:13,924 INFO L280 TraceCheckUtils]: 38: Hoare triple {5397#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {5397#true} is VALID [2020-07-18 00:17:13,924 INFO L280 TraceCheckUtils]: 39: Hoare triple {5397#true} ~cond~0 := #t~nondet8; {5397#true} is VALID [2020-07-18 00:17:13,941 INFO L280 TraceCheckUtils]: 40: Hoare triple {5397#true} havoc #t~nondet8; {5397#true} is VALID [2020-07-18 00:17:13,941 INFO L280 TraceCheckUtils]: 41: Hoare triple {5397#true} assume !(0 == ~cond~0); {5397#true} is VALID [2020-07-18 00:17:13,941 INFO L280 TraceCheckUtils]: 42: Hoare triple {5397#true} ~lk1~0 := 0; {5397#true} is VALID [2020-07-18 00:17:13,941 INFO L280 TraceCheckUtils]: 43: Hoare triple {5397#true} ~lk2~0 := 0; {5397#true} is VALID [2020-07-18 00:17:13,942 INFO L280 TraceCheckUtils]: 44: Hoare triple {5397#true} ~lk3~0 := 0; {5397#true} is VALID [2020-07-18 00:17:13,942 INFO L280 TraceCheckUtils]: 45: Hoare triple {5397#true} ~lk4~0 := 0; {5397#true} is VALID [2020-07-18 00:17:13,942 INFO L280 TraceCheckUtils]: 46: Hoare triple {5397#true} ~lk5~0 := 0; {5397#true} is VALID [2020-07-18 00:17:13,942 INFO L280 TraceCheckUtils]: 47: Hoare triple {5397#true} ~lk6~0 := 0; {5397#true} is VALID [2020-07-18 00:17:13,943 INFO L280 TraceCheckUtils]: 48: Hoare triple {5397#true} ~lk7~0 := 0; {5397#true} is VALID [2020-07-18 00:17:13,943 INFO L280 TraceCheckUtils]: 49: Hoare triple {5397#true} ~lk8~0 := 0; {5397#true} is VALID [2020-07-18 00:17:13,943 INFO L280 TraceCheckUtils]: 50: Hoare triple {5397#true} assume !(0 != ~p1~0); {5397#true} is VALID [2020-07-18 00:17:13,943 INFO L280 TraceCheckUtils]: 51: Hoare triple {5397#true} assume !(0 != ~p2~0); {5397#true} is VALID [2020-07-18 00:17:13,945 INFO L280 TraceCheckUtils]: 52: Hoare triple {5397#true} assume !(0 != ~p3~0); {5401#(= 0 main_~p3~0)} is VALID [2020-07-18 00:17:13,946 INFO L280 TraceCheckUtils]: 53: Hoare triple {5401#(= 0 main_~p3~0)} assume !(0 != ~p4~0); {5401#(= 0 main_~p3~0)} is VALID [2020-07-18 00:17:13,946 INFO L280 TraceCheckUtils]: 54: Hoare triple {5401#(= 0 main_~p3~0)} assume !(0 != ~p5~0); {5401#(= 0 main_~p3~0)} is VALID [2020-07-18 00:17:13,947 INFO L280 TraceCheckUtils]: 55: Hoare triple {5401#(= 0 main_~p3~0)} assume !(0 != ~p6~0); {5401#(= 0 main_~p3~0)} is VALID [2020-07-18 00:17:13,947 INFO L280 TraceCheckUtils]: 56: Hoare triple {5401#(= 0 main_~p3~0)} assume !(0 != ~p7~0); {5401#(= 0 main_~p3~0)} is VALID [2020-07-18 00:17:13,948 INFO L280 TraceCheckUtils]: 57: Hoare triple {5401#(= 0 main_~p3~0)} assume !(0 != ~p8~0); {5401#(= 0 main_~p3~0)} is VALID [2020-07-18 00:17:13,949 INFO L280 TraceCheckUtils]: 58: Hoare triple {5401#(= 0 main_~p3~0)} assume !(0 != ~p1~0); {5401#(= 0 main_~p3~0)} is VALID [2020-07-18 00:17:13,949 INFO L280 TraceCheckUtils]: 59: Hoare triple {5401#(= 0 main_~p3~0)} assume !(0 != ~p2~0); {5401#(= 0 main_~p3~0)} is VALID [2020-07-18 00:17:13,950 INFO L280 TraceCheckUtils]: 60: Hoare triple {5401#(= 0 main_~p3~0)} assume 0 != ~p3~0; {5398#false} is VALID [2020-07-18 00:17:13,950 INFO L280 TraceCheckUtils]: 61: Hoare triple {5398#false} assume 1 != ~lk3~0; {5398#false} is VALID [2020-07-18 00:17:13,950 INFO L280 TraceCheckUtils]: 62: Hoare triple {5398#false} assume !false; {5398#false} is VALID [2020-07-18 00:17:13,953 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:13,953 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:17:13,953 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1227377179] [2020-07-18 00:17:13,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:17:13,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:17:13,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989018131] [2020-07-18 00:17:13,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2020-07-18 00:17:13,955 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:17:13,955 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:17:14,004 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:14,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:17:14,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:17:14,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:17:14,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:17:14,006 INFO L87 Difference]: Start difference. First operand 239 states and 318 transitions. Second operand 3 states. [2020-07-18 00:17:14,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:14,871 INFO L93 Difference]: Finished difference Result 631 states and 864 transitions. [2020-07-18 00:17:14,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:17:14,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2020-07-18 00:17:14,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:17:14,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:17:14,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 261 transitions. [2020-07-18 00:17:14,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:17:14,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 261 transitions. [2020-07-18 00:17:14,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 261 transitions. [2020-07-18 00:17:15,139 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 261 edges. 261 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:15,151 INFO L225 Difference]: With dead ends: 631 [2020-07-18 00:17:15,152 INFO L226 Difference]: Without dead ends: 429 [2020-07-18 00:17:15,153 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:15,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2020-07-18 00:17:15,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 427. [2020-07-18 00:17:15,691 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:17:15,691 INFO L82 GeneralOperation]: Start isEquivalent. First operand 429 states. Second operand 427 states. [2020-07-18 00:17:15,691 INFO L74 IsIncluded]: Start isIncluded. First operand 429 states. Second operand 427 states. [2020-07-18 00:17:15,691 INFO L87 Difference]: Start difference. First operand 429 states. Second operand 427 states. [2020-07-18 00:17:15,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:15,707 INFO L93 Difference]: Finished difference Result 429 states and 575 transitions. [2020-07-18 00:17:15,707 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 575 transitions. [2020-07-18 00:17:15,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:17:15,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:17:15,708 INFO L74 IsIncluded]: Start isIncluded. First operand 427 states. Second operand 429 states. [2020-07-18 00:17:15,708 INFO L87 Difference]: Start difference. First operand 427 states. Second operand 429 states. [2020-07-18 00:17:15,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:15,723 INFO L93 Difference]: Finished difference Result 429 states and 575 transitions. [2020-07-18 00:17:15,723 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 575 transitions. [2020-07-18 00:17:15,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:17:15,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:17:15,725 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:17:15,725 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:17:15,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2020-07-18 00:17:15,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 574 transitions. [2020-07-18 00:17:15,739 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 574 transitions. Word has length 63 [2020-07-18 00:17:15,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:17:15,740 INFO L479 AbstractCegarLoop]: Abstraction has 427 states and 574 transitions. [2020-07-18 00:17:15,740 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:17:15,740 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 427 states and 574 transitions. [2020-07-18 00:17:16,381 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 574 edges. 574 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:16,382 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 574 transitions. [2020-07-18 00:17:16,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-07-18 00:17:16,383 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:17:16,383 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:17:16,383 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-18 00:17:16,383 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:17:16,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:17:16,384 INFO L82 PathProgramCache]: Analyzing trace with hash 361296622, now seen corresponding path program 1 times [2020-07-18 00:17:16,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:17:16,384 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [801840837] [2020-07-18 00:17:16,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:17:16,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:17:16,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:17:16,446 INFO L280 TraceCheckUtils]: 0: Hoare triple {8378#true} assume true; {8378#true} is VALID [2020-07-18 00:17:16,446 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {8378#true} {8378#true} #223#return; {8378#true} is VALID [2020-07-18 00:17:16,447 INFO L263 TraceCheckUtils]: 0: Hoare triple {8378#true} call ULTIMATE.init(); {8378#true} is VALID [2020-07-18 00:17:16,447 INFO L280 TraceCheckUtils]: 1: Hoare triple {8378#true} assume true; {8378#true} is VALID [2020-07-18 00:17:16,447 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {8378#true} {8378#true} #223#return; {8378#true} is VALID [2020-07-18 00:17:16,447 INFO L263 TraceCheckUtils]: 3: Hoare triple {8378#true} call #t~ret9 := main(); {8378#true} is VALID [2020-07-18 00:17:16,447 INFO L280 TraceCheckUtils]: 4: Hoare triple {8378#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {8378#true} is VALID [2020-07-18 00:17:16,448 INFO L280 TraceCheckUtils]: 5: Hoare triple {8378#true} ~p1~0 := #t~nondet0; {8378#true} is VALID [2020-07-18 00:17:16,448 INFO L280 TraceCheckUtils]: 6: Hoare triple {8378#true} havoc #t~nondet0; {8378#true} is VALID [2020-07-18 00:17:16,448 INFO L280 TraceCheckUtils]: 7: Hoare triple {8378#true} havoc ~lk1~0; {8378#true} is VALID [2020-07-18 00:17:16,448 INFO L280 TraceCheckUtils]: 8: Hoare triple {8378#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {8378#true} is VALID [2020-07-18 00:17:16,449 INFO L280 TraceCheckUtils]: 9: Hoare triple {8378#true} ~p2~0 := #t~nondet1; {8378#true} is VALID [2020-07-18 00:17:16,449 INFO L280 TraceCheckUtils]: 10: Hoare triple {8378#true} havoc #t~nondet1; {8378#true} is VALID [2020-07-18 00:17:16,449 INFO L280 TraceCheckUtils]: 11: Hoare triple {8378#true} havoc ~lk2~0; {8378#true} is VALID [2020-07-18 00:17:16,449 INFO L280 TraceCheckUtils]: 12: Hoare triple {8378#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {8378#true} is VALID [2020-07-18 00:17:16,449 INFO L280 TraceCheckUtils]: 13: Hoare triple {8378#true} ~p3~0 := #t~nondet2; {8378#true} is VALID [2020-07-18 00:17:16,450 INFO L280 TraceCheckUtils]: 14: Hoare triple {8378#true} havoc #t~nondet2; {8378#true} is VALID [2020-07-18 00:17:16,450 INFO L280 TraceCheckUtils]: 15: Hoare triple {8378#true} havoc ~lk3~0; {8378#true} is VALID [2020-07-18 00:17:16,450 INFO L280 TraceCheckUtils]: 16: Hoare triple {8378#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {8378#true} is VALID [2020-07-18 00:17:16,450 INFO L280 TraceCheckUtils]: 17: Hoare triple {8378#true} ~p4~0 := #t~nondet3; {8378#true} is VALID [2020-07-18 00:17:16,450 INFO L280 TraceCheckUtils]: 18: Hoare triple {8378#true} havoc #t~nondet3; {8378#true} is VALID [2020-07-18 00:17:16,451 INFO L280 TraceCheckUtils]: 19: Hoare triple {8378#true} havoc ~lk4~0; {8378#true} is VALID [2020-07-18 00:17:16,451 INFO L280 TraceCheckUtils]: 20: Hoare triple {8378#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {8378#true} is VALID [2020-07-18 00:17:16,451 INFO L280 TraceCheckUtils]: 21: Hoare triple {8378#true} ~p5~0 := #t~nondet4; {8378#true} is VALID [2020-07-18 00:17:16,451 INFO L280 TraceCheckUtils]: 22: Hoare triple {8378#true} havoc #t~nondet4; {8378#true} is VALID [2020-07-18 00:17:16,451 INFO L280 TraceCheckUtils]: 23: Hoare triple {8378#true} havoc ~lk5~0; {8378#true} is VALID [2020-07-18 00:17:16,452 INFO L280 TraceCheckUtils]: 24: Hoare triple {8378#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {8378#true} is VALID [2020-07-18 00:17:16,452 INFO L280 TraceCheckUtils]: 25: Hoare triple {8378#true} ~p6~0 := #t~nondet5; {8378#true} is VALID [2020-07-18 00:17:16,452 INFO L280 TraceCheckUtils]: 26: Hoare triple {8378#true} havoc #t~nondet5; {8378#true} is VALID [2020-07-18 00:17:16,452 INFO L280 TraceCheckUtils]: 27: Hoare triple {8378#true} havoc ~lk6~0; {8378#true} is VALID [2020-07-18 00:17:16,453 INFO L280 TraceCheckUtils]: 28: Hoare triple {8378#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {8378#true} is VALID [2020-07-18 00:17:16,453 INFO L280 TraceCheckUtils]: 29: Hoare triple {8378#true} ~p7~0 := #t~nondet6; {8378#true} is VALID [2020-07-18 00:17:16,453 INFO L280 TraceCheckUtils]: 30: Hoare triple {8378#true} havoc #t~nondet6; {8378#true} is VALID [2020-07-18 00:17:16,453 INFO L280 TraceCheckUtils]: 31: Hoare triple {8378#true} havoc ~lk7~0; {8378#true} is VALID [2020-07-18 00:17:16,453 INFO L280 TraceCheckUtils]: 32: Hoare triple {8378#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {8378#true} is VALID [2020-07-18 00:17:16,454 INFO L280 TraceCheckUtils]: 33: Hoare triple {8378#true} ~p8~0 := #t~nondet7; {8378#true} is VALID [2020-07-18 00:17:16,454 INFO L280 TraceCheckUtils]: 34: Hoare triple {8378#true} havoc #t~nondet7; {8378#true} is VALID [2020-07-18 00:17:16,454 INFO L280 TraceCheckUtils]: 35: Hoare triple {8378#true} havoc ~lk8~0; {8378#true} is VALID [2020-07-18 00:17:16,454 INFO L280 TraceCheckUtils]: 36: Hoare triple {8378#true} havoc ~cond~0; {8378#true} is VALID [2020-07-18 00:17:16,455 INFO L280 TraceCheckUtils]: 37: Hoare triple {8378#true} assume !false; {8378#true} is VALID [2020-07-18 00:17:16,455 INFO L280 TraceCheckUtils]: 38: Hoare triple {8378#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {8378#true} is VALID [2020-07-18 00:17:16,455 INFO L280 TraceCheckUtils]: 39: Hoare triple {8378#true} ~cond~0 := #t~nondet8; {8378#true} is VALID [2020-07-18 00:17:16,455 INFO L280 TraceCheckUtils]: 40: Hoare triple {8378#true} havoc #t~nondet8; {8378#true} is VALID [2020-07-18 00:17:16,455 INFO L280 TraceCheckUtils]: 41: Hoare triple {8378#true} assume !(0 == ~cond~0); {8378#true} is VALID [2020-07-18 00:17:16,456 INFO L280 TraceCheckUtils]: 42: Hoare triple {8378#true} ~lk1~0 := 0; {8378#true} is VALID [2020-07-18 00:17:16,456 INFO L280 TraceCheckUtils]: 43: Hoare triple {8378#true} ~lk2~0 := 0; {8378#true} is VALID [2020-07-18 00:17:16,456 INFO L280 TraceCheckUtils]: 44: Hoare triple {8378#true} ~lk3~0 := 0; {8378#true} is VALID [2020-07-18 00:17:16,456 INFO L280 TraceCheckUtils]: 45: Hoare triple {8378#true} ~lk4~0 := 0; {8378#true} is VALID [2020-07-18 00:17:16,456 INFO L280 TraceCheckUtils]: 46: Hoare triple {8378#true} ~lk5~0 := 0; {8378#true} is VALID [2020-07-18 00:17:16,457 INFO L280 TraceCheckUtils]: 47: Hoare triple {8378#true} ~lk6~0 := 0; {8378#true} is VALID [2020-07-18 00:17:16,457 INFO L280 TraceCheckUtils]: 48: Hoare triple {8378#true} ~lk7~0 := 0; {8378#true} is VALID [2020-07-18 00:17:16,457 INFO L280 TraceCheckUtils]: 49: Hoare triple {8378#true} ~lk8~0 := 0; {8378#true} is VALID [2020-07-18 00:17:16,457 INFO L280 TraceCheckUtils]: 50: Hoare triple {8378#true} assume !(0 != ~p1~0); {8378#true} is VALID [2020-07-18 00:17:16,458 INFO L280 TraceCheckUtils]: 51: Hoare triple {8378#true} assume !(0 != ~p2~0); {8378#true} is VALID [2020-07-18 00:17:16,458 INFO L280 TraceCheckUtils]: 52: Hoare triple {8378#true} assume !(0 != ~p3~0); {8378#true} is VALID [2020-07-18 00:17:16,458 INFO L280 TraceCheckUtils]: 53: Hoare triple {8378#true} assume !(0 != ~p4~0); {8382#(= 0 main_~p4~0)} is VALID [2020-07-18 00:17:16,459 INFO L280 TraceCheckUtils]: 54: Hoare triple {8382#(= 0 main_~p4~0)} assume !(0 != ~p5~0); {8382#(= 0 main_~p4~0)} is VALID [2020-07-18 00:17:16,460 INFO L280 TraceCheckUtils]: 55: Hoare triple {8382#(= 0 main_~p4~0)} assume !(0 != ~p6~0); {8382#(= 0 main_~p4~0)} is VALID [2020-07-18 00:17:16,460 INFO L280 TraceCheckUtils]: 56: Hoare triple {8382#(= 0 main_~p4~0)} assume !(0 != ~p7~0); {8382#(= 0 main_~p4~0)} is VALID [2020-07-18 00:17:16,462 INFO L280 TraceCheckUtils]: 57: Hoare triple {8382#(= 0 main_~p4~0)} assume !(0 != ~p8~0); {8382#(= 0 main_~p4~0)} is VALID [2020-07-18 00:17:16,463 INFO L280 TraceCheckUtils]: 58: Hoare triple {8382#(= 0 main_~p4~0)} assume !(0 != ~p1~0); {8382#(= 0 main_~p4~0)} is VALID [2020-07-18 00:17:16,464 INFO L280 TraceCheckUtils]: 59: Hoare triple {8382#(= 0 main_~p4~0)} assume !(0 != ~p2~0); {8382#(= 0 main_~p4~0)} is VALID [2020-07-18 00:17:16,465 INFO L280 TraceCheckUtils]: 60: Hoare triple {8382#(= 0 main_~p4~0)} assume !(0 != ~p3~0); {8382#(= 0 main_~p4~0)} is VALID [2020-07-18 00:17:16,467 INFO L280 TraceCheckUtils]: 61: Hoare triple {8382#(= 0 main_~p4~0)} assume 0 != ~p4~0; {8379#false} is VALID [2020-07-18 00:17:16,468 INFO L280 TraceCheckUtils]: 62: Hoare triple {8379#false} assume 1 != ~lk4~0; {8379#false} is VALID [2020-07-18 00:17:16,468 INFO L280 TraceCheckUtils]: 63: Hoare triple {8379#false} assume !false; {8379#false} is VALID [2020-07-18 00:17:16,471 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:16,472 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:17:16,472 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [801840837] [2020-07-18 00:17:16,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:17:16,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:17:16,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182448248] [2020-07-18 00:17:16,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2020-07-18 00:17:16,475 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:17:16,475 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:17:16,535 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:16,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:17:16,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:17:16,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:17:16,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:17:16,537 INFO L87 Difference]: Start difference. First operand 427 states and 574 transitions. Second operand 3 states. [2020-07-18 00:17:18,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:18,071 INFO L93 Difference]: Finished difference Result 1183 states and 1616 transitions. [2020-07-18 00:17:18,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:17:18,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2020-07-18 00:17:18,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:17:18,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:17:18,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 261 transitions. [2020-07-18 00:17:18,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:17:18,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 261 transitions. [2020-07-18 00:17:18,077 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 261 transitions. [2020-07-18 00:17:18,341 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 261 edges. 261 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:18,389 INFO L225 Difference]: With dead ends: 1183 [2020-07-18 00:17:18,389 INFO L226 Difference]: Without dead ends: 793 [2020-07-18 00:17:18,394 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:18,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2020-07-18 00:17:19,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 791. [2020-07-18 00:17:19,543 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:17:19,544 INFO L82 GeneralOperation]: Start isEquivalent. First operand 793 states. Second operand 791 states. [2020-07-18 00:17:19,544 INFO L74 IsIncluded]: Start isIncluded. First operand 793 states. Second operand 791 states. [2020-07-18 00:17:19,544 INFO L87 Difference]: Start difference. First operand 793 states. Second operand 791 states. [2020-07-18 00:17:19,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:19,583 INFO L93 Difference]: Finished difference Result 793 states and 1063 transitions. [2020-07-18 00:17:19,583 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1063 transitions. [2020-07-18 00:17:19,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:17:19,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:17:19,586 INFO L74 IsIncluded]: Start isIncluded. First operand 791 states. Second operand 793 states. [2020-07-18 00:17:19,586 INFO L87 Difference]: Start difference. First operand 791 states. Second operand 793 states. [2020-07-18 00:17:19,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:19,625 INFO L93 Difference]: Finished difference Result 793 states and 1063 transitions. [2020-07-18 00:17:19,625 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1063 transitions. [2020-07-18 00:17:19,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:17:19,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:17:19,628 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:17:19,628 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:17:19,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-07-18 00:17:19,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1062 transitions. [2020-07-18 00:17:19,668 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1062 transitions. Word has length 64 [2020-07-18 00:17:19,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:17:19,668 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 1062 transitions. [2020-07-18 00:17:19,668 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:17:19,668 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 791 states and 1062 transitions. [2020-07-18 00:17:20,796 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 1062 edges. 1062 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:20,797 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1062 transitions. [2020-07-18 00:17:20,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-07-18 00:17:20,799 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:17:20,799 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:17:20,799 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-18 00:17:20,800 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:17:20,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:17:20,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1477714988, now seen corresponding path program 1 times [2020-07-18 00:17:20,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:17:20,801 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1325451408] [2020-07-18 00:17:20,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:17:20,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:17:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:17:20,849 INFO L280 TraceCheckUtils]: 0: Hoare triple {13919#true} assume true; {13919#true} is VALID [2020-07-18 00:17:20,849 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {13919#true} {13919#true} #223#return; {13919#true} is VALID [2020-07-18 00:17:20,850 INFO L263 TraceCheckUtils]: 0: Hoare triple {13919#true} call ULTIMATE.init(); {13919#true} is VALID [2020-07-18 00:17:20,850 INFO L280 TraceCheckUtils]: 1: Hoare triple {13919#true} assume true; {13919#true} is VALID [2020-07-18 00:17:20,850 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {13919#true} {13919#true} #223#return; {13919#true} is VALID [2020-07-18 00:17:20,850 INFO L263 TraceCheckUtils]: 3: Hoare triple {13919#true} call #t~ret9 := main(); {13919#true} is VALID [2020-07-18 00:17:20,850 INFO L280 TraceCheckUtils]: 4: Hoare triple {13919#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {13919#true} is VALID [2020-07-18 00:17:20,851 INFO L280 TraceCheckUtils]: 5: Hoare triple {13919#true} ~p1~0 := #t~nondet0; {13919#true} is VALID [2020-07-18 00:17:20,851 INFO L280 TraceCheckUtils]: 6: Hoare triple {13919#true} havoc #t~nondet0; {13919#true} is VALID [2020-07-18 00:17:20,851 INFO L280 TraceCheckUtils]: 7: Hoare triple {13919#true} havoc ~lk1~0; {13919#true} is VALID [2020-07-18 00:17:20,851 INFO L280 TraceCheckUtils]: 8: Hoare triple {13919#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {13919#true} is VALID [2020-07-18 00:17:20,851 INFO L280 TraceCheckUtils]: 9: Hoare triple {13919#true} ~p2~0 := #t~nondet1; {13919#true} is VALID [2020-07-18 00:17:20,851 INFO L280 TraceCheckUtils]: 10: Hoare triple {13919#true} havoc #t~nondet1; {13919#true} is VALID [2020-07-18 00:17:20,852 INFO L280 TraceCheckUtils]: 11: Hoare triple {13919#true} havoc ~lk2~0; {13919#true} is VALID [2020-07-18 00:17:20,852 INFO L280 TraceCheckUtils]: 12: Hoare triple {13919#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {13919#true} is VALID [2020-07-18 00:17:20,852 INFO L280 TraceCheckUtils]: 13: Hoare triple {13919#true} ~p3~0 := #t~nondet2; {13919#true} is VALID [2020-07-18 00:17:20,852 INFO L280 TraceCheckUtils]: 14: Hoare triple {13919#true} havoc #t~nondet2; {13919#true} is VALID [2020-07-18 00:17:20,852 INFO L280 TraceCheckUtils]: 15: Hoare triple {13919#true} havoc ~lk3~0; {13919#true} is VALID [2020-07-18 00:17:20,853 INFO L280 TraceCheckUtils]: 16: Hoare triple {13919#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {13919#true} is VALID [2020-07-18 00:17:20,853 INFO L280 TraceCheckUtils]: 17: Hoare triple {13919#true} ~p4~0 := #t~nondet3; {13919#true} is VALID [2020-07-18 00:17:20,853 INFO L280 TraceCheckUtils]: 18: Hoare triple {13919#true} havoc #t~nondet3; {13919#true} is VALID [2020-07-18 00:17:20,853 INFO L280 TraceCheckUtils]: 19: Hoare triple {13919#true} havoc ~lk4~0; {13919#true} is VALID [2020-07-18 00:17:20,853 INFO L280 TraceCheckUtils]: 20: Hoare triple {13919#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {13919#true} is VALID [2020-07-18 00:17:20,853 INFO L280 TraceCheckUtils]: 21: Hoare triple {13919#true} ~p5~0 := #t~nondet4; {13919#true} is VALID [2020-07-18 00:17:20,854 INFO L280 TraceCheckUtils]: 22: Hoare triple {13919#true} havoc #t~nondet4; {13919#true} is VALID [2020-07-18 00:17:20,854 INFO L280 TraceCheckUtils]: 23: Hoare triple {13919#true} havoc ~lk5~0; {13919#true} is VALID [2020-07-18 00:17:20,854 INFO L280 TraceCheckUtils]: 24: Hoare triple {13919#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {13919#true} is VALID [2020-07-18 00:17:20,854 INFO L280 TraceCheckUtils]: 25: Hoare triple {13919#true} ~p6~0 := #t~nondet5; {13919#true} is VALID [2020-07-18 00:17:20,855 INFO L280 TraceCheckUtils]: 26: Hoare triple {13919#true} havoc #t~nondet5; {13919#true} is VALID [2020-07-18 00:17:20,855 INFO L280 TraceCheckUtils]: 27: Hoare triple {13919#true} havoc ~lk6~0; {13919#true} is VALID [2020-07-18 00:17:20,855 INFO L280 TraceCheckUtils]: 28: Hoare triple {13919#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {13919#true} is VALID [2020-07-18 00:17:20,855 INFO L280 TraceCheckUtils]: 29: Hoare triple {13919#true} ~p7~0 := #t~nondet6; {13919#true} is VALID [2020-07-18 00:17:20,856 INFO L280 TraceCheckUtils]: 30: Hoare triple {13919#true} havoc #t~nondet6; {13919#true} is VALID [2020-07-18 00:17:20,856 INFO L280 TraceCheckUtils]: 31: Hoare triple {13919#true} havoc ~lk7~0; {13919#true} is VALID [2020-07-18 00:17:20,856 INFO L280 TraceCheckUtils]: 32: Hoare triple {13919#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {13919#true} is VALID [2020-07-18 00:17:20,856 INFO L280 TraceCheckUtils]: 33: Hoare triple {13919#true} ~p8~0 := #t~nondet7; {13919#true} is VALID [2020-07-18 00:17:20,856 INFO L280 TraceCheckUtils]: 34: Hoare triple {13919#true} havoc #t~nondet7; {13919#true} is VALID [2020-07-18 00:17:20,856 INFO L280 TraceCheckUtils]: 35: Hoare triple {13919#true} havoc ~lk8~0; {13919#true} is VALID [2020-07-18 00:17:20,857 INFO L280 TraceCheckUtils]: 36: Hoare triple {13919#true} havoc ~cond~0; {13919#true} is VALID [2020-07-18 00:17:20,857 INFO L280 TraceCheckUtils]: 37: Hoare triple {13919#true} assume !false; {13919#true} is VALID [2020-07-18 00:17:20,857 INFO L280 TraceCheckUtils]: 38: Hoare triple {13919#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {13919#true} is VALID [2020-07-18 00:17:20,857 INFO L280 TraceCheckUtils]: 39: Hoare triple {13919#true} ~cond~0 := #t~nondet8; {13919#true} is VALID [2020-07-18 00:17:20,857 INFO L280 TraceCheckUtils]: 40: Hoare triple {13919#true} havoc #t~nondet8; {13919#true} is VALID [2020-07-18 00:17:20,857 INFO L280 TraceCheckUtils]: 41: Hoare triple {13919#true} assume !(0 == ~cond~0); {13919#true} is VALID [2020-07-18 00:17:20,858 INFO L280 TraceCheckUtils]: 42: Hoare triple {13919#true} ~lk1~0 := 0; {13919#true} is VALID [2020-07-18 00:17:20,858 INFO L280 TraceCheckUtils]: 43: Hoare triple {13919#true} ~lk2~0 := 0; {13919#true} is VALID [2020-07-18 00:17:20,858 INFO L280 TraceCheckUtils]: 44: Hoare triple {13919#true} ~lk3~0 := 0; {13919#true} is VALID [2020-07-18 00:17:20,858 INFO L280 TraceCheckUtils]: 45: Hoare triple {13919#true} ~lk4~0 := 0; {13919#true} is VALID [2020-07-18 00:17:20,859 INFO L280 TraceCheckUtils]: 46: Hoare triple {13919#true} ~lk5~0 := 0; {13919#true} is VALID [2020-07-18 00:17:20,859 INFO L280 TraceCheckUtils]: 47: Hoare triple {13919#true} ~lk6~0 := 0; {13919#true} is VALID [2020-07-18 00:17:20,859 INFO L280 TraceCheckUtils]: 48: Hoare triple {13919#true} ~lk7~0 := 0; {13919#true} is VALID [2020-07-18 00:17:20,859 INFO L280 TraceCheckUtils]: 49: Hoare triple {13919#true} ~lk8~0 := 0; {13919#true} is VALID [2020-07-18 00:17:20,859 INFO L280 TraceCheckUtils]: 50: Hoare triple {13919#true} assume !(0 != ~p1~0); {13919#true} is VALID [2020-07-18 00:17:20,860 INFO L280 TraceCheckUtils]: 51: Hoare triple {13919#true} assume !(0 != ~p2~0); {13919#true} is VALID [2020-07-18 00:17:20,860 INFO L280 TraceCheckUtils]: 52: Hoare triple {13919#true} assume 0 != ~p3~0; {13919#true} is VALID [2020-07-18 00:17:20,861 INFO L280 TraceCheckUtils]: 53: Hoare triple {13919#true} ~lk3~0 := 1; {13923#(= 1 main_~lk3~0)} is VALID [2020-07-18 00:17:20,861 INFO L280 TraceCheckUtils]: 54: Hoare triple {13923#(= 1 main_~lk3~0)} assume !(0 != ~p4~0); {13923#(= 1 main_~lk3~0)} is VALID [2020-07-18 00:17:20,862 INFO L280 TraceCheckUtils]: 55: Hoare triple {13923#(= 1 main_~lk3~0)} assume !(0 != ~p5~0); {13923#(= 1 main_~lk3~0)} is VALID [2020-07-18 00:17:20,862 INFO L280 TraceCheckUtils]: 56: Hoare triple {13923#(= 1 main_~lk3~0)} assume !(0 != ~p6~0); {13923#(= 1 main_~lk3~0)} is VALID [2020-07-18 00:17:20,863 INFO L280 TraceCheckUtils]: 57: Hoare triple {13923#(= 1 main_~lk3~0)} assume !(0 != ~p7~0); {13923#(= 1 main_~lk3~0)} is VALID [2020-07-18 00:17:20,863 INFO L280 TraceCheckUtils]: 58: Hoare triple {13923#(= 1 main_~lk3~0)} assume !(0 != ~p8~0); {13923#(= 1 main_~lk3~0)} is VALID [2020-07-18 00:17:20,864 INFO L280 TraceCheckUtils]: 59: Hoare triple {13923#(= 1 main_~lk3~0)} assume !(0 != ~p1~0); {13923#(= 1 main_~lk3~0)} is VALID [2020-07-18 00:17:20,864 INFO L280 TraceCheckUtils]: 60: Hoare triple {13923#(= 1 main_~lk3~0)} assume !(0 != ~p2~0); {13923#(= 1 main_~lk3~0)} is VALID [2020-07-18 00:17:20,865 INFO L280 TraceCheckUtils]: 61: Hoare triple {13923#(= 1 main_~lk3~0)} assume 0 != ~p3~0; {13923#(= 1 main_~lk3~0)} is VALID [2020-07-18 00:17:20,865 INFO L280 TraceCheckUtils]: 62: Hoare triple {13923#(= 1 main_~lk3~0)} assume 1 != ~lk3~0; {13920#false} is VALID [2020-07-18 00:17:20,865 INFO L280 TraceCheckUtils]: 63: Hoare triple {13920#false} assume !false; {13920#false} is VALID [2020-07-18 00:17:20,878 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:20,878 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:17:20,879 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1325451408] [2020-07-18 00:17:20,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:17:20,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:17:20,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213695042] [2020-07-18 00:17:20,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2020-07-18 00:17:20,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:17:20,880 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:17:20,934 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:20,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:17:20,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:17:20,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:17:20,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:17:20,935 INFO L87 Difference]: Start difference. First operand 791 states and 1062 transitions. Second operand 3 states. [2020-07-18 00:17:22,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:22,728 INFO L93 Difference]: Finished difference Result 971 states and 1312 transitions. [2020-07-18 00:17:22,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:17:22,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2020-07-18 00:17:22,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:17:22,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:17:22,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 172 transitions. [2020-07-18 00:17:22,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:17:22,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 172 transitions. [2020-07-18 00:17:22,732 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 172 transitions. [2020-07-18 00:17:22,904 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:22,996 INFO L225 Difference]: With dead ends: 971 [2020-07-18 00:17:22,996 INFO L226 Difference]: Without dead ends: 969 [2020-07-18 00:17:22,997 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:22,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2020-07-18 00:17:24,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 791. [2020-07-18 00:17:24,231 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:17:24,231 INFO L82 GeneralOperation]: Start isEquivalent. First operand 969 states. Second operand 791 states. [2020-07-18 00:17:24,231 INFO L74 IsIncluded]: Start isIncluded. First operand 969 states. Second operand 791 states. [2020-07-18 00:17:24,231 INFO L87 Difference]: Start difference. First operand 969 states. Second operand 791 states. [2020-07-18 00:17:24,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:24,284 INFO L93 Difference]: Finished difference Result 969 states and 1303 transitions. [2020-07-18 00:17:24,284 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1303 transitions. [2020-07-18 00:17:24,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:17:24,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:17:24,287 INFO L74 IsIncluded]: Start isIncluded. First operand 791 states. Second operand 969 states. [2020-07-18 00:17:24,287 INFO L87 Difference]: Start difference. First operand 791 states. Second operand 969 states. [2020-07-18 00:17:24,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:24,343 INFO L93 Difference]: Finished difference Result 969 states and 1303 transitions. [2020-07-18 00:17:24,343 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1303 transitions. [2020-07-18 00:17:24,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:17:24,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:17:24,345 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:17:24,345 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:17:24,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-07-18 00:17:24,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1054 transitions. [2020-07-18 00:17:24,387 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1054 transitions. Word has length 64 [2020-07-18 00:17:24,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:17:24,387 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 1054 transitions. [2020-07-18 00:17:24,387 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:17:24,387 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 791 states and 1054 transitions. [2020-07-18 00:17:25,662 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 1054 edges. 1054 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:25,663 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1054 transitions. [2020-07-18 00:17:25,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-18 00:17:25,665 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:17:25,665 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:17:25,665 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-18 00:17:25,665 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:17:25,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:17:25,666 INFO L82 PathProgramCache]: Analyzing trace with hash 628943709, now seen corresponding path program 1 times [2020-07-18 00:17:25,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:17:25,666 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [848875907] [2020-07-18 00:17:25,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:17:25,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:17:25,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:17:25,734 INFO L280 TraceCheckUtils]: 0: Hoare triple {19388#true} assume true; {19388#true} is VALID [2020-07-18 00:17:25,734 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {19388#true} {19388#true} #223#return; {19388#true} is VALID [2020-07-18 00:17:25,735 INFO L263 TraceCheckUtils]: 0: Hoare triple {19388#true} call ULTIMATE.init(); {19388#true} is VALID [2020-07-18 00:17:25,735 INFO L280 TraceCheckUtils]: 1: Hoare triple {19388#true} assume true; {19388#true} is VALID [2020-07-18 00:17:25,735 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {19388#true} {19388#true} #223#return; {19388#true} is VALID [2020-07-18 00:17:25,736 INFO L263 TraceCheckUtils]: 3: Hoare triple {19388#true} call #t~ret9 := main(); {19388#true} is VALID [2020-07-18 00:17:25,736 INFO L280 TraceCheckUtils]: 4: Hoare triple {19388#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {19388#true} is VALID [2020-07-18 00:17:25,736 INFO L280 TraceCheckUtils]: 5: Hoare triple {19388#true} ~p1~0 := #t~nondet0; {19388#true} is VALID [2020-07-18 00:17:25,737 INFO L280 TraceCheckUtils]: 6: Hoare triple {19388#true} havoc #t~nondet0; {19388#true} is VALID [2020-07-18 00:17:25,737 INFO L280 TraceCheckUtils]: 7: Hoare triple {19388#true} havoc ~lk1~0; {19388#true} is VALID [2020-07-18 00:17:25,737 INFO L280 TraceCheckUtils]: 8: Hoare triple {19388#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {19388#true} is VALID [2020-07-18 00:17:25,738 INFO L280 TraceCheckUtils]: 9: Hoare triple {19388#true} ~p2~0 := #t~nondet1; {19388#true} is VALID [2020-07-18 00:17:25,738 INFO L280 TraceCheckUtils]: 10: Hoare triple {19388#true} havoc #t~nondet1; {19388#true} is VALID [2020-07-18 00:17:25,738 INFO L280 TraceCheckUtils]: 11: Hoare triple {19388#true} havoc ~lk2~0; {19388#true} is VALID [2020-07-18 00:17:25,739 INFO L280 TraceCheckUtils]: 12: Hoare triple {19388#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {19388#true} is VALID [2020-07-18 00:17:25,739 INFO L280 TraceCheckUtils]: 13: Hoare triple {19388#true} ~p3~0 := #t~nondet2; {19388#true} is VALID [2020-07-18 00:17:25,739 INFO L280 TraceCheckUtils]: 14: Hoare triple {19388#true} havoc #t~nondet2; {19388#true} is VALID [2020-07-18 00:17:25,740 INFO L280 TraceCheckUtils]: 15: Hoare triple {19388#true} havoc ~lk3~0; {19388#true} is VALID [2020-07-18 00:17:25,740 INFO L280 TraceCheckUtils]: 16: Hoare triple {19388#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {19388#true} is VALID [2020-07-18 00:17:25,740 INFO L280 TraceCheckUtils]: 17: Hoare triple {19388#true} ~p4~0 := #t~nondet3; {19388#true} is VALID [2020-07-18 00:17:25,741 INFO L280 TraceCheckUtils]: 18: Hoare triple {19388#true} havoc #t~nondet3; {19388#true} is VALID [2020-07-18 00:17:25,741 INFO L280 TraceCheckUtils]: 19: Hoare triple {19388#true} havoc ~lk4~0; {19388#true} is VALID [2020-07-18 00:17:25,741 INFO L280 TraceCheckUtils]: 20: Hoare triple {19388#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {19388#true} is VALID [2020-07-18 00:17:25,742 INFO L280 TraceCheckUtils]: 21: Hoare triple {19388#true} ~p5~0 := #t~nondet4; {19388#true} is VALID [2020-07-18 00:17:25,742 INFO L280 TraceCheckUtils]: 22: Hoare triple {19388#true} havoc #t~nondet4; {19388#true} is VALID [2020-07-18 00:17:25,742 INFO L280 TraceCheckUtils]: 23: Hoare triple {19388#true} havoc ~lk5~0; {19388#true} is VALID [2020-07-18 00:17:25,743 INFO L280 TraceCheckUtils]: 24: Hoare triple {19388#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {19388#true} is VALID [2020-07-18 00:17:25,743 INFO L280 TraceCheckUtils]: 25: Hoare triple {19388#true} ~p6~0 := #t~nondet5; {19388#true} is VALID [2020-07-18 00:17:25,743 INFO L280 TraceCheckUtils]: 26: Hoare triple {19388#true} havoc #t~nondet5; {19388#true} is VALID [2020-07-18 00:17:25,744 INFO L280 TraceCheckUtils]: 27: Hoare triple {19388#true} havoc ~lk6~0; {19388#true} is VALID [2020-07-18 00:17:25,744 INFO L280 TraceCheckUtils]: 28: Hoare triple {19388#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {19388#true} is VALID [2020-07-18 00:17:25,744 INFO L280 TraceCheckUtils]: 29: Hoare triple {19388#true} ~p7~0 := #t~nondet6; {19388#true} is VALID [2020-07-18 00:17:25,745 INFO L280 TraceCheckUtils]: 30: Hoare triple {19388#true} havoc #t~nondet6; {19388#true} is VALID [2020-07-18 00:17:25,745 INFO L280 TraceCheckUtils]: 31: Hoare triple {19388#true} havoc ~lk7~0; {19388#true} is VALID [2020-07-18 00:17:25,745 INFO L280 TraceCheckUtils]: 32: Hoare triple {19388#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {19388#true} is VALID [2020-07-18 00:17:25,746 INFO L280 TraceCheckUtils]: 33: Hoare triple {19388#true} ~p8~0 := #t~nondet7; {19388#true} is VALID [2020-07-18 00:17:25,746 INFO L280 TraceCheckUtils]: 34: Hoare triple {19388#true} havoc #t~nondet7; {19388#true} is VALID [2020-07-18 00:17:25,746 INFO L280 TraceCheckUtils]: 35: Hoare triple {19388#true} havoc ~lk8~0; {19388#true} is VALID [2020-07-18 00:17:25,747 INFO L280 TraceCheckUtils]: 36: Hoare triple {19388#true} havoc ~cond~0; {19388#true} is VALID [2020-07-18 00:17:25,747 INFO L280 TraceCheckUtils]: 37: Hoare triple {19388#true} assume !false; {19388#true} is VALID [2020-07-18 00:17:25,747 INFO L280 TraceCheckUtils]: 38: Hoare triple {19388#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {19388#true} is VALID [2020-07-18 00:17:25,748 INFO L280 TraceCheckUtils]: 39: Hoare triple {19388#true} ~cond~0 := #t~nondet8; {19388#true} is VALID [2020-07-18 00:17:25,748 INFO L280 TraceCheckUtils]: 40: Hoare triple {19388#true} havoc #t~nondet8; {19388#true} is VALID [2020-07-18 00:17:25,748 INFO L280 TraceCheckUtils]: 41: Hoare triple {19388#true} assume !(0 == ~cond~0); {19388#true} is VALID [2020-07-18 00:17:25,748 INFO L280 TraceCheckUtils]: 42: Hoare triple {19388#true} ~lk1~0 := 0; {19388#true} is VALID [2020-07-18 00:17:25,749 INFO L280 TraceCheckUtils]: 43: Hoare triple {19388#true} ~lk2~0 := 0; {19388#true} is VALID [2020-07-18 00:17:25,749 INFO L280 TraceCheckUtils]: 44: Hoare triple {19388#true} ~lk3~0 := 0; {19388#true} is VALID [2020-07-18 00:17:25,749 INFO L280 TraceCheckUtils]: 45: Hoare triple {19388#true} ~lk4~0 := 0; {19388#true} is VALID [2020-07-18 00:17:25,750 INFO L280 TraceCheckUtils]: 46: Hoare triple {19388#true} ~lk5~0 := 0; {19388#true} is VALID [2020-07-18 00:17:25,750 INFO L280 TraceCheckUtils]: 47: Hoare triple {19388#true} ~lk6~0 := 0; {19388#true} is VALID [2020-07-18 00:17:25,750 INFO L280 TraceCheckUtils]: 48: Hoare triple {19388#true} ~lk7~0 := 0; {19388#true} is VALID [2020-07-18 00:17:25,751 INFO L280 TraceCheckUtils]: 49: Hoare triple {19388#true} ~lk8~0 := 0; {19388#true} is VALID [2020-07-18 00:17:25,751 INFO L280 TraceCheckUtils]: 50: Hoare triple {19388#true} assume !(0 != ~p1~0); {19388#true} is VALID [2020-07-18 00:17:25,751 INFO L280 TraceCheckUtils]: 51: Hoare triple {19388#true} assume !(0 != ~p2~0); {19388#true} is VALID [2020-07-18 00:17:25,752 INFO L280 TraceCheckUtils]: 52: Hoare triple {19388#true} assume !(0 != ~p3~0); {19388#true} is VALID [2020-07-18 00:17:25,752 INFO L280 TraceCheckUtils]: 53: Hoare triple {19388#true} assume 0 != ~p4~0; {19388#true} is VALID [2020-07-18 00:17:25,757 INFO L280 TraceCheckUtils]: 54: Hoare triple {19388#true} ~lk4~0 := 1; {19392#(= 1 main_~lk4~0)} is VALID [2020-07-18 00:17:25,757 INFO L280 TraceCheckUtils]: 55: Hoare triple {19392#(= 1 main_~lk4~0)} assume !(0 != ~p5~0); {19392#(= 1 main_~lk4~0)} is VALID [2020-07-18 00:17:25,758 INFO L280 TraceCheckUtils]: 56: Hoare triple {19392#(= 1 main_~lk4~0)} assume !(0 != ~p6~0); {19392#(= 1 main_~lk4~0)} is VALID [2020-07-18 00:17:25,779 INFO L280 TraceCheckUtils]: 57: Hoare triple {19392#(= 1 main_~lk4~0)} assume !(0 != ~p7~0); {19392#(= 1 main_~lk4~0)} is VALID [2020-07-18 00:17:25,780 INFO L280 TraceCheckUtils]: 58: Hoare triple {19392#(= 1 main_~lk4~0)} assume !(0 != ~p8~0); {19392#(= 1 main_~lk4~0)} is VALID [2020-07-18 00:17:25,780 INFO L280 TraceCheckUtils]: 59: Hoare triple {19392#(= 1 main_~lk4~0)} assume !(0 != ~p1~0); {19392#(= 1 main_~lk4~0)} is VALID [2020-07-18 00:17:25,781 INFO L280 TraceCheckUtils]: 60: Hoare triple {19392#(= 1 main_~lk4~0)} assume !(0 != ~p2~0); {19392#(= 1 main_~lk4~0)} is VALID [2020-07-18 00:17:25,782 INFO L280 TraceCheckUtils]: 61: Hoare triple {19392#(= 1 main_~lk4~0)} assume !(0 != ~p3~0); {19392#(= 1 main_~lk4~0)} is VALID [2020-07-18 00:17:25,783 INFO L280 TraceCheckUtils]: 62: Hoare triple {19392#(= 1 main_~lk4~0)} assume 0 != ~p4~0; {19392#(= 1 main_~lk4~0)} is VALID [2020-07-18 00:17:25,786 INFO L280 TraceCheckUtils]: 63: Hoare triple {19392#(= 1 main_~lk4~0)} assume 1 != ~lk4~0; {19389#false} is VALID [2020-07-18 00:17:25,786 INFO L280 TraceCheckUtils]: 64: Hoare triple {19389#false} assume !false; {19389#false} is VALID [2020-07-18 00:17:25,791 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:25,791 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:17:25,792 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [848875907] [2020-07-18 00:17:25,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:17:25,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:17:25,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063713151] [2020-07-18 00:17:25,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2020-07-18 00:17:25,794 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:17:25,794 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:17:25,862 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:25,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:17:25,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:17:25,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:17:25,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:17:25,864 INFO L87 Difference]: Start difference. First operand 791 states and 1054 transitions. Second operand 3 states. [2020-07-18 00:17:28,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:28,050 INFO L93 Difference]: Finished difference Result 963 states and 1288 transitions. [2020-07-18 00:17:28,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:17:28,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2020-07-18 00:17:28,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:17:28,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:17:28,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2020-07-18 00:17:28,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:17:28,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2020-07-18 00:17:28,055 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 168 transitions. [2020-07-18 00:17:28,207 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:28,247 INFO L225 Difference]: With dead ends: 963 [2020-07-18 00:17:28,247 INFO L226 Difference]: Without dead ends: 961 [2020-07-18 00:17:28,248 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:28,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2020-07-18 00:17:29,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 791. [2020-07-18 00:17:29,655 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:17:29,655 INFO L82 GeneralOperation]: Start isEquivalent. First operand 961 states. Second operand 791 states. [2020-07-18 00:17:29,656 INFO L74 IsIncluded]: Start isIncluded. First operand 961 states. Second operand 791 states. [2020-07-18 00:17:29,656 INFO L87 Difference]: Start difference. First operand 961 states. Second operand 791 states. [2020-07-18 00:17:29,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:29,689 INFO L93 Difference]: Finished difference Result 961 states and 1279 transitions. [2020-07-18 00:17:29,690 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1279 transitions. [2020-07-18 00:17:29,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:17:29,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:17:29,692 INFO L74 IsIncluded]: Start isIncluded. First operand 791 states. Second operand 961 states. [2020-07-18 00:17:29,692 INFO L87 Difference]: Start difference. First operand 791 states. Second operand 961 states. [2020-07-18 00:17:29,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:29,733 INFO L93 Difference]: Finished difference Result 961 states and 1279 transitions. [2020-07-18 00:17:29,733 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1279 transitions. [2020-07-18 00:17:29,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:17:29,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:17:29,735 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:17:29,735 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:17:29,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-07-18 00:17:29,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1046 transitions. [2020-07-18 00:17:29,774 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1046 transitions. Word has length 65 [2020-07-18 00:17:29,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:17:29,774 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 1046 transitions. [2020-07-18 00:17:29,775 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:17:29,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 791 states and 1046 transitions. [2020-07-18 00:17:30,997 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 1046 edges. 1046 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:30,997 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1046 transitions. [2020-07-18 00:17:30,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-18 00:17:30,999 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:17:30,999 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:17:30,999 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-18 00:17:30,999 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:17:31,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:17:31,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1684460868, now seen corresponding path program 1 times [2020-07-18 00:17:31,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:17:31,000 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [420393739] [2020-07-18 00:17:31,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:17:31,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:17:31,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:17:31,050 INFO L280 TraceCheckUtils]: 0: Hoare triple {24825#true} assume true; {24825#true} is VALID [2020-07-18 00:17:31,050 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {24825#true} {24825#true} #223#return; {24825#true} is VALID [2020-07-18 00:17:31,050 INFO L263 TraceCheckUtils]: 0: Hoare triple {24825#true} call ULTIMATE.init(); {24825#true} is VALID [2020-07-18 00:17:31,051 INFO L280 TraceCheckUtils]: 1: Hoare triple {24825#true} assume true; {24825#true} is VALID [2020-07-18 00:17:31,051 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {24825#true} {24825#true} #223#return; {24825#true} is VALID [2020-07-18 00:17:31,051 INFO L263 TraceCheckUtils]: 3: Hoare triple {24825#true} call #t~ret9 := main(); {24825#true} is VALID [2020-07-18 00:17:31,051 INFO L280 TraceCheckUtils]: 4: Hoare triple {24825#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {24825#true} is VALID [2020-07-18 00:17:31,051 INFO L280 TraceCheckUtils]: 5: Hoare triple {24825#true} ~p1~0 := #t~nondet0; {24825#true} is VALID [2020-07-18 00:17:31,051 INFO L280 TraceCheckUtils]: 6: Hoare triple {24825#true} havoc #t~nondet0; {24825#true} is VALID [2020-07-18 00:17:31,051 INFO L280 TraceCheckUtils]: 7: Hoare triple {24825#true} havoc ~lk1~0; {24825#true} is VALID [2020-07-18 00:17:31,052 INFO L280 TraceCheckUtils]: 8: Hoare triple {24825#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {24825#true} is VALID [2020-07-18 00:17:31,052 INFO L280 TraceCheckUtils]: 9: Hoare triple {24825#true} ~p2~0 := #t~nondet1; {24825#true} is VALID [2020-07-18 00:17:31,052 INFO L280 TraceCheckUtils]: 10: Hoare triple {24825#true} havoc #t~nondet1; {24825#true} is VALID [2020-07-18 00:17:31,052 INFO L280 TraceCheckUtils]: 11: Hoare triple {24825#true} havoc ~lk2~0; {24825#true} is VALID [2020-07-18 00:17:31,052 INFO L280 TraceCheckUtils]: 12: Hoare triple {24825#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {24825#true} is VALID [2020-07-18 00:17:31,053 INFO L280 TraceCheckUtils]: 13: Hoare triple {24825#true} ~p3~0 := #t~nondet2; {24825#true} is VALID [2020-07-18 00:17:31,053 INFO L280 TraceCheckUtils]: 14: Hoare triple {24825#true} havoc #t~nondet2; {24825#true} is VALID [2020-07-18 00:17:31,053 INFO L280 TraceCheckUtils]: 15: Hoare triple {24825#true} havoc ~lk3~0; {24825#true} is VALID [2020-07-18 00:17:31,053 INFO L280 TraceCheckUtils]: 16: Hoare triple {24825#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {24825#true} is VALID [2020-07-18 00:17:31,053 INFO L280 TraceCheckUtils]: 17: Hoare triple {24825#true} ~p4~0 := #t~nondet3; {24825#true} is VALID [2020-07-18 00:17:31,054 INFO L280 TraceCheckUtils]: 18: Hoare triple {24825#true} havoc #t~nondet3; {24825#true} is VALID [2020-07-18 00:17:31,054 INFO L280 TraceCheckUtils]: 19: Hoare triple {24825#true} havoc ~lk4~0; {24825#true} is VALID [2020-07-18 00:17:31,054 INFO L280 TraceCheckUtils]: 20: Hoare triple {24825#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {24825#true} is VALID [2020-07-18 00:17:31,054 INFO L280 TraceCheckUtils]: 21: Hoare triple {24825#true} ~p5~0 := #t~nondet4; {24825#true} is VALID [2020-07-18 00:17:31,054 INFO L280 TraceCheckUtils]: 22: Hoare triple {24825#true} havoc #t~nondet4; {24825#true} is VALID [2020-07-18 00:17:31,054 INFO L280 TraceCheckUtils]: 23: Hoare triple {24825#true} havoc ~lk5~0; {24825#true} is VALID [2020-07-18 00:17:31,055 INFO L280 TraceCheckUtils]: 24: Hoare triple {24825#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {24825#true} is VALID [2020-07-18 00:17:31,055 INFO L280 TraceCheckUtils]: 25: Hoare triple {24825#true} ~p6~0 := #t~nondet5; {24825#true} is VALID [2020-07-18 00:17:31,055 INFO L280 TraceCheckUtils]: 26: Hoare triple {24825#true} havoc #t~nondet5; {24825#true} is VALID [2020-07-18 00:17:31,055 INFO L280 TraceCheckUtils]: 27: Hoare triple {24825#true} havoc ~lk6~0; {24825#true} is VALID [2020-07-18 00:17:31,055 INFO L280 TraceCheckUtils]: 28: Hoare triple {24825#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {24825#true} is VALID [2020-07-18 00:17:31,056 INFO L280 TraceCheckUtils]: 29: Hoare triple {24825#true} ~p7~0 := #t~nondet6; {24825#true} is VALID [2020-07-18 00:17:31,056 INFO L280 TraceCheckUtils]: 30: Hoare triple {24825#true} havoc #t~nondet6; {24825#true} is VALID [2020-07-18 00:17:31,056 INFO L280 TraceCheckUtils]: 31: Hoare triple {24825#true} havoc ~lk7~0; {24825#true} is VALID [2020-07-18 00:17:31,056 INFO L280 TraceCheckUtils]: 32: Hoare triple {24825#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {24825#true} is VALID [2020-07-18 00:17:31,056 INFO L280 TraceCheckUtils]: 33: Hoare triple {24825#true} ~p8~0 := #t~nondet7; {24825#true} is VALID [2020-07-18 00:17:31,056 INFO L280 TraceCheckUtils]: 34: Hoare triple {24825#true} havoc #t~nondet7; {24825#true} is VALID [2020-07-18 00:17:31,057 INFO L280 TraceCheckUtils]: 35: Hoare triple {24825#true} havoc ~lk8~0; {24825#true} is VALID [2020-07-18 00:17:31,057 INFO L280 TraceCheckUtils]: 36: Hoare triple {24825#true} havoc ~cond~0; {24825#true} is VALID [2020-07-18 00:17:31,057 INFO L280 TraceCheckUtils]: 37: Hoare triple {24825#true} assume !false; {24825#true} is VALID [2020-07-18 00:17:31,057 INFO L280 TraceCheckUtils]: 38: Hoare triple {24825#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {24825#true} is VALID [2020-07-18 00:17:31,057 INFO L280 TraceCheckUtils]: 39: Hoare triple {24825#true} ~cond~0 := #t~nondet8; {24825#true} is VALID [2020-07-18 00:17:31,058 INFO L280 TraceCheckUtils]: 40: Hoare triple {24825#true} havoc #t~nondet8; {24825#true} is VALID [2020-07-18 00:17:31,058 INFO L280 TraceCheckUtils]: 41: Hoare triple {24825#true} assume !(0 == ~cond~0); {24825#true} is VALID [2020-07-18 00:17:31,058 INFO L280 TraceCheckUtils]: 42: Hoare triple {24825#true} ~lk1~0 := 0; {24825#true} is VALID [2020-07-18 00:17:31,058 INFO L280 TraceCheckUtils]: 43: Hoare triple {24825#true} ~lk2~0 := 0; {24825#true} is VALID [2020-07-18 00:17:31,058 INFO L280 TraceCheckUtils]: 44: Hoare triple {24825#true} ~lk3~0 := 0; {24825#true} is VALID [2020-07-18 00:17:31,058 INFO L280 TraceCheckUtils]: 45: Hoare triple {24825#true} ~lk4~0 := 0; {24825#true} is VALID [2020-07-18 00:17:31,059 INFO L280 TraceCheckUtils]: 46: Hoare triple {24825#true} ~lk5~0 := 0; {24825#true} is VALID [2020-07-18 00:17:31,059 INFO L280 TraceCheckUtils]: 47: Hoare triple {24825#true} ~lk6~0 := 0; {24825#true} is VALID [2020-07-18 00:17:31,059 INFO L280 TraceCheckUtils]: 48: Hoare triple {24825#true} ~lk7~0 := 0; {24825#true} is VALID [2020-07-18 00:17:31,059 INFO L280 TraceCheckUtils]: 49: Hoare triple {24825#true} ~lk8~0 := 0; {24825#true} is VALID [2020-07-18 00:17:31,059 INFO L280 TraceCheckUtils]: 50: Hoare triple {24825#true} assume !(0 != ~p1~0); {24825#true} is VALID [2020-07-18 00:17:31,060 INFO L280 TraceCheckUtils]: 51: Hoare triple {24825#true} assume !(0 != ~p2~0); {24825#true} is VALID [2020-07-18 00:17:31,060 INFO L280 TraceCheckUtils]: 52: Hoare triple {24825#true} assume !(0 != ~p3~0); {24825#true} is VALID [2020-07-18 00:17:31,060 INFO L280 TraceCheckUtils]: 53: Hoare triple {24825#true} assume !(0 != ~p4~0); {24825#true} is VALID [2020-07-18 00:17:31,066 INFO L280 TraceCheckUtils]: 54: Hoare triple {24825#true} assume !(0 != ~p5~0); {24829#(= 0 main_~p5~0)} is VALID [2020-07-18 00:17:31,066 INFO L280 TraceCheckUtils]: 55: Hoare triple {24829#(= 0 main_~p5~0)} assume !(0 != ~p6~0); {24829#(= 0 main_~p5~0)} is VALID [2020-07-18 00:17:31,067 INFO L280 TraceCheckUtils]: 56: Hoare triple {24829#(= 0 main_~p5~0)} assume !(0 != ~p7~0); {24829#(= 0 main_~p5~0)} is VALID [2020-07-18 00:17:31,067 INFO L280 TraceCheckUtils]: 57: Hoare triple {24829#(= 0 main_~p5~0)} assume !(0 != ~p8~0); {24829#(= 0 main_~p5~0)} is VALID [2020-07-18 00:17:31,068 INFO L280 TraceCheckUtils]: 58: Hoare triple {24829#(= 0 main_~p5~0)} assume !(0 != ~p1~0); {24829#(= 0 main_~p5~0)} is VALID [2020-07-18 00:17:31,068 INFO L280 TraceCheckUtils]: 59: Hoare triple {24829#(= 0 main_~p5~0)} assume !(0 != ~p2~0); {24829#(= 0 main_~p5~0)} is VALID [2020-07-18 00:17:31,069 INFO L280 TraceCheckUtils]: 60: Hoare triple {24829#(= 0 main_~p5~0)} assume !(0 != ~p3~0); {24829#(= 0 main_~p5~0)} is VALID [2020-07-18 00:17:31,069 INFO L280 TraceCheckUtils]: 61: Hoare triple {24829#(= 0 main_~p5~0)} assume !(0 != ~p4~0); {24829#(= 0 main_~p5~0)} is VALID [2020-07-18 00:17:31,070 INFO L280 TraceCheckUtils]: 62: Hoare triple {24829#(= 0 main_~p5~0)} assume 0 != ~p5~0; {24826#false} is VALID [2020-07-18 00:17:31,070 INFO L280 TraceCheckUtils]: 63: Hoare triple {24826#false} assume 1 != ~lk5~0; {24826#false} is VALID [2020-07-18 00:17:31,070 INFO L280 TraceCheckUtils]: 64: Hoare triple {24826#false} assume !false; {24826#false} is VALID [2020-07-18 00:17:31,072 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:31,073 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:17:31,073 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [420393739] [2020-07-18 00:17:31,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:17:31,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:17:31,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984918638] [2020-07-18 00:17:31,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2020-07-18 00:17:31,074 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:17:31,074 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:17:31,133 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:31,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:17:31,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:17:31,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:17:31,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:17:31,135 INFO L87 Difference]: Start difference. First operand 791 states and 1046 transitions. Second operand 3 states. [2020-07-18 00:17:34,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:34,561 INFO L93 Difference]: Finished difference Result 2251 states and 3000 transitions. [2020-07-18 00:17:34,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:17:34,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2020-07-18 00:17:34,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:17:34,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:17:34,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 255 transitions. [2020-07-18 00:17:34,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:17:34,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 255 transitions. [2020-07-18 00:17:34,565 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 255 transitions. [2020-07-18 00:17:34,790 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 255 edges. 255 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:34,873 INFO L225 Difference]: With dead ends: 2251 [2020-07-18 00:17:34,873 INFO L226 Difference]: Without dead ends: 1497 [2020-07-18 00:17:34,875 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:34,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2020-07-18 00:17:37,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1495. [2020-07-18 00:17:37,841 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:17:37,841 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1497 states. Second operand 1495 states. [2020-07-18 00:17:37,842 INFO L74 IsIncluded]: Start isIncluded. First operand 1497 states. Second operand 1495 states. [2020-07-18 00:17:37,842 INFO L87 Difference]: Start difference. First operand 1497 states. Second operand 1495 states. [2020-07-18 00:17:37,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:37,909 INFO L93 Difference]: Finished difference Result 1497 states and 1959 transitions. [2020-07-18 00:17:37,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 1959 transitions. [2020-07-18 00:17:37,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:17:37,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:17:37,912 INFO L74 IsIncluded]: Start isIncluded. First operand 1495 states. Second operand 1497 states. [2020-07-18 00:17:37,912 INFO L87 Difference]: Start difference. First operand 1495 states. Second operand 1497 states. [2020-07-18 00:17:38,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:38,003 INFO L93 Difference]: Finished difference Result 1497 states and 1959 transitions. [2020-07-18 00:17:38,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 1959 transitions. [2020-07-18 00:17:38,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:17:38,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:17:38,005 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:17:38,005 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:17:38,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1495 states. [2020-07-18 00:17:38,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1495 states and 1958 transitions. [2020-07-18 00:17:38,071 INFO L78 Accepts]: Start accepts. Automaton has 1495 states and 1958 transitions. Word has length 65 [2020-07-18 00:17:38,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:17:38,071 INFO L479 AbstractCegarLoop]: Abstraction has 1495 states and 1958 transitions. [2020-07-18 00:17:38,071 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:17:38,071 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 1495 states and 1958 transitions. [2020-07-18 00:17:40,446 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 1958 edges. 1958 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:40,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 1958 transitions. [2020-07-18 00:17:40,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-18 00:17:40,448 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:17:40,448 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:17:40,448 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-18 00:17:40,449 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:17:40,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:17:40,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1510854248, now seen corresponding path program 1 times [2020-07-18 00:17:40,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:17:40,449 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1677879442] [2020-07-18 00:17:40,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:17:40,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:17:40,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:17:40,512 INFO L280 TraceCheckUtils]: 0: Hoare triple {35318#true} assume true; {35318#true} is VALID [2020-07-18 00:17:40,512 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {35318#true} {35318#true} #223#return; {35318#true} is VALID [2020-07-18 00:17:40,512 INFO L263 TraceCheckUtils]: 0: Hoare triple {35318#true} call ULTIMATE.init(); {35318#true} is VALID [2020-07-18 00:17:40,512 INFO L280 TraceCheckUtils]: 1: Hoare triple {35318#true} assume true; {35318#true} is VALID [2020-07-18 00:17:40,513 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {35318#true} {35318#true} #223#return; {35318#true} is VALID [2020-07-18 00:17:40,513 INFO L263 TraceCheckUtils]: 3: Hoare triple {35318#true} call #t~ret9 := main(); {35318#true} is VALID [2020-07-18 00:17:40,513 INFO L280 TraceCheckUtils]: 4: Hoare triple {35318#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {35318#true} is VALID [2020-07-18 00:17:40,513 INFO L280 TraceCheckUtils]: 5: Hoare triple {35318#true} ~p1~0 := #t~nondet0; {35318#true} is VALID [2020-07-18 00:17:40,513 INFO L280 TraceCheckUtils]: 6: Hoare triple {35318#true} havoc #t~nondet0; {35318#true} is VALID [2020-07-18 00:17:40,514 INFO L280 TraceCheckUtils]: 7: Hoare triple {35318#true} havoc ~lk1~0; {35318#true} is VALID [2020-07-18 00:17:40,514 INFO L280 TraceCheckUtils]: 8: Hoare triple {35318#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {35318#true} is VALID [2020-07-18 00:17:40,514 INFO L280 TraceCheckUtils]: 9: Hoare triple {35318#true} ~p2~0 := #t~nondet1; {35318#true} is VALID [2020-07-18 00:17:40,514 INFO L280 TraceCheckUtils]: 10: Hoare triple {35318#true} havoc #t~nondet1; {35318#true} is VALID [2020-07-18 00:17:40,514 INFO L280 TraceCheckUtils]: 11: Hoare triple {35318#true} havoc ~lk2~0; {35318#true} is VALID [2020-07-18 00:17:40,514 INFO L280 TraceCheckUtils]: 12: Hoare triple {35318#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {35318#true} is VALID [2020-07-18 00:17:40,515 INFO L280 TraceCheckUtils]: 13: Hoare triple {35318#true} ~p3~0 := #t~nondet2; {35318#true} is VALID [2020-07-18 00:17:40,515 INFO L280 TraceCheckUtils]: 14: Hoare triple {35318#true} havoc #t~nondet2; {35318#true} is VALID [2020-07-18 00:17:40,515 INFO L280 TraceCheckUtils]: 15: Hoare triple {35318#true} havoc ~lk3~0; {35318#true} is VALID [2020-07-18 00:17:40,515 INFO L280 TraceCheckUtils]: 16: Hoare triple {35318#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {35318#true} is VALID [2020-07-18 00:17:40,515 INFO L280 TraceCheckUtils]: 17: Hoare triple {35318#true} ~p4~0 := #t~nondet3; {35318#true} is VALID [2020-07-18 00:17:40,515 INFO L280 TraceCheckUtils]: 18: Hoare triple {35318#true} havoc #t~nondet3; {35318#true} is VALID [2020-07-18 00:17:40,516 INFO L280 TraceCheckUtils]: 19: Hoare triple {35318#true} havoc ~lk4~0; {35318#true} is VALID [2020-07-18 00:17:40,516 INFO L280 TraceCheckUtils]: 20: Hoare triple {35318#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {35318#true} is VALID [2020-07-18 00:17:40,516 INFO L280 TraceCheckUtils]: 21: Hoare triple {35318#true} ~p5~0 := #t~nondet4; {35318#true} is VALID [2020-07-18 00:17:40,516 INFO L280 TraceCheckUtils]: 22: Hoare triple {35318#true} havoc #t~nondet4; {35318#true} is VALID [2020-07-18 00:17:40,516 INFO L280 TraceCheckUtils]: 23: Hoare triple {35318#true} havoc ~lk5~0; {35318#true} is VALID [2020-07-18 00:17:40,517 INFO L280 TraceCheckUtils]: 24: Hoare triple {35318#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {35318#true} is VALID [2020-07-18 00:17:40,517 INFO L280 TraceCheckUtils]: 25: Hoare triple {35318#true} ~p6~0 := #t~nondet5; {35318#true} is VALID [2020-07-18 00:17:40,517 INFO L280 TraceCheckUtils]: 26: Hoare triple {35318#true} havoc #t~nondet5; {35318#true} is VALID [2020-07-18 00:17:40,517 INFO L280 TraceCheckUtils]: 27: Hoare triple {35318#true} havoc ~lk6~0; {35318#true} is VALID [2020-07-18 00:17:40,517 INFO L280 TraceCheckUtils]: 28: Hoare triple {35318#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {35318#true} is VALID [2020-07-18 00:17:40,518 INFO L280 TraceCheckUtils]: 29: Hoare triple {35318#true} ~p7~0 := #t~nondet6; {35318#true} is VALID [2020-07-18 00:17:40,518 INFO L280 TraceCheckUtils]: 30: Hoare triple {35318#true} havoc #t~nondet6; {35318#true} is VALID [2020-07-18 00:17:40,518 INFO L280 TraceCheckUtils]: 31: Hoare triple {35318#true} havoc ~lk7~0; {35318#true} is VALID [2020-07-18 00:17:40,518 INFO L280 TraceCheckUtils]: 32: Hoare triple {35318#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {35318#true} is VALID [2020-07-18 00:17:40,518 INFO L280 TraceCheckUtils]: 33: Hoare triple {35318#true} ~p8~0 := #t~nondet7; {35318#true} is VALID [2020-07-18 00:17:40,519 INFO L280 TraceCheckUtils]: 34: Hoare triple {35318#true} havoc #t~nondet7; {35318#true} is VALID [2020-07-18 00:17:40,519 INFO L280 TraceCheckUtils]: 35: Hoare triple {35318#true} havoc ~lk8~0; {35318#true} is VALID [2020-07-18 00:17:40,519 INFO L280 TraceCheckUtils]: 36: Hoare triple {35318#true} havoc ~cond~0; {35318#true} is VALID [2020-07-18 00:17:40,519 INFO L280 TraceCheckUtils]: 37: Hoare triple {35318#true} assume !false; {35318#true} is VALID [2020-07-18 00:17:40,519 INFO L280 TraceCheckUtils]: 38: Hoare triple {35318#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {35318#true} is VALID [2020-07-18 00:17:40,519 INFO L280 TraceCheckUtils]: 39: Hoare triple {35318#true} ~cond~0 := #t~nondet8; {35318#true} is VALID [2020-07-18 00:17:40,520 INFO L280 TraceCheckUtils]: 40: Hoare triple {35318#true} havoc #t~nondet8; {35318#true} is VALID [2020-07-18 00:17:40,520 INFO L280 TraceCheckUtils]: 41: Hoare triple {35318#true} assume !(0 == ~cond~0); {35318#true} is VALID [2020-07-18 00:17:40,520 INFO L280 TraceCheckUtils]: 42: Hoare triple {35318#true} ~lk1~0 := 0; {35318#true} is VALID [2020-07-18 00:17:40,520 INFO L280 TraceCheckUtils]: 43: Hoare triple {35318#true} ~lk2~0 := 0; {35318#true} is VALID [2020-07-18 00:17:40,520 INFO L280 TraceCheckUtils]: 44: Hoare triple {35318#true} ~lk3~0 := 0; {35318#true} is VALID [2020-07-18 00:17:40,521 INFO L280 TraceCheckUtils]: 45: Hoare triple {35318#true} ~lk4~0 := 0; {35318#true} is VALID [2020-07-18 00:17:40,521 INFO L280 TraceCheckUtils]: 46: Hoare triple {35318#true} ~lk5~0 := 0; {35318#true} is VALID [2020-07-18 00:17:40,521 INFO L280 TraceCheckUtils]: 47: Hoare triple {35318#true} ~lk6~0 := 0; {35318#true} is VALID [2020-07-18 00:17:40,521 INFO L280 TraceCheckUtils]: 48: Hoare triple {35318#true} ~lk7~0 := 0; {35318#true} is VALID [2020-07-18 00:17:40,521 INFO L280 TraceCheckUtils]: 49: Hoare triple {35318#true} ~lk8~0 := 0; {35318#true} is VALID [2020-07-18 00:17:40,521 INFO L280 TraceCheckUtils]: 50: Hoare triple {35318#true} assume !(0 != ~p1~0); {35318#true} is VALID [2020-07-18 00:17:40,522 INFO L280 TraceCheckUtils]: 51: Hoare triple {35318#true} assume !(0 != ~p2~0); {35318#true} is VALID [2020-07-18 00:17:40,522 INFO L280 TraceCheckUtils]: 52: Hoare triple {35318#true} assume !(0 != ~p3~0); {35318#true} is VALID [2020-07-18 00:17:40,522 INFO L280 TraceCheckUtils]: 53: Hoare triple {35318#true} assume !(0 != ~p4~0); {35318#true} is VALID [2020-07-18 00:17:40,522 INFO L280 TraceCheckUtils]: 54: Hoare triple {35318#true} assume 0 != ~p5~0; {35318#true} is VALID [2020-07-18 00:17:40,523 INFO L280 TraceCheckUtils]: 55: Hoare triple {35318#true} ~lk5~0 := 1; {35322#(= 1 main_~lk5~0)} is VALID [2020-07-18 00:17:40,523 INFO L280 TraceCheckUtils]: 56: Hoare triple {35322#(= 1 main_~lk5~0)} assume !(0 != ~p6~0); {35322#(= 1 main_~lk5~0)} is VALID [2020-07-18 00:17:40,524 INFO L280 TraceCheckUtils]: 57: Hoare triple {35322#(= 1 main_~lk5~0)} assume !(0 != ~p7~0); {35322#(= 1 main_~lk5~0)} is VALID [2020-07-18 00:17:40,524 INFO L280 TraceCheckUtils]: 58: Hoare triple {35322#(= 1 main_~lk5~0)} assume !(0 != ~p8~0); {35322#(= 1 main_~lk5~0)} is VALID [2020-07-18 00:17:40,525 INFO L280 TraceCheckUtils]: 59: Hoare triple {35322#(= 1 main_~lk5~0)} assume !(0 != ~p1~0); {35322#(= 1 main_~lk5~0)} is VALID [2020-07-18 00:17:40,525 INFO L280 TraceCheckUtils]: 60: Hoare triple {35322#(= 1 main_~lk5~0)} assume !(0 != ~p2~0); {35322#(= 1 main_~lk5~0)} is VALID [2020-07-18 00:17:40,526 INFO L280 TraceCheckUtils]: 61: Hoare triple {35322#(= 1 main_~lk5~0)} assume !(0 != ~p3~0); {35322#(= 1 main_~lk5~0)} is VALID [2020-07-18 00:17:40,526 INFO L280 TraceCheckUtils]: 62: Hoare triple {35322#(= 1 main_~lk5~0)} assume !(0 != ~p4~0); {35322#(= 1 main_~lk5~0)} is VALID [2020-07-18 00:17:40,527 INFO L280 TraceCheckUtils]: 63: Hoare triple {35322#(= 1 main_~lk5~0)} assume 0 != ~p5~0; {35322#(= 1 main_~lk5~0)} is VALID [2020-07-18 00:17:40,527 INFO L280 TraceCheckUtils]: 64: Hoare triple {35322#(= 1 main_~lk5~0)} assume 1 != ~lk5~0; {35319#false} is VALID [2020-07-18 00:17:40,527 INFO L280 TraceCheckUtils]: 65: Hoare triple {35319#false} assume !false; {35319#false} is VALID [2020-07-18 00:17:40,530 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:40,530 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:17:40,531 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1677879442] [2020-07-18 00:17:40,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:17:40,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:17:40,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866370457] [2020-07-18 00:17:40,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-07-18 00:17:40,532 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:17:40,532 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:17:40,595 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:40,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:17:40,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:17:40,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:17:40,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:17:40,596 INFO L87 Difference]: Start difference. First operand 1495 states and 1958 transitions. Second operand 3 states. [2020-07-18 00:17:44,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:44,702 INFO L93 Difference]: Finished difference Result 1803 states and 2360 transitions. [2020-07-18 00:17:44,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:17:44,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-07-18 00:17:44,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:17:44,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:17:44,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 164 transitions. [2020-07-18 00:17:44,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:17:44,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 164 transitions. [2020-07-18 00:17:44,705 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 164 transitions. [2020-07-18 00:17:44,856 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:44,964 INFO L225 Difference]: With dead ends: 1803 [2020-07-18 00:17:44,964 INFO L226 Difference]: Without dead ends: 1801 [2020-07-18 00:17:44,964 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:44,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1801 states. [2020-07-18 00:17:48,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1801 to 1495. [2020-07-18 00:17:48,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:17:48,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1801 states. Second operand 1495 states. [2020-07-18 00:17:48,100 INFO L74 IsIncluded]: Start isIncluded. First operand 1801 states. Second operand 1495 states. [2020-07-18 00:17:48,100 INFO L87 Difference]: Start difference. First operand 1801 states. Second operand 1495 states. [2020-07-18 00:17:48,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:48,203 INFO L93 Difference]: Finished difference Result 1801 states and 2343 transitions. [2020-07-18 00:17:48,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2343 transitions. [2020-07-18 00:17:48,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:17:48,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:17:48,205 INFO L74 IsIncluded]: Start isIncluded. First operand 1495 states. Second operand 1801 states. [2020-07-18 00:17:48,206 INFO L87 Difference]: Start difference. First operand 1495 states. Second operand 1801 states. [2020-07-18 00:17:48,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:48,316 INFO L93 Difference]: Finished difference Result 1801 states and 2343 transitions. [2020-07-18 00:17:48,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2343 transitions. [2020-07-18 00:17:48,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:17:48,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:17:48,318 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:17:48,318 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:17:48,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1495 states. [2020-07-18 00:17:48,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1495 states and 1942 transitions. [2020-07-18 00:17:48,398 INFO L78 Accepts]: Start accepts. Automaton has 1495 states and 1942 transitions. Word has length 66 [2020-07-18 00:17:48,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:17:48,398 INFO L479 AbstractCegarLoop]: Abstraction has 1495 states and 1942 transitions. [2020-07-18 00:17:48,398 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:17:48,399 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 1495 states and 1942 transitions. [2020-07-18 00:17:50,806 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 1942 edges. 1942 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:50,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 1942 transitions. [2020-07-18 00:17:50,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-18 00:17:50,809 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:17:50,809 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:17:50,809 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-18 00:17:50,809 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:17:50,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:17:50,810 INFO L82 PathProgramCache]: Analyzing trace with hash -678433246, now seen corresponding path program 1 times [2020-07-18 00:17:50,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:17:50,810 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1933221625] [2020-07-18 00:17:50,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:17:50,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:17:50,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:17:50,847 INFO L280 TraceCheckUtils]: 0: Hoare triple {45523#true} assume true; {45523#true} is VALID [2020-07-18 00:17:50,847 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {45523#true} {45523#true} #223#return; {45523#true} is VALID [2020-07-18 00:17:50,847 INFO L263 TraceCheckUtils]: 0: Hoare triple {45523#true} call ULTIMATE.init(); {45523#true} is VALID [2020-07-18 00:17:50,847 INFO L280 TraceCheckUtils]: 1: Hoare triple {45523#true} assume true; {45523#true} is VALID [2020-07-18 00:17:50,848 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {45523#true} {45523#true} #223#return; {45523#true} is VALID [2020-07-18 00:17:50,848 INFO L263 TraceCheckUtils]: 3: Hoare triple {45523#true} call #t~ret9 := main(); {45523#true} is VALID [2020-07-18 00:17:50,848 INFO L280 TraceCheckUtils]: 4: Hoare triple {45523#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {45523#true} is VALID [2020-07-18 00:17:50,848 INFO L280 TraceCheckUtils]: 5: Hoare triple {45523#true} ~p1~0 := #t~nondet0; {45523#true} is VALID [2020-07-18 00:17:50,848 INFO L280 TraceCheckUtils]: 6: Hoare triple {45523#true} havoc #t~nondet0; {45523#true} is VALID [2020-07-18 00:17:50,849 INFO L280 TraceCheckUtils]: 7: Hoare triple {45523#true} havoc ~lk1~0; {45523#true} is VALID [2020-07-18 00:17:50,849 INFO L280 TraceCheckUtils]: 8: Hoare triple {45523#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {45523#true} is VALID [2020-07-18 00:17:50,849 INFO L280 TraceCheckUtils]: 9: Hoare triple {45523#true} ~p2~0 := #t~nondet1; {45523#true} is VALID [2020-07-18 00:17:50,849 INFO L280 TraceCheckUtils]: 10: Hoare triple {45523#true} havoc #t~nondet1; {45523#true} is VALID [2020-07-18 00:17:50,849 INFO L280 TraceCheckUtils]: 11: Hoare triple {45523#true} havoc ~lk2~0; {45523#true} is VALID [2020-07-18 00:17:50,850 INFO L280 TraceCheckUtils]: 12: Hoare triple {45523#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {45523#true} is VALID [2020-07-18 00:17:50,850 INFO L280 TraceCheckUtils]: 13: Hoare triple {45523#true} ~p3~0 := #t~nondet2; {45523#true} is VALID [2020-07-18 00:17:50,850 INFO L280 TraceCheckUtils]: 14: Hoare triple {45523#true} havoc #t~nondet2; {45523#true} is VALID [2020-07-18 00:17:50,850 INFO L280 TraceCheckUtils]: 15: Hoare triple {45523#true} havoc ~lk3~0; {45523#true} is VALID [2020-07-18 00:17:50,850 INFO L280 TraceCheckUtils]: 16: Hoare triple {45523#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {45523#true} is VALID [2020-07-18 00:17:50,851 INFO L280 TraceCheckUtils]: 17: Hoare triple {45523#true} ~p4~0 := #t~nondet3; {45523#true} is VALID [2020-07-18 00:17:50,851 INFO L280 TraceCheckUtils]: 18: Hoare triple {45523#true} havoc #t~nondet3; {45523#true} is VALID [2020-07-18 00:17:50,851 INFO L280 TraceCheckUtils]: 19: Hoare triple {45523#true} havoc ~lk4~0; {45523#true} is VALID [2020-07-18 00:17:50,851 INFO L280 TraceCheckUtils]: 20: Hoare triple {45523#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {45523#true} is VALID [2020-07-18 00:17:50,851 INFO L280 TraceCheckUtils]: 21: Hoare triple {45523#true} ~p5~0 := #t~nondet4; {45523#true} is VALID [2020-07-18 00:17:50,852 INFO L280 TraceCheckUtils]: 22: Hoare triple {45523#true} havoc #t~nondet4; {45523#true} is VALID [2020-07-18 00:17:50,852 INFO L280 TraceCheckUtils]: 23: Hoare triple {45523#true} havoc ~lk5~0; {45523#true} is VALID [2020-07-18 00:17:50,852 INFO L280 TraceCheckUtils]: 24: Hoare triple {45523#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {45523#true} is VALID [2020-07-18 00:17:50,852 INFO L280 TraceCheckUtils]: 25: Hoare triple {45523#true} ~p6~0 := #t~nondet5; {45523#true} is VALID [2020-07-18 00:17:50,852 INFO L280 TraceCheckUtils]: 26: Hoare triple {45523#true} havoc #t~nondet5; {45523#true} is VALID [2020-07-18 00:17:50,853 INFO L280 TraceCheckUtils]: 27: Hoare triple {45523#true} havoc ~lk6~0; {45523#true} is VALID [2020-07-18 00:17:50,853 INFO L280 TraceCheckUtils]: 28: Hoare triple {45523#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {45523#true} is VALID [2020-07-18 00:17:50,853 INFO L280 TraceCheckUtils]: 29: Hoare triple {45523#true} ~p7~0 := #t~nondet6; {45523#true} is VALID [2020-07-18 00:17:50,853 INFO L280 TraceCheckUtils]: 30: Hoare triple {45523#true} havoc #t~nondet6; {45523#true} is VALID [2020-07-18 00:17:50,853 INFO L280 TraceCheckUtils]: 31: Hoare triple {45523#true} havoc ~lk7~0; {45523#true} is VALID [2020-07-18 00:17:50,853 INFO L280 TraceCheckUtils]: 32: Hoare triple {45523#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {45523#true} is VALID [2020-07-18 00:17:50,854 INFO L280 TraceCheckUtils]: 33: Hoare triple {45523#true} ~p8~0 := #t~nondet7; {45523#true} is VALID [2020-07-18 00:17:50,854 INFO L280 TraceCheckUtils]: 34: Hoare triple {45523#true} havoc #t~nondet7; {45523#true} is VALID [2020-07-18 00:17:50,854 INFO L280 TraceCheckUtils]: 35: Hoare triple {45523#true} havoc ~lk8~0; {45523#true} is VALID [2020-07-18 00:17:50,854 INFO L280 TraceCheckUtils]: 36: Hoare triple {45523#true} havoc ~cond~0; {45523#true} is VALID [2020-07-18 00:17:50,854 INFO L280 TraceCheckUtils]: 37: Hoare triple {45523#true} assume !false; {45523#true} is VALID [2020-07-18 00:17:50,855 INFO L280 TraceCheckUtils]: 38: Hoare triple {45523#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {45523#true} is VALID [2020-07-18 00:17:50,855 INFO L280 TraceCheckUtils]: 39: Hoare triple {45523#true} ~cond~0 := #t~nondet8; {45523#true} is VALID [2020-07-18 00:17:50,855 INFO L280 TraceCheckUtils]: 40: Hoare triple {45523#true} havoc #t~nondet8; {45523#true} is VALID [2020-07-18 00:17:50,855 INFO L280 TraceCheckUtils]: 41: Hoare triple {45523#true} assume !(0 == ~cond~0); {45523#true} is VALID [2020-07-18 00:17:50,855 INFO L280 TraceCheckUtils]: 42: Hoare triple {45523#true} ~lk1~0 := 0; {45523#true} is VALID [2020-07-18 00:17:50,855 INFO L280 TraceCheckUtils]: 43: Hoare triple {45523#true} ~lk2~0 := 0; {45523#true} is VALID [2020-07-18 00:17:50,856 INFO L280 TraceCheckUtils]: 44: Hoare triple {45523#true} ~lk3~0 := 0; {45523#true} is VALID [2020-07-18 00:17:50,856 INFO L280 TraceCheckUtils]: 45: Hoare triple {45523#true} ~lk4~0 := 0; {45523#true} is VALID [2020-07-18 00:17:50,856 INFO L280 TraceCheckUtils]: 46: Hoare triple {45523#true} ~lk5~0 := 0; {45523#true} is VALID [2020-07-18 00:17:50,856 INFO L280 TraceCheckUtils]: 47: Hoare triple {45523#true} ~lk6~0 := 0; {45523#true} is VALID [2020-07-18 00:17:50,856 INFO L280 TraceCheckUtils]: 48: Hoare triple {45523#true} ~lk7~0 := 0; {45523#true} is VALID [2020-07-18 00:17:50,857 INFO L280 TraceCheckUtils]: 49: Hoare triple {45523#true} ~lk8~0 := 0; {45523#true} is VALID [2020-07-18 00:17:50,857 INFO L280 TraceCheckUtils]: 50: Hoare triple {45523#true} assume !(0 != ~p1~0); {45523#true} is VALID [2020-07-18 00:17:50,857 INFO L280 TraceCheckUtils]: 51: Hoare triple {45523#true} assume !(0 != ~p2~0); {45523#true} is VALID [2020-07-18 00:17:50,857 INFO L280 TraceCheckUtils]: 52: Hoare triple {45523#true} assume !(0 != ~p3~0); {45523#true} is VALID [2020-07-18 00:17:50,857 INFO L280 TraceCheckUtils]: 53: Hoare triple {45523#true} assume !(0 != ~p4~0); {45523#true} is VALID [2020-07-18 00:17:50,858 INFO L280 TraceCheckUtils]: 54: Hoare triple {45523#true} assume !(0 != ~p5~0); {45523#true} is VALID [2020-07-18 00:17:50,858 INFO L280 TraceCheckUtils]: 55: Hoare triple {45523#true} assume !(0 != ~p6~0); {45527#(= 0 main_~p6~0)} is VALID [2020-07-18 00:17:50,859 INFO L280 TraceCheckUtils]: 56: Hoare triple {45527#(= 0 main_~p6~0)} assume !(0 != ~p7~0); {45527#(= 0 main_~p6~0)} is VALID [2020-07-18 00:17:50,859 INFO L280 TraceCheckUtils]: 57: Hoare triple {45527#(= 0 main_~p6~0)} assume !(0 != ~p8~0); {45527#(= 0 main_~p6~0)} is VALID [2020-07-18 00:17:50,860 INFO L280 TraceCheckUtils]: 58: Hoare triple {45527#(= 0 main_~p6~0)} assume !(0 != ~p1~0); {45527#(= 0 main_~p6~0)} is VALID [2020-07-18 00:17:50,860 INFO L280 TraceCheckUtils]: 59: Hoare triple {45527#(= 0 main_~p6~0)} assume !(0 != ~p2~0); {45527#(= 0 main_~p6~0)} is VALID [2020-07-18 00:17:50,861 INFO L280 TraceCheckUtils]: 60: Hoare triple {45527#(= 0 main_~p6~0)} assume !(0 != ~p3~0); {45527#(= 0 main_~p6~0)} is VALID [2020-07-18 00:17:50,861 INFO L280 TraceCheckUtils]: 61: Hoare triple {45527#(= 0 main_~p6~0)} assume !(0 != ~p4~0); {45527#(= 0 main_~p6~0)} is VALID [2020-07-18 00:17:50,862 INFO L280 TraceCheckUtils]: 62: Hoare triple {45527#(= 0 main_~p6~0)} assume !(0 != ~p5~0); {45527#(= 0 main_~p6~0)} is VALID [2020-07-18 00:17:50,862 INFO L280 TraceCheckUtils]: 63: Hoare triple {45527#(= 0 main_~p6~0)} assume 0 != ~p6~0; {45524#false} is VALID [2020-07-18 00:17:50,862 INFO L280 TraceCheckUtils]: 64: Hoare triple {45524#false} assume 1 != ~lk6~0; {45524#false} is VALID [2020-07-18 00:17:50,862 INFO L280 TraceCheckUtils]: 65: Hoare triple {45524#false} assume !false; {45524#false} is VALID [2020-07-18 00:17:50,865 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:50,865 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:17:50,866 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1933221625] [2020-07-18 00:17:50,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:17:50,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:17:50,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040363239] [2020-07-18 00:17:50,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-07-18 00:17:50,867 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:17:50,867 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:17:50,936 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:50,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:17:50,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:17:50,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:17:50,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:17:50,937 INFO L87 Difference]: Start difference. First operand 1495 states and 1942 transitions. Second operand 3 states. [2020-07-18 00:17:58,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:58,974 INFO L93 Difference]: Finished difference Result 4315 states and 5624 transitions. [2020-07-18 00:17:58,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:17:58,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-07-18 00:17:58,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:17:58,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:17:58,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 252 transitions. [2020-07-18 00:17:58,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:17:58,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 252 transitions. [2020-07-18 00:17:58,978 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 252 transitions. [2020-07-18 00:17:59,199 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 252 edges. 252 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:59,488 INFO L225 Difference]: With dead ends: 4315 [2020-07-18 00:17:59,488 INFO L226 Difference]: Without dead ends: 2857 [2020-07-18 00:17:59,491 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:59,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2857 states. [2020-07-18 00:18:06,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2857 to 2855. [2020-07-18 00:18:06,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:18:06,196 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2857 states. Second operand 2855 states. [2020-07-18 00:18:06,196 INFO L74 IsIncluded]: Start isIncluded. First operand 2857 states. Second operand 2855 states. [2020-07-18 00:18:06,197 INFO L87 Difference]: Start difference. First operand 2857 states. Second operand 2855 states. [2020-07-18 00:18:06,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:18:06,419 INFO L93 Difference]: Finished difference Result 2857 states and 3655 transitions. [2020-07-18 00:18:06,420 INFO L276 IsEmpty]: Start isEmpty. Operand 2857 states and 3655 transitions. [2020-07-18 00:18:06,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:18:06,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:18:06,422 INFO L74 IsIncluded]: Start isIncluded. First operand 2855 states. Second operand 2857 states. [2020-07-18 00:18:06,423 INFO L87 Difference]: Start difference. First operand 2855 states. Second operand 2857 states. [2020-07-18 00:18:06,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:18:06,660 INFO L93 Difference]: Finished difference Result 2857 states and 3655 transitions. [2020-07-18 00:18:06,660 INFO L276 IsEmpty]: Start isEmpty. Operand 2857 states and 3655 transitions. [2020-07-18 00:18:06,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:18:06,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:18:06,663 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:18:06,663 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:18:06,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2855 states. [2020-07-18 00:18:06,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2855 states to 2855 states and 3654 transitions. [2020-07-18 00:18:06,897 INFO L78 Accepts]: Start accepts. Automaton has 2855 states and 3654 transitions. Word has length 66 [2020-07-18 00:18:06,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:18:06,898 INFO L479 AbstractCegarLoop]: Abstraction has 2855 states and 3654 transitions. [2020-07-18 00:18:06,898 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:18:06,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2855 states and 3654 transitions. [2020-07-18 00:18:11,486 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3654 edges. 3654 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:18:11,487 INFO L276 IsEmpty]: Start isEmpty. Operand 2855 states and 3654 transitions. [2020-07-18 00:18:11,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-07-18 00:18:11,489 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:18:11,489 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:18:11,489 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-18 00:18:11,490 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:18:11,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:18:11,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1214689743, now seen corresponding path program 1 times [2020-07-18 00:18:11,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:18:11,490 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1254414499] [2020-07-18 00:18:11,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:18:11,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:18:11,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:18:11,526 INFO L280 TraceCheckUtils]: 0: Hoare triple {65584#true} assume true; {65584#true} is VALID [2020-07-18 00:18:11,526 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {65584#true} {65584#true} #223#return; {65584#true} is VALID [2020-07-18 00:18:11,526 INFO L263 TraceCheckUtils]: 0: Hoare triple {65584#true} call ULTIMATE.init(); {65584#true} is VALID [2020-07-18 00:18:11,527 INFO L280 TraceCheckUtils]: 1: Hoare triple {65584#true} assume true; {65584#true} is VALID [2020-07-18 00:18:11,527 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {65584#true} {65584#true} #223#return; {65584#true} is VALID [2020-07-18 00:18:11,527 INFO L263 TraceCheckUtils]: 3: Hoare triple {65584#true} call #t~ret9 := main(); {65584#true} is VALID [2020-07-18 00:18:11,527 INFO L280 TraceCheckUtils]: 4: Hoare triple {65584#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {65584#true} is VALID [2020-07-18 00:18:11,528 INFO L280 TraceCheckUtils]: 5: Hoare triple {65584#true} ~p1~0 := #t~nondet0; {65584#true} is VALID [2020-07-18 00:18:11,528 INFO L280 TraceCheckUtils]: 6: Hoare triple {65584#true} havoc #t~nondet0; {65584#true} is VALID [2020-07-18 00:18:11,528 INFO L280 TraceCheckUtils]: 7: Hoare triple {65584#true} havoc ~lk1~0; {65584#true} is VALID [2020-07-18 00:18:11,528 INFO L280 TraceCheckUtils]: 8: Hoare triple {65584#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {65584#true} is VALID [2020-07-18 00:18:11,528 INFO L280 TraceCheckUtils]: 9: Hoare triple {65584#true} ~p2~0 := #t~nondet1; {65584#true} is VALID [2020-07-18 00:18:11,529 INFO L280 TraceCheckUtils]: 10: Hoare triple {65584#true} havoc #t~nondet1; {65584#true} is VALID [2020-07-18 00:18:11,529 INFO L280 TraceCheckUtils]: 11: Hoare triple {65584#true} havoc ~lk2~0; {65584#true} is VALID [2020-07-18 00:18:11,529 INFO L280 TraceCheckUtils]: 12: Hoare triple {65584#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {65584#true} is VALID [2020-07-18 00:18:11,529 INFO L280 TraceCheckUtils]: 13: Hoare triple {65584#true} ~p3~0 := #t~nondet2; {65584#true} is VALID [2020-07-18 00:18:11,529 INFO L280 TraceCheckUtils]: 14: Hoare triple {65584#true} havoc #t~nondet2; {65584#true} is VALID [2020-07-18 00:18:11,530 INFO L280 TraceCheckUtils]: 15: Hoare triple {65584#true} havoc ~lk3~0; {65584#true} is VALID [2020-07-18 00:18:11,530 INFO L280 TraceCheckUtils]: 16: Hoare triple {65584#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {65584#true} is VALID [2020-07-18 00:18:11,530 INFO L280 TraceCheckUtils]: 17: Hoare triple {65584#true} ~p4~0 := #t~nondet3; {65584#true} is VALID [2020-07-18 00:18:11,530 INFO L280 TraceCheckUtils]: 18: Hoare triple {65584#true} havoc #t~nondet3; {65584#true} is VALID [2020-07-18 00:18:11,530 INFO L280 TraceCheckUtils]: 19: Hoare triple {65584#true} havoc ~lk4~0; {65584#true} is VALID [2020-07-18 00:18:11,530 INFO L280 TraceCheckUtils]: 20: Hoare triple {65584#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {65584#true} is VALID [2020-07-18 00:18:11,531 INFO L280 TraceCheckUtils]: 21: Hoare triple {65584#true} ~p5~0 := #t~nondet4; {65584#true} is VALID [2020-07-18 00:18:11,531 INFO L280 TraceCheckUtils]: 22: Hoare triple {65584#true} havoc #t~nondet4; {65584#true} is VALID [2020-07-18 00:18:11,531 INFO L280 TraceCheckUtils]: 23: Hoare triple {65584#true} havoc ~lk5~0; {65584#true} is VALID [2020-07-18 00:18:11,531 INFO L280 TraceCheckUtils]: 24: Hoare triple {65584#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {65584#true} is VALID [2020-07-18 00:18:11,531 INFO L280 TraceCheckUtils]: 25: Hoare triple {65584#true} ~p6~0 := #t~nondet5; {65584#true} is VALID [2020-07-18 00:18:11,532 INFO L280 TraceCheckUtils]: 26: Hoare triple {65584#true} havoc #t~nondet5; {65584#true} is VALID [2020-07-18 00:18:11,532 INFO L280 TraceCheckUtils]: 27: Hoare triple {65584#true} havoc ~lk6~0; {65584#true} is VALID [2020-07-18 00:18:11,532 INFO L280 TraceCheckUtils]: 28: Hoare triple {65584#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {65584#true} is VALID [2020-07-18 00:18:11,532 INFO L280 TraceCheckUtils]: 29: Hoare triple {65584#true} ~p7~0 := #t~nondet6; {65584#true} is VALID [2020-07-18 00:18:11,532 INFO L280 TraceCheckUtils]: 30: Hoare triple {65584#true} havoc #t~nondet6; {65584#true} is VALID [2020-07-18 00:18:11,533 INFO L280 TraceCheckUtils]: 31: Hoare triple {65584#true} havoc ~lk7~0; {65584#true} is VALID [2020-07-18 00:18:11,533 INFO L280 TraceCheckUtils]: 32: Hoare triple {65584#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {65584#true} is VALID [2020-07-18 00:18:11,533 INFO L280 TraceCheckUtils]: 33: Hoare triple {65584#true} ~p8~0 := #t~nondet7; {65584#true} is VALID [2020-07-18 00:18:11,533 INFO L280 TraceCheckUtils]: 34: Hoare triple {65584#true} havoc #t~nondet7; {65584#true} is VALID [2020-07-18 00:18:11,534 INFO L280 TraceCheckUtils]: 35: Hoare triple {65584#true} havoc ~lk8~0; {65584#true} is VALID [2020-07-18 00:18:11,534 INFO L280 TraceCheckUtils]: 36: Hoare triple {65584#true} havoc ~cond~0; {65584#true} is VALID [2020-07-18 00:18:11,534 INFO L280 TraceCheckUtils]: 37: Hoare triple {65584#true} assume !false; {65584#true} is VALID [2020-07-18 00:18:11,534 INFO L280 TraceCheckUtils]: 38: Hoare triple {65584#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {65584#true} is VALID [2020-07-18 00:18:11,534 INFO L280 TraceCheckUtils]: 39: Hoare triple {65584#true} ~cond~0 := #t~nondet8; {65584#true} is VALID [2020-07-18 00:18:11,535 INFO L280 TraceCheckUtils]: 40: Hoare triple {65584#true} havoc #t~nondet8; {65584#true} is VALID [2020-07-18 00:18:11,535 INFO L280 TraceCheckUtils]: 41: Hoare triple {65584#true} assume !(0 == ~cond~0); {65584#true} is VALID [2020-07-18 00:18:11,535 INFO L280 TraceCheckUtils]: 42: Hoare triple {65584#true} ~lk1~0 := 0; {65584#true} is VALID [2020-07-18 00:18:11,535 INFO L280 TraceCheckUtils]: 43: Hoare triple {65584#true} ~lk2~0 := 0; {65584#true} is VALID [2020-07-18 00:18:11,535 INFO L280 TraceCheckUtils]: 44: Hoare triple {65584#true} ~lk3~0 := 0; {65584#true} is VALID [2020-07-18 00:18:11,536 INFO L280 TraceCheckUtils]: 45: Hoare triple {65584#true} ~lk4~0 := 0; {65584#true} is VALID [2020-07-18 00:18:11,536 INFO L280 TraceCheckUtils]: 46: Hoare triple {65584#true} ~lk5~0 := 0; {65584#true} is VALID [2020-07-18 00:18:11,536 INFO L280 TraceCheckUtils]: 47: Hoare triple {65584#true} ~lk6~0 := 0; {65584#true} is VALID [2020-07-18 00:18:11,536 INFO L280 TraceCheckUtils]: 48: Hoare triple {65584#true} ~lk7~0 := 0; {65584#true} is VALID [2020-07-18 00:18:11,536 INFO L280 TraceCheckUtils]: 49: Hoare triple {65584#true} ~lk8~0 := 0; {65584#true} is VALID [2020-07-18 00:18:11,537 INFO L280 TraceCheckUtils]: 50: Hoare triple {65584#true} assume !(0 != ~p1~0); {65584#true} is VALID [2020-07-18 00:18:11,537 INFO L280 TraceCheckUtils]: 51: Hoare triple {65584#true} assume !(0 != ~p2~0); {65584#true} is VALID [2020-07-18 00:18:11,537 INFO L280 TraceCheckUtils]: 52: Hoare triple {65584#true} assume !(0 != ~p3~0); {65584#true} is VALID [2020-07-18 00:18:11,537 INFO L280 TraceCheckUtils]: 53: Hoare triple {65584#true} assume !(0 != ~p4~0); {65584#true} is VALID [2020-07-18 00:18:11,537 INFO L280 TraceCheckUtils]: 54: Hoare triple {65584#true} assume !(0 != ~p5~0); {65584#true} is VALID [2020-07-18 00:18:11,538 INFO L280 TraceCheckUtils]: 55: Hoare triple {65584#true} assume 0 != ~p6~0; {65584#true} is VALID [2020-07-18 00:18:11,538 INFO L280 TraceCheckUtils]: 56: Hoare triple {65584#true} ~lk6~0 := 1; {65588#(= 1 main_~lk6~0)} is VALID [2020-07-18 00:18:11,539 INFO L280 TraceCheckUtils]: 57: Hoare triple {65588#(= 1 main_~lk6~0)} assume !(0 != ~p7~0); {65588#(= 1 main_~lk6~0)} is VALID [2020-07-18 00:18:11,539 INFO L280 TraceCheckUtils]: 58: Hoare triple {65588#(= 1 main_~lk6~0)} assume !(0 != ~p8~0); {65588#(= 1 main_~lk6~0)} is VALID [2020-07-18 00:18:11,540 INFO L280 TraceCheckUtils]: 59: Hoare triple {65588#(= 1 main_~lk6~0)} assume !(0 != ~p1~0); {65588#(= 1 main_~lk6~0)} is VALID [2020-07-18 00:18:11,540 INFO L280 TraceCheckUtils]: 60: Hoare triple {65588#(= 1 main_~lk6~0)} assume !(0 != ~p2~0); {65588#(= 1 main_~lk6~0)} is VALID [2020-07-18 00:18:11,541 INFO L280 TraceCheckUtils]: 61: Hoare triple {65588#(= 1 main_~lk6~0)} assume !(0 != ~p3~0); {65588#(= 1 main_~lk6~0)} is VALID [2020-07-18 00:18:11,541 INFO L280 TraceCheckUtils]: 62: Hoare triple {65588#(= 1 main_~lk6~0)} assume !(0 != ~p4~0); {65588#(= 1 main_~lk6~0)} is VALID [2020-07-18 00:18:11,541 INFO L280 TraceCheckUtils]: 63: Hoare triple {65588#(= 1 main_~lk6~0)} assume !(0 != ~p5~0); {65588#(= 1 main_~lk6~0)} is VALID [2020-07-18 00:18:11,542 INFO L280 TraceCheckUtils]: 64: Hoare triple {65588#(= 1 main_~lk6~0)} assume 0 != ~p6~0; {65588#(= 1 main_~lk6~0)} is VALID [2020-07-18 00:18:11,542 INFO L280 TraceCheckUtils]: 65: Hoare triple {65588#(= 1 main_~lk6~0)} assume 1 != ~lk6~0; {65585#false} is VALID [2020-07-18 00:18:11,542 INFO L280 TraceCheckUtils]: 66: Hoare triple {65585#false} assume !false; {65585#false} is VALID [2020-07-18 00:18:11,545 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:18:11,545 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:18:11,546 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1254414499] [2020-07-18 00:18:11,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:18:11,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:18:11,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611719255] [2020-07-18 00:18:11,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2020-07-18 00:18:11,547 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:18:11,547 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:18:11,598 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:18:11,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:18:11,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:18:11,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:18:11,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:18:11,599 INFO L87 Difference]: Start difference. First operand 2855 states and 3654 transitions. Second operand 3 states. [2020-07-18 00:18:21,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:18:21,032 INFO L93 Difference]: Finished difference Result 3403 states and 4328 transitions. [2020-07-18 00:18:21,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:18:21,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2020-07-18 00:18:21,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:18:21,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:18:21,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2020-07-18 00:18:21,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:18:21,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2020-07-18 00:18:21,035 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 160 transitions. [2020-07-18 00:18:21,179 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:18:21,616 INFO L225 Difference]: With dead ends: 3403 [2020-07-18 00:18:21,616 INFO L226 Difference]: Without dead ends: 3401 [2020-07-18 00:18:21,617 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:18:21,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3401 states. [2020-07-18 00:18:28,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3401 to 2855. [2020-07-18 00:18:28,682 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:18:28,682 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3401 states. Second operand 2855 states. [2020-07-18 00:18:28,682 INFO L74 IsIncluded]: Start isIncluded. First operand 3401 states. Second operand 2855 states. [2020-07-18 00:18:28,682 INFO L87 Difference]: Start difference. First operand 3401 states. Second operand 2855 states. [2020-07-18 00:18:29,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:18:29,039 INFO L93 Difference]: Finished difference Result 3401 states and 4295 transitions. [2020-07-18 00:18:29,040 INFO L276 IsEmpty]: Start isEmpty. Operand 3401 states and 4295 transitions. [2020-07-18 00:18:29,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:18:29,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:18:29,043 INFO L74 IsIncluded]: Start isIncluded. First operand 2855 states. Second operand 3401 states. [2020-07-18 00:18:29,043 INFO L87 Difference]: Start difference. First operand 2855 states. Second operand 3401 states. [2020-07-18 00:18:29,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:18:29,411 INFO L93 Difference]: Finished difference Result 3401 states and 4295 transitions. [2020-07-18 00:18:29,411 INFO L276 IsEmpty]: Start isEmpty. Operand 3401 states and 4295 transitions. [2020-07-18 00:18:29,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:18:29,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:18:29,414 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:18:29,414 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:18:29,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2855 states. [2020-07-18 00:18:29,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2855 states to 2855 states and 3622 transitions. [2020-07-18 00:18:29,673 INFO L78 Accepts]: Start accepts. Automaton has 2855 states and 3622 transitions. Word has length 67 [2020-07-18 00:18:29,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:18:29,673 INFO L479 AbstractCegarLoop]: Abstraction has 2855 states and 3622 transitions. [2020-07-18 00:18:29,673 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:18:29,673 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2855 states and 3622 transitions. [2020-07-18 00:18:34,431 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3622 edges. 3622 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:18:34,431 INFO L276 IsEmpty]: Start isEmpty. Operand 2855 states and 3622 transitions. [2020-07-18 00:18:34,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-07-18 00:18:34,435 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:18:34,435 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:18:34,435 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-18 00:18:34,436 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:18:34,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:18:34,436 INFO L82 PathProgramCache]: Analyzing trace with hash 443652336, now seen corresponding path program 1 times [2020-07-18 00:18:34,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:18:34,436 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [908175260] [2020-07-18 00:18:34,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:18:34,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:18:34,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:18:34,468 INFO L280 TraceCheckUtils]: 0: Hoare triple {84909#true} assume true; {84909#true} is VALID [2020-07-18 00:18:34,468 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {84909#true} {84909#true} #223#return; {84909#true} is VALID [2020-07-18 00:18:34,469 INFO L263 TraceCheckUtils]: 0: Hoare triple {84909#true} call ULTIMATE.init(); {84909#true} is VALID [2020-07-18 00:18:34,469 INFO L280 TraceCheckUtils]: 1: Hoare triple {84909#true} assume true; {84909#true} is VALID [2020-07-18 00:18:34,469 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {84909#true} {84909#true} #223#return; {84909#true} is VALID [2020-07-18 00:18:34,469 INFO L263 TraceCheckUtils]: 3: Hoare triple {84909#true} call #t~ret9 := main(); {84909#true} is VALID [2020-07-18 00:18:34,469 INFO L280 TraceCheckUtils]: 4: Hoare triple {84909#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {84909#true} is VALID [2020-07-18 00:18:34,470 INFO L280 TraceCheckUtils]: 5: Hoare triple {84909#true} ~p1~0 := #t~nondet0; {84909#true} is VALID [2020-07-18 00:18:34,470 INFO L280 TraceCheckUtils]: 6: Hoare triple {84909#true} havoc #t~nondet0; {84909#true} is VALID [2020-07-18 00:18:34,470 INFO L280 TraceCheckUtils]: 7: Hoare triple {84909#true} havoc ~lk1~0; {84909#true} is VALID [2020-07-18 00:18:34,470 INFO L280 TraceCheckUtils]: 8: Hoare triple {84909#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {84909#true} is VALID [2020-07-18 00:18:34,470 INFO L280 TraceCheckUtils]: 9: Hoare triple {84909#true} ~p2~0 := #t~nondet1; {84909#true} is VALID [2020-07-18 00:18:34,471 INFO L280 TraceCheckUtils]: 10: Hoare triple {84909#true} havoc #t~nondet1; {84909#true} is VALID [2020-07-18 00:18:34,471 INFO L280 TraceCheckUtils]: 11: Hoare triple {84909#true} havoc ~lk2~0; {84909#true} is VALID [2020-07-18 00:18:34,471 INFO L280 TraceCheckUtils]: 12: Hoare triple {84909#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {84909#true} is VALID [2020-07-18 00:18:34,471 INFO L280 TraceCheckUtils]: 13: Hoare triple {84909#true} ~p3~0 := #t~nondet2; {84909#true} is VALID [2020-07-18 00:18:34,471 INFO L280 TraceCheckUtils]: 14: Hoare triple {84909#true} havoc #t~nondet2; {84909#true} is VALID [2020-07-18 00:18:34,472 INFO L280 TraceCheckUtils]: 15: Hoare triple {84909#true} havoc ~lk3~0; {84909#true} is VALID [2020-07-18 00:18:34,472 INFO L280 TraceCheckUtils]: 16: Hoare triple {84909#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {84909#true} is VALID [2020-07-18 00:18:34,472 INFO L280 TraceCheckUtils]: 17: Hoare triple {84909#true} ~p4~0 := #t~nondet3; {84909#true} is VALID [2020-07-18 00:18:34,472 INFO L280 TraceCheckUtils]: 18: Hoare triple {84909#true} havoc #t~nondet3; {84909#true} is VALID [2020-07-18 00:18:34,472 INFO L280 TraceCheckUtils]: 19: Hoare triple {84909#true} havoc ~lk4~0; {84909#true} is VALID [2020-07-18 00:18:34,472 INFO L280 TraceCheckUtils]: 20: Hoare triple {84909#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {84909#true} is VALID [2020-07-18 00:18:34,473 INFO L280 TraceCheckUtils]: 21: Hoare triple {84909#true} ~p5~0 := #t~nondet4; {84909#true} is VALID [2020-07-18 00:18:34,473 INFO L280 TraceCheckUtils]: 22: Hoare triple {84909#true} havoc #t~nondet4; {84909#true} is VALID [2020-07-18 00:18:34,473 INFO L280 TraceCheckUtils]: 23: Hoare triple {84909#true} havoc ~lk5~0; {84909#true} is VALID [2020-07-18 00:18:34,473 INFO L280 TraceCheckUtils]: 24: Hoare triple {84909#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {84909#true} is VALID [2020-07-18 00:18:34,473 INFO L280 TraceCheckUtils]: 25: Hoare triple {84909#true} ~p6~0 := #t~nondet5; {84909#true} is VALID [2020-07-18 00:18:34,474 INFO L280 TraceCheckUtils]: 26: Hoare triple {84909#true} havoc #t~nondet5; {84909#true} is VALID [2020-07-18 00:18:34,474 INFO L280 TraceCheckUtils]: 27: Hoare triple {84909#true} havoc ~lk6~0; {84909#true} is VALID [2020-07-18 00:18:34,474 INFO L280 TraceCheckUtils]: 28: Hoare triple {84909#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {84909#true} is VALID [2020-07-18 00:18:34,474 INFO L280 TraceCheckUtils]: 29: Hoare triple {84909#true} ~p7~0 := #t~nondet6; {84909#true} is VALID [2020-07-18 00:18:34,474 INFO L280 TraceCheckUtils]: 30: Hoare triple {84909#true} havoc #t~nondet6; {84909#true} is VALID [2020-07-18 00:18:34,474 INFO L280 TraceCheckUtils]: 31: Hoare triple {84909#true} havoc ~lk7~0; {84909#true} is VALID [2020-07-18 00:18:34,475 INFO L280 TraceCheckUtils]: 32: Hoare triple {84909#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {84909#true} is VALID [2020-07-18 00:18:34,475 INFO L280 TraceCheckUtils]: 33: Hoare triple {84909#true} ~p8~0 := #t~nondet7; {84909#true} is VALID [2020-07-18 00:18:34,475 INFO L280 TraceCheckUtils]: 34: Hoare triple {84909#true} havoc #t~nondet7; {84909#true} is VALID [2020-07-18 00:18:34,475 INFO L280 TraceCheckUtils]: 35: Hoare triple {84909#true} havoc ~lk8~0; {84909#true} is VALID [2020-07-18 00:18:34,475 INFO L280 TraceCheckUtils]: 36: Hoare triple {84909#true} havoc ~cond~0; {84909#true} is VALID [2020-07-18 00:18:34,476 INFO L280 TraceCheckUtils]: 37: Hoare triple {84909#true} assume !false; {84909#true} is VALID [2020-07-18 00:18:34,476 INFO L280 TraceCheckUtils]: 38: Hoare triple {84909#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {84909#true} is VALID [2020-07-18 00:18:34,476 INFO L280 TraceCheckUtils]: 39: Hoare triple {84909#true} ~cond~0 := #t~nondet8; {84909#true} is VALID [2020-07-18 00:18:34,476 INFO L280 TraceCheckUtils]: 40: Hoare triple {84909#true} havoc #t~nondet8; {84909#true} is VALID [2020-07-18 00:18:34,476 INFO L280 TraceCheckUtils]: 41: Hoare triple {84909#true} assume !(0 == ~cond~0); {84909#true} is VALID [2020-07-18 00:18:34,476 INFO L280 TraceCheckUtils]: 42: Hoare triple {84909#true} ~lk1~0 := 0; {84909#true} is VALID [2020-07-18 00:18:34,477 INFO L280 TraceCheckUtils]: 43: Hoare triple {84909#true} ~lk2~0 := 0; {84909#true} is VALID [2020-07-18 00:18:34,477 INFO L280 TraceCheckUtils]: 44: Hoare triple {84909#true} ~lk3~0 := 0; {84909#true} is VALID [2020-07-18 00:18:34,477 INFO L280 TraceCheckUtils]: 45: Hoare triple {84909#true} ~lk4~0 := 0; {84909#true} is VALID [2020-07-18 00:18:34,477 INFO L280 TraceCheckUtils]: 46: Hoare triple {84909#true} ~lk5~0 := 0; {84909#true} is VALID [2020-07-18 00:18:34,477 INFO L280 TraceCheckUtils]: 47: Hoare triple {84909#true} ~lk6~0 := 0; {84909#true} is VALID [2020-07-18 00:18:34,478 INFO L280 TraceCheckUtils]: 48: Hoare triple {84909#true} ~lk7~0 := 0; {84909#true} is VALID [2020-07-18 00:18:34,478 INFO L280 TraceCheckUtils]: 49: Hoare triple {84909#true} ~lk8~0 := 0; {84909#true} is VALID [2020-07-18 00:18:34,478 INFO L280 TraceCheckUtils]: 50: Hoare triple {84909#true} assume !(0 != ~p1~0); {84909#true} is VALID [2020-07-18 00:18:34,478 INFO L280 TraceCheckUtils]: 51: Hoare triple {84909#true} assume !(0 != ~p2~0); {84909#true} is VALID [2020-07-18 00:18:34,478 INFO L280 TraceCheckUtils]: 52: Hoare triple {84909#true} assume !(0 != ~p3~0); {84909#true} is VALID [2020-07-18 00:18:34,478 INFO L280 TraceCheckUtils]: 53: Hoare triple {84909#true} assume !(0 != ~p4~0); {84909#true} is VALID [2020-07-18 00:18:34,479 INFO L280 TraceCheckUtils]: 54: Hoare triple {84909#true} assume !(0 != ~p5~0); {84909#true} is VALID [2020-07-18 00:18:34,479 INFO L280 TraceCheckUtils]: 55: Hoare triple {84909#true} assume !(0 != ~p6~0); {84909#true} is VALID [2020-07-18 00:18:34,484 INFO L280 TraceCheckUtils]: 56: Hoare triple {84909#true} assume !(0 != ~p7~0); {84913#(= 0 main_~p7~0)} is VALID [2020-07-18 00:18:34,484 INFO L280 TraceCheckUtils]: 57: Hoare triple {84913#(= 0 main_~p7~0)} assume !(0 != ~p8~0); {84913#(= 0 main_~p7~0)} is VALID [2020-07-18 00:18:34,485 INFO L280 TraceCheckUtils]: 58: Hoare triple {84913#(= 0 main_~p7~0)} assume !(0 != ~p1~0); {84913#(= 0 main_~p7~0)} is VALID [2020-07-18 00:18:34,485 INFO L280 TraceCheckUtils]: 59: Hoare triple {84913#(= 0 main_~p7~0)} assume !(0 != ~p2~0); {84913#(= 0 main_~p7~0)} is VALID [2020-07-18 00:18:34,486 INFO L280 TraceCheckUtils]: 60: Hoare triple {84913#(= 0 main_~p7~0)} assume !(0 != ~p3~0); {84913#(= 0 main_~p7~0)} is VALID [2020-07-18 00:18:34,486 INFO L280 TraceCheckUtils]: 61: Hoare triple {84913#(= 0 main_~p7~0)} assume !(0 != ~p4~0); {84913#(= 0 main_~p7~0)} is VALID [2020-07-18 00:18:34,486 INFO L280 TraceCheckUtils]: 62: Hoare triple {84913#(= 0 main_~p7~0)} assume !(0 != ~p5~0); {84913#(= 0 main_~p7~0)} is VALID [2020-07-18 00:18:34,487 INFO L280 TraceCheckUtils]: 63: Hoare triple {84913#(= 0 main_~p7~0)} assume !(0 != ~p6~0); {84913#(= 0 main_~p7~0)} is VALID [2020-07-18 00:18:34,487 INFO L280 TraceCheckUtils]: 64: Hoare triple {84913#(= 0 main_~p7~0)} assume 0 != ~p7~0; {84910#false} is VALID [2020-07-18 00:18:34,488 INFO L280 TraceCheckUtils]: 65: Hoare triple {84910#false} assume 1 != ~lk7~0; {84910#false} is VALID [2020-07-18 00:18:34,488 INFO L280 TraceCheckUtils]: 66: Hoare triple {84910#false} assume !false; {84910#false} is VALID [2020-07-18 00:18:34,490 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:18:34,491 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:18:34,491 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [908175260] [2020-07-18 00:18:34,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:18:34,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:18:34,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963897898] [2020-07-18 00:18:34,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2020-07-18 00:18:34,492 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:18:34,492 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:18:34,548 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:18:34,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:18:34,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:18:34,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:18:34,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:18:34,549 INFO L87 Difference]: Start difference. First operand 2855 states and 3622 transitions. Second operand 3 states. [2020-07-18 00:18:52,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:18:52,414 INFO L93 Difference]: Finished difference Result 8299 states and 10536 transitions. [2020-07-18 00:18:52,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:18:52,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2020-07-18 00:18:52,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:18:52,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:18:52,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 249 transitions. [2020-07-18 00:18:52,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:18:52,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 249 transitions. [2020-07-18 00:18:52,417 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 249 transitions. [2020-07-18 00:18:52,643 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 249 edges. 249 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:18:53,672 INFO L225 Difference]: With dead ends: 8299 [2020-07-18 00:18:53,672 INFO L226 Difference]: Without dead ends: 5481 [2020-07-18 00:18:53,676 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:18:53,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5481 states. [2020-07-18 00:19:08,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5481 to 5479. [2020-07-18 00:19:08,883 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:19:08,883 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5481 states. Second operand 5479 states. [2020-07-18 00:19:08,883 INFO L74 IsIncluded]: Start isIncluded. First operand 5481 states. Second operand 5479 states. [2020-07-18 00:19:08,883 INFO L87 Difference]: Start difference. First operand 5481 states. Second operand 5479 states. [2020-07-18 00:19:09,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:19:09,733 INFO L93 Difference]: Finished difference Result 5481 states and 6823 transitions. [2020-07-18 00:19:09,733 INFO L276 IsEmpty]: Start isEmpty. Operand 5481 states and 6823 transitions. [2020-07-18 00:19:09,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:19:09,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:19:09,738 INFO L74 IsIncluded]: Start isIncluded. First operand 5479 states. Second operand 5481 states. [2020-07-18 00:19:09,739 INFO L87 Difference]: Start difference. First operand 5479 states. Second operand 5481 states. [2020-07-18 00:19:10,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:19:10,616 INFO L93 Difference]: Finished difference Result 5481 states and 6823 transitions. [2020-07-18 00:19:10,616 INFO L276 IsEmpty]: Start isEmpty. Operand 5481 states and 6823 transitions. [2020-07-18 00:19:10,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:19:10,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:19:10,621 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:19:10,622 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:19:10,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5479 states. [2020-07-18 00:19:11,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5479 states to 5479 states and 6822 transitions. [2020-07-18 00:19:11,566 INFO L78 Accepts]: Start accepts. Automaton has 5479 states and 6822 transitions. Word has length 67 [2020-07-18 00:19:11,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:19:11,567 INFO L479 AbstractCegarLoop]: Abstraction has 5479 states and 6822 transitions. [2020-07-18 00:19:11,567 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:19:11,567 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5479 states and 6822 transitions. [2020-07-18 00:19:20,568 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6822 edges. 6822 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:19:20,568 INFO L276 IsEmpty]: Start isEmpty. Operand 5479 states and 6822 transitions. [2020-07-18 00:19:20,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-07-18 00:19:20,572 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:19:20,572 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:19:20,572 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-18 00:19:20,572 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:19:20,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:19:20,572 INFO L82 PathProgramCache]: Analyzing trace with hash 192792828, now seen corresponding path program 1 times [2020-07-18 00:19:20,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:19:20,573 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1654607245] [2020-07-18 00:19:20,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:19:20,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:19:20,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:19:20,618 INFO L280 TraceCheckUtils]: 0: Hoare triple {123434#true} assume true; {123434#true} is VALID [2020-07-18 00:19:20,618 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {123434#true} {123434#true} #223#return; {123434#true} is VALID [2020-07-18 00:19:20,619 INFO L263 TraceCheckUtils]: 0: Hoare triple {123434#true} call ULTIMATE.init(); {123434#true} is VALID [2020-07-18 00:19:20,619 INFO L280 TraceCheckUtils]: 1: Hoare triple {123434#true} assume true; {123434#true} is VALID [2020-07-18 00:19:20,619 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {123434#true} {123434#true} #223#return; {123434#true} is VALID [2020-07-18 00:19:20,619 INFO L263 TraceCheckUtils]: 3: Hoare triple {123434#true} call #t~ret9 := main(); {123434#true} is VALID [2020-07-18 00:19:20,619 INFO L280 TraceCheckUtils]: 4: Hoare triple {123434#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {123434#true} is VALID [2020-07-18 00:19:20,620 INFO L280 TraceCheckUtils]: 5: Hoare triple {123434#true} ~p1~0 := #t~nondet0; {123434#true} is VALID [2020-07-18 00:19:20,620 INFO L280 TraceCheckUtils]: 6: Hoare triple {123434#true} havoc #t~nondet0; {123434#true} is VALID [2020-07-18 00:19:20,620 INFO L280 TraceCheckUtils]: 7: Hoare triple {123434#true} havoc ~lk1~0; {123434#true} is VALID [2020-07-18 00:19:20,620 INFO L280 TraceCheckUtils]: 8: Hoare triple {123434#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {123434#true} is VALID [2020-07-18 00:19:20,620 INFO L280 TraceCheckUtils]: 9: Hoare triple {123434#true} ~p2~0 := #t~nondet1; {123434#true} is VALID [2020-07-18 00:19:20,621 INFO L280 TraceCheckUtils]: 10: Hoare triple {123434#true} havoc #t~nondet1; {123434#true} is VALID [2020-07-18 00:19:20,621 INFO L280 TraceCheckUtils]: 11: Hoare triple {123434#true} havoc ~lk2~0; {123434#true} is VALID [2020-07-18 00:19:20,621 INFO L280 TraceCheckUtils]: 12: Hoare triple {123434#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {123434#true} is VALID [2020-07-18 00:19:20,621 INFO L280 TraceCheckUtils]: 13: Hoare triple {123434#true} ~p3~0 := #t~nondet2; {123434#true} is VALID [2020-07-18 00:19:20,621 INFO L280 TraceCheckUtils]: 14: Hoare triple {123434#true} havoc #t~nondet2; {123434#true} is VALID [2020-07-18 00:19:20,622 INFO L280 TraceCheckUtils]: 15: Hoare triple {123434#true} havoc ~lk3~0; {123434#true} is VALID [2020-07-18 00:19:20,622 INFO L280 TraceCheckUtils]: 16: Hoare triple {123434#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {123434#true} is VALID [2020-07-18 00:19:20,622 INFO L280 TraceCheckUtils]: 17: Hoare triple {123434#true} ~p4~0 := #t~nondet3; {123434#true} is VALID [2020-07-18 00:19:20,622 INFO L280 TraceCheckUtils]: 18: Hoare triple {123434#true} havoc #t~nondet3; {123434#true} is VALID [2020-07-18 00:19:20,622 INFO L280 TraceCheckUtils]: 19: Hoare triple {123434#true} havoc ~lk4~0; {123434#true} is VALID [2020-07-18 00:19:20,623 INFO L280 TraceCheckUtils]: 20: Hoare triple {123434#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {123434#true} is VALID [2020-07-18 00:19:20,623 INFO L280 TraceCheckUtils]: 21: Hoare triple {123434#true} ~p5~0 := #t~nondet4; {123434#true} is VALID [2020-07-18 00:19:20,623 INFO L280 TraceCheckUtils]: 22: Hoare triple {123434#true} havoc #t~nondet4; {123434#true} is VALID [2020-07-18 00:19:20,623 INFO L280 TraceCheckUtils]: 23: Hoare triple {123434#true} havoc ~lk5~0; {123434#true} is VALID [2020-07-18 00:19:20,623 INFO L280 TraceCheckUtils]: 24: Hoare triple {123434#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {123434#true} is VALID [2020-07-18 00:19:20,624 INFO L280 TraceCheckUtils]: 25: Hoare triple {123434#true} ~p6~0 := #t~nondet5; {123434#true} is VALID [2020-07-18 00:19:20,624 INFO L280 TraceCheckUtils]: 26: Hoare triple {123434#true} havoc #t~nondet5; {123434#true} is VALID [2020-07-18 00:19:20,624 INFO L280 TraceCheckUtils]: 27: Hoare triple {123434#true} havoc ~lk6~0; {123434#true} is VALID [2020-07-18 00:19:20,624 INFO L280 TraceCheckUtils]: 28: Hoare triple {123434#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {123434#true} is VALID [2020-07-18 00:19:20,624 INFO L280 TraceCheckUtils]: 29: Hoare triple {123434#true} ~p7~0 := #t~nondet6; {123434#true} is VALID [2020-07-18 00:19:20,625 INFO L280 TraceCheckUtils]: 30: Hoare triple {123434#true} havoc #t~nondet6; {123434#true} is VALID [2020-07-18 00:19:20,625 INFO L280 TraceCheckUtils]: 31: Hoare triple {123434#true} havoc ~lk7~0; {123434#true} is VALID [2020-07-18 00:19:20,625 INFO L280 TraceCheckUtils]: 32: Hoare triple {123434#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {123434#true} is VALID [2020-07-18 00:19:20,625 INFO L280 TraceCheckUtils]: 33: Hoare triple {123434#true} ~p8~0 := #t~nondet7; {123434#true} is VALID [2020-07-18 00:19:20,625 INFO L280 TraceCheckUtils]: 34: Hoare triple {123434#true} havoc #t~nondet7; {123434#true} is VALID [2020-07-18 00:19:20,626 INFO L280 TraceCheckUtils]: 35: Hoare triple {123434#true} havoc ~lk8~0; {123434#true} is VALID [2020-07-18 00:19:20,626 INFO L280 TraceCheckUtils]: 36: Hoare triple {123434#true} havoc ~cond~0; {123434#true} is VALID [2020-07-18 00:19:20,626 INFO L280 TraceCheckUtils]: 37: Hoare triple {123434#true} assume !false; {123434#true} is VALID [2020-07-18 00:19:20,626 INFO L280 TraceCheckUtils]: 38: Hoare triple {123434#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {123434#true} is VALID [2020-07-18 00:19:20,626 INFO L280 TraceCheckUtils]: 39: Hoare triple {123434#true} ~cond~0 := #t~nondet8; {123434#true} is VALID [2020-07-18 00:19:20,627 INFO L280 TraceCheckUtils]: 40: Hoare triple {123434#true} havoc #t~nondet8; {123434#true} is VALID [2020-07-18 00:19:20,627 INFO L280 TraceCheckUtils]: 41: Hoare triple {123434#true} assume !(0 == ~cond~0); {123434#true} is VALID [2020-07-18 00:19:20,627 INFO L280 TraceCheckUtils]: 42: Hoare triple {123434#true} ~lk1~0 := 0; {123434#true} is VALID [2020-07-18 00:19:20,627 INFO L280 TraceCheckUtils]: 43: Hoare triple {123434#true} ~lk2~0 := 0; {123434#true} is VALID [2020-07-18 00:19:20,627 INFO L280 TraceCheckUtils]: 44: Hoare triple {123434#true} ~lk3~0 := 0; {123434#true} is VALID [2020-07-18 00:19:20,628 INFO L280 TraceCheckUtils]: 45: Hoare triple {123434#true} ~lk4~0 := 0; {123434#true} is VALID [2020-07-18 00:19:20,628 INFO L280 TraceCheckUtils]: 46: Hoare triple {123434#true} ~lk5~0 := 0; {123434#true} is VALID [2020-07-18 00:19:20,628 INFO L280 TraceCheckUtils]: 47: Hoare triple {123434#true} ~lk6~0 := 0; {123434#true} is VALID [2020-07-18 00:19:20,628 INFO L280 TraceCheckUtils]: 48: Hoare triple {123434#true} ~lk7~0 := 0; {123434#true} is VALID [2020-07-18 00:19:20,628 INFO L280 TraceCheckUtils]: 49: Hoare triple {123434#true} ~lk8~0 := 0; {123434#true} is VALID [2020-07-18 00:19:20,629 INFO L280 TraceCheckUtils]: 50: Hoare triple {123434#true} assume !(0 != ~p1~0); {123434#true} is VALID [2020-07-18 00:19:20,629 INFO L280 TraceCheckUtils]: 51: Hoare triple {123434#true} assume !(0 != ~p2~0); {123434#true} is VALID [2020-07-18 00:19:20,629 INFO L280 TraceCheckUtils]: 52: Hoare triple {123434#true} assume !(0 != ~p3~0); {123434#true} is VALID [2020-07-18 00:19:20,629 INFO L280 TraceCheckUtils]: 53: Hoare triple {123434#true} assume !(0 != ~p4~0); {123434#true} is VALID [2020-07-18 00:19:20,629 INFO L280 TraceCheckUtils]: 54: Hoare triple {123434#true} assume !(0 != ~p5~0); {123434#true} is VALID [2020-07-18 00:19:20,630 INFO L280 TraceCheckUtils]: 55: Hoare triple {123434#true} assume !(0 != ~p6~0); {123434#true} is VALID [2020-07-18 00:19:20,630 INFO L280 TraceCheckUtils]: 56: Hoare triple {123434#true} assume 0 != ~p7~0; {123434#true} is VALID [2020-07-18 00:19:20,630 INFO L280 TraceCheckUtils]: 57: Hoare triple {123434#true} ~lk7~0 := 1; {123438#(= main_~lk7~0 1)} is VALID [2020-07-18 00:19:20,631 INFO L280 TraceCheckUtils]: 58: Hoare triple {123438#(= main_~lk7~0 1)} assume !(0 != ~p8~0); {123438#(= main_~lk7~0 1)} is VALID [2020-07-18 00:19:20,631 INFO L280 TraceCheckUtils]: 59: Hoare triple {123438#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {123438#(= main_~lk7~0 1)} is VALID [2020-07-18 00:19:20,632 INFO L280 TraceCheckUtils]: 60: Hoare triple {123438#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {123438#(= main_~lk7~0 1)} is VALID [2020-07-18 00:19:20,632 INFO L280 TraceCheckUtils]: 61: Hoare triple {123438#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {123438#(= main_~lk7~0 1)} is VALID [2020-07-18 00:19:20,633 INFO L280 TraceCheckUtils]: 62: Hoare triple {123438#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {123438#(= main_~lk7~0 1)} is VALID [2020-07-18 00:19:20,633 INFO L280 TraceCheckUtils]: 63: Hoare triple {123438#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {123438#(= main_~lk7~0 1)} is VALID [2020-07-18 00:19:20,634 INFO L280 TraceCheckUtils]: 64: Hoare triple {123438#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {123438#(= main_~lk7~0 1)} is VALID [2020-07-18 00:19:20,634 INFO L280 TraceCheckUtils]: 65: Hoare triple {123438#(= main_~lk7~0 1)} assume 0 != ~p7~0; {123438#(= main_~lk7~0 1)} is VALID [2020-07-18 00:19:20,635 INFO L280 TraceCheckUtils]: 66: Hoare triple {123438#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {123435#false} is VALID [2020-07-18 00:19:20,635 INFO L280 TraceCheckUtils]: 67: Hoare triple {123435#false} assume !false; {123435#false} is VALID [2020-07-18 00:19:20,638 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:19:20,640 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:19:20,640 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1654607245] [2020-07-18 00:19:20,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:19:20,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:19:20,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351923200] [2020-07-18 00:19:20,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2020-07-18 00:19:20,642 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:19:20,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:19:20,692 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:19:20,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:19:20,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:19:20,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:19:20,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:19:20,693 INFO L87 Difference]: Start difference. First operand 5479 states and 6822 transitions. Second operand 3 states. [2020-07-18 00:19:41,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:19:41,190 INFO L93 Difference]: Finished difference Result 6443 states and 7912 transitions. [2020-07-18 00:19:41,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:19:41,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2020-07-18 00:19:41,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:19:41,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:19:41,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2020-07-18 00:19:41,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:19:41,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2020-07-18 00:19:41,193 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 156 transitions. [2020-07-18 00:19:41,361 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:19:42,845 INFO L225 Difference]: With dead ends: 6443 [2020-07-18 00:19:42,845 INFO L226 Difference]: Without dead ends: 6441 [2020-07-18 00:19:42,846 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 1 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:19:42,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6441 states. [2020-07-18 00:19:58,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6441 to 5479. [2020-07-18 00:19:58,944 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:19:58,944 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6441 states. Second operand 5479 states. [2020-07-18 00:19:58,944 INFO L74 IsIncluded]: Start isIncluded. First operand 6441 states. Second operand 5479 states. [2020-07-18 00:19:58,944 INFO L87 Difference]: Start difference. First operand 6441 states. Second operand 5479 states. [2020-07-18 00:20:00,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:20:00,254 INFO L93 Difference]: Finished difference Result 6441 states and 7847 transitions. [2020-07-18 00:20:00,254 INFO L276 IsEmpty]: Start isEmpty. Operand 6441 states and 7847 transitions. [2020-07-18 00:20:00,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:20:00,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:20:00,261 INFO L74 IsIncluded]: Start isIncluded. First operand 5479 states. Second operand 6441 states. [2020-07-18 00:20:00,261 INFO L87 Difference]: Start difference. First operand 5479 states. Second operand 6441 states. [2020-07-18 00:20:01,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:20:01,575 INFO L93 Difference]: Finished difference Result 6441 states and 7847 transitions. [2020-07-18 00:20:01,575 INFO L276 IsEmpty]: Start isEmpty. Operand 6441 states and 7847 transitions. [2020-07-18 00:20:01,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:20:01,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:20:01,582 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:20:01,582 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:20:01,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5479 states. [2020-07-18 00:20:02,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5479 states to 5479 states and 6758 transitions. [2020-07-18 00:20:02,586 INFO L78 Accepts]: Start accepts. Automaton has 5479 states and 6758 transitions. Word has length 68 [2020-07-18 00:20:02,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:20:02,586 INFO L479 AbstractCegarLoop]: Abstraction has 5479 states and 6758 transitions. [2020-07-18 00:20:02,587 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:20:02,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5479 states and 6758 transitions. [2020-07-18 00:20:12,073 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6758 edges. 6758 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:20:12,073 INFO L276 IsEmpty]: Start isEmpty. Operand 5479 states and 6758 transitions. [2020-07-18 00:20:12,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-07-18 00:20:12,076 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:20:12,077 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:20:12,077 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-18 00:20:12,077 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:20:12,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:20:12,077 INFO L82 PathProgramCache]: Analyzing trace with hash 868567382, now seen corresponding path program 1 times [2020-07-18 00:20:12,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:20:12,078 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [981122709] [2020-07-18 00:20:12,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:20:12,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:20:12,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:20:12,120 INFO L280 TraceCheckUtils]: 0: Hoare triple {160167#true} assume true; {160167#true} is VALID [2020-07-18 00:20:12,121 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {160167#true} {160167#true} #223#return; {160167#true} is VALID [2020-07-18 00:20:12,121 INFO L263 TraceCheckUtils]: 0: Hoare triple {160167#true} call ULTIMATE.init(); {160167#true} is VALID [2020-07-18 00:20:12,121 INFO L280 TraceCheckUtils]: 1: Hoare triple {160167#true} assume true; {160167#true} is VALID [2020-07-18 00:20:12,121 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {160167#true} {160167#true} #223#return; {160167#true} is VALID [2020-07-18 00:20:12,122 INFO L263 TraceCheckUtils]: 3: Hoare triple {160167#true} call #t~ret9 := main(); {160167#true} is VALID [2020-07-18 00:20:12,122 INFO L280 TraceCheckUtils]: 4: Hoare triple {160167#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {160167#true} is VALID [2020-07-18 00:20:12,122 INFO L280 TraceCheckUtils]: 5: Hoare triple {160167#true} ~p1~0 := #t~nondet0; {160167#true} is VALID [2020-07-18 00:20:12,123 INFO L280 TraceCheckUtils]: 6: Hoare triple {160167#true} havoc #t~nondet0; {160167#true} is VALID [2020-07-18 00:20:12,123 INFO L280 TraceCheckUtils]: 7: Hoare triple {160167#true} havoc ~lk1~0; {160167#true} is VALID [2020-07-18 00:20:12,123 INFO L280 TraceCheckUtils]: 8: Hoare triple {160167#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {160167#true} is VALID [2020-07-18 00:20:12,123 INFO L280 TraceCheckUtils]: 9: Hoare triple {160167#true} ~p2~0 := #t~nondet1; {160167#true} is VALID [2020-07-18 00:20:12,124 INFO L280 TraceCheckUtils]: 10: Hoare triple {160167#true} havoc #t~nondet1; {160167#true} is VALID [2020-07-18 00:20:12,124 INFO L280 TraceCheckUtils]: 11: Hoare triple {160167#true} havoc ~lk2~0; {160167#true} is VALID [2020-07-18 00:20:12,124 INFO L280 TraceCheckUtils]: 12: Hoare triple {160167#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {160167#true} is VALID [2020-07-18 00:20:12,124 INFO L280 TraceCheckUtils]: 13: Hoare triple {160167#true} ~p3~0 := #t~nondet2; {160167#true} is VALID [2020-07-18 00:20:12,124 INFO L280 TraceCheckUtils]: 14: Hoare triple {160167#true} havoc #t~nondet2; {160167#true} is VALID [2020-07-18 00:20:12,125 INFO L280 TraceCheckUtils]: 15: Hoare triple {160167#true} havoc ~lk3~0; {160167#true} is VALID [2020-07-18 00:20:12,125 INFO L280 TraceCheckUtils]: 16: Hoare triple {160167#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {160167#true} is VALID [2020-07-18 00:20:12,125 INFO L280 TraceCheckUtils]: 17: Hoare triple {160167#true} ~p4~0 := #t~nondet3; {160167#true} is VALID [2020-07-18 00:20:12,125 INFO L280 TraceCheckUtils]: 18: Hoare triple {160167#true} havoc #t~nondet3; {160167#true} is VALID [2020-07-18 00:20:12,125 INFO L280 TraceCheckUtils]: 19: Hoare triple {160167#true} havoc ~lk4~0; {160167#true} is VALID [2020-07-18 00:20:12,126 INFO L280 TraceCheckUtils]: 20: Hoare triple {160167#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {160167#true} is VALID [2020-07-18 00:20:12,126 INFO L280 TraceCheckUtils]: 21: Hoare triple {160167#true} ~p5~0 := #t~nondet4; {160167#true} is VALID [2020-07-18 00:20:12,126 INFO L280 TraceCheckUtils]: 22: Hoare triple {160167#true} havoc #t~nondet4; {160167#true} is VALID [2020-07-18 00:20:12,126 INFO L280 TraceCheckUtils]: 23: Hoare triple {160167#true} havoc ~lk5~0; {160167#true} is VALID [2020-07-18 00:20:12,126 INFO L280 TraceCheckUtils]: 24: Hoare triple {160167#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {160167#true} is VALID [2020-07-18 00:20:12,127 INFO L280 TraceCheckUtils]: 25: Hoare triple {160167#true} ~p6~0 := #t~nondet5; {160167#true} is VALID [2020-07-18 00:20:12,127 INFO L280 TraceCheckUtils]: 26: Hoare triple {160167#true} havoc #t~nondet5; {160167#true} is VALID [2020-07-18 00:20:12,127 INFO L280 TraceCheckUtils]: 27: Hoare triple {160167#true} havoc ~lk6~0; {160167#true} is VALID [2020-07-18 00:20:12,127 INFO L280 TraceCheckUtils]: 28: Hoare triple {160167#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {160167#true} is VALID [2020-07-18 00:20:12,127 INFO L280 TraceCheckUtils]: 29: Hoare triple {160167#true} ~p7~0 := #t~nondet6; {160167#true} is VALID [2020-07-18 00:20:12,128 INFO L280 TraceCheckUtils]: 30: Hoare triple {160167#true} havoc #t~nondet6; {160167#true} is VALID [2020-07-18 00:20:12,128 INFO L280 TraceCheckUtils]: 31: Hoare triple {160167#true} havoc ~lk7~0; {160167#true} is VALID [2020-07-18 00:20:12,128 INFO L280 TraceCheckUtils]: 32: Hoare triple {160167#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {160167#true} is VALID [2020-07-18 00:20:12,128 INFO L280 TraceCheckUtils]: 33: Hoare triple {160167#true} ~p8~0 := #t~nondet7; {160167#true} is VALID [2020-07-18 00:20:12,128 INFO L280 TraceCheckUtils]: 34: Hoare triple {160167#true} havoc #t~nondet7; {160167#true} is VALID [2020-07-18 00:20:12,129 INFO L280 TraceCheckUtils]: 35: Hoare triple {160167#true} havoc ~lk8~0; {160167#true} is VALID [2020-07-18 00:20:12,129 INFO L280 TraceCheckUtils]: 36: Hoare triple {160167#true} havoc ~cond~0; {160167#true} is VALID [2020-07-18 00:20:12,129 INFO L280 TraceCheckUtils]: 37: Hoare triple {160167#true} assume !false; {160167#true} is VALID [2020-07-18 00:20:12,129 INFO L280 TraceCheckUtils]: 38: Hoare triple {160167#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {160167#true} is VALID [2020-07-18 00:20:12,129 INFO L280 TraceCheckUtils]: 39: Hoare triple {160167#true} ~cond~0 := #t~nondet8; {160167#true} is VALID [2020-07-18 00:20:12,130 INFO L280 TraceCheckUtils]: 40: Hoare triple {160167#true} havoc #t~nondet8; {160167#true} is VALID [2020-07-18 00:20:12,130 INFO L280 TraceCheckUtils]: 41: Hoare triple {160167#true} assume !(0 == ~cond~0); {160167#true} is VALID [2020-07-18 00:20:12,130 INFO L280 TraceCheckUtils]: 42: Hoare triple {160167#true} ~lk1~0 := 0; {160167#true} is VALID [2020-07-18 00:20:12,130 INFO L280 TraceCheckUtils]: 43: Hoare triple {160167#true} ~lk2~0 := 0; {160167#true} is VALID [2020-07-18 00:20:12,130 INFO L280 TraceCheckUtils]: 44: Hoare triple {160167#true} ~lk3~0 := 0; {160167#true} is VALID [2020-07-18 00:20:12,131 INFO L280 TraceCheckUtils]: 45: Hoare triple {160167#true} ~lk4~0 := 0; {160167#true} is VALID [2020-07-18 00:20:12,131 INFO L280 TraceCheckUtils]: 46: Hoare triple {160167#true} ~lk5~0 := 0; {160167#true} is VALID [2020-07-18 00:20:12,131 INFO L280 TraceCheckUtils]: 47: Hoare triple {160167#true} ~lk6~0 := 0; {160167#true} is VALID [2020-07-18 00:20:12,131 INFO L280 TraceCheckUtils]: 48: Hoare triple {160167#true} ~lk7~0 := 0; {160167#true} is VALID [2020-07-18 00:20:12,131 INFO L280 TraceCheckUtils]: 49: Hoare triple {160167#true} ~lk8~0 := 0; {160167#true} is VALID [2020-07-18 00:20:12,132 INFO L280 TraceCheckUtils]: 50: Hoare triple {160167#true} assume !(0 != ~p1~0); {160167#true} is VALID [2020-07-18 00:20:12,132 INFO L280 TraceCheckUtils]: 51: Hoare triple {160167#true} assume !(0 != ~p2~0); {160167#true} is VALID [2020-07-18 00:20:12,132 INFO L280 TraceCheckUtils]: 52: Hoare triple {160167#true} assume !(0 != ~p3~0); {160167#true} is VALID [2020-07-18 00:20:12,132 INFO L280 TraceCheckUtils]: 53: Hoare triple {160167#true} assume !(0 != ~p4~0); {160167#true} is VALID [2020-07-18 00:20:12,132 INFO L280 TraceCheckUtils]: 54: Hoare triple {160167#true} assume !(0 != ~p5~0); {160167#true} is VALID [2020-07-18 00:20:12,133 INFO L280 TraceCheckUtils]: 55: Hoare triple {160167#true} assume !(0 != ~p6~0); {160167#true} is VALID [2020-07-18 00:20:12,133 INFO L280 TraceCheckUtils]: 56: Hoare triple {160167#true} assume !(0 != ~p7~0); {160167#true} is VALID [2020-07-18 00:20:12,133 INFO L280 TraceCheckUtils]: 57: Hoare triple {160167#true} assume !(0 != ~p8~0); {160171#(= 0 main_~p8~0)} is VALID [2020-07-18 00:20:12,134 INFO L280 TraceCheckUtils]: 58: Hoare triple {160171#(= 0 main_~p8~0)} assume !(0 != ~p1~0); {160171#(= 0 main_~p8~0)} is VALID [2020-07-18 00:20:12,135 INFO L280 TraceCheckUtils]: 59: Hoare triple {160171#(= 0 main_~p8~0)} assume !(0 != ~p2~0); {160171#(= 0 main_~p8~0)} is VALID [2020-07-18 00:20:12,136 INFO L280 TraceCheckUtils]: 60: Hoare triple {160171#(= 0 main_~p8~0)} assume !(0 != ~p3~0); {160171#(= 0 main_~p8~0)} is VALID [2020-07-18 00:20:12,136 INFO L280 TraceCheckUtils]: 61: Hoare triple {160171#(= 0 main_~p8~0)} assume !(0 != ~p4~0); {160171#(= 0 main_~p8~0)} is VALID [2020-07-18 00:20:12,137 INFO L280 TraceCheckUtils]: 62: Hoare triple {160171#(= 0 main_~p8~0)} assume !(0 != ~p5~0); {160171#(= 0 main_~p8~0)} is VALID [2020-07-18 00:20:12,137 INFO L280 TraceCheckUtils]: 63: Hoare triple {160171#(= 0 main_~p8~0)} assume !(0 != ~p6~0); {160171#(= 0 main_~p8~0)} is VALID [2020-07-18 00:20:12,138 INFO L280 TraceCheckUtils]: 64: Hoare triple {160171#(= 0 main_~p8~0)} assume !(0 != ~p7~0); {160171#(= 0 main_~p8~0)} is VALID [2020-07-18 00:20:12,138 INFO L280 TraceCheckUtils]: 65: Hoare triple {160171#(= 0 main_~p8~0)} assume 0 != ~p8~0; {160168#false} is VALID [2020-07-18 00:20:12,139 INFO L280 TraceCheckUtils]: 66: Hoare triple {160168#false} assume 1 != ~lk8~0; {160168#false} is VALID [2020-07-18 00:20:12,139 INFO L280 TraceCheckUtils]: 67: Hoare triple {160168#false} assume !false; {160168#false} is VALID [2020-07-18 00:20:12,142 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:20:12,142 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:20:12,142 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [981122709] [2020-07-18 00:20:12,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:20:12,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:20:12,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309488509] [2020-07-18 00:20:12,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2020-07-18 00:20:12,144 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:20:12,144 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:20:12,200 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:20:12,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:20:12,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:20:12,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:20:12,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:20:12,201 INFO L87 Difference]: Start difference. First operand 5479 states and 6758 transitions. Second operand 3 states. [2020-07-18 00:20:56,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:20:56,490 INFO L93 Difference]: Finished difference Result 15977 states and 19687 transitions. [2020-07-18 00:20:56,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:20:56,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2020-07-18 00:20:56,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:20:56,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:20:56,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 245 transitions. [2020-07-18 00:20:56,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:20:56,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 245 transitions. [2020-07-18 00:20:56,493 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 245 transitions. [2020-07-18 00:20:56,711 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 245 edges. 245 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:20:57,888 INFO L225 Difference]: With dead ends: 15977 [2020-07-18 00:20:57,889 INFO L226 Difference]: Without dead ends: 5479 [2020-07-18 00:20:57,905 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:20:57,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5479 states. [2020-07-18 00:21:15,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5479 to 5479. [2020-07-18 00:21:15,244 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:21:15,244 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5479 states. Second operand 5479 states. [2020-07-18 00:21:15,245 INFO L74 IsIncluded]: Start isIncluded. First operand 5479 states. Second operand 5479 states. [2020-07-18 00:21:15,245 INFO L87 Difference]: Start difference. First operand 5479 states. Second operand 5479 states. [2020-07-18 00:21:16,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:21:16,089 INFO L93 Difference]: Finished difference Result 5479 states and 6502 transitions. [2020-07-18 00:21:16,089 INFO L276 IsEmpty]: Start isEmpty. Operand 5479 states and 6502 transitions. [2020-07-18 00:21:16,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:21:16,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:21:16,095 INFO L74 IsIncluded]: Start isIncluded. First operand 5479 states. Second operand 5479 states. [2020-07-18 00:21:16,095 INFO L87 Difference]: Start difference. First operand 5479 states. Second operand 5479 states. [2020-07-18 00:21:16,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:21:16,978 INFO L93 Difference]: Finished difference Result 5479 states and 6502 transitions. [2020-07-18 00:21:16,979 INFO L276 IsEmpty]: Start isEmpty. Operand 5479 states and 6502 transitions. [2020-07-18 00:21:16,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:21:16,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:21:16,984 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:21:16,984 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:21:16,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5479 states. [2020-07-18 00:21:17,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5479 states to 5479 states and 6502 transitions. [2020-07-18 00:21:17,952 INFO L78 Accepts]: Start accepts. Automaton has 5479 states and 6502 transitions. Word has length 68 [2020-07-18 00:21:17,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:21:17,952 INFO L479 AbstractCegarLoop]: Abstraction has 5479 states and 6502 transitions. [2020-07-18 00:21:17,952 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:21:17,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5479 states and 6502 transitions. [2020-07-18 00:21:26,724 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6502 edges. 6502 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:21:26,724 INFO L276 IsEmpty]: Start isEmpty. Operand 5479 states and 6502 transitions. [2020-07-18 00:21:26,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-07-18 00:21:26,727 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:21:26,727 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:21:26,727 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-18 00:21:26,727 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:21:26,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:21:26,727 INFO L82 PathProgramCache]: Analyzing trace with hash 875079941, now seen corresponding path program 1 times [2020-07-18 00:21:26,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:21:26,728 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1562091354] [2020-07-18 00:21:26,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:21:26,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:21:26,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:21:26,766 INFO L280 TraceCheckUtils]: 0: Hoare triple {214044#true} assume true; {214044#true} is VALID [2020-07-18 00:21:26,766 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {214044#true} {214044#true} #223#return; {214044#true} is VALID [2020-07-18 00:21:26,767 INFO L263 TraceCheckUtils]: 0: Hoare triple {214044#true} call ULTIMATE.init(); {214044#true} is VALID [2020-07-18 00:21:26,767 INFO L280 TraceCheckUtils]: 1: Hoare triple {214044#true} assume true; {214044#true} is VALID [2020-07-18 00:21:26,767 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {214044#true} {214044#true} #223#return; {214044#true} is VALID [2020-07-18 00:21:26,767 INFO L263 TraceCheckUtils]: 3: Hoare triple {214044#true} call #t~ret9 := main(); {214044#true} is VALID [2020-07-18 00:21:26,768 INFO L280 TraceCheckUtils]: 4: Hoare triple {214044#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {214044#true} is VALID [2020-07-18 00:21:26,768 INFO L280 TraceCheckUtils]: 5: Hoare triple {214044#true} ~p1~0 := #t~nondet0; {214044#true} is VALID [2020-07-18 00:21:26,768 INFO L280 TraceCheckUtils]: 6: Hoare triple {214044#true} havoc #t~nondet0; {214044#true} is VALID [2020-07-18 00:21:26,768 INFO L280 TraceCheckUtils]: 7: Hoare triple {214044#true} havoc ~lk1~0; {214044#true} is VALID [2020-07-18 00:21:26,768 INFO L280 TraceCheckUtils]: 8: Hoare triple {214044#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {214044#true} is VALID [2020-07-18 00:21:26,769 INFO L280 TraceCheckUtils]: 9: Hoare triple {214044#true} ~p2~0 := #t~nondet1; {214044#true} is VALID [2020-07-18 00:21:26,769 INFO L280 TraceCheckUtils]: 10: Hoare triple {214044#true} havoc #t~nondet1; {214044#true} is VALID [2020-07-18 00:21:26,769 INFO L280 TraceCheckUtils]: 11: Hoare triple {214044#true} havoc ~lk2~0; {214044#true} is VALID [2020-07-18 00:21:26,769 INFO L280 TraceCheckUtils]: 12: Hoare triple {214044#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {214044#true} is VALID [2020-07-18 00:21:26,769 INFO L280 TraceCheckUtils]: 13: Hoare triple {214044#true} ~p3~0 := #t~nondet2; {214044#true} is VALID [2020-07-18 00:21:26,770 INFO L280 TraceCheckUtils]: 14: Hoare triple {214044#true} havoc #t~nondet2; {214044#true} is VALID [2020-07-18 00:21:26,770 INFO L280 TraceCheckUtils]: 15: Hoare triple {214044#true} havoc ~lk3~0; {214044#true} is VALID [2020-07-18 00:21:26,770 INFO L280 TraceCheckUtils]: 16: Hoare triple {214044#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {214044#true} is VALID [2020-07-18 00:21:26,770 INFO L280 TraceCheckUtils]: 17: Hoare triple {214044#true} ~p4~0 := #t~nondet3; {214044#true} is VALID [2020-07-18 00:21:26,770 INFO L280 TraceCheckUtils]: 18: Hoare triple {214044#true} havoc #t~nondet3; {214044#true} is VALID [2020-07-18 00:21:26,770 INFO L280 TraceCheckUtils]: 19: Hoare triple {214044#true} havoc ~lk4~0; {214044#true} is VALID [2020-07-18 00:21:26,771 INFO L280 TraceCheckUtils]: 20: Hoare triple {214044#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {214044#true} is VALID [2020-07-18 00:21:26,771 INFO L280 TraceCheckUtils]: 21: Hoare triple {214044#true} ~p5~0 := #t~nondet4; {214044#true} is VALID [2020-07-18 00:21:26,771 INFO L280 TraceCheckUtils]: 22: Hoare triple {214044#true} havoc #t~nondet4; {214044#true} is VALID [2020-07-18 00:21:26,771 INFO L280 TraceCheckUtils]: 23: Hoare triple {214044#true} havoc ~lk5~0; {214044#true} is VALID [2020-07-18 00:21:26,771 INFO L280 TraceCheckUtils]: 24: Hoare triple {214044#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {214044#true} is VALID [2020-07-18 00:21:26,772 INFO L280 TraceCheckUtils]: 25: Hoare triple {214044#true} ~p6~0 := #t~nondet5; {214044#true} is VALID [2020-07-18 00:21:26,772 INFO L280 TraceCheckUtils]: 26: Hoare triple {214044#true} havoc #t~nondet5; {214044#true} is VALID [2020-07-18 00:21:26,772 INFO L280 TraceCheckUtils]: 27: Hoare triple {214044#true} havoc ~lk6~0; {214044#true} is VALID [2020-07-18 00:21:26,772 INFO L280 TraceCheckUtils]: 28: Hoare triple {214044#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {214044#true} is VALID [2020-07-18 00:21:26,772 INFO L280 TraceCheckUtils]: 29: Hoare triple {214044#true} ~p7~0 := #t~nondet6; {214044#true} is VALID [2020-07-18 00:21:26,773 INFO L280 TraceCheckUtils]: 30: Hoare triple {214044#true} havoc #t~nondet6; {214044#true} is VALID [2020-07-18 00:21:26,773 INFO L280 TraceCheckUtils]: 31: Hoare triple {214044#true} havoc ~lk7~0; {214044#true} is VALID [2020-07-18 00:21:26,773 INFO L280 TraceCheckUtils]: 32: Hoare triple {214044#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {214044#true} is VALID [2020-07-18 00:21:26,773 INFO L280 TraceCheckUtils]: 33: Hoare triple {214044#true} ~p8~0 := #t~nondet7; {214044#true} is VALID [2020-07-18 00:21:26,773 INFO L280 TraceCheckUtils]: 34: Hoare triple {214044#true} havoc #t~nondet7; {214044#true} is VALID [2020-07-18 00:21:26,774 INFO L280 TraceCheckUtils]: 35: Hoare triple {214044#true} havoc ~lk8~0; {214044#true} is VALID [2020-07-18 00:21:26,774 INFO L280 TraceCheckUtils]: 36: Hoare triple {214044#true} havoc ~cond~0; {214044#true} is VALID [2020-07-18 00:21:26,774 INFO L280 TraceCheckUtils]: 37: Hoare triple {214044#true} assume !false; {214044#true} is VALID [2020-07-18 00:21:26,774 INFO L280 TraceCheckUtils]: 38: Hoare triple {214044#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {214044#true} is VALID [2020-07-18 00:21:26,774 INFO L280 TraceCheckUtils]: 39: Hoare triple {214044#true} ~cond~0 := #t~nondet8; {214044#true} is VALID [2020-07-18 00:21:26,775 INFO L280 TraceCheckUtils]: 40: Hoare triple {214044#true} havoc #t~nondet8; {214044#true} is VALID [2020-07-18 00:21:26,775 INFO L280 TraceCheckUtils]: 41: Hoare triple {214044#true} assume !(0 == ~cond~0); {214044#true} is VALID [2020-07-18 00:21:26,775 INFO L280 TraceCheckUtils]: 42: Hoare triple {214044#true} ~lk1~0 := 0; {214044#true} is VALID [2020-07-18 00:21:26,775 INFO L280 TraceCheckUtils]: 43: Hoare triple {214044#true} ~lk2~0 := 0; {214044#true} is VALID [2020-07-18 00:21:26,775 INFO L280 TraceCheckUtils]: 44: Hoare triple {214044#true} ~lk3~0 := 0; {214044#true} is VALID [2020-07-18 00:21:26,776 INFO L280 TraceCheckUtils]: 45: Hoare triple {214044#true} ~lk4~0 := 0; {214044#true} is VALID [2020-07-18 00:21:26,776 INFO L280 TraceCheckUtils]: 46: Hoare triple {214044#true} ~lk5~0 := 0; {214044#true} is VALID [2020-07-18 00:21:26,776 INFO L280 TraceCheckUtils]: 47: Hoare triple {214044#true} ~lk6~0 := 0; {214044#true} is VALID [2020-07-18 00:21:26,776 INFO L280 TraceCheckUtils]: 48: Hoare triple {214044#true} ~lk7~0 := 0; {214044#true} is VALID [2020-07-18 00:21:26,776 INFO L280 TraceCheckUtils]: 49: Hoare triple {214044#true} ~lk8~0 := 0; {214044#true} is VALID [2020-07-18 00:21:26,777 INFO L280 TraceCheckUtils]: 50: Hoare triple {214044#true} assume !(0 != ~p1~0); {214044#true} is VALID [2020-07-18 00:21:26,777 INFO L280 TraceCheckUtils]: 51: Hoare triple {214044#true} assume !(0 != ~p2~0); {214044#true} is VALID [2020-07-18 00:21:26,777 INFO L280 TraceCheckUtils]: 52: Hoare triple {214044#true} assume !(0 != ~p3~0); {214044#true} is VALID [2020-07-18 00:21:26,777 INFO L280 TraceCheckUtils]: 53: Hoare triple {214044#true} assume !(0 != ~p4~0); {214044#true} is VALID [2020-07-18 00:21:26,777 INFO L280 TraceCheckUtils]: 54: Hoare triple {214044#true} assume !(0 != ~p5~0); {214044#true} is VALID [2020-07-18 00:21:26,778 INFO L280 TraceCheckUtils]: 55: Hoare triple {214044#true} assume !(0 != ~p6~0); {214044#true} is VALID [2020-07-18 00:21:26,778 INFO L280 TraceCheckUtils]: 56: Hoare triple {214044#true} assume !(0 != ~p7~0); {214044#true} is VALID [2020-07-18 00:21:26,778 INFO L280 TraceCheckUtils]: 57: Hoare triple {214044#true} assume 0 != ~p8~0; {214044#true} is VALID [2020-07-18 00:21:26,782 INFO L280 TraceCheckUtils]: 58: Hoare triple {214044#true} ~lk8~0 := 1; {214048#(= 1 main_~lk8~0)} is VALID [2020-07-18 00:21:26,783 INFO L280 TraceCheckUtils]: 59: Hoare triple {214048#(= 1 main_~lk8~0)} assume !(0 != ~p1~0); {214048#(= 1 main_~lk8~0)} is VALID [2020-07-18 00:21:26,784 INFO L280 TraceCheckUtils]: 60: Hoare triple {214048#(= 1 main_~lk8~0)} assume !(0 != ~p2~0); {214048#(= 1 main_~lk8~0)} is VALID [2020-07-18 00:21:26,784 INFO L280 TraceCheckUtils]: 61: Hoare triple {214048#(= 1 main_~lk8~0)} assume !(0 != ~p3~0); {214048#(= 1 main_~lk8~0)} is VALID [2020-07-18 00:21:26,785 INFO L280 TraceCheckUtils]: 62: Hoare triple {214048#(= 1 main_~lk8~0)} assume !(0 != ~p4~0); {214048#(= 1 main_~lk8~0)} is VALID [2020-07-18 00:21:26,785 INFO L280 TraceCheckUtils]: 63: Hoare triple {214048#(= 1 main_~lk8~0)} assume !(0 != ~p5~0); {214048#(= 1 main_~lk8~0)} is VALID [2020-07-18 00:21:26,786 INFO L280 TraceCheckUtils]: 64: Hoare triple {214048#(= 1 main_~lk8~0)} assume !(0 != ~p6~0); {214048#(= 1 main_~lk8~0)} is VALID [2020-07-18 00:21:26,786 INFO L280 TraceCheckUtils]: 65: Hoare triple {214048#(= 1 main_~lk8~0)} assume !(0 != ~p7~0); {214048#(= 1 main_~lk8~0)} is VALID [2020-07-18 00:21:26,787 INFO L280 TraceCheckUtils]: 66: Hoare triple {214048#(= 1 main_~lk8~0)} assume 0 != ~p8~0; {214048#(= 1 main_~lk8~0)} is VALID [2020-07-18 00:21:26,787 INFO L280 TraceCheckUtils]: 67: Hoare triple {214048#(= 1 main_~lk8~0)} assume 1 != ~lk8~0; {214045#false} is VALID [2020-07-18 00:21:26,787 INFO L280 TraceCheckUtils]: 68: Hoare triple {214045#false} assume !false; {214045#false} is VALID [2020-07-18 00:21:26,790 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:21:26,791 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:21:26,791 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1562091354] [2020-07-18 00:21:26,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:21:26,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:21:26,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718320378] [2020-07-18 00:21:26,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2020-07-18 00:21:26,793 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:21:26,793 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:21:26,848 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:21:26,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:21:26,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:21:26,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:21:26,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:21:26,849 INFO L87 Difference]: Start difference. First operand 5479 states and 6502 transitions. Second operand 3 states. [2020-07-18 00:21:46,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:21:46,830 INFO L93 Difference]: Finished difference Result 5479 states and 6502 transitions. [2020-07-18 00:21:46,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:21:46,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2020-07-18 00:21:46,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:21:46,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:21:46,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2020-07-18 00:21:46,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:21:46,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2020-07-18 00:21:46,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 106 transitions. [2020-07-18 00:21:46,930 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:21:46,930 INFO L225 Difference]: With dead ends: 5479 [2020-07-18 00:21:46,931 INFO L226 Difference]: Without dead ends: 0 [2020-07-18 00:21:46,941 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:21:46,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-18 00:21:46,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-18 00:21:46,942 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:21:46,942 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-18 00:21:46,942 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 00:21:46,942 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 00:21:46,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:21:46,942 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 00:21:46,943 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:21:46,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:21:46,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:21:46,943 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 00:21:46,943 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 00:21:46,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:21:46,943 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 00:21:46,944 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:21:46,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:21:46,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:21:46,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:21:46,944 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:21:46,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-18 00:21:46,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-18 00:21:46,945 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2020-07-18 00:21:46,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:21:46,945 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-18 00:21:46,945 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:21:46,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-18 00:21:46,945 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:21:46,945 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:21:46,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:21:46,946 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-18 00:21:46,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-18 00:21:47,671 WARN L193 SmtUtils]: Spent 703.00 ms on a formula simplification. DAG size of input: 289 DAG size of output: 159 [2020-07-18 00:21:48,141 WARN L193 SmtUtils]: Spent 382.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2020-07-18 00:21:48,265 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 57 [2020-07-18 00:21:48,374 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 55 [2020-07-18 00:21:48,641 WARN L193 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 387 DAG size of output: 23 [2020-07-18 00:21:48,899 WARN L193 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 352 DAG size of output: 11 [2020-07-18 00:21:49,191 WARN L193 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2020-07-18 00:21:49,417 WARN L193 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 93 [2020-07-18 00:21:49,634 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 279 DAG size of output: 15 [2020-07-18 00:21:49,972 WARN L193 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 482 DAG size of output: 15 [2020-07-18 00:21:50,200 WARN L193 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 542 DAG size of output: 3 [2020-07-18 00:21:50,324 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 283 DAG size of output: 35 [2020-07-18 00:21:50,741 WARN L193 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 293 DAG size of output: 159 [2020-07-18 00:21:51,048 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 91 [2020-07-18 00:21:51,514 WARN L193 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 671 DAG size of output: 7 [2020-07-18 00:21:51,944 WARN L193 SmtUtils]: Spent 426.00 ms on a formula simplification that was a NOOP. DAG size: 291 [2020-07-18 00:21:52,087 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 298 DAG size of output: 91 [2020-07-18 00:21:52,412 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2020-07-18 00:21:52,566 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 321 DAG size of output: 55 [2020-07-18 00:21:52,976 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 285 DAG size of output: 55 [2020-07-18 00:21:53,115 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 340 DAG size of output: 35 [2020-07-18 00:21:53,276 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 542 DAG size of output: 3 [2020-07-18 00:21:56,025 WARN L193 SmtUtils]: Spent 2.74 s on a formula simplification that was a NOOP. DAG size: 159 [2020-07-18 00:21:59,180 WARN L193 SmtUtils]: Spent 3.08 s on a formula simplification that was a NOOP. DAG size: 161 [2020-07-18 00:21:59,599 WARN L193 SmtUtils]: Spent 407.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-07-18 00:21:59,956 WARN L193 SmtUtils]: Spent 347.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-18 00:22:02,779 WARN L193 SmtUtils]: Spent 2.74 s on a formula simplification that was a NOOP. DAG size: 159 [2020-07-18 00:22:03,867 WARN L193 SmtUtils]: Spent 1.08 s on a formula simplification that was a NOOP. DAG size: 93 [2020-07-18 00:22:04,026 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-07-18 00:22:04,236 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-18 00:22:06,909 WARN L193 SmtUtils]: Spent 2.66 s on a formula simplification that was a NOOP. DAG size: 159 [2020-07-18 00:22:07,331 WARN L193 SmtUtils]: Spent 409.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-07-18 00:22:08,345 WARN L193 SmtUtils]: Spent 928.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-07-18 00:22:16,651 WARN L193 SmtUtils]: Spent 8.24 s on a formula simplification that was a NOOP. DAG size: 291 [2020-07-18 00:22:17,533 WARN L193 SmtUtils]: Spent 871.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-07-18 00:22:17,667 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-18 00:22:17,828 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-07-18 00:22:18,761 WARN L193 SmtUtils]: Spent 890.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-07-18 00:22:21,627 WARN L193 SmtUtils]: Spent 2.85 s on a formula simplification that was a NOOP. DAG size: 161 [2020-07-18 00:22:21,979 WARN L193 SmtUtils]: Spent 325.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-18 00:22:23,150 WARN L193 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 93 [2020-07-18 00:22:23,487 WARN L193 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-18 00:22:23,622 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-18 00:22:23,660 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-18 00:22:23,660 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-18 00:22:23,660 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-18 00:22:23,660 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-18 00:22:23,660 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-18 00:22:23,660 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-18 00:22:23,661 INFO L264 CegarLoopResult]: At program point L126(line 126) the Hoare annotation is: (= 1 main_~lk8~0) [2020-07-18 00:22:23,661 INFO L264 CegarLoopResult]: At program point L126-1(lines 5 135) the Hoare annotation is: false [2020-07-18 00:22:23,661 INFO L271 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: true [2020-07-18 00:22:23,661 INFO L264 CegarLoopResult]: At program point L60-1(lines 33 130) 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:22:23,661 INFO L271 CegarLoopResult]: At program point L27-1(line 27) the Hoare annotation is: true [2020-07-18 00:22:23,662 INFO L271 CegarLoopResult]: At program point L27-2(line 27) the Hoare annotation is: true [2020-07-18 00:22:23,662 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 4 135) the Hoare annotation is: true [2020-07-18 00:22:23,664 INFO L264 CegarLoopResult]: At program point L85(line 85) the Hoare annotation is: (let ((.cse1 (= 0 main_~p4~0)) (.cse2 (= 0 main_~p2~0)) (.cse11 (= 1 main_~lk6~0)) (.cse12 (= 0 main_~p3~0)) (.cse0 (= main_~lk7~0 1)) (.cse5 (= 0 main_~p1~0)) (.cse6 (= 1 main_~lk5~0)) (.cse13 (= 0 main_~p7~0)) (.cse7 (= 1 main_~lk2~0)) (.cse3 (= 1 main_~lk3~0)) (.cse8 (= 0 main_~p5~0)) (.cse4 (= 0 main_~p6~0)) (.cse9 (= 1 main_~lk1~0)) (.cse10 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse3 .cse8 .cse4 .cse9 .cse10) (and .cse11 .cse12 .cse7 .cse0 .cse1 .cse8 .cse5) (and .cse11 .cse7 .cse0 .cse1 .cse3 .cse8 .cse9) (and .cse13 .cse12 .cse1 .cse2 .cse4 .cse6 .cse9) (and .cse11 .cse0 .cse2 .cse3 .cse8 .cse9 .cse10) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse9 .cse10) (and .cse12 .cse7 .cse0 .cse1 .cse8 .cse4 .cse5) (and .cse13 .cse12 .cse1 .cse2 .cse8 .cse4 .cse9) (and .cse13 .cse7 .cse1 .cse3 .cse8 .cse4 .cse5) (and .cse11 .cse7 .cse0 .cse3 .cse8 .cse5 .cse10) (and .cse11 .cse13 .cse12 .cse7 .cse1 .cse8 .cse9) (and .cse13 .cse12 .cse7 .cse1 .cse8 .cse4 .cse5) (and .cse13 .cse7 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse11 .cse13 .cse12 .cse2 .cse8 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse3 .cse4 .cse6 .cse9) (and .cse11 .cse12 .cse7 .cse0 .cse1 .cse8 .cse9) (and .cse11 .cse13 .cse12 .cse2 .cse8 .cse9 .cse10) (and .cse11 .cse12 .cse7 .cse0 .cse8 .cse5 .cse10) (and .cse13 .cse12 .cse7 .cse8 .cse4 .cse5 .cse10) (and .cse11 .cse13 .cse12 .cse2 .cse6 .cse9 .cse10) (and .cse11 .cse13 .cse12 .cse2 .cse5 .cse6 .cse10) (and .cse11 .cse0 .cse2 .cse3 .cse5 .cse6 .cse10) (and .cse11 .cse12 .cse0 .cse2 .cse5 .cse6 .cse10) (and .cse13 .cse12 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse11 .cse13 .cse7 .cse1 .cse3 .cse5 .cse6) (and .cse13 .cse1 .cse2 .cse3 .cse8 .cse4 .cse5) (and .cse11 .cse0 .cse2 .cse3 .cse8 .cse5 .cse10) (and .cse11 .cse12 .cse0 .cse2 .cse8 .cse5 .cse10) (and .cse11 .cse13 .cse12 .cse7 .cse1 .cse8 .cse5) (and .cse11 .cse12 .cse0 .cse2 .cse6 .cse9 .cse10) (and .cse11 .cse13 .cse7 .cse3 .cse5 .cse6 .cse10) (and .cse7 .cse0 .cse3 .cse8 .cse4 .cse5 .cse10) (and .cse11 .cse7 .cse0 .cse1 .cse3 .cse6 .cse9) (and .cse12 .cse0 .cse1 .cse2 .cse4 .cse6 .cse9) (and .cse11 .cse13 .cse12 .cse7 .cse1 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse3 .cse8 .cse4 .cse9) (and .cse11 .cse12 .cse0 .cse1 .cse2 .cse8 .cse9) (and .cse7 .cse0 .cse1 .cse3 .cse8 .cse4 .cse5) (and .cse7 .cse0 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse13 .cse12 .cse1 .cse2 .cse8 .cse4 .cse5) (and .cse11 .cse13 .cse2 .cse3 .cse6 .cse9 .cse10) (and .cse11 .cse13 .cse7 .cse3 .cse8 .cse5 .cse10) (and .cse11 .cse7 .cse0 .cse3 .cse6 .cse9 .cse10) (and .cse11 .cse13 .cse12 .cse1 .cse2 .cse6 .cse9) (and .cse13 .cse1 .cse2 .cse3 .cse4 .cse6 .cse9) (and .cse11 .cse13 .cse7 .cse3 .cse8 .cse9 .cse10) (and .cse11 .cse7 .cse0 .cse1 .cse3 .cse8 .cse5) (and .cse12 .cse7 .cse0 .cse1 .cse8 .cse4 .cse9) (and .cse13 .cse12 .cse2 .cse8 .cse4 .cse5 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse4 .cse5) (and .cse11 .cse12 .cse0 .cse2 .cse8 .cse9 .cse10) (and .cse13 .cse12 .cse7 .cse4 .cse6 .cse9 .cse10) (and .cse13 .cse2 .cse3 .cse8 .cse4 .cse5 .cse10) (and .cse13 .cse12 .cse7 .cse1 .cse8 .cse4 .cse9) (and .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse12 .cse0 .cse2 .cse4 .cse6 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse12 .cse7 .cse0 .cse8 .cse4 .cse9 .cse10) (and .cse11 .cse13 .cse12 .cse1 .cse2 .cse8 .cse5) (and .cse13 .cse12 .cse7 .cse1 .cse4 .cse5 .cse6) (and .cse13 .cse7 .cse3 .cse4 .cse6 .cse9 .cse10) (and .cse13 .cse1 .cse2 .cse3 .cse8 .cse4 .cse9) (and .cse13 .cse12 .cse2 .cse4 .cse5 .cse6 .cse10) (and .cse12 .cse0 .cse2 .cse4 .cse5 .cse6 .cse10) (and .cse11 .cse12 .cse0 .cse1 .cse2 .cse6 .cse9) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse5 .cse10) (and .cse11 .cse12 .cse7 .cse0 .cse6 .cse9 .cse10) (and .cse11 .cse7 .cse0 .cse3 .cse8 .cse9 .cse10) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse11 .cse13 .cse1 .cse2 .cse3 .cse8 .cse9) (and .cse7 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse6 .cse9) (and .cse12 .cse7 .cse0 .cse4 .cse6 .cse9 .cse10) (and .cse13 .cse7 .cse1 .cse3 .cse8 .cse4 .cse9) (and .cse11 .cse12 .cse7 .cse0 .cse1 .cse6 .cse9) (and .cse13 .cse7 .cse1 .cse3 .cse4 .cse6 .cse9) (and .cse11 .cse12 .cse7 .cse0 .cse8 .cse9 .cse10) (and .cse13 .cse7 .cse3 .cse8 .cse4 .cse5 .cse10) (and .cse12 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse8 .cse9) (and .cse11 .cse13 .cse12 .cse7 .cse6 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse13 .cse12 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse13 .cse12 .cse1 .cse2 .cse5 .cse6) (and .cse11 .cse13 .cse2 .cse3 .cse5 .cse6 .cse10) (and .cse11 .cse13 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse12 .cse0 .cse2 .cse8 .cse4 .cse5 .cse10) (and .cse12 .cse7 .cse0 .cse1 .cse4 .cse5 .cse6) (and .cse11 .cse13 .cse2 .cse3 .cse8 .cse9 .cse10) (and .cse13 .cse2 .cse3 .cse4 .cse6 .cse9 .cse10) (and .cse11 .cse0 .cse2 .cse3 .cse6 .cse9 .cse10) (and .cse11 .cse12 .cse0 .cse1 .cse2 .cse8 .cse5) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse9 .cse10) (and .cse11 .cse13 .cse12 .cse1 .cse2 .cse8 .cse9) (and .cse11 .cse7 .cse0 .cse1 .cse3 .cse5 .cse6) (and .cse7 .cse0 .cse3 .cse4 .cse6 .cse9 .cse10) (and .cse11 .cse13 .cse7 .cse3 .cse6 .cse9 .cse10) (and .cse12 .cse0 .cse2 .cse8 .cse4 .cse9 .cse10) (and .cse13 .cse12 .cse7 .cse4 .cse5 .cse6 .cse10) (and .cse11 .cse13 .cse12 .cse7 .cse1 .cse6 .cse9) (and .cse11 .cse13 .cse7 .cse1 .cse3 .cse6 .cse9) (and .cse13 .cse12 .cse7 .cse1 .cse4 .cse6 .cse9) (and .cse13 .cse7 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse11 .cse12 .cse0 .cse1 .cse2 .cse5 .cse6) (and .cse11 .cse13 .cse1 .cse2 .cse3 .cse6 .cse9) (and .cse13 .cse2 .cse3 .cse8 .cse4 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse4 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse9) (and .cse11 .cse13 .cse2 .cse3 .cse8 .cse5 .cse10) (and .cse11 .cse13 .cse12 .cse7 .cse8 .cse5 .cse10) (and .cse12 .cse7 .cse0 .cse4 .cse5 .cse6 .cse10) (and .cse13 .cse12 .cse2 .cse8 .cse4 .cse9 .cse10) (and .cse13 .cse12 .cse2 .cse4 .cse6 .cse9 .cse10) (and .cse11 .cse12 .cse7 .cse0 .cse1 .cse5 .cse6) (and .cse11 .cse13 .cse1 .cse2 .cse3 .cse8 .cse5) (and .cse12 .cse0 .cse1 .cse2 .cse8 .cse4 .cse9) (and .cse13 .cse12 .cse7 .cse8 .cse4 .cse9 .cse10) (and .cse12 .cse7 .cse0 .cse1 .cse4 .cse6 .cse9) (and .cse11 .cse13 .cse7 .cse1 .cse3 .cse8 .cse5) (and .cse11 .cse13 .cse7 .cse1 .cse3 .cse8 .cse9) (and .cse12 .cse7 .cse0 .cse8 .cse4 .cse5 .cse10) (and .cse11 .cse13 .cse12 .cse7 .cse5 .cse6 .cse10) (and .cse13 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse11 .cse7 .cse0 .cse3 .cse5 .cse6 .cse10) (and .cse12 .cse0 .cse1 .cse2 .cse8 .cse4 .cse5) (and .cse11 .cse12 .cse7 .cse0 .cse5 .cse6 .cse10) (and .cse13 .cse7 .cse3 .cse8 .cse4 .cse9 .cse10))) [2020-07-18 00:22:23,664 INFO L271 CegarLoopResult]: At program point L52(line 52) the Hoare annotation is: true [2020-07-18 00:22:23,664 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-07-18 00:22:23,665 INFO L264 CegarLoopResult]: At program point L77(line 77) 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 .cse5 .cse7 .cse9 .cse3 .cse8) (and .cse1 .cse7 .cse2 .cse6 .cse4) (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 .cse0 .cse1 .cse2 .cse6 .cse9) (and .cse5 .cse1 .cse7 .cse9 .cse3) (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:22:23,665 INFO L264 CegarLoopResult]: At program point L110-1(lines 33 130) the Hoare annotation is: (let ((.cse1 (= 0 main_~p6~0)) (.cse0 (= 1 main_~lk7~0)) (.cse2 (= 0 main_~p8~0)) (.cse3 (= 1 main_~lk6~0)) (.cse4 (= 0 main_~p7~0)) (.cse5 (= 1 main_~lk8~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse4 .cse1 .cse2) (and .cse5 .cse0 .cse1) (and .cse3 .cse5 .cse0) (and .cse4 .cse5 .cse1) (and .cse3 .cse0 .cse2) (and .cse3 .cse4 .cse5))) [2020-07-18 00:22:23,665 INFO L271 CegarLoopResult]: At program point L44(line 44) the Hoare annotation is: true [2020-07-18 00:22:23,666 INFO L264 CegarLoopResult]: At program point L102(line 102) the Hoare annotation is: (let ((.cse9 (= 0 main_~p5~0)) (.cse6 (= 1 main_~lk6~0)) (.cse7 (= 0 main_~p7~0)) (.cse8 (= 0 main_~p4~0)) (.cse3 (= 0 main_~p8~0)) (.cse10 (= 1 main_~lk8~0)) (.cse0 (= 1 main_~lk7~0)) (.cse1 (= 1 main_~lk3~0)) (.cse2 (= 0 main_~p6~0)) (.cse4 (= 1 main_~lk5~0)) (.cse5 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse1 .cse3 .cse4) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse4) (and .cse6 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse7 .cse1 .cse9 .cse2 .cse3 .cse5) (and .cse6 .cse10 .cse0 .cse8 .cse1 .cse9) (and .cse6 .cse7 .cse10 .cse1 .cse4 .cse5) (and .cse6 .cse10 .cse0 .cse8 .cse1 .cse4) (and .cse0 .cse8 .cse1 .cse9 .cse2 .cse3) (and .cse6 .cse7 .cse8 .cse1 .cse9 .cse3) (and .cse6 .cse10 .cse0 .cse1 .cse4 .cse5) (and .cse6 .cse7 .cse10 .cse1 .cse9 .cse5) (and .cse6 .cse7 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5) (and .cse6 .cse7 .cse10 .cse8 .cse1 .cse9) (and .cse10 .cse0 .cse8 .cse1 .cse2 .cse4) (and .cse7 .cse10 .cse8 .cse1 .cse2 .cse4) (and .cse6 .cse10 .cse0 .cse1 .cse9 .cse5) (and .cse10 .cse0 .cse8 .cse1 .cse9 .cse2) (and .cse6 .cse7 .cse1 .cse9 .cse3 .cse5) (and .cse6 .cse0 .cse8 .cse1 .cse9 .cse3) (and .cse6 .cse0 .cse1 .cse9 .cse3 .cse5) (and .cse7 .cse10 .cse8 .cse1 .cse9 .cse2) (and .cse7 .cse10 .cse1 .cse9 .cse2 .cse5) (and .cse10 .cse0 .cse1 .cse9 .cse2 .cse5) (and .cse7 .cse8 .cse1 .cse9 .cse2 .cse3) (and .cse6 .cse7 .cse10 .cse8 .cse1 .cse4) (and .cse6 .cse0 .cse8 .cse1 .cse3 .cse4) (and .cse7 .cse10 .cse1 .cse2 .cse4 .cse5) (and .cse7 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse7 .cse8 .cse1 .cse2 .cse3 .cse4) (and .cse10 .cse0 .cse1 .cse2 .cse4 .cse5))) [2020-07-18 00:22:23,666 INFO L264 CegarLoopResult]: At program point L69(line 69) 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:22:23,666 INFO L264 CegarLoopResult]: At program point L127(line 127) the Hoare annotation is: (= 1 main_~lk8~0) [2020-07-18 00:22:23,666 INFO L264 CegarLoopResult]: At program point L61(line 61) the Hoare annotation is: (or (= 0 main_~p1~0) (= 1 main_~lk1~0)) [2020-07-18 00:22:23,666 INFO L271 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-07-18 00:22:23,666 INFO L264 CegarLoopResult]: At program point L111(line 111) the Hoare annotation is: (let ((.cse5 (= 1 main_~lk8~0)) (.cse1 (= 0 main_~p6~0)) (.cse0 (= 0 main_~p7~0)) (.cse4 (= 1 main_~lk6~0)) (.cse6 (= 1 main_~lk7~0)) (.cse2 (= 0 main_~p8~0)) (.cse3 (= 1 main_~lk5~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse3) (and .cse4 .cse5 .cse6 .cse3) (and .cse5 .cse6 .cse1 .cse3) (and .cse6 .cse1 .cse2 .cse3) (and .cse0 .cse5 .cse1 .cse3) (and .cse4 .cse0 .cse2 .cse3) (and .cse4 .cse6 .cse2 .cse3))) [2020-07-18 00:22:23,667 INFO L271 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-07-18 00:22:23,667 INFO L271 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-07-18 00:22:23,667 INFO L271 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-07-18 00:22:23,667 INFO L264 CegarLoopResult]: At program point L95-1(lines 33 130) the Hoare annotation is: (let ((.cse4 (= 0 main_~p8~0)) (.cse0 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p7~0)) (.cse8 (= 0 main_~p3~0)) (.cse2 (= 0 main_~p4~0)) (.cse10 (= 0 main_~p5~0)) (.cse9 (= 1 main_~lk8~0)) (.cse6 (= 1 main_~lk7~0)) (.cse3 (= 1 main_~lk3~0)) (.cse7 (= 0 main_~p6~0)) (.cse5 (= 1 main_~lk5~0)) (.cse11 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse0 .cse8 .cse9 .cse6 .cse2 .cse5) (and .cse1 .cse3 .cse10 .cse7 .cse4 .cse11) (and .cse0 .cse9 .cse6 .cse2 .cse3 .cse10) (and .cse0 .cse1 .cse8 .cse2 .cse10 .cse4) (and .cse0 .cse1 .cse9 .cse3 .cse5 .cse11) (and .cse0 .cse9 .cse6 .cse2 .cse3 .cse5) (and .cse0 .cse8 .cse9 .cse6 .cse10 .cse11) (and .cse6 .cse2 .cse3 .cse10 .cse7 .cse4) (and .cse8 .cse9 .cse6 .cse2 .cse7 .cse5) (and .cse0 .cse8 .cse6 .cse4 .cse5 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse11) (and .cse0 .cse8 .cse9 .cse6 .cse2 .cse10) (and .cse0 .cse1 .cse8 .cse9 .cse5 .cse11) (and .cse9 .cse6 .cse2 .cse3 .cse7 .cse5) (and .cse1 .cse9 .cse2 .cse3 .cse7 .cse5) (and .cse0 .cse1 .cse8 .cse2 .cse4 .cse5) (and .cse0 .cse1 .cse8 .cse4 .cse5 .cse11) (and .cse1 .cse8 .cse7 .cse4 .cse5 .cse11) (and .cse0 .cse6 .cse3 .cse10 .cse4 .cse11) (and .cse1 .cse8 .cse9 .cse2 .cse10 .cse7) (and .cse1 .cse9 .cse2 .cse3 .cse10 .cse7) (and .cse9 .cse6 .cse3 .cse10 .cse7 .cse11) (and .cse1 .cse2 .cse3 .cse10 .cse7 .cse4) (and .cse1 .cse8 .cse9 .cse10 .cse7 .cse11) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5) (and .cse1 .cse8 .cse9 .cse7 .cse5 .cse11) (and .cse1 .cse9 .cse3 .cse7 .cse5 .cse11) (and .cse1 .cse3 .cse7 .cse4 .cse5 .cse11) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse6 .cse3 .cse7 .cse4 .cse5 .cse11) (and .cse0 .cse6 .cse3 .cse4 .cse5 .cse11) (and .cse8 .cse6 .cse7 .cse4 .cse5 .cse11) (and .cse0 .cse1 .cse8 .cse10 .cse4 .cse11) (and .cse8 .cse6 .cse2 .cse7 .cse4 .cse5) (and .cse1 .cse8 .cse2 .cse7 .cse4 .cse5) (and .cse0 .cse8 .cse6 .cse2 .cse10 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4) (and .cse8 .cse6 .cse2 .cse10 .cse7 .cse4) (and .cse0 .cse9 .cse6 .cse3 .cse5 .cse11) (and .cse0 .cse1 .cse9 .cse3 .cse10 .cse11) (and .cse6 .cse3 .cse10 .cse7 .cse4 .cse11) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse10) (and .cse0 .cse8 .cse6 .cse2 .cse4 .cse5) (and .cse0 .cse1 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse9 .cse6 .cse3 .cse10 .cse11) (and .cse9 .cse6 .cse2 .cse3 .cse10 .cse7) (and .cse8 .cse9 .cse6 .cse10 .cse7 .cse11) (and .cse0 .cse8 .cse6 .cse10 .cse4 .cse11) (and .cse8 .cse9 .cse6 .cse2 .cse10 .cse7) (and .cse0 .cse1 .cse3 .cse10 .cse4 .cse11) (and .cse0 .cse6 .cse2 .cse3 .cse10 .cse4) (and .cse8 .cse9 .cse6 .cse7 .cse5 .cse11) (and .cse1 .cse9 .cse3 .cse10 .cse7 .cse11) (and .cse0 .cse8 .cse9 .cse6 .cse5 .cse11) (and .cse0 .cse1 .cse8 .cse9 .cse2 .cse5) (and .cse1 .cse8 .cse10 .cse7 .cse4 .cse11) (and .cse8 .cse6 .cse10 .cse7 .cse4 .cse11) (and .cse1 .cse8 .cse2 .cse10 .cse7 .cse4) (and .cse1 .cse8 .cse9 .cse2 .cse7 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse8 .cse9 .cse2 .cse10) (and .cse9 .cse6 .cse3 .cse7 .cse5 .cse11))) [2020-07-18 00:22:23,667 INFO L264 CegarLoopResult]: At program point L120-1(lines 33 130) the Hoare annotation is: (or (= 1 main_~lk8~0) (= 0 main_~p8~0)) [2020-07-18 00:22:23,668 INFO L271 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-07-18 00:22:23,668 INFO L271 CegarLoopResult]: At program point L21-1(line 21) the Hoare annotation is: true [2020-07-18 00:22:23,668 INFO L271 CegarLoopResult]: At program point L21-2(line 21) the Hoare annotation is: true [2020-07-18 00:22:23,668 INFO L264 CegarLoopResult]: At program point L112(line 112) the Hoare annotation is: (let ((.cse5 (= 1 main_~lk8~0)) (.cse1 (= 0 main_~p6~0)) (.cse0 (= 0 main_~p7~0)) (.cse4 (= 1 main_~lk6~0)) (.cse6 (= 1 main_~lk7~0)) (.cse2 (= 0 main_~p8~0)) (.cse3 (= 1 main_~lk5~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse3) (and .cse4 .cse5 .cse6 .cse3) (and .cse5 .cse6 .cse1 .cse3) (and .cse6 .cse1 .cse2 .cse3) (and .cse0 .cse5 .cse1 .cse3) (and .cse4 .cse0 .cse2 .cse3) (and .cse4 .cse6 .cse2 .cse3))) [2020-07-18 00:22:23,668 INFO L271 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: true [2020-07-18 00:22:23,668 INFO L271 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: true [2020-07-18 00:22:23,668 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 4 135) the Hoare annotation is: true [2020-07-18 00:22:23,668 INFO L271 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: true [2020-07-18 00:22:23,669 INFO L264 CegarLoopResult]: At program point L96(line 96) the Hoare annotation is: (let ((.cse9 (= 0 main_~p7~0)) (.cse6 (= 0 main_~p8~0)) (.cse7 (= 1 main_~lk6~0)) (.cse8 (= 0 main_~p3~0)) (.cse12 (= 1 main_~lk5~0)) (.cse11 (= 1 main_~lk4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse10 (= 1 main_~lk8~0)) (.cse1 (= 1 main_~lk7~0)) (.cse2 (= 0 main_~p4~0)) (.cse3 (= 1 main_~lk3~0)) (.cse4 (= 0 main_~p5~0)) (.cse5 (= 0 main_~p6~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse0 .cse1 .cse2 .cse4 .cse6) (and .cse9 .cse0 .cse10 .cse3 .cse4 .cse5 .cse11) (and .cse9 .cse8 .cse0 .cse4 .cse5 .cse6 .cse11) (and .cse8 .cse0 .cse1 .cse5 .cse6 .cse12 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse4 .cse6 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse9 .cse0 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse7 .cse8 .cse0 .cse10 .cse1 .cse2 .cse4) (and .cse7 .cse9 .cse0 .cse10 .cse3 .cse4 .cse11) (and .cse7 .cse0 .cse1 .cse3 .cse4 .cse6 .cse11) (and .cse7 .cse8 .cse0 .cse1 .cse2 .cse6 .cse12) (and .cse7 .cse0 .cse10 .cse1 .cse3 .cse4 .cse11) (and .cse7 .cse9 .cse0 .cse10 .cse2 .cse3 .cse4) (and .cse9 .cse0 .cse10 .cse2 .cse3 .cse5 .cse12) (and .cse7 .cse0 .cse10 .cse1 .cse2 .cse3 .cse12) (and .cse0 .cse10 .cse1 .cse3 .cse4 .cse5 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse10 .cse2 .cse4) (and .cse7 .cse9 .cse8 .cse0 .cse2 .cse6 .cse12) (and .cse7 .cse9 .cse0 .cse3 .cse6 .cse12 .cse11) (and .cse7 .cse8 .cse0 .cse1 .cse6 .cse12 .cse11) (and .cse8 .cse0 .cse10 .cse1 .cse4 .cse5 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse10 .cse12 .cse11) (and .cse9 .cse0 .cse3 .cse5 .cse6 .cse12 .cse11) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse5 .cse12) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse9 .cse8 .cse0 .cse6 .cse12 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse2 .cse4 .cse6) (and .cse7 .cse9 .cse8 .cse0 .cse10 .cse2 .cse12) (and .cse7 .cse8 .cse0 .cse10 .cse1 .cse4 .cse11) (and .cse7 .cse9 .cse0 .cse10 .cse2 .cse3 .cse12) (and .cse9 .cse8 .cse0 .cse2 .cse5 .cse6 .cse12) (and .cse7 .cse9 .cse0 .cse2 .cse3 .cse6 .cse12) (and .cse7 .cse0 .cse10 .cse1 .cse3 .cse12 .cse11) (and .cse7 .cse0 .cse10 .cse1 .cse2 .cse3 .cse4) (and .cse7 .cse8 .cse0 .cse10 .cse1 .cse12 .cse11) (and .cse9 .cse8 .cse0 .cse10 .cse5 .cse12 .cse11) (and .cse9 .cse0 .cse2 .cse3 .cse5 .cse6 .cse12) (and .cse7 .cse9 .cse0 .cse10 .cse3 .cse12 .cse11) (and .cse7 .cse0 .cse1 .cse3 .cse6 .cse12 .cse11) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse12 .cse11) (and .cse9 .cse8 .cse0 .cse10 .cse2 .cse5 .cse12) (and .cse8 .cse0 .cse1 .cse4 .cse5 .cse6 .cse11) (and .cse8 .cse0 .cse10 .cse1 .cse2 .cse4 .cse5) (and .cse7 .cse8 .cse0 .cse1 .cse4 .cse6 .cse11) (and .cse8 .cse0 .cse1 .cse2 .cse5 .cse6 .cse12) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse6 .cse12) (and .cse9 .cse8 .cse0 .cse2 .cse4 .cse5 .cse6) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse9 .cse0 .cse3 .cse4 .cse6 .cse11) (and .cse9 .cse8 .cse0 .cse10 .cse2 .cse4 .cse5) (and .cse8 .cse0 .cse10 .cse1 .cse2 .cse5 .cse12) (and .cse9 .cse8 .cse0 .cse5 .cse6 .cse12 .cse11) (and .cse7 .cse9 .cse0 .cse2 .cse3 .cse4 .cse6) (and .cse9 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse9 .cse8 .cse0 .cse10 .cse4 .cse5 .cse11) (and .cse9 .cse0 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse8 .cse0 .cse10 .cse1 .cse5 .cse12 .cse11) (and .cse9 .cse0 .cse10 .cse3 .cse5 .cse12 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse10 .cse4 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse12) (and .cse7 .cse8 .cse0 .cse10 .cse1 .cse2 .cse12) (and .cse0 .cse10 .cse1 .cse3 .cse5 .cse12 .cse11) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse4 .cse5))) [2020-07-18 00:22:23,669 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 133) the Hoare annotation is: false [2020-07-18 00:22:23,669 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 135) the Hoare annotation is: true [2020-07-18 00:22:23,669 INFO L264 CegarLoopResult]: At program point L121(line 121) the Hoare annotation is: (let ((.cse0 (= 1 main_~lk7~0))) (or (and .cse0 (= 0 main_~p8~0)) (and (= 1 main_~lk8~0) .cse0))) [2020-07-18 00:22:23,670 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-07-18 00:22:23,671 INFO L264 CegarLoopResult]: At program point L80-1(lines 33 130) the Hoare annotation is: (let ((.cse1 (= 0 main_~p3~0)) (.cse5 (= 1 main_~lk5~0)) (.cse2 (= 0 main_~p4~0)) (.cse0 (= 0 main_~p7~0)) (.cse13 (= 1 main_~lk2~0)) (.cse4 (= 0 main_~p6~0)) (.cse6 (= 1 main_~lk1~0)) (.cse9 (= 1 main_~lk6~0)) (.cse7 (= 1 main_~lk7~0)) (.cse3 (= 0 main_~p2~0)) (.cse10 (= 1 main_~lk3~0)) (.cse8 (= 0 main_~p5~0)) (.cse12 (= 0 main_~p1~0)) (.cse11 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse7 .cse2 .cse3 .cse8 .cse4 .cse6) (and .cse9 .cse7 .cse3 .cse10 .cse5 .cse6 .cse11) (and .cse1 .cse7 .cse2 .cse3 .cse8 .cse4 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse4 .cse6) (and .cse7 .cse2 .cse3 .cse10 .cse8 .cse4 .cse12) (and .cse0 .cse13 .cse2 .cse10 .cse8 .cse4 .cse12) (and .cse9 .cse13 .cse7 .cse10 .cse8 .cse6 .cse11) (and .cse9 .cse1 .cse7 .cse3 .cse5 .cse6 .cse11) (and .cse9 .cse0 .cse1 .cse13 .cse2 .cse8 .cse6) (and .cse13 .cse7 .cse10 .cse4 .cse12 .cse5 .cse11) (and .cse0 .cse1 .cse13 .cse2 .cse8 .cse4 .cse12) (and .cse0 .cse13 .cse10 .cse4 .cse12 .cse5 .cse11) (and .cse1 .cse7 .cse2 .cse3 .cse4 .cse12 .cse5) (and .cse13 .cse7 .cse2 .cse10 .cse4 .cse5 .cse6) (and .cse9 .cse0 .cse1 .cse3 .cse8 .cse12 .cse11) (and .cse9 .cse0 .cse1 .cse3 .cse8 .cse6 .cse11) (and .cse0 .cse1 .cse13 .cse8 .cse4 .cse12 .cse11) (and .cse9 .cse0 .cse1 .cse3 .cse5 .cse6 .cse11) (and .cse9 .cse0 .cse1 .cse3 .cse12 .cse5 .cse11) (and .cse13 .cse7 .cse10 .cse8 .cse4 .cse6 .cse11) (and .cse9 .cse1 .cse13 .cse7 .cse2 .cse8 .cse6) (and .cse9 .cse7 .cse2 .cse3 .cse10 .cse12 .cse5) (and .cse1 .cse7 .cse3 .cse8 .cse4 .cse6 .cse11) (and .cse9 .cse0 .cse13 .cse2 .cse10 .cse12 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse5) (and .cse9 .cse1 .cse13 .cse7 .cse2 .cse12 .cse5) (and .cse9 .cse1 .cse13 .cse7 .cse12 .cse5 .cse11) (and .cse0 .cse2 .cse3 .cse10 .cse8 .cse4 .cse12) (and .cse1 .cse7 .cse3 .cse8 .cse4 .cse12 .cse11) (and .cse9 .cse0 .cse13 .cse10 .cse12 .cse5 .cse11) (and .cse9 .cse1 .cse7 .cse3 .cse8 .cse6 .cse11) (and .cse1 .cse13 .cse7 .cse2 .cse8 .cse4 .cse12) (and .cse9 .cse0 .cse1 .cse13 .cse2 .cse8 .cse12) (and .cse9 .cse0 .cse1 .cse13 .cse2 .cse12 .cse5) (and .cse1 .cse13 .cse7 .cse2 .cse4 .cse5 .cse6) (and .cse1 .cse13 .cse7 .cse2 .cse4 .cse12 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse4 .cse12) (and .cse9 .cse0 .cse3 .cse10 .cse5 .cse6 .cse11) (and .cse9 .cse0 .cse13 .cse10 .cse8 .cse12 .cse11) (and .cse1 .cse7 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse10 .cse4 .cse5 .cse6) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse9 .cse0 .cse13 .cse10 .cse8 .cse6 .cse11) (and .cse9 .cse1 .cse13 .cse7 .cse2 .cse5 .cse6) (and .cse9 .cse13 .cse7 .cse10 .cse8 .cse12 .cse11) (and .cse9 .cse7 .cse2 .cse3 .cse10 .cse8 .cse12) (and .cse0 .cse1 .cse3 .cse8 .cse4 .cse12 .cse11) (and .cse0 .cse3 .cse10 .cse8 .cse4 .cse12 .cse11) (and .cse0 .cse1 .cse13 .cse4 .cse5 .cse6 .cse11) (and .cse9 .cse1 .cse7 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse13 .cse2 .cse8 .cse4 .cse6) (and .cse0 .cse3 .cse10 .cse4 .cse12 .cse5 .cse11) (and .cse9 .cse1 .cse7 .cse3 .cse12 .cse5 .cse11) (and .cse7 .cse2 .cse3 .cse10 .cse4 .cse5 .cse6) (and .cse9 .cse13 .cse7 .cse2 .cse10 .cse12 .cse5) (and .cse13 .cse7 .cse10 .cse8 .cse4 .cse12 .cse11) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse8 .cse12) (and .cse0 .cse1 .cse13 .cse2 .cse4 .cse12 .cse5) (and .cse0 .cse13 .cse10 .cse4 .cse5 .cse6 .cse11) (and .cse9 .cse1 .cse7 .cse2 .cse3 .cse12 .cse5) (and .cse9 .cse1 .cse7 .cse2 .cse3 .cse8 .cse12) (and .cse9 .cse1 .cse13 .cse7 .cse2 .cse8 .cse12) (and .cse0 .cse2 .cse3 .cse10 .cse8 .cse4 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse12 .cse5 .cse11) (and .cse9 .cse13 .cse7 .cse10 .cse12 .cse5 .cse11) (and .cse13 .cse7 .cse10 .cse4 .cse5 .cse6 .cse11) (and .cse9 .cse1 .cse13 .cse7 .cse5 .cse6 .cse11) (and .cse7 .cse3 .cse10 .cse8 .cse4 .cse12 .cse11) (and .cse9 .cse1 .cse7 .cse3 .cse8 .cse12 .cse11) (and .cse9 .cse7 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse9 .cse0 .cse2 .cse3 .cse10 .cse8 .cse6) (and .cse0 .cse13 .cse2 .cse10 .cse8 .cse4 .cse6) (and .cse1 .cse13 .cse7 .cse8 .cse4 .cse6 .cse11) (and .cse0 .cse13 .cse2 .cse10 .cse4 .cse5 .cse6) (and .cse0 .cse13 .cse10 .cse8 .cse4 .cse12 .cse11) (and .cse9 .cse0 .cse1 .cse13 .cse5 .cse6 .cse11) (and .cse9 .cse0 .cse1 .cse13 .cse8 .cse6 .cse11) (and .cse7 .cse3 .cse10 .cse4 .cse12 .cse5 .cse11) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse12 .cse5) (and .cse9 .cse1 .cse7 .cse2 .cse3 .cse8 .cse6) (and .cse9 .cse0 .cse3 .cse10 .cse12 .cse5 .cse11) (and .cse9 .cse1 .cse13 .cse7 .cse8 .cse12 .cse11) (and .cse9 .cse13 .cse7 .cse2 .cse10 .cse8 .cse6) (and .cse9 .cse0 .cse2 .cse3 .cse10 .cse12 .cse5) (and .cse7 .cse2 .cse3 .cse10 .cse4 .cse12 .cse5) (and .cse9 .cse0 .cse3 .cse10 .cse8 .cse6 .cse11) (and .cse0 .cse3 .cse10 .cse4 .cse5 .cse6 .cse11) (and .cse1 .cse13 .cse7 .cse8 .cse4 .cse12 .cse11) (and .cse13 .cse7 .cse2 .cse10 .cse8 .cse4 .cse6) (and .cse7 .cse2 .cse3 .cse10 .cse8 .cse4 .cse6) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse8 .cse6) (and .cse9 .cse7 .cse3 .cse10 .cse8 .cse6 .cse11) (and .cse9 .cse0 .cse13 .cse10 .cse5 .cse6 .cse11) (and .cse9 .cse7 .cse2 .cse3 .cse10 .cse8 .cse6) (and .cse0 .cse1 .cse13 .cse4 .cse12 .cse5 .cse11) (and .cse9 .cse0 .cse1 .cse13 .cse2 .cse5 .cse6) (and .cse9 .cse0 .cse13 .cse2 .cse10 .cse5 .cse6) (and .cse0 .cse1 .cse13 .cse2 .cse4 .cse5 .cse6) (and .cse0 .cse13 .cse2 .cse10 .cse4 .cse12 .cse5) (and .cse1 .cse7 .cse3 .cse4 .cse12 .cse5 .cse11) (and .cse0 .cse3 .cse10 .cse8 .cse4 .cse6 .cse11) (and .cse9 .cse0 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse7 .cse3 .cse10 .cse8 .cse4 .cse6 .cse11) (and .cse13 .cse7 .cse2 .cse10 .cse4 .cse12 .cse5) (and .cse9 .cse0 .cse3 .cse10 .cse8 .cse12 .cse11) (and .cse9 .cse7 .cse3 .cse10 .cse12 .cse5 .cse11) (and .cse9 .cse0 .cse1 .cse13 .cse8 .cse12 .cse11) (and .cse1 .cse13 .cse7 .cse4 .cse12 .cse5 .cse11) (and .cse1 .cse7 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse1 .cse13 .cse7 .cse2 .cse8 .cse4 .cse6) (and .cse0 .cse1 .cse3 .cse8 .cse4 .cse6 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse9 .cse13 .cse7 .cse2 .cse10 .cse8 .cse12) (and .cse9 .cse0 .cse2 .cse3 .cse10 .cse8 .cse12) (and .cse9 .cse13 .cse7 .cse10 .cse5 .cse6 .cse11) (and .cse7 .cse3 .cse10 .cse4 .cse5 .cse6 .cse11) (and .cse0 .cse1 .cse13 .cse8 .cse4 .cse6 .cse11) (and .cse9 .cse1 .cse13 .cse7 .cse8 .cse6 .cse11) (and .cse9 .cse0 .cse13 .cse2 .cse10 .cse8 .cse12) (and .cse1 .cse13 .cse7 .cse4 .cse5 .cse6 .cse11) (and .cse9 .cse0 .cse13 .cse2 .cse10 .cse8 .cse6) (and .cse9 .cse13 .cse7 .cse2 .cse10 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse10 .cse4 .cse12 .cse5) (and .cse9 .cse0 .cse1 .cse13 .cse12 .cse5 .cse11) (and .cse13 .cse7 .cse2 .cse10 .cse8 .cse4 .cse12) (and .cse0 .cse13 .cse10 .cse8 .cse4 .cse6 .cse11) (and .cse9 .cse7 .cse3 .cse10 .cse8 .cse12 .cse11))) [2020-07-18 00:22:23,671 INFO L264 CegarLoopResult]: At program point L105-1(lines 33 130) the Hoare annotation is: (let ((.cse6 (= 0 main_~p5~0)) (.cse0 (= 0 main_~p7~0)) (.cse7 (= 1 main_~lk8~0)) (.cse1 (= 0 main_~p6~0)) (.cse4 (= 1 main_~lk6~0)) (.cse5 (= 1 main_~lk7~0)) (.cse2 (= 0 main_~p8~0)) (.cse3 (= 1 main_~lk5~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse2) (and .cse7 .cse5 .cse1 .cse3) (and .cse5 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse6 .cse2) (and .cse5 .cse6 .cse1 .cse2) (and .cse4 .cse0 .cse7 .cse6) (and .cse0 .cse6 .cse1 .cse2) (and .cse4 .cse7 .cse5 .cse6) (and .cse4 .cse0 .cse7 .cse3) (and .cse4 .cse7 .cse5 .cse3) (and .cse0 .cse7 .cse6 .cse1) (and .cse4 .cse0 .cse2 .cse3) (and .cse7 .cse5 .cse6 .cse1) (and .cse0 .cse7 .cse1 .cse3) (and .cse4 .cse5 .cse2 .cse3))) [2020-07-18 00:22:23,672 INFO L264 CegarLoopResult]: At program point L72-1(lines 33 130) 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 .cse5 .cse7 .cse9 .cse3 .cse8) (and .cse1 .cse7 .cse2 .cse6 .cse4) (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:22:23,672 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-07-18 00:22:23,672 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-07-18 00:22:23,673 INFO L264 CegarLoopResult]: At program point L97(line 97) the Hoare annotation is: (let ((.cse9 (= 0 main_~p7~0)) (.cse6 (= 0 main_~p8~0)) (.cse7 (= 1 main_~lk6~0)) (.cse8 (= 0 main_~p3~0)) (.cse12 (= 1 main_~lk5~0)) (.cse11 (= 1 main_~lk4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse10 (= 1 main_~lk8~0)) (.cse1 (= 1 main_~lk7~0)) (.cse2 (= 0 main_~p4~0)) (.cse3 (= 1 main_~lk3~0)) (.cse4 (= 0 main_~p5~0)) (.cse5 (= 0 main_~p6~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse0 .cse1 .cse2 .cse4 .cse6) (and .cse9 .cse0 .cse10 .cse3 .cse4 .cse5 .cse11) (and .cse9 .cse8 .cse0 .cse4 .cse5 .cse6 .cse11) (and .cse8 .cse0 .cse1 .cse5 .cse6 .cse12 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse4 .cse6 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse9 .cse0 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse7 .cse8 .cse0 .cse10 .cse1 .cse2 .cse4) (and .cse7 .cse9 .cse0 .cse10 .cse3 .cse4 .cse11) (and .cse7 .cse0 .cse1 .cse3 .cse4 .cse6 .cse11) (and .cse7 .cse8 .cse0 .cse1 .cse2 .cse6 .cse12) (and .cse7 .cse0 .cse10 .cse1 .cse3 .cse4 .cse11) (and .cse7 .cse9 .cse0 .cse10 .cse2 .cse3 .cse4) (and .cse9 .cse0 .cse10 .cse2 .cse3 .cse5 .cse12) (and .cse7 .cse0 .cse10 .cse1 .cse2 .cse3 .cse12) (and .cse0 .cse10 .cse1 .cse3 .cse4 .cse5 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse10 .cse2 .cse4) (and .cse7 .cse9 .cse8 .cse0 .cse2 .cse6 .cse12) (and .cse7 .cse9 .cse0 .cse3 .cse6 .cse12 .cse11) (and .cse7 .cse8 .cse0 .cse1 .cse6 .cse12 .cse11) (and .cse8 .cse0 .cse10 .cse1 .cse4 .cse5 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse10 .cse12 .cse11) (and .cse9 .cse0 .cse3 .cse5 .cse6 .cse12 .cse11) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse5 .cse12) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse9 .cse8 .cse0 .cse6 .cse12 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse2 .cse4 .cse6) (and .cse7 .cse9 .cse8 .cse0 .cse10 .cse2 .cse12) (and .cse7 .cse8 .cse0 .cse10 .cse1 .cse4 .cse11) (and .cse7 .cse9 .cse0 .cse10 .cse2 .cse3 .cse12) (and .cse9 .cse8 .cse0 .cse2 .cse5 .cse6 .cse12) (and .cse7 .cse9 .cse0 .cse2 .cse3 .cse6 .cse12) (and .cse7 .cse0 .cse10 .cse1 .cse3 .cse12 .cse11) (and .cse7 .cse0 .cse10 .cse1 .cse2 .cse3 .cse4) (and .cse7 .cse8 .cse0 .cse10 .cse1 .cse12 .cse11) (and .cse9 .cse8 .cse0 .cse10 .cse5 .cse12 .cse11) (and .cse9 .cse0 .cse2 .cse3 .cse5 .cse6 .cse12) (and .cse7 .cse9 .cse0 .cse10 .cse3 .cse12 .cse11) (and .cse7 .cse0 .cse1 .cse3 .cse6 .cse12 .cse11) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse12 .cse11) (and .cse9 .cse8 .cse0 .cse10 .cse2 .cse5 .cse12) (and .cse8 .cse0 .cse1 .cse4 .cse5 .cse6 .cse11) (and .cse8 .cse0 .cse10 .cse1 .cse2 .cse4 .cse5) (and .cse7 .cse8 .cse0 .cse1 .cse4 .cse6 .cse11) (and .cse8 .cse0 .cse1 .cse2 .cse5 .cse6 .cse12) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse6 .cse12) (and .cse9 .cse8 .cse0 .cse2 .cse4 .cse5 .cse6) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse9 .cse0 .cse3 .cse4 .cse6 .cse11) (and .cse9 .cse8 .cse0 .cse10 .cse2 .cse4 .cse5) (and .cse8 .cse0 .cse10 .cse1 .cse2 .cse5 .cse12) (and .cse9 .cse8 .cse0 .cse5 .cse6 .cse12 .cse11) (and .cse7 .cse9 .cse0 .cse2 .cse3 .cse4 .cse6) (and .cse9 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse9 .cse8 .cse0 .cse10 .cse4 .cse5 .cse11) (and .cse9 .cse0 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse8 .cse0 .cse10 .cse1 .cse5 .cse12 .cse11) (and .cse9 .cse0 .cse10 .cse3 .cse5 .cse12 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse10 .cse4 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse12) (and .cse7 .cse8 .cse0 .cse10 .cse1 .cse2 .cse12) (and .cse0 .cse10 .cse1 .cse3 .cse5 .cse12 .cse11) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse4 .cse5))) [2020-07-18 00:22:23,673 INFO L271 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: true [2020-07-18 00:22:23,673 INFO L264 CegarLoopResult]: At program point L64-1(lines 33 130) 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:22:23,673 INFO L264 CegarLoopResult]: At program point L122(line 122) the Hoare annotation is: (let ((.cse0 (= 1 main_~lk7~0))) (or (and .cse0 (= 0 main_~p8~0)) (and (= 1 main_~lk8~0) .cse0))) [2020-07-18 00:22:23,674 INFO L271 CegarLoopResult]: At program point L56(lines 56 58) the Hoare annotation is: true [2020-07-18 00:22:23,674 INFO L264 CegarLoopResult]: At program point L56-2(lines 33 130) the Hoare annotation is: (or (= 0 main_~p1~0) (= 1 main_~lk1~0)) [2020-07-18 00:22:23,674 INFO L264 CegarLoopResult]: At program point L81(line 81) the Hoare annotation is: (let ((.cse6 (= 0 main_~p2~0)) (.cse10 (= 1 main_~lk3~0)) (.cse11 (= 1 main_~lk6~0)) (.cse2 (= 0 main_~p5~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 .cse6 .cse10 .cse3 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse4 .cse7 .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 .cse9 .cse10 .cse7 .cse8) (and .cse11 .cse1 .cse10 .cse2 .cse4 .cse5) (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 .cse1 .cse10 .cse3 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse6 .cse2 .cse8 .cse5) (and .cse6 .cse10 .cse3 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse9 .cse6 .cse7 .cse8) (and .cse0 .cse9 .cse6 .cse3 .cse7 .cse8) (and .cse11 .cse1 .cse9 .cse10 .cse2 .cse4) (and .cse11 .cse0 .cse1 .cse9 .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 .cse6 .cse10 .cse2 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse9 .cse2 .cse8) (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 .cse6 .cse10 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse2 .cse4 .cse5) (and .cse0 .cse1 .cse9 .cse3 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse4 .cse7 .cse5))) [2020-07-18 00:22:23,675 INFO L271 CegarLoopResult]: At program point L48(line 48) the Hoare annotation is: true [2020-07-18 00:22:23,675 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-07-18 00:22:23,675 INFO L271 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: true [2020-07-18 00:22:23,675 INFO L271 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: true [2020-07-18 00:22:23,675 INFO L264 CegarLoopResult]: At program point L106(line 106) the Hoare annotation is: (let ((.cse2 (= 1 main_~lk7~0)) (.cse6 (= 0 main_~p6~0)) (.cse7 (= 0 main_~p8~0)) (.cse8 (= 1 main_~lk5~0)) (.cse0 (= 1 main_~lk6~0)) (.cse5 (= 0 main_~p7~0)) (.cse1 (= 1 main_~lk8~0)) (.cse3 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse3 .cse6 .cse7 .cse4) (and .cse0 .cse1 .cse2 .cse8 .cse4) (and .cse5 .cse1 .cse3 .cse6 .cse4) (and .cse1 .cse2 .cse6 .cse8 .cse4) (and .cse2 .cse3 .cse6 .cse7 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse4) (and .cse1 .cse2 .cse3 .cse6 .cse4) (and .cse0 .cse2 .cse7 .cse8 .cse4) (and .cse5 .cse1 .cse6 .cse8 .cse4) (and .cse0 .cse2 .cse3 .cse7 .cse4) (and .cse0 .cse5 .cse3 .cse7 .cse4) (and .cse2 .cse6 .cse7 .cse8 .cse4) (and .cse0 .cse5 .cse1 .cse8 .cse4) (and .cse0 .cse5 .cse7 .cse8 .cse4) (and .cse0 .cse5 .cse1 .cse3 .cse4))) [2020-07-18 00:22:23,675 INFO L264 CegarLoopResult]: At program point L73(line 73) 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 .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 .cse5 .cse1 .cse6) (and .cse0 .cse1 .cse6 .cse3))) [2020-07-18 00:22:23,676 INFO L271 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: true [2020-07-18 00:22:23,676 INFO L271 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: true [2020-07-18 00:22:23,676 INFO L271 CegarLoopResult]: At program point L131(lines 5 135) the Hoare annotation is: true [2020-07-18 00:22:23,676 INFO L264 CegarLoopResult]: At program point L65(line 65) 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:22:23,676 INFO L271 CegarLoopResult]: At program point L57(line 57) the Hoare annotation is: true [2020-07-18 00:22:23,678 INFO L264 CegarLoopResult]: At program point L90-1(lines 33 130) the Hoare annotation is: (let ((.cse7 (= 1 main_~lk6~0)) (.cse12 (= 1 main_~lk5~0)) (.cse9 (= 0 main_~p7~0)) (.cse0 (= 1 main_~lk2~0)) (.cse10 (= 1 main_~lk8~0)) (.cse2 (= 0 main_~p4~0)) (.cse3 (= 1 main_~lk3~0)) (.cse8 (= 0 main_~p3~0)) (.cse1 (= 1 main_~lk7~0)) (.cse13 (= 0 main_~p2~0)) (.cse4 (= 0 main_~p5~0)) (.cse5 (= 0 main_~p6~0)) (.cse6 (= 0 main_~p8~0)) (.cse11 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse0 .cse1 .cse2 .cse4 .cse6) (and .cse9 .cse0 .cse10 .cse3 .cse4 .cse5 .cse11) (and .cse8 .cse0 .cse1 .cse5 .cse6 .cse12 .cse11) (and .cse8 .cse10 .cse1 .cse13 .cse4 .cse5 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse9 .cse8 .cse10 .cse13 .cse5 .cse12 .cse11) (and .cse7 .cse0 .cse1 .cse3 .cse4 .cse6 .cse11) (and .cse7 .cse9 .cse0 .cse10 .cse3 .cse4 .cse11) (and .cse7 .cse0 .cse10 .cse1 .cse3 .cse4 .cse11) (and .cse0 .cse10 .cse1 .cse3 .cse4 .cse5 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse10 .cse2 .cse4) (and .cse9 .cse8 .cse2 .cse13 .cse5 .cse6 .cse12) (and .cse7 .cse9 .cse8 .cse0 .cse2 .cse6 .cse12) (and .cse9 .cse10 .cse13 .cse3 .cse5 .cse12 .cse11) (and .cse7 .cse9 .cse0 .cse3 .cse6 .cse12 .cse11) (and .cse7 .cse9 .cse8 .cse10 .cse13 .cse4 .cse11) (and .cse8 .cse0 .cse10 .cse1 .cse4 .cse5 .cse11) (and .cse7 .cse8 .cse10 .cse1 .cse13 .cse4 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse10 .cse12 .cse11) (and .cse9 .cse0 .cse3 .cse5 .cse6 .cse12 .cse11) (and .cse1 .cse13 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse5 .cse12) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse9 .cse8 .cse0 .cse2 .cse4 .cse6) (and .cse8 .cse1 .cse13 .cse5 .cse6 .cse12 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse6 .cse12 .cse11) (and .cse7 .cse8 .cse1 .cse2 .cse13 .cse6 .cse12) (and .cse7 .cse9 .cse10 .cse13 .cse3 .cse12 .cse11) (and .cse8 .cse1 .cse2 .cse13 .cse5 .cse6 .cse12) (and .cse7 .cse9 .cse0 .cse2 .cse3 .cse6 .cse12) (and .cse7 .cse0 .cse10 .cse1 .cse2 .cse3 .cse4) (and .cse7 .cse8 .cse0 .cse10 .cse1 .cse12 .cse11) (and .cse9 .cse8 .cse0 .cse10 .cse5 .cse12 .cse11) (and .cse9 .cse0 .cse2 .cse3 .cse5 .cse6 .cse12) (and .cse8 .cse1 .cse2 .cse13 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse3 .cse6 .cse12 .cse11) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse12 .cse11) (and .cse8 .cse0 .cse1 .cse4 .cse5 .cse6 .cse11) (and .cse8 .cse0 .cse10 .cse1 .cse2 .cse4 .cse5) (and .cse7 .cse8 .cse1 .cse13 .cse6 .cse12 .cse11) (and .cse7 .cse1 .cse2 .cse13 .cse3 .cse6 .cse12) (and .cse7 .cse9 .cse10 .cse2 .cse13 .cse3 .cse12) (and .cse7 .cse9 .cse8 .cse13 .cse4 .cse6 .cse11) (and .cse7 .cse8 .cse0 .cse1 .cse4 .cse6 .cse11) (and .cse9 .cse10 .cse2 .cse13 .cse3 .cse5 .cse12) (and .cse7 .cse9 .cse10 .cse13 .cse3 .cse4 .cse11) (and .cse7 .cse10 .cse1 .cse2 .cse13 .cse3 .cse4) (and .cse7 .cse1 .cse2 .cse13 .cse3 .cse4 .cse6) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse9 .cse0 .cse3 .cse4 .cse6 .cse11) (and .cse8 .cse0 .cse10 .cse1 .cse2 .cse5 .cse12) (and .cse7 .cse9 .cse10 .cse2 .cse13 .cse3 .cse4) (and .cse1 .cse13 .cse3 .cse5 .cse6 .cse12 .cse11) (and .cse9 .cse8 .cse0 .cse10 .cse4 .cse5 .cse11) (and .cse9 .cse0 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse8 .cse0 .cse10 .cse1 .cse5 .cse12 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse12) (and .cse7 .cse9 .cse8 .cse0 .cse10 .cse4 .cse11) (and .cse7 .cse9 .cse8 .cse13 .cse6 .cse12 .cse11) (and .cse0 .cse10 .cse1 .cse3 .cse5 .cse12 .cse11) (and .cse7 .cse8 .cse1 .cse13 .cse4 .cse6 .cse11) (and .cse7 .cse9 .cse2 .cse13 .cse3 .cse4 .cse6) (and .cse9 .cse8 .cse0 .cse4 .cse5 .cse6 .cse11) (and .cse9 .cse8 .cse13 .cse5 .cse6 .cse12 .cse11) (and .cse7 .cse8 .cse10 .cse1 .cse2 .cse13 .cse12) (and .cse7 .cse9 .cse8 .cse0 .cse4 .cse6 .cse11) (and .cse9 .cse13 .cse3 .cse5 .cse6 .cse12 .cse11) (and .cse9 .cse0 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse7 .cse8 .cse0 .cse10 .cse1 .cse2 .cse4) (and .cse10 .cse1 .cse13 .cse3 .cse4 .cse5 .cse11) (and .cse1 .cse2 .cse13 .cse3 .cse5 .cse6 .cse12) (and .cse7 .cse8 .cse0 .cse1 .cse2 .cse6 .cse12) (and .cse7 .cse9 .cse13 .cse3 .cse6 .cse12 .cse11) (and .cse7 .cse9 .cse0 .cse10 .cse2 .cse3 .cse4) (and .cse9 .cse0 .cse10 .cse2 .cse3 .cse5 .cse12) (and .cse7 .cse8 .cse10 .cse1 .cse13 .cse12 .cse11) (and .cse10 .cse1 .cse2 .cse13 .cse3 .cse4 .cse5) (and .cse7 .cse0 .cse10 .cse1 .cse2 .cse3 .cse12) (and .cse7 .cse1 .cse13 .cse3 .cse4 .cse6 .cse11) (and .cse7 .cse8 .cse10 .cse1 .cse2 .cse13 .cse4) (and .cse7 .cse8 .cse1 .cse2 .cse13 .cse4 .cse6) (and .cse7 .cse8 .cse0 .cse1 .cse6 .cse12 .cse11) (and .cse8 .cse10 .cse1 .cse2 .cse13 .cse5 .cse12) (and .cse7 .cse10 .cse1 .cse13 .cse3 .cse12 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse10 .cse2 .cse12) (and .cse9 .cse8 .cse2 .cse13 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse0 .cse10 .cse1 .cse4 .cse11) (and .cse7 .cse9 .cse0 .cse10 .cse2 .cse3 .cse12) (and .cse7 .cse9 .cse13 .cse3 .cse4 .cse6 .cse11) (and .cse9 .cse8 .cse0 .cse2 .cse5 .cse6 .cse12) (and .cse7 .cse0 .cse10 .cse1 .cse3 .cse12 .cse11) (and .cse9 .cse2 .cse13 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse9 .cse0 .cse10 .cse3 .cse12 .cse11) (and .cse7 .cse9 .cse8 .cse2 .cse13 .cse4 .cse6) (and .cse9 .cse8 .cse0 .cse10 .cse2 .cse5 .cse12) (and .cse10 .cse1 .cse2 .cse13 .cse3 .cse5 .cse12) (and .cse9 .cse8 .cse10 .cse13 .cse4 .cse5 .cse11) (and .cse9 .cse8 .cse10 .cse2 .cse13 .cse5 .cse12) (and .cse8 .cse10 .cse1 .cse2 .cse13 .cse4 .cse5) (and .cse7 .cse9 .cse8 .cse2 .cse13 .cse6 .cse12) (and .cse7 .cse9 .cse8 .cse10 .cse13 .cse12 .cse11) (and .cse7 .cse10 .cse1 .cse2 .cse13 .cse3 .cse12) (and .cse7 .cse10 .cse1 .cse13 .cse3 .cse4 .cse11) (and .cse1 .cse2 .cse13 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse9 .cse8 .cse10 .cse2 .cse13 .cse4) (and .cse8 .cse0 .cse1 .cse2 .cse5 .cse6 .cse12) (and .cse9 .cse13 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse6 .cse12) (and .cse10 .cse1 .cse13 .cse3 .cse5 .cse12 .cse11) (and .cse7 .cse1 .cse13 .cse3 .cse6 .cse12 .cse11) (and .cse9 .cse10 .cse2 .cse13 .cse3 .cse4 .cse5) (and .cse9 .cse8 .cse0 .cse2 .cse4 .cse5 .cse6) (and .cse9 .cse8 .cse13 .cse4 .cse5 .cse6 .cse11) (and .cse9 .cse10 .cse13 .cse3 .cse4 .cse5 .cse11) (and .cse9 .cse8 .cse0 .cse10 .cse2 .cse4 .cse5) (and .cse9 .cse8 .cse0 .cse5 .cse6 .cse12 .cse11) (and .cse7 .cse9 .cse8 .cse10 .cse2 .cse13 .cse12) (and .cse8 .cse10 .cse1 .cse13 .cse5 .cse12 .cse11) (and .cse7 .cse9 .cse0 .cse2 .cse3 .cse4 .cse6) (and .cse9 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse9 .cse2 .cse13 .cse3 .cse5 .cse6 .cse12) (and .cse9 .cse0 .cse10 .cse3 .cse5 .cse12 .cse11) (and .cse7 .cse8 .cse0 .cse10 .cse1 .cse2 .cse12) (and .cse7 .cse9 .cse2 .cse13 .cse3 .cse6 .cse12) (and .cse9 .cse8 .cse10 .cse2 .cse13 .cse4 .cse5) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse8 .cse1 .cse13 .cse4 .cse5 .cse6 .cse11))) [2020-07-18 00:22:23,678 INFO L271 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: true [2020-07-18 00:22:23,678 INFO L271 CegarLoopResult]: At program point L24-1(line 24) the Hoare annotation is: true [2020-07-18 00:22:23,678 INFO L271 CegarLoopResult]: At program point L24-2(line 24) the Hoare annotation is: true [2020-07-18 00:22:23,678 INFO L264 CegarLoopResult]: At program point L115-1(lines 33 130) the Hoare annotation is: (let ((.cse1 (= 0 main_~p8~0)) (.cse2 (= 1 main_~lk7~0)) (.cse0 (= 0 main_~p7~0)) (.cse3 (= 1 main_~lk8~0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and .cse3 .cse2) (and .cse0 .cse3))) [2020-07-18 00:22:23,678 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-07-18 00:22:23,679 INFO L264 CegarLoopResult]: At program point L107(line 107) the Hoare annotation is: (let ((.cse2 (= 1 main_~lk7~0)) (.cse6 (= 0 main_~p6~0)) (.cse7 (= 0 main_~p8~0)) (.cse8 (= 1 main_~lk5~0)) (.cse0 (= 1 main_~lk6~0)) (.cse5 (= 0 main_~p7~0)) (.cse1 (= 1 main_~lk8~0)) (.cse3 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse3 .cse6 .cse7 .cse4) (and .cse0 .cse1 .cse2 .cse8 .cse4) (and .cse5 .cse1 .cse3 .cse6 .cse4) (and .cse1 .cse2 .cse6 .cse8 .cse4) (and .cse2 .cse3 .cse6 .cse7 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse4) (and .cse1 .cse2 .cse3 .cse6 .cse4) (and .cse0 .cse2 .cse7 .cse8 .cse4) (and .cse5 .cse1 .cse6 .cse8 .cse4) (and .cse0 .cse2 .cse3 .cse7 .cse4) (and .cse0 .cse5 .cse3 .cse7 .cse4) (and .cse2 .cse6 .cse7 .cse8 .cse4) (and .cse0 .cse5 .cse1 .cse8 .cse4) (and .cse0 .cse5 .cse7 .cse8 .cse4) (and .cse0 .cse5 .cse1 .cse3 .cse4))) [2020-07-18 00:22:23,680 INFO L264 CegarLoopResult]: At program point L91(line 91) the Hoare annotation is: (let ((.cse4 (= 1 main_~lk8~0)) (.cse0 (= 1 main_~lk6~0)) (.cse12 (= 0 main_~p7~0)) (.cse8 (= 0 main_~p4~0)) (.cse1 (= 0 main_~p3~0)) (.cse13 (= 1 main_~lk5~0)) (.cse2 (= 1 main_~lk2~0)) (.cse3 (= main_~lk7~0 1)) (.cse9 (= 0 main_~p2~0)) (.cse10 (= 1 main_~lk3~0)) (.cse5 (= 0 main_~p5~0)) (.cse11 (= 0 main_~p6~0)) (.cse14 (= 0 main_~p8~0)) (.cse6 (= 1 main_~lk1~0)) (.cse7 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse3 .cse4 .cse8 .cse9 .cse10 .cse5 .cse11 .cse6) (and .cse12 .cse2 .cse4 .cse10 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse12 .cse2 .cse4 .cse10 .cse5 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse10 .cse13 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse10 .cse5 .cse6 .cse7) (and .cse0 .cse12 .cse4 .cse9 .cse10 .cse5 .cse6 .cse7) (and .cse12 .cse4 .cse9 .cse10 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse8 .cse10 .cse13 .cse6) (and .cse3 .cse4 .cse9 .cse10 .cse5 .cse11 .cse6 .cse7) (and .cse12 .cse2 .cse4 .cse8 .cse10 .cse11 .cse13 .cse6) (and .cse0 .cse12 .cse1 .cse2 .cse4 .cse8 .cse13 .cse6) (and .cse0 .cse12 .cse2 .cse4 .cse10 .cse13 .cse6 .cse7) (and .cse0 .cse3 .cse4 .cse8 .cse9 .cse10 .cse13 .cse6) (and .cse12 .cse1 .cse8 .cse9 .cse5 .cse11 .cse14 .cse6) (and .cse0 .cse12 .cse4 .cse8 .cse9 .cse10 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse3 .cse4 .cse8 .cse9 .cse10 .cse5 .cse6) (and .cse12 .cse1 .cse2 .cse4 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse12 .cse4 .cse9 .cse10 .cse13 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse8 .cse13 .cse6) (and .cse0 .cse12 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7) (and .cse12 .cse1 .cse2 .cse8 .cse11 .cse14 .cse13 .cse6) (and .cse12 .cse8 .cse9 .cse10 .cse11 .cse14 .cse13 .cse6) (and .cse12 .cse1 .cse2 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse2 .cse8 .cse5 .cse14 .cse6) (and .cse12 .cse1 .cse2 .cse4 .cse8 .cse11 .cse13 .cse6) (and .cse0 .cse3 .cse4 .cse9 .cse10 .cse13 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse14 .cse6 .cse7) (and .cse1 .cse3 .cse4 .cse9 .cse11 .cse13 .cse6 .cse7) (and .cse0 .cse3 .cse8 .cse9 .cse10 .cse5 .cse14 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse5 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse8 .cse9 .cse5 .cse14 .cse6) (and .cse0 .cse12 .cse1 .cse2 .cse5 .cse14 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse5 .cse14 .cse6) (and .cse0 .cse12 .cse1 .cse4 .cse9 .cse13 .cse6 .cse7) (and .cse12 .cse2 .cse10 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse12 .cse8 .cse9 .cse10 .cse14 .cse13 .cse6) (and .cse0 .cse2 .cse3 .cse8 .cse10 .cse14 .cse13 .cse6) (and .cse0 .cse1 .cse3 .cse9 .cse5 .cse14 .cse6 .cse7) (and .cse12 .cse2 .cse8 .cse10 .cse11 .cse14 .cse13 .cse6) (and .cse12 .cse1 .cse2 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse1 .cse3 .cse4 .cse8 .cse9 .cse5 .cse11 .cse6) (and .cse3 .cse4 .cse8 .cse9 .cse10 .cse11 .cse13 .cse6) (and .cse1 .cse3 .cse4 .cse9 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse8 .cse9 .cse14 .cse13 .cse6) (and .cse1 .cse2 .cse3 .cse8 .cse11 .cse14 .cse13 .cse6) (and .cse1 .cse2 .cse3 .cse4 .cse8 .cse11 .cse13 .cse6) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse11 .cse6 .cse7) (and .cse3 .cse9 .cse10 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse4 .cse8 .cse9 .cse10 .cse13 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse14 .cse13 .cse6) (and .cse12 .cse1 .cse2 .cse8 .cse5 .cse11 .cse14 .cse6) (and .cse0 .cse1 .cse3 .cse8 .cse9 .cse14 .cse13 .cse6) (and .cse0 .cse2 .cse3 .cse8 .cse10 .cse5 .cse14 .cse6) (and .cse0 .cse1 .cse3 .cse8 .cse9 .cse5 .cse14 .cse6) (and .cse0 .cse3 .cse9 .cse10 .cse14 .cse13 .cse6 .cse7) (and .cse2 .cse3 .cse4 .cse10 .cse11 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse9 .cse10 .cse5 .cse14 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse2 .cse4 .cse8 .cse5 .cse6) (and .cse12 .cse1 .cse4 .cse9 .cse11 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse2 .cse10 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse2 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse2 .cse4 .cse8 .cse10 .cse5 .cse6) (and .cse12 .cse9 .cse10 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse8 .cse5 .cse11 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse13 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse3 .cse8 .cse9 .cse10 .cse14 .cse13 .cse6) (and .cse1 .cse3 .cse4 .cse8 .cse9 .cse11 .cse13 .cse6) (and .cse2 .cse3 .cse4 .cse8 .cse10 .cse11 .cse13 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse8 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse10 .cse5 .cse14 .cse6 .cse7) (and .cse0 .cse12 .cse2 .cse10 .cse5 .cse14 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse4 .cse8 .cse9 .cse5 .cse6) (and .cse12 .cse1 .cse4 .cse9 .cse5 .cse11 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse8 .cse5 .cse11 .cse14 .cse6) (and .cse0 .cse12 .cse1 .cse9 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse2 .cse4 .cse13 .cse6 .cse7) (and .cse12 .cse1 .cse8 .cse9 .cse11 .cse14 .cse13 .cse6) (and .cse12 .cse4 .cse8 .cse9 .cse10 .cse11 .cse13 .cse6) (and .cse1 .cse3 .cse9 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse12 .cse2 .cse4 .cse10 .cse11 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse2 .cse8 .cse14 .cse13 .cse6) (and .cse12 .cse1 .cse2 .cse4 .cse8 .cse5 .cse11 .cse6) (and .cse12 .cse4 .cse9 .cse10 .cse11 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse2 .cse8 .cse10 .cse14 .cse13 .cse6) (and .cse3 .cse8 .cse9 .cse10 .cse11 .cse14 .cse13 .cse6) (and .cse0 .cse3 .cse4 .cse9 .cse10 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse9 .cse5 .cse14 .cse6 .cse7) (and .cse1 .cse3 .cse8 .cse9 .cse5 .cse11 .cse14 .cse6) (and .cse3 .cse8 .cse9 .cse10 .cse5 .cse11 .cse14 .cse6) (and .cse2 .cse3 .cse10 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse8 .cse9 .cse13 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse8 .cse10 .cse5 .cse6) (and .cse12 .cse1 .cse9 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse2 .cse3 .cse8 .cse10 .cse5 .cse11 .cse14 .cse6) (and .cse12 .cse1 .cse4 .cse8 .cse9 .cse11 .cse13 .cse6) (and .cse12 .cse1 .cse2 .cse4 .cse11 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse8 .cse9 .cse10 .cse5 .cse14 .cse6) (and .cse12 .cse2 .cse10 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse12 .cse1 .cse9 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse3 .cse9 .cse10 .cse5 .cse14 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse13 .cse6 .cse7) (and .cse12 .cse2 .cse4 .cse8 .cse10 .cse5 .cse11 .cse6) (and .cse12 .cse8 .cse9 .cse10 .cse5 .cse11 .cse14 .cse6) (and .cse0 .cse12 .cse1 .cse4 .cse8 .cse9 .cse13 .cse6) (and .cse0 .cse12 .cse2 .cse8 .cse10 .cse5 .cse14 .cse6) (and .cse12 .cse4 .cse8 .cse9 .cse10 .cse5 .cse11 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse8 .cse9 .cse5 .cse6) (and .cse3 .cse4 .cse9 .cse10 .cse11 .cse13 .cse6 .cse7) (and .cse2 .cse3 .cse4 .cse8 .cse10 .cse5 .cse11 .cse6) (and .cse12 .cse9 .cse10 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse10 .cse14 .cse13 .cse6 .cse7) (and .cse12 .cse1 .cse4 .cse8 .cse9 .cse5 .cse11 .cse6) (and .cse1 .cse3 .cse9 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse4 .cse9 .cse5 .cse6 .cse7) (and .cse0 .cse12 .cse2 .cse4 .cse8 .cse10 .cse13 .cse6) (and .cse2 .cse3 .cse4 .cse10 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse12 .cse9 .cse10 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse9 .cse14 .cse13 .cse6 .cse7) (and .cse1 .cse3 .cse8 .cse9 .cse11 .cse14 .cse13 .cse6) (and .cse12 .cse2 .cse8 .cse10 .cse5 .cse11 .cse14 .cse6) (and .cse2 .cse3 .cse8 .cse10 .cse11 .cse14 .cse13 .cse6) (and .cse1 .cse2 .cse3 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse2 .cse3 .cse10 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse3 .cse9 .cse10 .cse5 .cse11 .cse14 .cse6 .cse7))) [2020-07-18 00:22:23,680 INFO L271 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-07-18 00:22:23,681 INFO L264 CegarLoopResult]: At program point L116(line 116) the Hoare annotation is: (let ((.cse4 (= 1 main_~lk7~0)) (.cse2 (= 0 main_~p8~0)) (.cse0 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p7~0)) (.cse3 (= 1 main_~lk8~0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4) (and .cse0 .cse4 .cse2) (and .cse0 .cse1 .cse3))) [2020-07-18 00:22:23,681 INFO L271 CegarLoopResult]: At program point L50(line 50) the Hoare annotation is: true [2020-07-18 00:22:23,681 INFO L271 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: true [2020-07-18 00:22:23,681 INFO L271 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-07-18 00:22:23,681 INFO L271 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: true [2020-07-18 00:22:23,681 INFO L271 CegarLoopResult]: At program point L9-2(line 9) the Hoare annotation is: true [2020-07-18 00:22:23,682 INFO L264 CegarLoopResult]: At program point L100-1(lines 33 130) the Hoare annotation is: (let ((.cse2 (= 0 main_~p5~0)) (.cse1 (= 0 main_~p4~0)) (.cse0 (= 1 main_~lk7~0)) (.cse3 (= 0 main_~p6~0)) (.cse6 (= 1 main_~lk8~0)) (.cse5 (= 1 main_~lk6~0)) (.cse8 (= 0 main_~p7~0)) (.cse4 (= 0 main_~p8~0)) (.cse9 (= 1 main_~lk5~0)) (.cse7 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse0 .cse2 .cse7) (and .cse8 .cse2 .cse3 .cse4 .cse7) (and .cse5 .cse6 .cse0 .cse9 .cse7) (and .cse8 .cse6 .cse2 .cse3 .cse7) (and .cse5 .cse8 .cse6 .cse1 .cse2) (and .cse0 .cse2 .cse3 .cse4 .cse7) (and .cse5 .cse0 .cse1 .cse2 .cse4) (and .cse5 .cse8 .cse1 .cse2 .cse4) (and .cse8 .cse6 .cse1 .cse2 .cse3) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse5 .cse8 .cse1 .cse4 .cse9) (and .cse5 .cse6 .cse0 .cse1 .cse2) (and .cse8 .cse1 .cse2 .cse3 .cse4) (and .cse8 .cse6 .cse3 .cse9 .cse7) (and .cse5 .cse0 .cse2 .cse4 .cse7) (and .cse6 .cse0 .cse1 .cse3 .cse9) (and .cse5 .cse8 .cse6 .cse2 .cse7) (and .cse6 .cse0 .cse3 .cse9 .cse7) (and .cse8 .cse3 .cse4 .cse9 .cse7) (and .cse5 .cse0 .cse1 .cse4 .cse9) (and .cse5 .cse0 .cse4 .cse9 .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse9) (and .cse8 .cse1 .cse3 .cse4 .cse9) (and .cse6 .cse0 .cse1 .cse2 .cse3) (and .cse5 .cse8 .cse6 .cse1 .cse9) (and .cse5 .cse6 .cse0 .cse1 .cse9) (and .cse5 .cse8 .cse2 .cse4 .cse7) (and .cse8 .cse6 .cse1 .cse3 .cse9) (and .cse0 .cse3 .cse4 .cse9 .cse7) (and .cse5 .cse8 .cse6 .cse9 .cse7) (and .cse5 .cse8 .cse4 .cse9 .cse7))) [2020-07-18 00:22:23,682 INFO L271 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: true [2020-07-18 00:22:23,682 INFO L271 CegarLoopResult]: At program point L34-1(line 34) the Hoare annotation is: true [2020-07-18 00:22:23,682 INFO L271 CegarLoopResult]: At program point L34-2(line 34) the Hoare annotation is: true [2020-07-18 00:22:23,684 INFO L264 CegarLoopResult]: At program point L92(line 92) the Hoare annotation is: (let ((.cse4 (= 1 main_~lk8~0)) (.cse0 (= 1 main_~lk6~0)) (.cse12 (= 0 main_~p7~0)) (.cse8 (= 0 main_~p4~0)) (.cse1 (= 0 main_~p3~0)) (.cse13 (= 1 main_~lk5~0)) (.cse2 (= 1 main_~lk2~0)) (.cse3 (= main_~lk7~0 1)) (.cse9 (= 0 main_~p2~0)) (.cse10 (= 1 main_~lk3~0)) (.cse5 (= 0 main_~p5~0)) (.cse11 (= 0 main_~p6~0)) (.cse14 (= 0 main_~p8~0)) (.cse6 (= 1 main_~lk1~0)) (.cse7 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse3 .cse4 .cse8 .cse9 .cse10 .cse5 .cse11 .cse6) (and .cse0 .cse12 .cse2 .cse4 .cse10 .cse5 .cse6 .cse7) (and .cse12 .cse2 .cse4 .cse10 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse10 .cse13 .cse6 .cse7) (and .cse12 .cse4 .cse9 .cse10 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse10 .cse5 .cse6 .cse7) (and .cse0 .cse12 .cse4 .cse9 .cse10 .cse5 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse8 .cse10 .cse13 .cse6) (and .cse3 .cse4 .cse9 .cse10 .cse5 .cse11 .cse6 .cse7) (and .cse12 .cse2 .cse4 .cse8 .cse10 .cse11 .cse13 .cse6) (and .cse0 .cse12 .cse1 .cse2 .cse4 .cse8 .cse13 .cse6) (and .cse0 .cse12 .cse2 .cse4 .cse10 .cse13 .cse6 .cse7) (and .cse0 .cse3 .cse4 .cse8 .cse9 .cse10 .cse13 .cse6) (and .cse12 .cse1 .cse8 .cse9 .cse5 .cse11 .cse14 .cse6) (and .cse0 .cse12 .cse4 .cse8 .cse9 .cse10 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse3 .cse4 .cse8 .cse9 .cse10 .cse5 .cse6) (and .cse12 .cse1 .cse2 .cse4 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse12 .cse4 .cse9 .cse10 .cse13 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse8 .cse13 .cse6) (and .cse12 .cse1 .cse2 .cse8 .cse11 .cse14 .cse13 .cse6) (and .cse12 .cse8 .cse9 .cse10 .cse11 .cse14 .cse13 .cse6) (and .cse0 .cse12 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7) (and .cse12 .cse1 .cse2 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse2 .cse8 .cse5 .cse14 .cse6) (and .cse12 .cse1 .cse2 .cse4 .cse8 .cse11 .cse13 .cse6) (and .cse0 .cse3 .cse4 .cse9 .cse10 .cse13 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse14 .cse6 .cse7) (and .cse1 .cse3 .cse4 .cse9 .cse11 .cse13 .cse6 .cse7) (and .cse0 .cse3 .cse8 .cse9 .cse10 .cse5 .cse14 .cse6) (and .cse0 .cse12 .cse1 .cse8 .cse9 .cse5 .cse14 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse5 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse2 .cse5 .cse14 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse5 .cse14 .cse6) (and .cse0 .cse12 .cse1 .cse4 .cse9 .cse13 .cse6 .cse7) (and .cse12 .cse2 .cse10 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse12 .cse8 .cse9 .cse10 .cse14 .cse13 .cse6) (and .cse0 .cse2 .cse3 .cse8 .cse10 .cse14 .cse13 .cse6) (and .cse0 .cse1 .cse3 .cse9 .cse5 .cse14 .cse6 .cse7) (and .cse12 .cse2 .cse8 .cse10 .cse11 .cse14 .cse13 .cse6) (and .cse12 .cse1 .cse2 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse1 .cse3 .cse4 .cse8 .cse9 .cse5 .cse11 .cse6) (and .cse3 .cse4 .cse8 .cse9 .cse10 .cse11 .cse13 .cse6) (and .cse1 .cse3 .cse4 .cse9 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse8 .cse9 .cse14 .cse13 .cse6) (and .cse1 .cse2 .cse3 .cse8 .cse11 .cse14 .cse13 .cse6) (and .cse1 .cse2 .cse3 .cse4 .cse8 .cse11 .cse13 .cse6) (and .cse3 .cse9 .cse10 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse12 .cse4 .cse8 .cse9 .cse10 .cse13 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse14 .cse13 .cse6) (and .cse12 .cse1 .cse2 .cse8 .cse5 .cse11 .cse14 .cse6) (and .cse0 .cse1 .cse3 .cse8 .cse9 .cse14 .cse13 .cse6) (and .cse0 .cse2 .cse3 .cse8 .cse10 .cse5 .cse14 .cse6) (and .cse0 .cse1 .cse3 .cse8 .cse9 .cse5 .cse14 .cse6) (and .cse0 .cse3 .cse9 .cse10 .cse14 .cse13 .cse6 .cse7) (and .cse2 .cse3 .cse4 .cse10 .cse11 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse9 .cse10 .cse5 .cse14 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse2 .cse4 .cse8 .cse5 .cse6) (and .cse12 .cse1 .cse4 .cse9 .cse11 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse2 .cse10 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse2 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse2 .cse4 .cse8 .cse10 .cse5 .cse6) (and .cse12 .cse9 .cse10 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse8 .cse5 .cse11 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse13 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse3 .cse8 .cse9 .cse10 .cse14 .cse13 .cse6) (and .cse1 .cse3 .cse4 .cse8 .cse9 .cse11 .cse13 .cse6) (and .cse2 .cse3 .cse4 .cse8 .cse10 .cse11 .cse13 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse8 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse10 .cse5 .cse14 .cse6 .cse7) (and .cse0 .cse12 .cse2 .cse10 .cse5 .cse14 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse4 .cse8 .cse9 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse8 .cse5 .cse11 .cse14 .cse6) (and .cse12 .cse1 .cse4 .cse9 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse9 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse2 .cse4 .cse13 .cse6 .cse7) (and .cse12 .cse1 .cse8 .cse9 .cse11 .cse14 .cse13 .cse6) (and .cse12 .cse4 .cse8 .cse9 .cse10 .cse11 .cse13 .cse6) (and .cse1 .cse3 .cse9 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse12 .cse2 .cse4 .cse10 .cse11 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse2 .cse8 .cse14 .cse13 .cse6) (and .cse12 .cse1 .cse2 .cse4 .cse8 .cse5 .cse11 .cse6) (and .cse12 .cse4 .cse9 .cse10 .cse11 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse2 .cse8 .cse10 .cse14 .cse13 .cse6) (and .cse0 .cse3 .cse4 .cse9 .cse10 .cse5 .cse6 .cse7) (and .cse3 .cse8 .cse9 .cse10 .cse11 .cse14 .cse13 .cse6) (and .cse0 .cse12 .cse1 .cse9 .cse5 .cse14 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6 .cse7) (and .cse1 .cse3 .cse8 .cse9 .cse5 .cse11 .cse14 .cse6) (and .cse3 .cse8 .cse9 .cse10 .cse5 .cse11 .cse14 .cse6) (and .cse2 .cse3 .cse10 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse8 .cse10 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse8 .cse9 .cse13 .cse6) (and .cse12 .cse1 .cse9 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse2 .cse3 .cse8 .cse10 .cse5 .cse11 .cse14 .cse6) (and .cse12 .cse1 .cse4 .cse8 .cse9 .cse11 .cse13 .cse6) (and .cse0 .cse12 .cse8 .cse9 .cse10 .cse5 .cse14 .cse6) (and .cse12 .cse1 .cse2 .cse4 .cse11 .cse13 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse13 .cse6 .cse7) (and .cse12 .cse2 .cse10 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse12 .cse1 .cse9 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse3 .cse9 .cse10 .cse5 .cse14 .cse6 .cse7) (and .cse12 .cse2 .cse4 .cse8 .cse10 .cse5 .cse11 .cse6) (and .cse12 .cse8 .cse9 .cse10 .cse5 .cse11 .cse14 .cse6) (and .cse0 .cse12 .cse1 .cse4 .cse8 .cse9 .cse13 .cse6) (and .cse0 .cse12 .cse2 .cse8 .cse10 .cse5 .cse14 .cse6) (and .cse12 .cse4 .cse8 .cse9 .cse10 .cse5 .cse11 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse8 .cse9 .cse5 .cse6) (and .cse3 .cse4 .cse9 .cse10 .cse11 .cse13 .cse6 .cse7) (and .cse2 .cse3 .cse4 .cse8 .cse10 .cse5 .cse11 .cse6) (and .cse12 .cse9 .cse10 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse10 .cse14 .cse13 .cse6 .cse7) (and .cse12 .cse1 .cse4 .cse8 .cse9 .cse5 .cse11 .cse6) (and .cse0 .cse12 .cse1 .cse4 .cse9 .cse5 .cse6 .cse7) (and .cse1 .cse3 .cse9 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse12 .cse2 .cse4 .cse8 .cse10 .cse13 .cse6) (and .cse2 .cse3 .cse4 .cse10 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse12 .cse9 .cse10 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse9 .cse14 .cse13 .cse6 .cse7) (and .cse1 .cse3 .cse8 .cse9 .cse11 .cse14 .cse13 .cse6) (and .cse12 .cse2 .cse8 .cse10 .cse5 .cse11 .cse14 .cse6) (and .cse2 .cse3 .cse8 .cse10 .cse11 .cse14 .cse13 .cse6) (and .cse1 .cse2 .cse3 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse2 .cse3 .cse10 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse3 .cse9 .cse10 .cse5 .cse11 .cse14 .cse6 .cse7))) [2020-07-18 00:22:23,684 INFO L271 CegarLoopResult]: At program point L125-1(lines 33 130) the Hoare annotation is: true [2020-07-18 00:22:23,684 INFO L264 CegarLoopResult]: At program point L117(line 117) the Hoare annotation is: (let ((.cse4 (= 1 main_~lk7~0)) (.cse2 (= 0 main_~p8~0)) (.cse0 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p7~0)) (.cse3 (= 1 main_~lk8~0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4) (and .cse0 .cse4 .cse2) (and .cse0 .cse1 .cse3))) [2020-07-18 00:22:23,686 INFO L264 CegarLoopResult]: At program point L84-1(lines 33 130) the Hoare annotation is: (let ((.cse4 (= 1 main_~lk8~0)) (.cse12 (= 0 main_~p1~0)) (.cse0 (= 1 main_~lk6~0)) (.cse7 (= 1 main_~lk4~0)) (.cse1 (= 0 main_~p3~0)) (.cse9 (= 0 main_~p2~0)) (.cse8 (= 0 main_~p7~0)) (.cse5 (= 0 main_~p5~0)) (.cse2 (= 1 main_~lk2~0)) (.cse3 (= main_~lk7~0 1)) (.cse13 (= 0 main_~p4~0)) (.cse15 (= 1 main_~lk3~0)) (.cse10 (= 0 main_~p6~0)) (.cse11 (= 0 main_~p8~0)) (.cse14 (= 1 main_~lk5~0)) (.cse6 (= 1 main_~lk1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse1 .cse9 .cse5 .cse10 .cse11 .cse12 .cse7) (and .cse0 .cse8 .cse1 .cse13 .cse9 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse3 .cse9 .cse5 .cse11 .cse12 .cse7) (and .cse3 .cse4 .cse13 .cse9 .cse15 .cse5 .cse10 .cse6) (and .cse8 .cse13 .cse9 .cse15 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse3 .cse9 .cse15 .cse11 .cse12 .cse14 .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse5 .cse12 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse15 .cse5 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse13 .cse15 .cse14 .cse6) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse12 .cse7) (and .cse8 .cse2 .cse4 .cse13 .cse15 .cse10 .cse14 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse4 .cse13 .cse14 .cse6) (and .cse0 .cse2 .cse3 .cse15 .cse11 .cse12 .cse14 .cse7) (and .cse0 .cse3 .cse4 .cse13 .cse9 .cse15 .cse14 .cse6) (and .cse0 .cse8 .cse2 .cse4 .cse15 .cse12 .cse14 .cse7) (and .cse8 .cse4 .cse9 .cse15 .cse10 .cse12 .cse14 .cse7) (and .cse8 .cse1 .cse13 .cse9 .cse5 .cse10 .cse11 .cse6) (and .cse0 .cse8 .cse2 .cse13 .cse15 .cse5 .cse11 .cse12) (and .cse8 .cse13 .cse9 .cse15 .cse5 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse14 .cse6 .cse7) (and .cse3 .cse13 .cse9 .cse15 .cse5 .cse10 .cse11 .cse12) (and .cse8 .cse1 .cse2 .cse4 .cse5 .cse10 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse15 .cse5 .cse11 .cse12 .cse7) (and .cse0 .cse8 .cse4 .cse9 .cse15 .cse14 .cse6 .cse7) (and .cse0 .cse8 .cse2 .cse15 .cse5 .cse11 .cse12 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse14 .cse6) (and .cse0 .cse8 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse1 .cse2 .cse5 .cse10 .cse11 .cse6 .cse7) (and .cse8 .cse1 .cse2 .cse4 .cse13 .cse10 .cse14 .cse6) (and .cse1 .cse3 .cse4 .cse9 .cse10 .cse14 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse4 .cse13 .cse9 .cse12 .cse14) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse5 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse13 .cse15 .cse11 .cse14 .cse6) (and .cse1 .cse2 .cse3 .cse4 .cse13 .cse10 .cse12 .cse14) (and .cse8 .cse2 .cse13 .cse15 .cse10 .cse11 .cse14 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse12 .cse14 .cse7) (and .cse3 .cse4 .cse13 .cse9 .cse15 .cse10 .cse14 .cse6) (and .cse2 .cse3 .cse4 .cse15 .cse10 .cse12 .cse14 .cse7) (and .cse0 .cse8 .cse1 .cse13 .cse9 .cse11 .cse14 .cse6) (and .cse1 .cse2 .cse3 .cse4 .cse13 .cse10 .cse14 .cse6) (and .cse3 .cse9 .cse15 .cse10 .cse11 .cse14 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse6 .cse7) (and .cse0 .cse8 .cse4 .cse13 .cse9 .cse15 .cse14 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse11 .cse14 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse13 .cse15 .cse5 .cse12) (and .cse8 .cse1 .cse2 .cse13 .cse5 .cse10 .cse11 .cse6) (and .cse8 .cse2 .cse4 .cse15 .cse10 .cse12 .cse14 .cse7) (and .cse0 .cse1 .cse3 .cse13 .cse9 .cse11 .cse14 .cse6) (and .cse0 .cse2 .cse3 .cse13 .cse15 .cse5 .cse11 .cse6) (and .cse0 .cse8 .cse1 .cse2 .cse4 .cse13 .cse12 .cse14) (and .cse0 .cse3 .cse13 .cse9 .cse15 .cse11 .cse12 .cse14) (and .cse0 .cse8 .cse9 .cse15 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse11 .cse12 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse4 .cse13 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse11 .cse12 .cse14) (and .cse0 .cse8 .cse2 .cse15 .cse11 .cse14 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse13 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse3 .cse4 .cse13 .cse9 .cse15 .cse12 .cse14) (and .cse0 .cse8 .cse1 .cse2 .cse11 .cse12 .cse14 .cse7) (and .cse0 .cse3 .cse13 .cse9 .cse15 .cse11 .cse14 .cse6) (and .cse1 .cse3 .cse4 .cse13 .cse9 .cse10 .cse14 .cse6) (and .cse0 .cse8 .cse2 .cse4 .cse13 .cse15 .cse5 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse13 .cse5 .cse10 .cse11 .cse6) (and .cse8 .cse1 .cse4 .cse9 .cse5 .cse10 .cse6 .cse7) (and .cse2 .cse3 .cse4 .cse13 .cse15 .cse10 .cse12 .cse14) (and .cse8 .cse2 .cse4 .cse15 .cse5 .cse10 .cse12 .cse7) (and .cse1 .cse3 .cse4 .cse13 .cse9 .cse10 .cse12 .cse14) (and .cse0 .cse8 .cse1 .cse4 .cse9 .cse5 .cse12 .cse7) (and .cse1 .cse3 .cse9 .cse10 .cse11 .cse14 .cse6 .cse7) (and .cse8 .cse2 .cse4 .cse15 .cse10 .cse14 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse13 .cse11 .cse14 .cse6) (and .cse8 .cse4 .cse9 .cse15 .cse5 .cse10 .cse12 .cse7) (and .cse8 .cse4 .cse9 .cse15 .cse10 .cse14 .cse6 .cse7) (and .cse0 .cse8 .cse2 .cse13 .cse15 .cse11 .cse14 .cse6) (and .cse8 .cse1 .cse2 .cse10 .cse11 .cse12 .cse14 .cse7) (and .cse2 .cse3 .cse15 .cse10 .cse11 .cse12 .cse14 .cse7) (and .cse1 .cse3 .cse4 .cse13 .cse9 .cse5 .cse10 .cse12) (and .cse3 .cse13 .cse9 .cse15 .cse10 .cse11 .cse14 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse6 .cse7) (and .cse8 .cse1 .cse2 .cse4 .cse5 .cse10 .cse12 .cse7) (and .cse1 .cse3 .cse13 .cse9 .cse5 .cse10 .cse11 .cse6) (and .cse1 .cse2 .cse3 .cse13 .cse5 .cse10 .cse11 .cse12) (and .cse2 .cse3 .cse15 .cse10 .cse11 .cse14 .cse6 .cse7) (and .cse2 .cse3 .cse13 .cse15 .cse10 .cse11 .cse12 .cse14) (and .cse8 .cse1 .cse4 .cse13 .cse9 .cse10 .cse14 .cse6) (and .cse0 .cse1 .cse3 .cse13 .cse9 .cse11 .cse12 .cse14) (and .cse0 .cse2 .cse3 .cse13 .cse15 .cse11 .cse12 .cse14) (and .cse0 .cse8 .cse13 .cse9 .cse15 .cse5 .cse11 .cse6) (and .cse8 .cse2 .cse15 .cse10 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse3 .cse9 .cse15 .cse5 .cse11 .cse6 .cse7) (and .cse8 .cse1 .cse9 .cse10 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse13 .cse5 .cse11 .cse12) (and .cse8 .cse1 .cse2 .cse5 .cse10 .cse11 .cse12 .cse7) (and .cse1 .cse3 .cse13 .cse9 .cse5 .cse10 .cse11 .cse12) (and .cse0 .cse8 .cse9 .cse15 .cse11 .cse12 .cse14 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse15 .cse5 .cse12 .cse7) (and .cse0 .cse8 .cse2 .cse13 .cse15 .cse5 .cse11 .cse6) (and .cse8 .cse1 .cse13 .cse9 .cse5 .cse10 .cse11 .cse12) (and .cse8 .cse4 .cse13 .cse9 .cse15 .cse5 .cse10 .cse6) (and .cse0 .cse8 .cse1 .cse9 .cse5 .cse11 .cse12 .cse7) (and .cse3 .cse4 .cse9 .cse15 .cse10 .cse14 .cse6 .cse7) (and .cse2 .cse3 .cse4 .cse13 .cse15 .cse5 .cse10 .cse6) (and .cse8 .cse2 .cse13 .cse15 .cse10 .cse11 .cse12 .cse14) (and .cse8 .cse1 .cse2 .cse4 .cse13 .cse5 .cse10 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse13 .cse11 .cse12 .cse14) (and .cse0 .cse8 .cse4 .cse9 .cse15 .cse12 .cse14 .cse7) (and .cse8 .cse2 .cse4 .cse13 .cse15 .cse5 .cse10 .cse12) (and .cse3 .cse13 .cse9 .cse15 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse8 .cse1 .cse4 .cse9 .cse12 .cse14 .cse7) (and .cse8 .cse2 .cse15 .cse10 .cse11 .cse12 .cse14 .cse7) (and .cse0 .cse2 .cse3 .cse13 .cse15 .cse5 .cse11 .cse12) (and .cse3 .cse4 .cse13 .cse9 .cse15 .cse5 .cse10 .cse12) (and .cse0 .cse8 .cse2 .cse4 .cse13 .cse15 .cse14 .cse6) (and .cse8 .cse1 .cse2 .cse13 .cse10 .cse11 .cse12 .cse14) (and .cse1 .cse2 .cse3 .cse10 .cse11 .cse14 .cse6 .cse7) (and .cse2 .cse3 .cse15 .cse5 .cse10 .cse11 .cse6 .cse7) (and .cse3 .cse9 .cse15 .cse5 .cse10 .cse11 .cse6 .cse7) (and .cse8 .cse9 .cse15 .cse5 .cse10 .cse11 .cse12 .cse7) (and .cse0 .cse8 .cse4 .cse13 .cse9 .cse15 .cse5 .cse12) (and .cse0 .cse3 .cse9 .cse15 .cse5 .cse11 .cse12 .cse7) (and .cse8 .cse4 .cse13 .cse9 .cse15 .cse5 .cse10 .cse12) (and .cse8 .cse1 .cse9 .cse10 .cse11 .cse12 .cse14 .cse7) (and .cse1 .cse3 .cse9 .cse10 .cse11 .cse12 .cse14 .cse7) (and .cse1 .cse3 .cse9 .cse5 .cse10 .cse11 .cse12 .cse7) (and .cse8 .cse2 .cse4 .cse15 .cse5 .cse10 .cse6 .cse7) (and .cse0 .cse8 .cse2 .cse4 .cse15 .cse5 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse15 .cse14 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse4 .cse12 .cse14 .cse7) (and .cse0 .cse1 .cse3 .cse9 .cse11 .cse12 .cse14 .cse7) (and .cse0 .cse8 .cse9 .cse15 .cse5 .cse11 .cse12 .cse7) (and .cse8 .cse4 .cse9 .cse15 .cse5 .cse10 .cse6 .cse7) (and .cse0 .cse8 .cse4 .cse9 .cse15 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse5 .cse11 .cse12 .cse7) (and .cse3 .cse4 .cse9 .cse15 .cse5 .cse10 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse15 .cse12 .cse14 .cse7) (and .cse8 .cse2 .cse4 .cse13 .cse15 .cse10 .cse12 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse10 .cse12 .cse14 .cse7) (and .cse2 .cse3 .cse13 .cse15 .cse5 .cse10 .cse11 .cse12) (and .cse0 .cse8 .cse2 .cse4 .cse15 .cse14 .cse6 .cse7) (and .cse0 .cse8 .cse4 .cse9 .cse15 .cse5 .cse12 .cse7) (and .cse0 .cse8 .cse2 .cse13 .cse15 .cse11 .cse12 .cse14) (and .cse0 .cse8 .cse1 .cse4 .cse13 .cse9 .cse5 .cse12) (and .cse0 .cse8 .cse4 .cse13 .cse9 .cse15 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse12 .cse14) (and .cse0 .cse1 .cse3 .cse4 .cse13 .cse9 .cse5 .cse12) (and .cse0 .cse3 .cse4 .cse13 .cse9 .cse15 .cse5 .cse6) (and .cse8 .cse1 .cse13 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse3 .cse13 .cse9 .cse15 .cse5 .cse11 .cse12) (and .cse8 .cse1 .cse2 .cse13 .cse10 .cse11 .cse14 .cse6) (and .cse8 .cse13 .cse9 .cse15 .cse10 .cse11 .cse14 .cse6) (and .cse0 .cse8 .cse1 .cse2 .cse13 .cse5 .cse11 .cse6) (and .cse0 .cse3 .cse4 .cse9 .cse15 .cse14 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse11 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse13 .cse5 .cse10 .cse12) (and .cse0 .cse3 .cse13 .cse9 .cse15 .cse5 .cse11 .cse6) (and .cse0 .cse8 .cse1 .cse13 .cse9 .cse5 .cse11 .cse6) (and .cse8 .cse2 .cse13 .cse15 .cse5 .cse10 .cse11 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse5 .cse11 .cse6) (and .cse0 .cse8 .cse1 .cse4 .cse9 .cse14 .cse6 .cse7) (and .cse8 .cse2 .cse15 .cse5 .cse10 .cse11 .cse6 .cse7) (and .cse0 .cse8 .cse13 .cse9 .cse15 .cse11 .cse14 .cse6) (and .cse0 .cse8 .cse2 .cse4 .cse13 .cse15 .cse12 .cse14) (and .cse0 .cse1 .cse3 .cse9 .cse5 .cse11 .cse6 .cse7) (and .cse3 .cse4 .cse9 .cse15 .cse5 .cse10 .cse12 .cse7) (and .cse3 .cse9 .cse15 .cse10 .cse11 .cse12 .cse14 .cse7) (and .cse8 .cse1 .cse2 .cse10 .cse11 .cse14 .cse6 .cse7) (and .cse1 .cse3 .cse4 .cse13 .cse9 .cse5 .cse10 .cse6) (and .cse0 .cse8 .cse13 .cse9 .cse15 .cse5 .cse11 .cse12) (and .cse1 .cse3 .cse4 .cse9 .cse5 .cse10 .cse6 .cse7) (and .cse3 .cse4 .cse9 .cse15 .cse10 .cse12 .cse14 .cse7) (and .cse1 .cse2 .cse3 .cse13 .cse10 .cse11 .cse14 .cse6) (and .cse3 .cse9 .cse15 .cse5 .cse10 .cse11 .cse12 .cse7) (and .cse8 .cse1 .cse4 .cse9 .cse5 .cse10 .cse12 .cse7) (and .cse0 .cse3 .cse4 .cse9 .cse15 .cse12 .cse14 .cse7) (and .cse2 .cse3 .cse4 .cse13 .cse15 .cse5 .cse10 .cse12) (and .cse0 .cse1 .cse3 .cse13 .cse9 .cse5 .cse11 .cse6) (and .cse0 .cse3 .cse9 .cse15 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse5 .cse12) (and .cse2 .cse3 .cse4 .cse15 .cse10 .cse14 .cse6 .cse7) (and .cse8 .cse1 .cse4 .cse9 .cse10 .cse14 .cse6 .cse7) (and .cse8 .cse1 .cse4 .cse9 .cse10 .cse12 .cse14 .cse7) (and .cse1 .cse3 .cse4 .cse9 .cse10 .cse12 .cse14 .cse7) (and .cse8 .cse1 .cse2 .cse13 .cse5 .cse10 .cse11 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse8 .cse2 .cse4 .cse13 .cse15 .cse5 .cse6) (and .cse8 .cse9 .cse15 .cse10 .cse11 .cse14 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse13 .cse5 .cse10 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse14 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse5 .cse10 .cse11 .cse6 .cse7) (and .cse2 .cse3 .cse4 .cse13 .cse15 .cse10 .cse14 .cse6) (and .cse0 .cse8 .cse1 .cse2 .cse4 .cse13 .cse5 .cse12) (and .cse2 .cse3 .cse4 .cse15 .cse5 .cse10 .cse12 .cse7) (and .cse0 .cse8 .cse2 .cse15 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse15 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse4 .cse13 .cse9 .cse5 .cse6) (and .cse0 .cse8 .cse1 .cse9 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse4 .cse14 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse12 .cse14 .cse7) (and .cse8 .cse4 .cse13 .cse9 .cse15 .cse10 .cse12 .cse14) (and .cse1 .cse3 .cse4 .cse9 .cse5 .cse10 .cse12 .cse7) (and .cse8 .cse2 .cse15 .cse5 .cse10 .cse11 .cse12 .cse7) (and .cse8 .cse1 .cse13 .cse9 .cse10 .cse11 .cse14 .cse6) (and .cse8 .cse4 .cse13 .cse9 .cse15 .cse10 .cse14 .cse6) (and .cse1 .cse3 .cse13 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse1 .cse2 .cse3 .cse10 .cse11 .cse12 .cse14 .cse7) (and .cse0 .cse8 .cse4 .cse13 .cse9 .cse15 .cse12 .cse14) (and .cse1 .cse2 .cse3 .cse5 .cse10 .cse11 .cse12 .cse7) (and .cse8 .cse1 .cse4 .cse13 .cse9 .cse10 .cse12 .cse14) (and .cse8 .cse1 .cse2 .cse4 .cse13 .cse5 .cse10 .cse6) (and .cse0 .cse8 .cse2 .cse4 .cse15 .cse5 .cse12 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse4 .cse5 .cse12 .cse7) (and .cse0 .cse3 .cse4 .cse9 .cse15 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse9 .cse5 .cse11 .cse6 .cse7) (and .cse3 .cse13 .cse9 .cse15 .cse5 .cse10 .cse11 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse13 .cse9 .cse14 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse13 .cse15 .cse5 .cse6) (and .cse8 .cse1 .cse9 .cse5 .cse10 .cse11 .cse6 .cse7) (and .cse2 .cse3 .cse13 .cse15 .cse5 .cse10 .cse11 .cse6) (and .cse0 .cse8 .cse1 .cse13 .cse9 .cse5 .cse11 .cse12) (and .cse8 .cse1 .cse2 .cse4 .cse10 .cse12 .cse14 .cse7) (and .cse3 .cse4 .cse13 .cse9 .cse15 .cse10 .cse12 .cse14) (and .cse8 .cse1 .cse2 .cse4 .cse10 .cse14 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse10 .cse14 .cse6 .cse7) (and .cse8 .cse2 .cse4 .cse13 .cse15 .cse5 .cse10 .cse6) (and .cse0 .cse3 .cse4 .cse9 .cse15 .cse5 .cse12 .cse7) (and .cse8 .cse13 .cse9 .cse15 .cse5 .cse10 .cse11 .cse6) (and .cse0 .cse8 .cse1 .cse4 .cse13 .cse9 .cse14 .cse6) (and .cse8 .cse9 .cse15 .cse10 .cse11 .cse12 .cse14 .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse13 .cse9 .cse12 .cse14) (and .cse8 .cse1 .cse4 .cse13 .cse9 .cse5 .cse10 .cse12) (and .cse0 .cse1 .cse3 .cse4 .cse13 .cse9 .cse5 .cse6) (and .cse8 .cse9 .cse15 .cse5 .cse10 .cse11 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse9 .cse11 .cse12 .cse14 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse14 .cse7) (and .cse2 .cse3 .cse15 .cse5 .cse10 .cse11 .cse12 .cse7) (and .cse8 .cse1 .cse2 .cse4 .cse13 .cse10 .cse12 .cse14) (and .cse0 .cse2 .cse3 .cse15 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse13 .cse9 .cse5 .cse11 .cse12) (and .cse0 .cse3 .cse4 .cse13 .cse9 .cse15 .cse5 .cse12) (and .cse8 .cse1 .cse4 .cse13 .cse9 .cse5 .cse10 .cse6) (and .cse0 .cse8 .cse1 .cse4 .cse9 .cse5 .cse6 .cse7) (and .cse1 .cse3 .cse9 .cse5 .cse10 .cse11 .cse6 .cse7) (and .cse0 .cse8 .cse2 .cse15 .cse11 .cse12 .cse14 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse5 .cse11 .cse12) (and .cse2 .cse3 .cse4 .cse15 .cse5 .cse10 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse13 .cse15 .cse12 .cse14) (and .cse0 .cse8 .cse13 .cse9 .cse15 .cse11 .cse12 .cse14) (and .cse0 .cse8 .cse9 .cse15 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse9 .cse11 .cse14 .cse6 .cse7) (and .cse1 .cse3 .cse13 .cse9 .cse10 .cse11 .cse14 .cse6) (and .cse8 .cse2 .cse13 .cse15 .cse5 .cse10 .cse11 .cse6) (and .cse2 .cse3 .cse13 .cse15 .cse10 .cse11 .cse14 .cse6))) [2020-07-18 00:22:23,687 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-07-18 00:22:23,687 INFO L271 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: true [2020-07-18 00:22:23,687 INFO L271 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: true [2020-07-18 00:22:23,688 INFO L264 CegarLoopResult]: At program point L76-1(lines 33 130) 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 .cse6 .cse10 .cse3 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse4 .cse7 .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 .cse1 .cse10 .cse3 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse6 .cse2 .cse8 .cse5) (and .cse6 .cse10 .cse3 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse9 .cse6 .cse7 .cse8) (and .cse0 .cse9 .cse6 .cse3 .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 .cse9 .cse6 .cse10 .cse4 .cse7) (and .cse11 .cse0 .cse9 .cse6 .cse4 .cse7) (and .cse11 .cse9 .cse6 .cse10 .cse7 .cse8) (and .cse11 .cse6 .cse10 .cse2 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse9 .cse2 .cse8) (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 .cse0 .cse9 .cse6 .cse2 .cse3 .cse8) (and .cse11 .cse0 .cse1 .cse2 .cse8 .cse5) (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:22:23,688 INFO L271 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: true [2020-07-18 00:22:23,688 INFO L264 CegarLoopResult]: At program point L134(line 134) the Hoare annotation is: false [2020-07-18 00:22:23,688 INFO L264 CegarLoopResult]: At program point L101(line 101) the Hoare annotation is: (let ((.cse9 (= 0 main_~p5~0)) (.cse6 (= 1 main_~lk6~0)) (.cse7 (= 0 main_~p7~0)) (.cse8 (= 0 main_~p4~0)) (.cse3 (= 0 main_~p8~0)) (.cse10 (= 1 main_~lk8~0)) (.cse0 (= 1 main_~lk7~0)) (.cse1 (= 1 main_~lk3~0)) (.cse2 (= 0 main_~p6~0)) (.cse4 (= 1 main_~lk5~0)) (.cse5 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse1 .cse3 .cse4) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse4) (and .cse6 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse7 .cse1 .cse9 .cse2 .cse3 .cse5) (and .cse6 .cse10 .cse0 .cse8 .cse1 .cse9) (and .cse6 .cse7 .cse10 .cse1 .cse4 .cse5) (and .cse6 .cse10 .cse0 .cse8 .cse1 .cse4) (and .cse0 .cse8 .cse1 .cse9 .cse2 .cse3) (and .cse6 .cse7 .cse8 .cse1 .cse9 .cse3) (and .cse6 .cse10 .cse0 .cse1 .cse4 .cse5) (and .cse6 .cse7 .cse10 .cse1 .cse9 .cse5) (and .cse6 .cse7 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5) (and .cse6 .cse7 .cse10 .cse8 .cse1 .cse9) (and .cse10 .cse0 .cse8 .cse1 .cse2 .cse4) (and .cse7 .cse10 .cse8 .cse1 .cse2 .cse4) (and .cse6 .cse10 .cse0 .cse1 .cse9 .cse5) (and .cse10 .cse0 .cse8 .cse1 .cse9 .cse2) (and .cse6 .cse7 .cse1 .cse9 .cse3 .cse5) (and .cse6 .cse0 .cse8 .cse1 .cse9 .cse3) (and .cse6 .cse0 .cse1 .cse9 .cse3 .cse5) (and .cse7 .cse10 .cse8 .cse1 .cse9 .cse2) (and .cse7 .cse10 .cse1 .cse9 .cse2 .cse5) (and .cse10 .cse0 .cse1 .cse9 .cse2 .cse5) (and .cse7 .cse8 .cse1 .cse9 .cse2 .cse3) (and .cse6 .cse7 .cse10 .cse8 .cse1 .cse4) (and .cse6 .cse0 .cse8 .cse1 .cse3 .cse4) (and .cse7 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse7 .cse10 .cse1 .cse2 .cse4 .cse5) (and .cse7 .cse8 .cse1 .cse2 .cse3 .cse4) (and .cse10 .cse0 .cse1 .cse2 .cse4 .cse5))) [2020-07-18 00:22:23,688 INFO L271 CegarLoopResult]: At program point L35(lines 35 37) the Hoare annotation is: true [2020-07-18 00:22:23,689 INFO L264 CegarLoopResult]: At program point L68-1(lines 33 130) 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 .cse5 .cse7 .cse1 .cse6) (and .cse4 .cse0 .cse6 .cse3) (and .cse7 .cse1 .cse2 .cse3) (and .cse4 .cse7 .cse6 .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:22:23,847 INFO L163 areAnnotationChecker]: CFG has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-18 00:22:23,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 12:22:23 BoogieIcfgContainer [2020-07-18 00:22:23,856 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-18 00:22:23,858 INFO L168 Benchmark]: Toolchain (without parser) took 316958.91 ms. Allocated memory was 137.4 MB in the beginning and 728.2 MB in the end (delta: 590.9 MB). Free memory was 102.9 MB in the beginning and 277.1 MB in the end (delta: -174.2 MB). Peak memory consumption was 416.6 MB. Max. memory is 7.1 GB. [2020-07-18 00:22:23,859 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 137.4 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-18 00:22:23,859 INFO L168 Benchmark]: CACSL2BoogieTranslator took 290.91 ms. Allocated memory is still 137.4 MB. Free memory was 102.4 MB in the beginning and 91.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. [2020-07-18 00:22:23,860 INFO L168 Benchmark]: Boogie Preprocessor took 125.60 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 91.7 MB in the beginning and 180.1 MB in the end (delta: -88.3 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2020-07-18 00:22:23,860 INFO L168 Benchmark]: RCFGBuilder took 637.79 ms. Allocated memory is still 201.9 MB. Free memory was 179.4 MB in the beginning and 144.1 MB in the end (delta: 35.3 MB). Peak memory consumption was 35.3 MB. Max. memory is 7.1 GB. [2020-07-18 00:22:23,861 INFO L168 Benchmark]: TraceAbstraction took 315897.88 ms. Allocated memory was 201.9 MB in the beginning and 728.2 MB in the end (delta: 526.4 MB). Free memory was 143.4 MB in the beginning and 277.1 MB in the end (delta: -133.6 MB). Peak memory consumption was 392.7 MB. Max. memory is 7.1 GB. [2020-07-18 00:22:23,863 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.17 ms. Allocated memory is still 137.4 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 290.91 ms. Allocated memory is still 137.4 MB. Free memory was 102.4 MB in the beginning and 91.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 125.60 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 91.7 MB in the beginning and 180.1 MB in the end (delta: -88.3 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 637.79 ms. Allocated memory is still 201.9 MB. Free memory was 179.4 MB in the beginning and 144.1 MB in the end (delta: 35.3 MB). Peak memory consumption was 35.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 315897.88 ms. Allocated memory was 201.9 MB in the beginning and 728.2 MB in the end (delta: 526.4 MB). Free memory was 143.4 MB in the beginning and 277.1 MB in the end (delta: -133.6 MB). Peak memory consumption was 392.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 133]: 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: 33]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: 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, 98 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 278.9s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 144.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 36.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2345 SDtfs, 845 SDslu, 1664 SDs, 0 SdLazy, 79 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 104 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5479occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 85.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 2257 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 98 LocationsWithAnnotation, 98 PreInvPairs, 10602 NumberOfFragments, 32360 HoareAnnotationTreeSize, 98 FomulaSimplifications, 323126 FormulaSimplificationTreeSizeReduction, 6.3s HoareSimplificationTime, 98 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 30.1s 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...