/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/locks/test_locks_7.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 01:00:23,853 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 01:00:23,855 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 01:00:23,873 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 01:00:23,873 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 01:00:23,875 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 01:00:23,877 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 01:00:23,887 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 01:00:23,891 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 01:00:23,894 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 01:00:23,897 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 01:00:23,899 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 01:00:23,900 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 01:00:23,902 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 01:00:23,904 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 01:00:23,905 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 01:00:23,906 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 01:00:23,907 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 01:00:23,909 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 01:00:23,913 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 01:00:23,919 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 01:00:23,923 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 01:00:23,924 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 01:00:23,925 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 01:00:23,927 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 01:00:23,927 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 01:00:23,927 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 01:00:23,928 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 01:00:23,929 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 01:00:23,929 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 01:00:23,930 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 01:00:23,930 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 01:00:23,931 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 01:00:23,932 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 01:00:23,933 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 01:00:23,933 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 01:00:23,933 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 01:00:23,934 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 01:00:23,934 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 01:00:23,935 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 01:00:23,935 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 01:00:23,936 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 01:00:23,945 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 01:00:23,945 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 01:00:23,946 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 01:00:23,946 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 01:00:23,947 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 01:00:23,947 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 01:00:23,947 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 01:00:23,947 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 01:00:23,947 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 01:00:23,948 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 01:00:23,948 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 01:00:23,948 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 01:00:23,948 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 01:00:23,948 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 01:00:23,949 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 01:00:23,949 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 01:00:23,949 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 01:00:23,949 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 01:00:23,949 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 01:00:23,950 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 01:00:23,950 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 01:00:23,950 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 01:00:23,950 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-11 01:00:24,254 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 01:00:24,276 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 01:00:24,280 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 01:00:24,281 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 01:00:24,282 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 01:00:24,283 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_7.c [2020-07-11 01:00:24,362 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba3dbfe76/e8d0cb9860fa46f6b160ac40cbc0a456/FLAGbeb9cc4da [2020-07-11 01:00:24,853 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 01:00:24,854 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7.c [2020-07-11 01:00:24,861 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba3dbfe76/e8d0cb9860fa46f6b160ac40cbc0a456/FLAGbeb9cc4da [2020-07-11 01:00:25,187 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba3dbfe76/e8d0cb9860fa46f6b160ac40cbc0a456 [2020-07-11 01:00:25,197 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 01:00:25,199 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 01:00:25,200 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 01:00:25,200 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 01:00:25,204 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 01:00:25,206 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 01:00:25" (1/1) ... [2020-07-11 01:00:25,210 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f3df79e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:00:25, skipping insertion in model container [2020-07-11 01:00:25,210 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 01:00:25" (1/1) ... [2020-07-11 01:00:25,220 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 01:00:25,244 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 01:00:25,425 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 01:00:25,431 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 01:00:25,455 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 01:00:25,470 INFO L208 MainTranslator]: Completed translation [2020-07-11 01:00:25,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:00:25 WrapperNode [2020-07-11 01:00:25,471 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 01:00:25,472 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 01:00:25,472 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 01:00:25,472 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 01:00:25,566 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:00:25" (1/1) ... [2020-07-11 01:00:25,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:00:25" (1/1) ... [2020-07-11 01:00:25,572 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:00:25" (1/1) ... [2020-07-11 01:00:25,573 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:00:25" (1/1) ... [2020-07-11 01:00:25,580 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:00:25" (1/1) ... [2020-07-11 01:00:25,590 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:00:25" (1/1) ... [2020-07-11 01:00:25,591 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:00:25" (1/1) ... [2020-07-11 01:00:25,593 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 01:00:25,594 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 01:00:25,594 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 01:00:25,594 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 01:00:25,595 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:00:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 01:00:25,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 01:00:25,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 01:00:25,662 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 01:00:25,663 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 01:00:25,663 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 01:00:25,663 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 01:00:25,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 01:00:25,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 01:00:26,206 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 01:00:26,206 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-11 01:00:26,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 01:00:26 BoogieIcfgContainer [2020-07-11 01:00:26,212 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 01:00:26,213 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 01:00:26,213 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 01:00:26,217 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 01:00:26,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 01:00:25" (1/3) ... [2020-07-11 01:00:26,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13376c32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 01:00:26, skipping insertion in model container [2020-07-11 01:00:26,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:00:25" (2/3) ... [2020-07-11 01:00:26,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13376c32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 01:00:26, skipping insertion in model container [2020-07-11 01:00:26,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 01:00:26" (3/3) ... [2020-07-11 01:00:26,222 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_7.c [2020-07-11 01:00:26,233 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 01:00:26,242 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 01:00:26,258 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 01:00:26,282 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 01:00:26,282 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 01:00:26,283 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 01:00:26,283 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 01:00:26,283 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 01:00:26,283 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 01:00:26,284 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 01:00:26,284 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 01:00:26,302 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2020-07-11 01:00:26,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-07-11 01:00:26,317 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:00:26,318 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:00:26,319 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:00:26,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:00:26,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1826051656, now seen corresponding path program 1 times [2020-07-11 01:00:26,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:00:26,336 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1626648982] [2020-07-11 01:00:26,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:00:26,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:26,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:26,609 INFO L280 TraceCheckUtils]: 0: Hoare triple {91#true} assume true; {91#true} is VALID [2020-07-11 01:00:26,610 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {91#true} {91#true} #199#return; {91#true} is VALID [2020-07-11 01:00:26,612 INFO L263 TraceCheckUtils]: 0: Hoare triple {91#true} call ULTIMATE.init(); {91#true} is VALID [2020-07-11 01:00:26,612 INFO L280 TraceCheckUtils]: 1: Hoare triple {91#true} assume true; {91#true} is VALID [2020-07-11 01:00:26,614 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {91#true} {91#true} #199#return; {91#true} is VALID [2020-07-11 01:00:26,615 INFO L263 TraceCheckUtils]: 3: Hoare triple {91#true} call #t~ret8 := main(); {91#true} is VALID [2020-07-11 01:00:26,615 INFO L280 TraceCheckUtils]: 4: Hoare triple {91#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {91#true} is VALID [2020-07-11 01:00:26,616 INFO L280 TraceCheckUtils]: 5: Hoare triple {91#true} ~p1~0 := #t~nondet0; {91#true} is VALID [2020-07-11 01:00:26,616 INFO L280 TraceCheckUtils]: 6: Hoare triple {91#true} havoc #t~nondet0; {91#true} is VALID [2020-07-11 01:00:26,617 INFO L280 TraceCheckUtils]: 7: Hoare triple {91#true} havoc ~lk1~0; {91#true} is VALID [2020-07-11 01:00:26,617 INFO L280 TraceCheckUtils]: 8: Hoare triple {91#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {91#true} is VALID [2020-07-11 01:00:26,618 INFO L280 TraceCheckUtils]: 9: Hoare triple {91#true} ~p2~0 := #t~nondet1; {91#true} is VALID [2020-07-11 01:00:26,618 INFO L280 TraceCheckUtils]: 10: Hoare triple {91#true} havoc #t~nondet1; {91#true} is VALID [2020-07-11 01:00:26,618 INFO L280 TraceCheckUtils]: 11: Hoare triple {91#true} havoc ~lk2~0; {91#true} is VALID [2020-07-11 01:00:26,619 INFO L280 TraceCheckUtils]: 12: Hoare triple {91#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {91#true} is VALID [2020-07-11 01:00:26,619 INFO L280 TraceCheckUtils]: 13: Hoare triple {91#true} ~p3~0 := #t~nondet2; {91#true} is VALID [2020-07-11 01:00:26,620 INFO L280 TraceCheckUtils]: 14: Hoare triple {91#true} havoc #t~nondet2; {91#true} is VALID [2020-07-11 01:00:26,620 INFO L280 TraceCheckUtils]: 15: Hoare triple {91#true} havoc ~lk3~0; {91#true} is VALID [2020-07-11 01:00:26,620 INFO L280 TraceCheckUtils]: 16: Hoare triple {91#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {91#true} is VALID [2020-07-11 01:00:26,621 INFO L280 TraceCheckUtils]: 17: Hoare triple {91#true} ~p4~0 := #t~nondet3; {91#true} is VALID [2020-07-11 01:00:26,621 INFO L280 TraceCheckUtils]: 18: Hoare triple {91#true} havoc #t~nondet3; {91#true} is VALID [2020-07-11 01:00:26,622 INFO L280 TraceCheckUtils]: 19: Hoare triple {91#true} havoc ~lk4~0; {91#true} is VALID [2020-07-11 01:00:26,622 INFO L280 TraceCheckUtils]: 20: Hoare triple {91#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {91#true} is VALID [2020-07-11 01:00:26,623 INFO L280 TraceCheckUtils]: 21: Hoare triple {91#true} ~p5~0 := #t~nondet4; {91#true} is VALID [2020-07-11 01:00:26,623 INFO L280 TraceCheckUtils]: 22: Hoare triple {91#true} havoc #t~nondet4; {91#true} is VALID [2020-07-11 01:00:26,626 INFO L280 TraceCheckUtils]: 23: Hoare triple {91#true} havoc ~lk5~0; {91#true} is VALID [2020-07-11 01:00:26,627 INFO L280 TraceCheckUtils]: 24: Hoare triple {91#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {91#true} is VALID [2020-07-11 01:00:26,627 INFO L280 TraceCheckUtils]: 25: Hoare triple {91#true} ~p6~0 := #t~nondet5; {91#true} is VALID [2020-07-11 01:00:26,628 INFO L280 TraceCheckUtils]: 26: Hoare triple {91#true} havoc #t~nondet5; {91#true} is VALID [2020-07-11 01:00:26,628 INFO L280 TraceCheckUtils]: 27: Hoare triple {91#true} havoc ~lk6~0; {91#true} is VALID [2020-07-11 01:00:26,629 INFO L280 TraceCheckUtils]: 28: Hoare triple {91#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {91#true} is VALID [2020-07-11 01:00:26,629 INFO L280 TraceCheckUtils]: 29: Hoare triple {91#true} ~p7~0 := #t~nondet6; {91#true} is VALID [2020-07-11 01:00:26,630 INFO L280 TraceCheckUtils]: 30: Hoare triple {91#true} havoc #t~nondet6; {91#true} is VALID [2020-07-11 01:00:26,630 INFO L280 TraceCheckUtils]: 31: Hoare triple {91#true} havoc ~lk7~0; {91#true} is VALID [2020-07-11 01:00:26,631 INFO L280 TraceCheckUtils]: 32: Hoare triple {91#true} havoc ~cond~0; {91#true} is VALID [2020-07-11 01:00:26,632 INFO L280 TraceCheckUtils]: 33: Hoare triple {91#true} assume !false; {91#true} is VALID [2020-07-11 01:00:26,633 INFO L280 TraceCheckUtils]: 34: Hoare triple {91#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {91#true} is VALID [2020-07-11 01:00:26,633 INFO L280 TraceCheckUtils]: 35: Hoare triple {91#true} ~cond~0 := #t~nondet7; {91#true} is VALID [2020-07-11 01:00:26,634 INFO L280 TraceCheckUtils]: 36: Hoare triple {91#true} havoc #t~nondet7; {91#true} is VALID [2020-07-11 01:00:26,635 INFO L280 TraceCheckUtils]: 37: Hoare triple {91#true} assume !(0 == ~cond~0); {91#true} is VALID [2020-07-11 01:00:26,636 INFO L280 TraceCheckUtils]: 38: Hoare triple {91#true} ~lk1~0 := 0; {91#true} is VALID [2020-07-11 01:00:26,636 INFO L280 TraceCheckUtils]: 39: Hoare triple {91#true} ~lk2~0 := 0; {91#true} is VALID [2020-07-11 01:00:26,637 INFO L280 TraceCheckUtils]: 40: Hoare triple {91#true} ~lk3~0 := 0; {91#true} is VALID [2020-07-11 01:00:26,638 INFO L280 TraceCheckUtils]: 41: Hoare triple {91#true} ~lk4~0 := 0; {91#true} is VALID [2020-07-11 01:00:26,638 INFO L280 TraceCheckUtils]: 42: Hoare triple {91#true} ~lk5~0 := 0; {91#true} is VALID [2020-07-11 01:00:26,638 INFO L280 TraceCheckUtils]: 43: Hoare triple {91#true} ~lk6~0 := 0; {91#true} is VALID [2020-07-11 01:00:26,639 INFO L280 TraceCheckUtils]: 44: Hoare triple {91#true} ~lk7~0 := 0; {91#true} is VALID [2020-07-11 01:00:26,641 INFO L280 TraceCheckUtils]: 45: Hoare triple {91#true} assume !(0 != ~p1~0); {95#(= 0 main_~p1~0)} is VALID [2020-07-11 01:00:26,642 INFO L280 TraceCheckUtils]: 46: Hoare triple {95#(= 0 main_~p1~0)} assume !(0 != ~p2~0); {95#(= 0 main_~p1~0)} is VALID [2020-07-11 01:00:26,643 INFO L280 TraceCheckUtils]: 47: Hoare triple {95#(= 0 main_~p1~0)} assume !(0 != ~p3~0); {95#(= 0 main_~p1~0)} is VALID [2020-07-11 01:00:26,644 INFO L280 TraceCheckUtils]: 48: Hoare triple {95#(= 0 main_~p1~0)} assume !(0 != ~p4~0); {95#(= 0 main_~p1~0)} is VALID [2020-07-11 01:00:26,649 INFO L280 TraceCheckUtils]: 49: Hoare triple {95#(= 0 main_~p1~0)} assume !(0 != ~p5~0); {95#(= 0 main_~p1~0)} is VALID [2020-07-11 01:00:26,651 INFO L280 TraceCheckUtils]: 50: Hoare triple {95#(= 0 main_~p1~0)} assume !(0 != ~p6~0); {95#(= 0 main_~p1~0)} is VALID [2020-07-11 01:00:26,652 INFO L280 TraceCheckUtils]: 51: Hoare triple {95#(= 0 main_~p1~0)} assume !(0 != ~p7~0); {95#(= 0 main_~p1~0)} is VALID [2020-07-11 01:00:26,653 INFO L280 TraceCheckUtils]: 52: Hoare triple {95#(= 0 main_~p1~0)} assume 0 != ~p1~0; {92#false} is VALID [2020-07-11 01:00:26,653 INFO L280 TraceCheckUtils]: 53: Hoare triple {92#false} assume 1 != ~lk1~0; {92#false} is VALID [2020-07-11 01:00:26,654 INFO L280 TraceCheckUtils]: 54: Hoare triple {92#false} assume !false; {92#false} is VALID [2020-07-11 01:00:26,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 01:00:26,671 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1626648982] [2020-07-11 01:00:26,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:00:26,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:00:26,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004587395] [2020-07-11 01:00:26,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2020-07-11 01:00:26,692 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:00:26,696 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:00:26,806 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:26,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:00:26,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:00:26,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:00:26,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:00:26,820 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 3 states. [2020-07-11 01:00:27,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:27,364 INFO L93 Difference]: Finished difference Result 191 states and 260 transitions. [2020-07-11 01:00:27,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:00:27,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2020-07-11 01:00:27,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:00:27,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:27,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 260 transitions. [2020-07-11 01:00:27,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:27,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 260 transitions. [2020-07-11 01:00:27,392 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 260 transitions. [2020-07-11 01:00:27,679 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 260 edges. 260 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:27,697 INFO L225 Difference]: With dead ends: 191 [2020-07-11 01:00:27,697 INFO L226 Difference]: Without dead ends: 128 [2020-07-11 01:00:27,701 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11 01:00:27,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-07-11 01:00:27,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2020-07-11 01:00:27,824 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:00:27,824 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand 126 states. [2020-07-11 01:00:27,825 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 126 states. [2020-07-11 01:00:27,825 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 126 states. [2020-07-11 01:00:27,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:27,836 INFO L93 Difference]: Finished difference Result 128 states and 165 transitions. [2020-07-11 01:00:27,837 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 165 transitions. [2020-07-11 01:00:27,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:27,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:27,839 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 128 states. [2020-07-11 01:00:27,839 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 128 states. [2020-07-11 01:00:27,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:27,851 INFO L93 Difference]: Finished difference Result 128 states and 165 transitions. [2020-07-11 01:00:27,853 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 165 transitions. [2020-07-11 01:00:27,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:27,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:27,858 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:00:27,858 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:00:27,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-07-11 01:00:27,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 164 transitions. [2020-07-11 01:00:27,880 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 164 transitions. Word has length 55 [2020-07-11 01:00:27,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:00:27,881 INFO L479 AbstractCegarLoop]: Abstraction has 126 states and 164 transitions. [2020-07-11 01:00:27,881 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:00:27,881 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 126 states and 164 transitions. [2020-07-11 01:00:28,106 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-11 01:00:28,106 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 164 transitions. [2020-07-11 01:00:28,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-07-11 01:00:28,108 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:00:28,109 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] [2020-07-11 01:00:28,109 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 01:00:28,109 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:00:28,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:00:28,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1965492109, now seen corresponding path program 1 times [2020-07-11 01:00:28,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:00:28,110 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1911374672] [2020-07-11 01:00:28,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:00:28,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:28,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:28,176 INFO L280 TraceCheckUtils]: 0: Hoare triple {988#true} assume true; {988#true} is VALID [2020-07-11 01:00:28,176 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {988#true} {988#true} #199#return; {988#true} is VALID [2020-07-11 01:00:28,177 INFO L263 TraceCheckUtils]: 0: Hoare triple {988#true} call ULTIMATE.init(); {988#true} is VALID [2020-07-11 01:00:28,177 INFO L280 TraceCheckUtils]: 1: Hoare triple {988#true} assume true; {988#true} is VALID [2020-07-11 01:00:28,177 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {988#true} {988#true} #199#return; {988#true} is VALID [2020-07-11 01:00:28,177 INFO L263 TraceCheckUtils]: 3: Hoare triple {988#true} call #t~ret8 := main(); {988#true} is VALID [2020-07-11 01:00:28,178 INFO L280 TraceCheckUtils]: 4: Hoare triple {988#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {988#true} is VALID [2020-07-11 01:00:28,178 INFO L280 TraceCheckUtils]: 5: Hoare triple {988#true} ~p1~0 := #t~nondet0; {988#true} is VALID [2020-07-11 01:00:28,178 INFO L280 TraceCheckUtils]: 6: Hoare triple {988#true} havoc #t~nondet0; {988#true} is VALID [2020-07-11 01:00:28,179 INFO L280 TraceCheckUtils]: 7: Hoare triple {988#true} havoc ~lk1~0; {988#true} is VALID [2020-07-11 01:00:28,179 INFO L280 TraceCheckUtils]: 8: Hoare triple {988#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {988#true} is VALID [2020-07-11 01:00:28,179 INFO L280 TraceCheckUtils]: 9: Hoare triple {988#true} ~p2~0 := #t~nondet1; {988#true} is VALID [2020-07-11 01:00:28,180 INFO L280 TraceCheckUtils]: 10: Hoare triple {988#true} havoc #t~nondet1; {988#true} is VALID [2020-07-11 01:00:28,180 INFO L280 TraceCheckUtils]: 11: Hoare triple {988#true} havoc ~lk2~0; {988#true} is VALID [2020-07-11 01:00:28,180 INFO L280 TraceCheckUtils]: 12: Hoare triple {988#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {988#true} is VALID [2020-07-11 01:00:28,180 INFO L280 TraceCheckUtils]: 13: Hoare triple {988#true} ~p3~0 := #t~nondet2; {988#true} is VALID [2020-07-11 01:00:28,181 INFO L280 TraceCheckUtils]: 14: Hoare triple {988#true} havoc #t~nondet2; {988#true} is VALID [2020-07-11 01:00:28,181 INFO L280 TraceCheckUtils]: 15: Hoare triple {988#true} havoc ~lk3~0; {988#true} is VALID [2020-07-11 01:00:28,181 INFO L280 TraceCheckUtils]: 16: Hoare triple {988#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {988#true} is VALID [2020-07-11 01:00:28,182 INFO L280 TraceCheckUtils]: 17: Hoare triple {988#true} ~p4~0 := #t~nondet3; {988#true} is VALID [2020-07-11 01:00:28,182 INFO L280 TraceCheckUtils]: 18: Hoare triple {988#true} havoc #t~nondet3; {988#true} is VALID [2020-07-11 01:00:28,182 INFO L280 TraceCheckUtils]: 19: Hoare triple {988#true} havoc ~lk4~0; {988#true} is VALID [2020-07-11 01:00:28,183 INFO L280 TraceCheckUtils]: 20: Hoare triple {988#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {988#true} is VALID [2020-07-11 01:00:28,183 INFO L280 TraceCheckUtils]: 21: Hoare triple {988#true} ~p5~0 := #t~nondet4; {988#true} is VALID [2020-07-11 01:00:28,183 INFO L280 TraceCheckUtils]: 22: Hoare triple {988#true} havoc #t~nondet4; {988#true} is VALID [2020-07-11 01:00:28,183 INFO L280 TraceCheckUtils]: 23: Hoare triple {988#true} havoc ~lk5~0; {988#true} is VALID [2020-07-11 01:00:28,184 INFO L280 TraceCheckUtils]: 24: Hoare triple {988#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {988#true} is VALID [2020-07-11 01:00:28,184 INFO L280 TraceCheckUtils]: 25: Hoare triple {988#true} ~p6~0 := #t~nondet5; {988#true} is VALID [2020-07-11 01:00:28,184 INFO L280 TraceCheckUtils]: 26: Hoare triple {988#true} havoc #t~nondet5; {988#true} is VALID [2020-07-11 01:00:28,185 INFO L280 TraceCheckUtils]: 27: Hoare triple {988#true} havoc ~lk6~0; {988#true} is VALID [2020-07-11 01:00:28,185 INFO L280 TraceCheckUtils]: 28: Hoare triple {988#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {988#true} is VALID [2020-07-11 01:00:28,185 INFO L280 TraceCheckUtils]: 29: Hoare triple {988#true} ~p7~0 := #t~nondet6; {988#true} is VALID [2020-07-11 01:00:28,185 INFO L280 TraceCheckUtils]: 30: Hoare triple {988#true} havoc #t~nondet6; {988#true} is VALID [2020-07-11 01:00:28,186 INFO L280 TraceCheckUtils]: 31: Hoare triple {988#true} havoc ~lk7~0; {988#true} is VALID [2020-07-11 01:00:28,186 INFO L280 TraceCheckUtils]: 32: Hoare triple {988#true} havoc ~cond~0; {988#true} is VALID [2020-07-11 01:00:28,186 INFO L280 TraceCheckUtils]: 33: Hoare triple {988#true} assume !false; {988#true} is VALID [2020-07-11 01:00:28,187 INFO L280 TraceCheckUtils]: 34: Hoare triple {988#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {988#true} is VALID [2020-07-11 01:00:28,187 INFO L280 TraceCheckUtils]: 35: Hoare triple {988#true} ~cond~0 := #t~nondet7; {988#true} is VALID [2020-07-11 01:00:28,187 INFO L280 TraceCheckUtils]: 36: Hoare triple {988#true} havoc #t~nondet7; {988#true} is VALID [2020-07-11 01:00:28,187 INFO L280 TraceCheckUtils]: 37: Hoare triple {988#true} assume !(0 == ~cond~0); {988#true} is VALID [2020-07-11 01:00:28,188 INFO L280 TraceCheckUtils]: 38: Hoare triple {988#true} ~lk1~0 := 0; {988#true} is VALID [2020-07-11 01:00:28,188 INFO L280 TraceCheckUtils]: 39: Hoare triple {988#true} ~lk2~0 := 0; {988#true} is VALID [2020-07-11 01:00:28,188 INFO L280 TraceCheckUtils]: 40: Hoare triple {988#true} ~lk3~0 := 0; {988#true} is VALID [2020-07-11 01:00:28,189 INFO L280 TraceCheckUtils]: 41: Hoare triple {988#true} ~lk4~0 := 0; {988#true} is VALID [2020-07-11 01:00:28,189 INFO L280 TraceCheckUtils]: 42: Hoare triple {988#true} ~lk5~0 := 0; {988#true} is VALID [2020-07-11 01:00:28,189 INFO L280 TraceCheckUtils]: 43: Hoare triple {988#true} ~lk6~0 := 0; {988#true} is VALID [2020-07-11 01:00:28,189 INFO L280 TraceCheckUtils]: 44: Hoare triple {988#true} ~lk7~0 := 0; {988#true} is VALID [2020-07-11 01:00:28,190 INFO L280 TraceCheckUtils]: 45: Hoare triple {988#true} assume 0 != ~p1~0; {988#true} is VALID [2020-07-11 01:00:28,191 INFO L280 TraceCheckUtils]: 46: Hoare triple {988#true} ~lk1~0 := 1; {992#(= 1 main_~lk1~0)} is VALID [2020-07-11 01:00:28,191 INFO L280 TraceCheckUtils]: 47: Hoare triple {992#(= 1 main_~lk1~0)} assume !(0 != ~p2~0); {992#(= 1 main_~lk1~0)} is VALID [2020-07-11 01:00:28,192 INFO L280 TraceCheckUtils]: 48: Hoare triple {992#(= 1 main_~lk1~0)} assume !(0 != ~p3~0); {992#(= 1 main_~lk1~0)} is VALID [2020-07-11 01:00:28,193 INFO L280 TraceCheckUtils]: 49: Hoare triple {992#(= 1 main_~lk1~0)} assume !(0 != ~p4~0); {992#(= 1 main_~lk1~0)} is VALID [2020-07-11 01:00:28,194 INFO L280 TraceCheckUtils]: 50: Hoare triple {992#(= 1 main_~lk1~0)} assume !(0 != ~p5~0); {992#(= 1 main_~lk1~0)} is VALID [2020-07-11 01:00:28,194 INFO L280 TraceCheckUtils]: 51: Hoare triple {992#(= 1 main_~lk1~0)} assume !(0 != ~p6~0); {992#(= 1 main_~lk1~0)} is VALID [2020-07-11 01:00:28,195 INFO L280 TraceCheckUtils]: 52: Hoare triple {992#(= 1 main_~lk1~0)} assume !(0 != ~p7~0); {992#(= 1 main_~lk1~0)} is VALID [2020-07-11 01:00:28,196 INFO L280 TraceCheckUtils]: 53: Hoare triple {992#(= 1 main_~lk1~0)} assume 0 != ~p1~0; {992#(= 1 main_~lk1~0)} is VALID [2020-07-11 01:00:28,196 INFO L280 TraceCheckUtils]: 54: Hoare triple {992#(= 1 main_~lk1~0)} assume 1 != ~lk1~0; {989#false} is VALID [2020-07-11 01:00:28,196 INFO L280 TraceCheckUtils]: 55: Hoare triple {989#false} assume !false; {989#false} is VALID [2020-07-11 01:00:28,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 01:00:28,201 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1911374672] [2020-07-11 01:00:28,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:00:28,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:00:28,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058107022] [2020-07-11 01:00:28,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2020-07-11 01:00:28,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:00:28,204 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:00:28,254 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:28,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:00:28,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:00:28,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:00:28,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:00:28,256 INFO L87 Difference]: Start difference. First operand 126 states and 164 transitions. Second operand 3 states. [2020-07-11 01:00:28,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:28,581 INFO L93 Difference]: Finished difference Result 154 states and 202 transitions. [2020-07-11 01:00:28,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:00:28,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2020-07-11 01:00:28,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:00:28,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:28,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2020-07-11 01:00:28,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:28,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2020-07-11 01:00:28,589 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 159 transitions. [2020-07-11 01:00:28,739 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:28,748 INFO L225 Difference]: With dead ends: 154 [2020-07-11 01:00:28,748 INFO L226 Difference]: Without dead ends: 152 [2020-07-11 01:00:28,751 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11 01:00:28,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-07-11 01:00:28,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 126. [2020-07-11 01:00:28,857 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:00:28,857 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand 126 states. [2020-07-11 01:00:28,857 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 126 states. [2020-07-11 01:00:28,858 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 126 states. [2020-07-11 01:00:28,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:28,870 INFO L93 Difference]: Finished difference Result 152 states and 200 transitions. [2020-07-11 01:00:28,870 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 200 transitions. [2020-07-11 01:00:28,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:28,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:28,872 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 152 states. [2020-07-11 01:00:28,872 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 152 states. [2020-07-11 01:00:28,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:28,884 INFO L93 Difference]: Finished difference Result 152 states and 200 transitions. [2020-07-11 01:00:28,884 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 200 transitions. [2020-07-11 01:00:28,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:28,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:28,886 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:00:28,886 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:00:28,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-07-11 01:00:28,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 163 transitions. [2020-07-11 01:00:28,895 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 163 transitions. Word has length 56 [2020-07-11 01:00:28,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:00:28,896 INFO L479 AbstractCegarLoop]: Abstraction has 126 states and 163 transitions. [2020-07-11 01:00:28,896 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:00:28,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 126 states and 163 transitions. [2020-07-11 01:00:29,093 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:29,093 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 163 transitions. [2020-07-11 01:00:29,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-07-11 01:00:29,095 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:00:29,095 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] [2020-07-11 01:00:29,095 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 01:00:29,096 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:00:29,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:00:29,096 INFO L82 PathProgramCache]: Analyzing trace with hash 773271458, now seen corresponding path program 1 times [2020-07-11 01:00:29,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:00:29,097 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1267969669] [2020-07-11 01:00:29,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:00:29,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:29,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:29,147 INFO L280 TraceCheckUtils]: 0: Hoare triple {1859#true} assume true; {1859#true} is VALID [2020-07-11 01:00:29,148 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1859#true} {1859#true} #199#return; {1859#true} is VALID [2020-07-11 01:00:29,148 INFO L263 TraceCheckUtils]: 0: Hoare triple {1859#true} call ULTIMATE.init(); {1859#true} is VALID [2020-07-11 01:00:29,148 INFO L280 TraceCheckUtils]: 1: Hoare triple {1859#true} assume true; {1859#true} is VALID [2020-07-11 01:00:29,148 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1859#true} {1859#true} #199#return; {1859#true} is VALID [2020-07-11 01:00:29,148 INFO L263 TraceCheckUtils]: 3: Hoare triple {1859#true} call #t~ret8 := main(); {1859#true} is VALID [2020-07-11 01:00:29,149 INFO L280 TraceCheckUtils]: 4: Hoare triple {1859#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1859#true} is VALID [2020-07-11 01:00:29,149 INFO L280 TraceCheckUtils]: 5: Hoare triple {1859#true} ~p1~0 := #t~nondet0; {1859#true} is VALID [2020-07-11 01:00:29,149 INFO L280 TraceCheckUtils]: 6: Hoare triple {1859#true} havoc #t~nondet0; {1859#true} is VALID [2020-07-11 01:00:29,149 INFO L280 TraceCheckUtils]: 7: Hoare triple {1859#true} havoc ~lk1~0; {1859#true} is VALID [2020-07-11 01:00:29,150 INFO L280 TraceCheckUtils]: 8: Hoare triple {1859#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1859#true} is VALID [2020-07-11 01:00:29,150 INFO L280 TraceCheckUtils]: 9: Hoare triple {1859#true} ~p2~0 := #t~nondet1; {1859#true} is VALID [2020-07-11 01:00:29,150 INFO L280 TraceCheckUtils]: 10: Hoare triple {1859#true} havoc #t~nondet1; {1859#true} is VALID [2020-07-11 01:00:29,151 INFO L280 TraceCheckUtils]: 11: Hoare triple {1859#true} havoc ~lk2~0; {1859#true} is VALID [2020-07-11 01:00:29,151 INFO L280 TraceCheckUtils]: 12: Hoare triple {1859#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1859#true} is VALID [2020-07-11 01:00:29,151 INFO L280 TraceCheckUtils]: 13: Hoare triple {1859#true} ~p3~0 := #t~nondet2; {1859#true} is VALID [2020-07-11 01:00:29,151 INFO L280 TraceCheckUtils]: 14: Hoare triple {1859#true} havoc #t~nondet2; {1859#true} is VALID [2020-07-11 01:00:29,152 INFO L280 TraceCheckUtils]: 15: Hoare triple {1859#true} havoc ~lk3~0; {1859#true} is VALID [2020-07-11 01:00:29,152 INFO L280 TraceCheckUtils]: 16: Hoare triple {1859#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1859#true} is VALID [2020-07-11 01:00:29,152 INFO L280 TraceCheckUtils]: 17: Hoare triple {1859#true} ~p4~0 := #t~nondet3; {1859#true} is VALID [2020-07-11 01:00:29,152 INFO L280 TraceCheckUtils]: 18: Hoare triple {1859#true} havoc #t~nondet3; {1859#true} is VALID [2020-07-11 01:00:29,153 INFO L280 TraceCheckUtils]: 19: Hoare triple {1859#true} havoc ~lk4~0; {1859#true} is VALID [2020-07-11 01:00:29,153 INFO L280 TraceCheckUtils]: 20: Hoare triple {1859#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1859#true} is VALID [2020-07-11 01:00:29,153 INFO L280 TraceCheckUtils]: 21: Hoare triple {1859#true} ~p5~0 := #t~nondet4; {1859#true} is VALID [2020-07-11 01:00:29,153 INFO L280 TraceCheckUtils]: 22: Hoare triple {1859#true} havoc #t~nondet4; {1859#true} is VALID [2020-07-11 01:00:29,154 INFO L280 TraceCheckUtils]: 23: Hoare triple {1859#true} havoc ~lk5~0; {1859#true} is VALID [2020-07-11 01:00:29,154 INFO L280 TraceCheckUtils]: 24: Hoare triple {1859#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1859#true} is VALID [2020-07-11 01:00:29,154 INFO L280 TraceCheckUtils]: 25: Hoare triple {1859#true} ~p6~0 := #t~nondet5; {1859#true} is VALID [2020-07-11 01:00:29,154 INFO L280 TraceCheckUtils]: 26: Hoare triple {1859#true} havoc #t~nondet5; {1859#true} is VALID [2020-07-11 01:00:29,155 INFO L280 TraceCheckUtils]: 27: Hoare triple {1859#true} havoc ~lk6~0; {1859#true} is VALID [2020-07-11 01:00:29,155 INFO L280 TraceCheckUtils]: 28: Hoare triple {1859#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {1859#true} is VALID [2020-07-11 01:00:29,155 INFO L280 TraceCheckUtils]: 29: Hoare triple {1859#true} ~p7~0 := #t~nondet6; {1859#true} is VALID [2020-07-11 01:00:29,155 INFO L280 TraceCheckUtils]: 30: Hoare triple {1859#true} havoc #t~nondet6; {1859#true} is VALID [2020-07-11 01:00:29,155 INFO L280 TraceCheckUtils]: 31: Hoare triple {1859#true} havoc ~lk7~0; {1859#true} is VALID [2020-07-11 01:00:29,156 INFO L280 TraceCheckUtils]: 32: Hoare triple {1859#true} havoc ~cond~0; {1859#true} is VALID [2020-07-11 01:00:29,156 INFO L280 TraceCheckUtils]: 33: Hoare triple {1859#true} assume !false; {1859#true} is VALID [2020-07-11 01:00:29,156 INFO L280 TraceCheckUtils]: 34: Hoare triple {1859#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {1859#true} is VALID [2020-07-11 01:00:29,156 INFO L280 TraceCheckUtils]: 35: Hoare triple {1859#true} ~cond~0 := #t~nondet7; {1859#true} is VALID [2020-07-11 01:00:29,157 INFO L280 TraceCheckUtils]: 36: Hoare triple {1859#true} havoc #t~nondet7; {1859#true} is VALID [2020-07-11 01:00:29,157 INFO L280 TraceCheckUtils]: 37: Hoare triple {1859#true} assume !(0 == ~cond~0); {1859#true} is VALID [2020-07-11 01:00:29,157 INFO L280 TraceCheckUtils]: 38: Hoare triple {1859#true} ~lk1~0 := 0; {1859#true} is VALID [2020-07-11 01:00:29,157 INFO L280 TraceCheckUtils]: 39: Hoare triple {1859#true} ~lk2~0 := 0; {1859#true} is VALID [2020-07-11 01:00:29,158 INFO L280 TraceCheckUtils]: 40: Hoare triple {1859#true} ~lk3~0 := 0; {1859#true} is VALID [2020-07-11 01:00:29,158 INFO L280 TraceCheckUtils]: 41: Hoare triple {1859#true} ~lk4~0 := 0; {1859#true} is VALID [2020-07-11 01:00:29,158 INFO L280 TraceCheckUtils]: 42: Hoare triple {1859#true} ~lk5~0 := 0; {1859#true} is VALID [2020-07-11 01:00:29,158 INFO L280 TraceCheckUtils]: 43: Hoare triple {1859#true} ~lk6~0 := 0; {1859#true} is VALID [2020-07-11 01:00:29,159 INFO L280 TraceCheckUtils]: 44: Hoare triple {1859#true} ~lk7~0 := 0; {1859#true} is VALID [2020-07-11 01:00:29,159 INFO L280 TraceCheckUtils]: 45: Hoare triple {1859#true} assume !(0 != ~p1~0); {1859#true} is VALID [2020-07-11 01:00:29,160 INFO L280 TraceCheckUtils]: 46: Hoare triple {1859#true} assume !(0 != ~p2~0); {1863#(= 0 main_~p2~0)} is VALID [2020-07-11 01:00:29,161 INFO L280 TraceCheckUtils]: 47: Hoare triple {1863#(= 0 main_~p2~0)} assume !(0 != ~p3~0); {1863#(= 0 main_~p2~0)} is VALID [2020-07-11 01:00:29,162 INFO L280 TraceCheckUtils]: 48: Hoare triple {1863#(= 0 main_~p2~0)} assume !(0 != ~p4~0); {1863#(= 0 main_~p2~0)} is VALID [2020-07-11 01:00:29,162 INFO L280 TraceCheckUtils]: 49: Hoare triple {1863#(= 0 main_~p2~0)} assume !(0 != ~p5~0); {1863#(= 0 main_~p2~0)} is VALID [2020-07-11 01:00:29,163 INFO L280 TraceCheckUtils]: 50: Hoare triple {1863#(= 0 main_~p2~0)} assume !(0 != ~p6~0); {1863#(= 0 main_~p2~0)} is VALID [2020-07-11 01:00:29,163 INFO L280 TraceCheckUtils]: 51: Hoare triple {1863#(= 0 main_~p2~0)} assume !(0 != ~p7~0); {1863#(= 0 main_~p2~0)} is VALID [2020-07-11 01:00:29,164 INFO L280 TraceCheckUtils]: 52: Hoare triple {1863#(= 0 main_~p2~0)} assume !(0 != ~p1~0); {1863#(= 0 main_~p2~0)} is VALID [2020-07-11 01:00:29,165 INFO L280 TraceCheckUtils]: 53: Hoare triple {1863#(= 0 main_~p2~0)} assume 0 != ~p2~0; {1860#false} is VALID [2020-07-11 01:00:29,165 INFO L280 TraceCheckUtils]: 54: Hoare triple {1860#false} assume 1 != ~lk2~0; {1860#false} is VALID [2020-07-11 01:00:29,166 INFO L280 TraceCheckUtils]: 55: Hoare triple {1860#false} assume !false; {1860#false} is VALID [2020-07-11 01:00:29,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 01:00:29,170 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1267969669] [2020-07-11 01:00:29,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:00:29,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:00:29,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290577825] [2020-07-11 01:00:29,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2020-07-11 01:00:29,172 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:00:29,172 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:00:29,219 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:29,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:00:29,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:00:29,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:00:29,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:00:29,220 INFO L87 Difference]: Start difference. First operand 126 states and 163 transitions. Second operand 3 states. [2020-07-11 01:00:29,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:29,658 INFO L93 Difference]: Finished difference Result 306 states and 415 transitions. [2020-07-11 01:00:29,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:00:29,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2020-07-11 01:00:29,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:00:29,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:29,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 233 transitions. [2020-07-11 01:00:29,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:29,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 233 transitions. [2020-07-11 01:00:29,667 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 233 transitions. [2020-07-11 01:00:29,903 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 233 edges. 233 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:29,909 INFO L225 Difference]: With dead ends: 306 [2020-07-11 01:00:29,909 INFO L226 Difference]: Without dead ends: 213 [2020-07-11 01:00:29,910 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11 01:00:29,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2020-07-11 01:00:30,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2020-07-11 01:00:30,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:00:30,134 INFO L82 GeneralOperation]: Start isEquivalent. First operand 213 states. Second operand 211 states. [2020-07-11 01:00:30,134 INFO L74 IsIncluded]: Start isIncluded. First operand 213 states. Second operand 211 states. [2020-07-11 01:00:30,134 INFO L87 Difference]: Start difference. First operand 213 states. Second operand 211 states. [2020-07-11 01:00:30,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:30,143 INFO L93 Difference]: Finished difference Result 213 states and 281 transitions. [2020-07-11 01:00:30,143 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 281 transitions. [2020-07-11 01:00:30,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:30,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:30,144 INFO L74 IsIncluded]: Start isIncluded. First operand 211 states. Second operand 213 states. [2020-07-11 01:00:30,144 INFO L87 Difference]: Start difference. First operand 211 states. Second operand 213 states. [2020-07-11 01:00:30,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:30,152 INFO L93 Difference]: Finished difference Result 213 states and 281 transitions. [2020-07-11 01:00:30,153 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 281 transitions. [2020-07-11 01:00:30,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:30,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:30,154 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:00:30,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:00:30,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-07-11 01:00:30,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 280 transitions. [2020-07-11 01:00:30,162 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 280 transitions. Word has length 56 [2020-07-11 01:00:30,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:00:30,162 INFO L479 AbstractCegarLoop]: Abstraction has 211 states and 280 transitions. [2020-07-11 01:00:30,162 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:00:30,162 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 211 states and 280 transitions. [2020-07-11 01:00:30,460 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 280 edges. 280 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:30,460 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 280 transitions. [2020-07-11 01:00:30,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-07-11 01:00:30,461 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:00:30,461 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] [2020-07-11 01:00:30,462 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 01:00:30,462 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:00:30,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:00:30,462 INFO L82 PathProgramCache]: Analyzing trace with hash -610540190, now seen corresponding path program 1 times [2020-07-11 01:00:30,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:00:30,463 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [927405769] [2020-07-11 01:00:30,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:00:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:30,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:30,557 INFO L280 TraceCheckUtils]: 0: Hoare triple {3326#true} assume true; {3326#true} is VALID [2020-07-11 01:00:30,558 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3326#true} {3326#true} #199#return; {3326#true} is VALID [2020-07-11 01:00:30,558 INFO L263 TraceCheckUtils]: 0: Hoare triple {3326#true} call ULTIMATE.init(); {3326#true} is VALID [2020-07-11 01:00:30,558 INFO L280 TraceCheckUtils]: 1: Hoare triple {3326#true} assume true; {3326#true} is VALID [2020-07-11 01:00:30,559 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3326#true} {3326#true} #199#return; {3326#true} is VALID [2020-07-11 01:00:30,559 INFO L263 TraceCheckUtils]: 3: Hoare triple {3326#true} call #t~ret8 := main(); {3326#true} is VALID [2020-07-11 01:00:30,559 INFO L280 TraceCheckUtils]: 4: Hoare triple {3326#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {3326#true} is VALID [2020-07-11 01:00:30,559 INFO L280 TraceCheckUtils]: 5: Hoare triple {3326#true} ~p1~0 := #t~nondet0; {3326#true} is VALID [2020-07-11 01:00:30,560 INFO L280 TraceCheckUtils]: 6: Hoare triple {3326#true} havoc #t~nondet0; {3326#true} is VALID [2020-07-11 01:00:30,560 INFO L280 TraceCheckUtils]: 7: Hoare triple {3326#true} havoc ~lk1~0; {3326#true} is VALID [2020-07-11 01:00:30,560 INFO L280 TraceCheckUtils]: 8: Hoare triple {3326#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3326#true} is VALID [2020-07-11 01:00:30,561 INFO L280 TraceCheckUtils]: 9: Hoare triple {3326#true} ~p2~0 := #t~nondet1; {3326#true} is VALID [2020-07-11 01:00:30,561 INFO L280 TraceCheckUtils]: 10: Hoare triple {3326#true} havoc #t~nondet1; {3326#true} is VALID [2020-07-11 01:00:30,562 INFO L280 TraceCheckUtils]: 11: Hoare triple {3326#true} havoc ~lk2~0; {3326#true} is VALID [2020-07-11 01:00:30,563 INFO L280 TraceCheckUtils]: 12: Hoare triple {3326#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3326#true} is VALID [2020-07-11 01:00:30,563 INFO L280 TraceCheckUtils]: 13: Hoare triple {3326#true} ~p3~0 := #t~nondet2; {3326#true} is VALID [2020-07-11 01:00:30,564 INFO L280 TraceCheckUtils]: 14: Hoare triple {3326#true} havoc #t~nondet2; {3326#true} is VALID [2020-07-11 01:00:30,564 INFO L280 TraceCheckUtils]: 15: Hoare triple {3326#true} havoc ~lk3~0; {3326#true} is VALID [2020-07-11 01:00:30,567 INFO L280 TraceCheckUtils]: 16: Hoare triple {3326#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {3326#true} is VALID [2020-07-11 01:00:30,568 INFO L280 TraceCheckUtils]: 17: Hoare triple {3326#true} ~p4~0 := #t~nondet3; {3326#true} is VALID [2020-07-11 01:00:30,568 INFO L280 TraceCheckUtils]: 18: Hoare triple {3326#true} havoc #t~nondet3; {3326#true} is VALID [2020-07-11 01:00:30,568 INFO L280 TraceCheckUtils]: 19: Hoare triple {3326#true} havoc ~lk4~0; {3326#true} is VALID [2020-07-11 01:00:30,569 INFO L280 TraceCheckUtils]: 20: Hoare triple {3326#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {3326#true} is VALID [2020-07-11 01:00:30,569 INFO L280 TraceCheckUtils]: 21: Hoare triple {3326#true} ~p5~0 := #t~nondet4; {3326#true} is VALID [2020-07-11 01:00:30,569 INFO L280 TraceCheckUtils]: 22: Hoare triple {3326#true} havoc #t~nondet4; {3326#true} is VALID [2020-07-11 01:00:30,570 INFO L280 TraceCheckUtils]: 23: Hoare triple {3326#true} havoc ~lk5~0; {3326#true} is VALID [2020-07-11 01:00:30,570 INFO L280 TraceCheckUtils]: 24: Hoare triple {3326#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {3326#true} is VALID [2020-07-11 01:00:30,570 INFO L280 TraceCheckUtils]: 25: Hoare triple {3326#true} ~p6~0 := #t~nondet5; {3326#true} is VALID [2020-07-11 01:00:30,570 INFO L280 TraceCheckUtils]: 26: Hoare triple {3326#true} havoc #t~nondet5; {3326#true} is VALID [2020-07-11 01:00:30,571 INFO L280 TraceCheckUtils]: 27: Hoare triple {3326#true} havoc ~lk6~0; {3326#true} is VALID [2020-07-11 01:00:30,571 INFO L280 TraceCheckUtils]: 28: Hoare triple {3326#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {3326#true} is VALID [2020-07-11 01:00:30,571 INFO L280 TraceCheckUtils]: 29: Hoare triple {3326#true} ~p7~0 := #t~nondet6; {3326#true} is VALID [2020-07-11 01:00:30,572 INFO L280 TraceCheckUtils]: 30: Hoare triple {3326#true} havoc #t~nondet6; {3326#true} is VALID [2020-07-11 01:00:30,572 INFO L280 TraceCheckUtils]: 31: Hoare triple {3326#true} havoc ~lk7~0; {3326#true} is VALID [2020-07-11 01:00:30,572 INFO L280 TraceCheckUtils]: 32: Hoare triple {3326#true} havoc ~cond~0; {3326#true} is VALID [2020-07-11 01:00:30,573 INFO L280 TraceCheckUtils]: 33: Hoare triple {3326#true} assume !false; {3326#true} is VALID [2020-07-11 01:00:30,573 INFO L280 TraceCheckUtils]: 34: Hoare triple {3326#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {3326#true} is VALID [2020-07-11 01:00:30,573 INFO L280 TraceCheckUtils]: 35: Hoare triple {3326#true} ~cond~0 := #t~nondet7; {3326#true} is VALID [2020-07-11 01:00:30,573 INFO L280 TraceCheckUtils]: 36: Hoare triple {3326#true} havoc #t~nondet7; {3326#true} is VALID [2020-07-11 01:00:30,574 INFO L280 TraceCheckUtils]: 37: Hoare triple {3326#true} assume !(0 == ~cond~0); {3326#true} is VALID [2020-07-11 01:00:30,574 INFO L280 TraceCheckUtils]: 38: Hoare triple {3326#true} ~lk1~0 := 0; {3326#true} is VALID [2020-07-11 01:00:30,574 INFO L280 TraceCheckUtils]: 39: Hoare triple {3326#true} ~lk2~0 := 0; {3326#true} is VALID [2020-07-11 01:00:30,575 INFO L280 TraceCheckUtils]: 40: Hoare triple {3326#true} ~lk3~0 := 0; {3326#true} is VALID [2020-07-11 01:00:30,575 INFO L280 TraceCheckUtils]: 41: Hoare triple {3326#true} ~lk4~0 := 0; {3326#true} is VALID [2020-07-11 01:00:30,575 INFO L280 TraceCheckUtils]: 42: Hoare triple {3326#true} ~lk5~0 := 0; {3326#true} is VALID [2020-07-11 01:00:30,575 INFO L280 TraceCheckUtils]: 43: Hoare triple {3326#true} ~lk6~0 := 0; {3326#true} is VALID [2020-07-11 01:00:30,576 INFO L280 TraceCheckUtils]: 44: Hoare triple {3326#true} ~lk7~0 := 0; {3326#true} is VALID [2020-07-11 01:00:30,576 INFO L280 TraceCheckUtils]: 45: Hoare triple {3326#true} assume !(0 != ~p1~0); {3326#true} is VALID [2020-07-11 01:00:30,576 INFO L280 TraceCheckUtils]: 46: Hoare triple {3326#true} assume 0 != ~p2~0; {3326#true} is VALID [2020-07-11 01:00:30,577 INFO L280 TraceCheckUtils]: 47: Hoare triple {3326#true} ~lk2~0 := 1; {3330#(= 1 main_~lk2~0)} is VALID [2020-07-11 01:00:30,578 INFO L280 TraceCheckUtils]: 48: Hoare triple {3330#(= 1 main_~lk2~0)} assume !(0 != ~p3~0); {3330#(= 1 main_~lk2~0)} is VALID [2020-07-11 01:00:30,579 INFO L280 TraceCheckUtils]: 49: Hoare triple {3330#(= 1 main_~lk2~0)} assume !(0 != ~p4~0); {3330#(= 1 main_~lk2~0)} is VALID [2020-07-11 01:00:30,579 INFO L280 TraceCheckUtils]: 50: Hoare triple {3330#(= 1 main_~lk2~0)} assume !(0 != ~p5~0); {3330#(= 1 main_~lk2~0)} is VALID [2020-07-11 01:00:30,580 INFO L280 TraceCheckUtils]: 51: Hoare triple {3330#(= 1 main_~lk2~0)} assume !(0 != ~p6~0); {3330#(= 1 main_~lk2~0)} is VALID [2020-07-11 01:00:30,581 INFO L280 TraceCheckUtils]: 52: Hoare triple {3330#(= 1 main_~lk2~0)} assume !(0 != ~p7~0); {3330#(= 1 main_~lk2~0)} is VALID [2020-07-11 01:00:30,581 INFO L280 TraceCheckUtils]: 53: Hoare triple {3330#(= 1 main_~lk2~0)} assume !(0 != ~p1~0); {3330#(= 1 main_~lk2~0)} is VALID [2020-07-11 01:00:30,582 INFO L280 TraceCheckUtils]: 54: Hoare triple {3330#(= 1 main_~lk2~0)} assume 0 != ~p2~0; {3330#(= 1 main_~lk2~0)} is VALID [2020-07-11 01:00:30,583 INFO L280 TraceCheckUtils]: 55: Hoare triple {3330#(= 1 main_~lk2~0)} assume 1 != ~lk2~0; {3327#false} is VALID [2020-07-11 01:00:30,583 INFO L280 TraceCheckUtils]: 56: Hoare triple {3327#false} assume !false; {3327#false} is VALID [2020-07-11 01:00:30,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 01:00:30,588 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [927405769] [2020-07-11 01:00:30,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:00:30,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:00:30,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609970302] [2020-07-11 01:00:30,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2020-07-11 01:00:30,590 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:00:30,590 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:00:30,645 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:30,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:00:30,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:00:30,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:00:30,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:00:30,646 INFO L87 Difference]: Start difference. First operand 211 states and 280 transitions. Second operand 3 states. [2020-07-11 01:00:31,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:31,133 INFO L93 Difference]: Finished difference Result 259 states and 346 transitions. [2020-07-11 01:00:31,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:00:31,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2020-07-11 01:00:31,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:00:31,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:31,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2020-07-11 01:00:31,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:31,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2020-07-11 01:00:31,140 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 155 transitions. [2020-07-11 01:00:31,266 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:31,273 INFO L225 Difference]: With dead ends: 259 [2020-07-11 01:00:31,273 INFO L226 Difference]: Without dead ends: 257 [2020-07-11 01:00:31,274 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11 01:00:31,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2020-07-11 01:00:31,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 211. [2020-07-11 01:00:31,538 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:00:31,538 INFO L82 GeneralOperation]: Start isEquivalent. First operand 257 states. Second operand 211 states. [2020-07-11 01:00:31,538 INFO L74 IsIncluded]: Start isIncluded. First operand 257 states. Second operand 211 states. [2020-07-11 01:00:31,538 INFO L87 Difference]: Start difference. First operand 257 states. Second operand 211 states. [2020-07-11 01:00:31,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:31,548 INFO L93 Difference]: Finished difference Result 257 states and 343 transitions. [2020-07-11 01:00:31,549 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 343 transitions. [2020-07-11 01:00:31,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:31,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:31,550 INFO L74 IsIncluded]: Start isIncluded. First operand 211 states. Second operand 257 states. [2020-07-11 01:00:31,550 INFO L87 Difference]: Start difference. First operand 211 states. Second operand 257 states. [2020-07-11 01:00:31,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:31,560 INFO L93 Difference]: Finished difference Result 257 states and 343 transitions. [2020-07-11 01:00:31,560 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 343 transitions. [2020-07-11 01:00:31,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:31,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:31,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:00:31,562 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:00:31,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-07-11 01:00:31,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 278 transitions. [2020-07-11 01:00:31,569 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 278 transitions. Word has length 57 [2020-07-11 01:00:31,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:00:31,570 INFO L479 AbstractCegarLoop]: Abstraction has 211 states and 278 transitions. [2020-07-11 01:00:31,570 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:00:31,570 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 211 states and 278 transitions. [2020-07-11 01:00:31,893 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 278 edges. 278 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:31,894 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 278 transitions. [2020-07-11 01:00:31,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-07-11 01:00:31,895 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:00:31,896 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] [2020-07-11 01:00:31,896 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-11 01:00:31,896 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:00:31,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:00:31,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1798143236, now seen corresponding path program 1 times [2020-07-11 01:00:31,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:00:31,897 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1224855496] [2020-07-11 01:00:31,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:00:31,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:31,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:31,964 INFO L280 TraceCheckUtils]: 0: Hoare triple {4787#true} assume true; {4787#true} is VALID [2020-07-11 01:00:31,964 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {4787#true} {4787#true} #199#return; {4787#true} is VALID [2020-07-11 01:00:31,964 INFO L263 TraceCheckUtils]: 0: Hoare triple {4787#true} call ULTIMATE.init(); {4787#true} is VALID [2020-07-11 01:00:31,965 INFO L280 TraceCheckUtils]: 1: Hoare triple {4787#true} assume true; {4787#true} is VALID [2020-07-11 01:00:31,965 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4787#true} {4787#true} #199#return; {4787#true} is VALID [2020-07-11 01:00:31,965 INFO L263 TraceCheckUtils]: 3: Hoare triple {4787#true} call #t~ret8 := main(); {4787#true} is VALID [2020-07-11 01:00:31,965 INFO L280 TraceCheckUtils]: 4: Hoare triple {4787#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {4787#true} is VALID [2020-07-11 01:00:31,965 INFO L280 TraceCheckUtils]: 5: Hoare triple {4787#true} ~p1~0 := #t~nondet0; {4787#true} is VALID [2020-07-11 01:00:31,965 INFO L280 TraceCheckUtils]: 6: Hoare triple {4787#true} havoc #t~nondet0; {4787#true} is VALID [2020-07-11 01:00:31,966 INFO L280 TraceCheckUtils]: 7: Hoare triple {4787#true} havoc ~lk1~0; {4787#true} is VALID [2020-07-11 01:00:31,966 INFO L280 TraceCheckUtils]: 8: Hoare triple {4787#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {4787#true} is VALID [2020-07-11 01:00:31,966 INFO L280 TraceCheckUtils]: 9: Hoare triple {4787#true} ~p2~0 := #t~nondet1; {4787#true} is VALID [2020-07-11 01:00:31,966 INFO L280 TraceCheckUtils]: 10: Hoare triple {4787#true} havoc #t~nondet1; {4787#true} is VALID [2020-07-11 01:00:31,966 INFO L280 TraceCheckUtils]: 11: Hoare triple {4787#true} havoc ~lk2~0; {4787#true} is VALID [2020-07-11 01:00:31,966 INFO L280 TraceCheckUtils]: 12: Hoare triple {4787#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {4787#true} is VALID [2020-07-11 01:00:31,966 INFO L280 TraceCheckUtils]: 13: Hoare triple {4787#true} ~p3~0 := #t~nondet2; {4787#true} is VALID [2020-07-11 01:00:31,967 INFO L280 TraceCheckUtils]: 14: Hoare triple {4787#true} havoc #t~nondet2; {4787#true} is VALID [2020-07-11 01:00:31,967 INFO L280 TraceCheckUtils]: 15: Hoare triple {4787#true} havoc ~lk3~0; {4787#true} is VALID [2020-07-11 01:00:31,967 INFO L280 TraceCheckUtils]: 16: Hoare triple {4787#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {4787#true} is VALID [2020-07-11 01:00:31,967 INFO L280 TraceCheckUtils]: 17: Hoare triple {4787#true} ~p4~0 := #t~nondet3; {4787#true} is VALID [2020-07-11 01:00:31,967 INFO L280 TraceCheckUtils]: 18: Hoare triple {4787#true} havoc #t~nondet3; {4787#true} is VALID [2020-07-11 01:00:31,968 INFO L280 TraceCheckUtils]: 19: Hoare triple {4787#true} havoc ~lk4~0; {4787#true} is VALID [2020-07-11 01:00:31,968 INFO L280 TraceCheckUtils]: 20: Hoare triple {4787#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {4787#true} is VALID [2020-07-11 01:00:31,968 INFO L280 TraceCheckUtils]: 21: Hoare triple {4787#true} ~p5~0 := #t~nondet4; {4787#true} is VALID [2020-07-11 01:00:31,968 INFO L280 TraceCheckUtils]: 22: Hoare triple {4787#true} havoc #t~nondet4; {4787#true} is VALID [2020-07-11 01:00:31,968 INFO L280 TraceCheckUtils]: 23: Hoare triple {4787#true} havoc ~lk5~0; {4787#true} is VALID [2020-07-11 01:00:31,969 INFO L280 TraceCheckUtils]: 24: Hoare triple {4787#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {4787#true} is VALID [2020-07-11 01:00:31,969 INFO L280 TraceCheckUtils]: 25: Hoare triple {4787#true} ~p6~0 := #t~nondet5; {4787#true} is VALID [2020-07-11 01:00:31,969 INFO L280 TraceCheckUtils]: 26: Hoare triple {4787#true} havoc #t~nondet5; {4787#true} is VALID [2020-07-11 01:00:31,969 INFO L280 TraceCheckUtils]: 27: Hoare triple {4787#true} havoc ~lk6~0; {4787#true} is VALID [2020-07-11 01:00:31,970 INFO L280 TraceCheckUtils]: 28: Hoare triple {4787#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {4787#true} is VALID [2020-07-11 01:00:31,970 INFO L280 TraceCheckUtils]: 29: Hoare triple {4787#true} ~p7~0 := #t~nondet6; {4787#true} is VALID [2020-07-11 01:00:31,970 INFO L280 TraceCheckUtils]: 30: Hoare triple {4787#true} havoc #t~nondet6; {4787#true} is VALID [2020-07-11 01:00:31,970 INFO L280 TraceCheckUtils]: 31: Hoare triple {4787#true} havoc ~lk7~0; {4787#true} is VALID [2020-07-11 01:00:31,971 INFO L280 TraceCheckUtils]: 32: Hoare triple {4787#true} havoc ~cond~0; {4787#true} is VALID [2020-07-11 01:00:31,971 INFO L280 TraceCheckUtils]: 33: Hoare triple {4787#true} assume !false; {4787#true} is VALID [2020-07-11 01:00:31,971 INFO L280 TraceCheckUtils]: 34: Hoare triple {4787#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {4787#true} is VALID [2020-07-11 01:00:31,971 INFO L280 TraceCheckUtils]: 35: Hoare triple {4787#true} ~cond~0 := #t~nondet7; {4787#true} is VALID [2020-07-11 01:00:31,971 INFO L280 TraceCheckUtils]: 36: Hoare triple {4787#true} havoc #t~nondet7; {4787#true} is VALID [2020-07-11 01:00:31,972 INFO L280 TraceCheckUtils]: 37: Hoare triple {4787#true} assume !(0 == ~cond~0); {4787#true} is VALID [2020-07-11 01:00:31,972 INFO L280 TraceCheckUtils]: 38: Hoare triple {4787#true} ~lk1~0 := 0; {4787#true} is VALID [2020-07-11 01:00:31,972 INFO L280 TraceCheckUtils]: 39: Hoare triple {4787#true} ~lk2~0 := 0; {4787#true} is VALID [2020-07-11 01:00:31,972 INFO L280 TraceCheckUtils]: 40: Hoare triple {4787#true} ~lk3~0 := 0; {4787#true} is VALID [2020-07-11 01:00:31,973 INFO L280 TraceCheckUtils]: 41: Hoare triple {4787#true} ~lk4~0 := 0; {4787#true} is VALID [2020-07-11 01:00:31,973 INFO L280 TraceCheckUtils]: 42: Hoare triple {4787#true} ~lk5~0 := 0; {4787#true} is VALID [2020-07-11 01:00:31,973 INFO L280 TraceCheckUtils]: 43: Hoare triple {4787#true} ~lk6~0 := 0; {4787#true} is VALID [2020-07-11 01:00:31,973 INFO L280 TraceCheckUtils]: 44: Hoare triple {4787#true} ~lk7~0 := 0; {4787#true} is VALID [2020-07-11 01:00:31,973 INFO L280 TraceCheckUtils]: 45: Hoare triple {4787#true} assume !(0 != ~p1~0); {4787#true} is VALID [2020-07-11 01:00:31,974 INFO L280 TraceCheckUtils]: 46: Hoare triple {4787#true} assume !(0 != ~p2~0); {4787#true} is VALID [2020-07-11 01:00:31,977 INFO L280 TraceCheckUtils]: 47: Hoare triple {4787#true} assume !(0 != ~p3~0); {4791#(= 0 main_~p3~0)} is VALID [2020-07-11 01:00:31,977 INFO L280 TraceCheckUtils]: 48: Hoare triple {4791#(= 0 main_~p3~0)} assume !(0 != ~p4~0); {4791#(= 0 main_~p3~0)} is VALID [2020-07-11 01:00:31,978 INFO L280 TraceCheckUtils]: 49: Hoare triple {4791#(= 0 main_~p3~0)} assume !(0 != ~p5~0); {4791#(= 0 main_~p3~0)} is VALID [2020-07-11 01:00:31,979 INFO L280 TraceCheckUtils]: 50: Hoare triple {4791#(= 0 main_~p3~0)} assume !(0 != ~p6~0); {4791#(= 0 main_~p3~0)} is VALID [2020-07-11 01:00:31,979 INFO L280 TraceCheckUtils]: 51: Hoare triple {4791#(= 0 main_~p3~0)} assume !(0 != ~p7~0); {4791#(= 0 main_~p3~0)} is VALID [2020-07-11 01:00:31,980 INFO L280 TraceCheckUtils]: 52: Hoare triple {4791#(= 0 main_~p3~0)} assume !(0 != ~p1~0); {4791#(= 0 main_~p3~0)} is VALID [2020-07-11 01:00:31,980 INFO L280 TraceCheckUtils]: 53: Hoare triple {4791#(= 0 main_~p3~0)} assume !(0 != ~p2~0); {4791#(= 0 main_~p3~0)} is VALID [2020-07-11 01:00:31,981 INFO L280 TraceCheckUtils]: 54: Hoare triple {4791#(= 0 main_~p3~0)} assume 0 != ~p3~0; {4788#false} is VALID [2020-07-11 01:00:31,981 INFO L280 TraceCheckUtils]: 55: Hoare triple {4788#false} assume 1 != ~lk3~0; {4788#false} is VALID [2020-07-11 01:00:31,981 INFO L280 TraceCheckUtils]: 56: Hoare triple {4788#false} assume !false; {4788#false} is VALID [2020-07-11 01:00:31,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 01:00:31,983 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1224855496] [2020-07-11 01:00:31,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:00:31,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:00:31,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550170334] [2020-07-11 01:00:31,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2020-07-11 01:00:31,984 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:00:31,984 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:00:32,037 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:32,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:00:32,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:00:32,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:00:32,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:00:32,039 INFO L87 Difference]: Start difference. First operand 211 states and 278 transitions. Second operand 3 states. [2020-07-11 01:00:32,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:32,799 INFO L93 Difference]: Finished difference Result 555 states and 752 transitions. [2020-07-11 01:00:32,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:00:32,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2020-07-11 01:00:32,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:00:32,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:32,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 230 transitions. [2020-07-11 01:00:32,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:32,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 230 transitions. [2020-07-11 01:00:32,807 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 230 transitions. [2020-07-11 01:00:33,026 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 230 edges. 230 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:33,038 INFO L225 Difference]: With dead ends: 555 [2020-07-11 01:00:33,038 INFO L226 Difference]: Without dead ends: 377 [2020-07-11 01:00:33,040 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11 01:00:33,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2020-07-11 01:00:33,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 375. [2020-07-11 01:00:33,478 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:00:33,479 INFO L82 GeneralOperation]: Start isEquivalent. First operand 377 states. Second operand 375 states. [2020-07-11 01:00:33,479 INFO L74 IsIncluded]: Start isIncluded. First operand 377 states. Second operand 375 states. [2020-07-11 01:00:33,479 INFO L87 Difference]: Start difference. First operand 377 states. Second operand 375 states. [2020-07-11 01:00:33,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:33,513 INFO L93 Difference]: Finished difference Result 377 states and 499 transitions. [2020-07-11 01:00:33,513 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 499 transitions. [2020-07-11 01:00:33,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:33,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:33,516 INFO L74 IsIncluded]: Start isIncluded. First operand 375 states. Second operand 377 states. [2020-07-11 01:00:33,516 INFO L87 Difference]: Start difference. First operand 375 states. Second operand 377 states. [2020-07-11 01:00:33,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:33,549 INFO L93 Difference]: Finished difference Result 377 states and 499 transitions. [2020-07-11 01:00:33,549 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 499 transitions. [2020-07-11 01:00:33,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:33,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:33,550 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:00:33,550 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:00:33,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-07-11 01:00:33,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 498 transitions. [2020-07-11 01:00:33,566 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 498 transitions. Word has length 57 [2020-07-11 01:00:33,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:00:33,566 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 498 transitions. [2020-07-11 01:00:33,567 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:00:33,567 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 375 states and 498 transitions. [2020-07-11 01:00:34,164 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 498 edges. 498 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:34,164 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 498 transitions. [2020-07-11 01:00:34,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-07-11 01:00:34,166 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:00:34,166 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] [2020-07-11 01:00:34,166 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-11 01:00:34,166 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:00:34,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:00:34,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1136837537, now seen corresponding path program 1 times [2020-07-11 01:00:34,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:00:34,167 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [384336450] [2020-07-11 01:00:34,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:00:34,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:34,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:34,232 INFO L280 TraceCheckUtils]: 0: Hoare triple {7408#true} assume true; {7408#true} is VALID [2020-07-11 01:00:34,233 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {7408#true} {7408#true} #199#return; {7408#true} is VALID [2020-07-11 01:00:34,233 INFO L263 TraceCheckUtils]: 0: Hoare triple {7408#true} call ULTIMATE.init(); {7408#true} is VALID [2020-07-11 01:00:34,233 INFO L280 TraceCheckUtils]: 1: Hoare triple {7408#true} assume true; {7408#true} is VALID [2020-07-11 01:00:34,234 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {7408#true} {7408#true} #199#return; {7408#true} is VALID [2020-07-11 01:00:34,234 INFO L263 TraceCheckUtils]: 3: Hoare triple {7408#true} call #t~ret8 := main(); {7408#true} is VALID [2020-07-11 01:00:34,234 INFO L280 TraceCheckUtils]: 4: Hoare triple {7408#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {7408#true} is VALID [2020-07-11 01:00:34,234 INFO L280 TraceCheckUtils]: 5: Hoare triple {7408#true} ~p1~0 := #t~nondet0; {7408#true} is VALID [2020-07-11 01:00:34,234 INFO L280 TraceCheckUtils]: 6: Hoare triple {7408#true} havoc #t~nondet0; {7408#true} is VALID [2020-07-11 01:00:34,235 INFO L280 TraceCheckUtils]: 7: Hoare triple {7408#true} havoc ~lk1~0; {7408#true} is VALID [2020-07-11 01:00:34,235 INFO L280 TraceCheckUtils]: 8: Hoare triple {7408#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {7408#true} is VALID [2020-07-11 01:00:34,235 INFO L280 TraceCheckUtils]: 9: Hoare triple {7408#true} ~p2~0 := #t~nondet1; {7408#true} is VALID [2020-07-11 01:00:34,235 INFO L280 TraceCheckUtils]: 10: Hoare triple {7408#true} havoc #t~nondet1; {7408#true} is VALID [2020-07-11 01:00:34,235 INFO L280 TraceCheckUtils]: 11: Hoare triple {7408#true} havoc ~lk2~0; {7408#true} is VALID [2020-07-11 01:00:34,236 INFO L280 TraceCheckUtils]: 12: Hoare triple {7408#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {7408#true} is VALID [2020-07-11 01:00:34,236 INFO L280 TraceCheckUtils]: 13: Hoare triple {7408#true} ~p3~0 := #t~nondet2; {7408#true} is VALID [2020-07-11 01:00:34,236 INFO L280 TraceCheckUtils]: 14: Hoare triple {7408#true} havoc #t~nondet2; {7408#true} is VALID [2020-07-11 01:00:34,237 INFO L280 TraceCheckUtils]: 15: Hoare triple {7408#true} havoc ~lk3~0; {7408#true} is VALID [2020-07-11 01:00:34,238 INFO L280 TraceCheckUtils]: 16: Hoare triple {7408#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {7408#true} is VALID [2020-07-11 01:00:34,238 INFO L280 TraceCheckUtils]: 17: Hoare triple {7408#true} ~p4~0 := #t~nondet3; {7408#true} is VALID [2020-07-11 01:00:34,238 INFO L280 TraceCheckUtils]: 18: Hoare triple {7408#true} havoc #t~nondet3; {7408#true} is VALID [2020-07-11 01:00:34,238 INFO L280 TraceCheckUtils]: 19: Hoare triple {7408#true} havoc ~lk4~0; {7408#true} is VALID [2020-07-11 01:00:34,239 INFO L280 TraceCheckUtils]: 20: Hoare triple {7408#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {7408#true} is VALID [2020-07-11 01:00:34,239 INFO L280 TraceCheckUtils]: 21: Hoare triple {7408#true} ~p5~0 := #t~nondet4; {7408#true} is VALID [2020-07-11 01:00:34,242 INFO L280 TraceCheckUtils]: 22: Hoare triple {7408#true} havoc #t~nondet4; {7408#true} is VALID [2020-07-11 01:00:34,242 INFO L280 TraceCheckUtils]: 23: Hoare triple {7408#true} havoc ~lk5~0; {7408#true} is VALID [2020-07-11 01:00:34,242 INFO L280 TraceCheckUtils]: 24: Hoare triple {7408#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {7408#true} is VALID [2020-07-11 01:00:34,243 INFO L280 TraceCheckUtils]: 25: Hoare triple {7408#true} ~p6~0 := #t~nondet5; {7408#true} is VALID [2020-07-11 01:00:34,243 INFO L280 TraceCheckUtils]: 26: Hoare triple {7408#true} havoc #t~nondet5; {7408#true} is VALID [2020-07-11 01:00:34,246 INFO L280 TraceCheckUtils]: 27: Hoare triple {7408#true} havoc ~lk6~0; {7408#true} is VALID [2020-07-11 01:00:34,247 INFO L280 TraceCheckUtils]: 28: Hoare triple {7408#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {7408#true} is VALID [2020-07-11 01:00:34,247 INFO L280 TraceCheckUtils]: 29: Hoare triple {7408#true} ~p7~0 := #t~nondet6; {7408#true} is VALID [2020-07-11 01:00:34,247 INFO L280 TraceCheckUtils]: 30: Hoare triple {7408#true} havoc #t~nondet6; {7408#true} is VALID [2020-07-11 01:00:34,247 INFO L280 TraceCheckUtils]: 31: Hoare triple {7408#true} havoc ~lk7~0; {7408#true} is VALID [2020-07-11 01:00:34,247 INFO L280 TraceCheckUtils]: 32: Hoare triple {7408#true} havoc ~cond~0; {7408#true} is VALID [2020-07-11 01:00:34,248 INFO L280 TraceCheckUtils]: 33: Hoare triple {7408#true} assume !false; {7408#true} is VALID [2020-07-11 01:00:34,248 INFO L280 TraceCheckUtils]: 34: Hoare triple {7408#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {7408#true} is VALID [2020-07-11 01:00:34,248 INFO L280 TraceCheckUtils]: 35: Hoare triple {7408#true} ~cond~0 := #t~nondet7; {7408#true} is VALID [2020-07-11 01:00:34,248 INFO L280 TraceCheckUtils]: 36: Hoare triple {7408#true} havoc #t~nondet7; {7408#true} is VALID [2020-07-11 01:00:34,249 INFO L280 TraceCheckUtils]: 37: Hoare triple {7408#true} assume !(0 == ~cond~0); {7408#true} is VALID [2020-07-11 01:00:34,249 INFO L280 TraceCheckUtils]: 38: Hoare triple {7408#true} ~lk1~0 := 0; {7408#true} is VALID [2020-07-11 01:00:34,249 INFO L280 TraceCheckUtils]: 39: Hoare triple {7408#true} ~lk2~0 := 0; {7408#true} is VALID [2020-07-11 01:00:34,249 INFO L280 TraceCheckUtils]: 40: Hoare triple {7408#true} ~lk3~0 := 0; {7408#true} is VALID [2020-07-11 01:00:34,249 INFO L280 TraceCheckUtils]: 41: Hoare triple {7408#true} ~lk4~0 := 0; {7408#true} is VALID [2020-07-11 01:00:34,249 INFO L280 TraceCheckUtils]: 42: Hoare triple {7408#true} ~lk5~0 := 0; {7408#true} is VALID [2020-07-11 01:00:34,250 INFO L280 TraceCheckUtils]: 43: Hoare triple {7408#true} ~lk6~0 := 0; {7408#true} is VALID [2020-07-11 01:00:34,250 INFO L280 TraceCheckUtils]: 44: Hoare triple {7408#true} ~lk7~0 := 0; {7408#true} is VALID [2020-07-11 01:00:34,250 INFO L280 TraceCheckUtils]: 45: Hoare triple {7408#true} assume !(0 != ~p1~0); {7408#true} is VALID [2020-07-11 01:00:34,250 INFO L280 TraceCheckUtils]: 46: Hoare triple {7408#true} assume !(0 != ~p2~0); {7408#true} is VALID [2020-07-11 01:00:34,251 INFO L280 TraceCheckUtils]: 47: Hoare triple {7408#true} assume 0 != ~p3~0; {7408#true} is VALID [2020-07-11 01:00:34,251 INFO L280 TraceCheckUtils]: 48: Hoare triple {7408#true} ~lk3~0 := 1; {7412#(= 1 main_~lk3~0)} is VALID [2020-07-11 01:00:34,252 INFO L280 TraceCheckUtils]: 49: Hoare triple {7412#(= 1 main_~lk3~0)} assume !(0 != ~p4~0); {7412#(= 1 main_~lk3~0)} is VALID [2020-07-11 01:00:34,252 INFO L280 TraceCheckUtils]: 50: Hoare triple {7412#(= 1 main_~lk3~0)} assume !(0 != ~p5~0); {7412#(= 1 main_~lk3~0)} is VALID [2020-07-11 01:00:34,253 INFO L280 TraceCheckUtils]: 51: Hoare triple {7412#(= 1 main_~lk3~0)} assume !(0 != ~p6~0); {7412#(= 1 main_~lk3~0)} is VALID [2020-07-11 01:00:34,253 INFO L280 TraceCheckUtils]: 52: Hoare triple {7412#(= 1 main_~lk3~0)} assume !(0 != ~p7~0); {7412#(= 1 main_~lk3~0)} is VALID [2020-07-11 01:00:34,254 INFO L280 TraceCheckUtils]: 53: Hoare triple {7412#(= 1 main_~lk3~0)} assume !(0 != ~p1~0); {7412#(= 1 main_~lk3~0)} is VALID [2020-07-11 01:00:34,254 INFO L280 TraceCheckUtils]: 54: Hoare triple {7412#(= 1 main_~lk3~0)} assume !(0 != ~p2~0); {7412#(= 1 main_~lk3~0)} is VALID [2020-07-11 01:00:34,255 INFO L280 TraceCheckUtils]: 55: Hoare triple {7412#(= 1 main_~lk3~0)} assume 0 != ~p3~0; {7412#(= 1 main_~lk3~0)} is VALID [2020-07-11 01:00:34,255 INFO L280 TraceCheckUtils]: 56: Hoare triple {7412#(= 1 main_~lk3~0)} assume 1 != ~lk3~0; {7409#false} is VALID [2020-07-11 01:00:34,255 INFO L280 TraceCheckUtils]: 57: Hoare triple {7409#false} assume !false; {7409#false} is VALID [2020-07-11 01:00:34,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 01:00:34,257 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [384336450] [2020-07-11 01:00:34,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:00:34,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:00:34,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695968680] [2020-07-11 01:00:34,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2020-07-11 01:00:34,259 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:00:34,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:00:34,310 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:34,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:00:34,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:00:34,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:00:34,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:00:34,311 INFO L87 Difference]: Start difference. First operand 375 states and 498 transitions. Second operand 3 states. [2020-07-11 01:00:35,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:35,151 INFO L93 Difference]: Finished difference Result 459 states and 612 transitions. [2020-07-11 01:00:35,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:00:35,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2020-07-11 01:00:35,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:00:35,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:35,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2020-07-11 01:00:35,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:35,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2020-07-11 01:00:35,156 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 151 transitions. [2020-07-11 01:00:35,302 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:35,316 INFO L225 Difference]: With dead ends: 459 [2020-07-11 01:00:35,317 INFO L226 Difference]: Without dead ends: 457 [2020-07-11 01:00:35,317 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11 01:00:35,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2020-07-11 01:00:35,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 375. [2020-07-11 01:00:35,830 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:00:35,830 INFO L82 GeneralOperation]: Start isEquivalent. First operand 457 states. Second operand 375 states. [2020-07-11 01:00:35,830 INFO L74 IsIncluded]: Start isIncluded. First operand 457 states. Second operand 375 states. [2020-07-11 01:00:35,831 INFO L87 Difference]: Start difference. First operand 457 states. Second operand 375 states. [2020-07-11 01:00:35,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:35,847 INFO L93 Difference]: Finished difference Result 457 states and 607 transitions. [2020-07-11 01:00:35,847 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 607 transitions. [2020-07-11 01:00:35,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:35,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:35,848 INFO L74 IsIncluded]: Start isIncluded. First operand 375 states. Second operand 457 states. [2020-07-11 01:00:35,849 INFO L87 Difference]: Start difference. First operand 375 states. Second operand 457 states. [2020-07-11 01:00:35,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:35,864 INFO L93 Difference]: Finished difference Result 457 states and 607 transitions. [2020-07-11 01:00:35,864 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 607 transitions. [2020-07-11 01:00:35,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:35,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:35,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:00:35,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:00:35,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-07-11 01:00:35,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 494 transitions. [2020-07-11 01:00:35,877 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 494 transitions. Word has length 58 [2020-07-11 01:00:35,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:00:35,878 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 494 transitions. [2020-07-11 01:00:35,878 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:00:35,878 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 375 states and 494 transitions. [2020-07-11 01:00:36,471 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 494 edges. 494 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:36,472 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 494 transitions. [2020-07-11 01:00:36,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-07-11 01:00:36,473 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:00:36,474 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] [2020-07-11 01:00:36,474 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-11 01:00:36,474 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:00:36,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:00:36,475 INFO L82 PathProgramCache]: Analyzing trace with hash 92380246, now seen corresponding path program 1 times [2020-07-11 01:00:36,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:00:36,475 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1272748123] [2020-07-11 01:00:36,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:00:36,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:36,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:36,519 INFO L280 TraceCheckUtils]: 0: Hoare triple {9997#true} assume true; {9997#true} is VALID [2020-07-11 01:00:36,519 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {9997#true} {9997#true} #199#return; {9997#true} is VALID [2020-07-11 01:00:36,520 INFO L263 TraceCheckUtils]: 0: Hoare triple {9997#true} call ULTIMATE.init(); {9997#true} is VALID [2020-07-11 01:00:36,520 INFO L280 TraceCheckUtils]: 1: Hoare triple {9997#true} assume true; {9997#true} is VALID [2020-07-11 01:00:36,520 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {9997#true} {9997#true} #199#return; {9997#true} is VALID [2020-07-11 01:00:36,520 INFO L263 TraceCheckUtils]: 3: Hoare triple {9997#true} call #t~ret8 := main(); {9997#true} is VALID [2020-07-11 01:00:36,521 INFO L280 TraceCheckUtils]: 4: Hoare triple {9997#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {9997#true} is VALID [2020-07-11 01:00:36,521 INFO L280 TraceCheckUtils]: 5: Hoare triple {9997#true} ~p1~0 := #t~nondet0; {9997#true} is VALID [2020-07-11 01:00:36,521 INFO L280 TraceCheckUtils]: 6: Hoare triple {9997#true} havoc #t~nondet0; {9997#true} is VALID [2020-07-11 01:00:36,521 INFO L280 TraceCheckUtils]: 7: Hoare triple {9997#true} havoc ~lk1~0; {9997#true} is VALID [2020-07-11 01:00:36,521 INFO L280 TraceCheckUtils]: 8: Hoare triple {9997#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {9997#true} is VALID [2020-07-11 01:00:36,522 INFO L280 TraceCheckUtils]: 9: Hoare triple {9997#true} ~p2~0 := #t~nondet1; {9997#true} is VALID [2020-07-11 01:00:36,522 INFO L280 TraceCheckUtils]: 10: Hoare triple {9997#true} havoc #t~nondet1; {9997#true} is VALID [2020-07-11 01:00:36,522 INFO L280 TraceCheckUtils]: 11: Hoare triple {9997#true} havoc ~lk2~0; {9997#true} is VALID [2020-07-11 01:00:36,522 INFO L280 TraceCheckUtils]: 12: Hoare triple {9997#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {9997#true} is VALID [2020-07-11 01:00:36,523 INFO L280 TraceCheckUtils]: 13: Hoare triple {9997#true} ~p3~0 := #t~nondet2; {9997#true} is VALID [2020-07-11 01:00:36,523 INFO L280 TraceCheckUtils]: 14: Hoare triple {9997#true} havoc #t~nondet2; {9997#true} is VALID [2020-07-11 01:00:36,523 INFO L280 TraceCheckUtils]: 15: Hoare triple {9997#true} havoc ~lk3~0; {9997#true} is VALID [2020-07-11 01:00:36,523 INFO L280 TraceCheckUtils]: 16: Hoare triple {9997#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {9997#true} is VALID [2020-07-11 01:00:36,523 INFO L280 TraceCheckUtils]: 17: Hoare triple {9997#true} ~p4~0 := #t~nondet3; {9997#true} is VALID [2020-07-11 01:00:36,523 INFO L280 TraceCheckUtils]: 18: Hoare triple {9997#true} havoc #t~nondet3; {9997#true} is VALID [2020-07-11 01:00:36,524 INFO L280 TraceCheckUtils]: 19: Hoare triple {9997#true} havoc ~lk4~0; {9997#true} is VALID [2020-07-11 01:00:36,524 INFO L280 TraceCheckUtils]: 20: Hoare triple {9997#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {9997#true} is VALID [2020-07-11 01:00:36,524 INFO L280 TraceCheckUtils]: 21: Hoare triple {9997#true} ~p5~0 := #t~nondet4; {9997#true} is VALID [2020-07-11 01:00:36,524 INFO L280 TraceCheckUtils]: 22: Hoare triple {9997#true} havoc #t~nondet4; {9997#true} is VALID [2020-07-11 01:00:36,525 INFO L280 TraceCheckUtils]: 23: Hoare triple {9997#true} havoc ~lk5~0; {9997#true} is VALID [2020-07-11 01:00:36,525 INFO L280 TraceCheckUtils]: 24: Hoare triple {9997#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {9997#true} is VALID [2020-07-11 01:00:36,525 INFO L280 TraceCheckUtils]: 25: Hoare triple {9997#true} ~p6~0 := #t~nondet5; {9997#true} is VALID [2020-07-11 01:00:36,525 INFO L280 TraceCheckUtils]: 26: Hoare triple {9997#true} havoc #t~nondet5; {9997#true} is VALID [2020-07-11 01:00:36,525 INFO L280 TraceCheckUtils]: 27: Hoare triple {9997#true} havoc ~lk6~0; {9997#true} is VALID [2020-07-11 01:00:36,526 INFO L280 TraceCheckUtils]: 28: Hoare triple {9997#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {9997#true} is VALID [2020-07-11 01:00:36,527 INFO L280 TraceCheckUtils]: 29: Hoare triple {9997#true} ~p7~0 := #t~nondet6; {9997#true} is VALID [2020-07-11 01:00:36,531 INFO L280 TraceCheckUtils]: 30: Hoare triple {9997#true} havoc #t~nondet6; {9997#true} is VALID [2020-07-11 01:00:36,531 INFO L280 TraceCheckUtils]: 31: Hoare triple {9997#true} havoc ~lk7~0; {9997#true} is VALID [2020-07-11 01:00:36,532 INFO L280 TraceCheckUtils]: 32: Hoare triple {9997#true} havoc ~cond~0; {9997#true} is VALID [2020-07-11 01:00:36,532 INFO L280 TraceCheckUtils]: 33: Hoare triple {9997#true} assume !false; {9997#true} is VALID [2020-07-11 01:00:36,532 INFO L280 TraceCheckUtils]: 34: Hoare triple {9997#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {9997#true} is VALID [2020-07-11 01:00:36,537 INFO L280 TraceCheckUtils]: 35: Hoare triple {9997#true} ~cond~0 := #t~nondet7; {9997#true} is VALID [2020-07-11 01:00:36,537 INFO L280 TraceCheckUtils]: 36: Hoare triple {9997#true} havoc #t~nondet7; {9997#true} is VALID [2020-07-11 01:00:36,537 INFO L280 TraceCheckUtils]: 37: Hoare triple {9997#true} assume !(0 == ~cond~0); {9997#true} is VALID [2020-07-11 01:00:36,537 INFO L280 TraceCheckUtils]: 38: Hoare triple {9997#true} ~lk1~0 := 0; {9997#true} is VALID [2020-07-11 01:00:36,537 INFO L280 TraceCheckUtils]: 39: Hoare triple {9997#true} ~lk2~0 := 0; {9997#true} is VALID [2020-07-11 01:00:36,538 INFO L280 TraceCheckUtils]: 40: Hoare triple {9997#true} ~lk3~0 := 0; {9997#true} is VALID [2020-07-11 01:00:36,538 INFO L280 TraceCheckUtils]: 41: Hoare triple {9997#true} ~lk4~0 := 0; {9997#true} is VALID [2020-07-11 01:00:36,538 INFO L280 TraceCheckUtils]: 42: Hoare triple {9997#true} ~lk5~0 := 0; {9997#true} is VALID [2020-07-11 01:00:36,538 INFO L280 TraceCheckUtils]: 43: Hoare triple {9997#true} ~lk6~0 := 0; {9997#true} is VALID [2020-07-11 01:00:36,538 INFO L280 TraceCheckUtils]: 44: Hoare triple {9997#true} ~lk7~0 := 0; {9997#true} is VALID [2020-07-11 01:00:36,539 INFO L280 TraceCheckUtils]: 45: Hoare triple {9997#true} assume !(0 != ~p1~0); {9997#true} is VALID [2020-07-11 01:00:36,539 INFO L280 TraceCheckUtils]: 46: Hoare triple {9997#true} assume !(0 != ~p2~0); {9997#true} is VALID [2020-07-11 01:00:36,539 INFO L280 TraceCheckUtils]: 47: Hoare triple {9997#true} assume !(0 != ~p3~0); {9997#true} is VALID [2020-07-11 01:00:36,540 INFO L280 TraceCheckUtils]: 48: Hoare triple {9997#true} assume !(0 != ~p4~0); {10001#(= 0 main_~p4~0)} is VALID [2020-07-11 01:00:36,540 INFO L280 TraceCheckUtils]: 49: Hoare triple {10001#(= 0 main_~p4~0)} assume !(0 != ~p5~0); {10001#(= 0 main_~p4~0)} is VALID [2020-07-11 01:00:36,541 INFO L280 TraceCheckUtils]: 50: Hoare triple {10001#(= 0 main_~p4~0)} assume !(0 != ~p6~0); {10001#(= 0 main_~p4~0)} is VALID [2020-07-11 01:00:36,546 INFO L280 TraceCheckUtils]: 51: Hoare triple {10001#(= 0 main_~p4~0)} assume !(0 != ~p7~0); {10001#(= 0 main_~p4~0)} is VALID [2020-07-11 01:00:36,546 INFO L280 TraceCheckUtils]: 52: Hoare triple {10001#(= 0 main_~p4~0)} assume !(0 != ~p1~0); {10001#(= 0 main_~p4~0)} is VALID [2020-07-11 01:00:36,546 INFO L280 TraceCheckUtils]: 53: Hoare triple {10001#(= 0 main_~p4~0)} assume !(0 != ~p2~0); {10001#(= 0 main_~p4~0)} is VALID [2020-07-11 01:00:36,547 INFO L280 TraceCheckUtils]: 54: Hoare triple {10001#(= 0 main_~p4~0)} assume !(0 != ~p3~0); {10001#(= 0 main_~p4~0)} is VALID [2020-07-11 01:00:36,547 INFO L280 TraceCheckUtils]: 55: Hoare triple {10001#(= 0 main_~p4~0)} assume 0 != ~p4~0; {9998#false} is VALID [2020-07-11 01:00:36,547 INFO L280 TraceCheckUtils]: 56: Hoare triple {9998#false} assume 1 != ~lk4~0; {9998#false} is VALID [2020-07-11 01:00:36,548 INFO L280 TraceCheckUtils]: 57: Hoare triple {9998#false} assume !false; {9998#false} is VALID [2020-07-11 01:00:36,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 01:00:36,549 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1272748123] [2020-07-11 01:00:36,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:00:36,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:00:36,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974608720] [2020-07-11 01:00:36,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2020-07-11 01:00:36,551 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:00:36,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:00:36,605 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:36,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:00:36,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:00:36,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:00:36,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:00:36,607 INFO L87 Difference]: Start difference. First operand 375 states and 494 transitions. Second operand 3 states. [2020-07-11 01:00:38,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:38,120 INFO L93 Difference]: Finished difference Result 1035 states and 1384 transitions. [2020-07-11 01:00:38,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:00:38,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2020-07-11 01:00:38,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:00:38,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:38,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 227 transitions. [2020-07-11 01:00:38,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:38,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 227 transitions. [2020-07-11 01:00:38,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 227 transitions. [2020-07-11 01:00:38,317 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 227 edges. 227 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:38,358 INFO L225 Difference]: With dead ends: 1035 [2020-07-11 01:00:38,358 INFO L226 Difference]: Without dead ends: 693 [2020-07-11 01:00:38,360 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11 01:00:38,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2020-07-11 01:00:39,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 691. [2020-07-11 01:00:39,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:00:39,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 693 states. Second operand 691 states. [2020-07-11 01:00:39,576 INFO L74 IsIncluded]: Start isIncluded. First operand 693 states. Second operand 691 states. [2020-07-11 01:00:39,576 INFO L87 Difference]: Start difference. First operand 693 states. Second operand 691 states. [2020-07-11 01:00:39,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:39,609 INFO L93 Difference]: Finished difference Result 693 states and 907 transitions. [2020-07-11 01:00:39,609 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 907 transitions. [2020-07-11 01:00:39,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:39,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:39,611 INFO L74 IsIncluded]: Start isIncluded. First operand 691 states. Second operand 693 states. [2020-07-11 01:00:39,611 INFO L87 Difference]: Start difference. First operand 691 states. Second operand 693 states. [2020-07-11 01:00:39,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:39,642 INFO L93 Difference]: Finished difference Result 693 states and 907 transitions. [2020-07-11 01:00:39,642 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 907 transitions. [2020-07-11 01:00:39,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:39,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:39,644 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:00:39,644 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:00:39,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2020-07-11 01:00:39,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 906 transitions. [2020-07-11 01:00:39,677 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 906 transitions. Word has length 58 [2020-07-11 01:00:39,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:00:39,678 INFO L479 AbstractCegarLoop]: Abstraction has 691 states and 906 transitions. [2020-07-11 01:00:39,678 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:00:39,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 691 states and 906 transitions. [2020-07-11 01:00:40,774 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 906 edges. 906 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:40,774 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 906 transitions. [2020-07-11 01:00:40,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-07-11 01:00:40,776 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:00:40,776 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] [2020-07-11 01:00:40,777 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-11 01:00:40,777 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:00:40,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:00:40,777 INFO L82 PathProgramCache]: Analyzing trace with hash -529027402, now seen corresponding path program 1 times [2020-07-11 01:00:40,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:00:40,778 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [520116313] [2020-07-11 01:00:40,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:00:40,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:40,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:40,817 INFO L280 TraceCheckUtils]: 0: Hoare triple {14842#true} assume true; {14842#true} is VALID [2020-07-11 01:00:40,817 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {14842#true} {14842#true} #199#return; {14842#true} is VALID [2020-07-11 01:00:40,817 INFO L263 TraceCheckUtils]: 0: Hoare triple {14842#true} call ULTIMATE.init(); {14842#true} is VALID [2020-07-11 01:00:40,817 INFO L280 TraceCheckUtils]: 1: Hoare triple {14842#true} assume true; {14842#true} is VALID [2020-07-11 01:00:40,818 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {14842#true} {14842#true} #199#return; {14842#true} is VALID [2020-07-11 01:00:40,818 INFO L263 TraceCheckUtils]: 3: Hoare triple {14842#true} call #t~ret8 := main(); {14842#true} is VALID [2020-07-11 01:00:40,818 INFO L280 TraceCheckUtils]: 4: Hoare triple {14842#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {14842#true} is VALID [2020-07-11 01:00:40,818 INFO L280 TraceCheckUtils]: 5: Hoare triple {14842#true} ~p1~0 := #t~nondet0; {14842#true} is VALID [2020-07-11 01:00:40,818 INFO L280 TraceCheckUtils]: 6: Hoare triple {14842#true} havoc #t~nondet0; {14842#true} is VALID [2020-07-11 01:00:40,819 INFO L280 TraceCheckUtils]: 7: Hoare triple {14842#true} havoc ~lk1~0; {14842#true} is VALID [2020-07-11 01:00:40,819 INFO L280 TraceCheckUtils]: 8: Hoare triple {14842#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {14842#true} is VALID [2020-07-11 01:00:40,819 INFO L280 TraceCheckUtils]: 9: Hoare triple {14842#true} ~p2~0 := #t~nondet1; {14842#true} is VALID [2020-07-11 01:00:40,819 INFO L280 TraceCheckUtils]: 10: Hoare triple {14842#true} havoc #t~nondet1; {14842#true} is VALID [2020-07-11 01:00:40,819 INFO L280 TraceCheckUtils]: 11: Hoare triple {14842#true} havoc ~lk2~0; {14842#true} is VALID [2020-07-11 01:00:40,820 INFO L280 TraceCheckUtils]: 12: Hoare triple {14842#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {14842#true} is VALID [2020-07-11 01:00:40,820 INFO L280 TraceCheckUtils]: 13: Hoare triple {14842#true} ~p3~0 := #t~nondet2; {14842#true} is VALID [2020-07-11 01:00:40,820 INFO L280 TraceCheckUtils]: 14: Hoare triple {14842#true} havoc #t~nondet2; {14842#true} is VALID [2020-07-11 01:00:40,820 INFO L280 TraceCheckUtils]: 15: Hoare triple {14842#true} havoc ~lk3~0; {14842#true} is VALID [2020-07-11 01:00:40,820 INFO L280 TraceCheckUtils]: 16: Hoare triple {14842#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {14842#true} is VALID [2020-07-11 01:00:40,821 INFO L280 TraceCheckUtils]: 17: Hoare triple {14842#true} ~p4~0 := #t~nondet3; {14842#true} is VALID [2020-07-11 01:00:40,821 INFO L280 TraceCheckUtils]: 18: Hoare triple {14842#true} havoc #t~nondet3; {14842#true} is VALID [2020-07-11 01:00:40,821 INFO L280 TraceCheckUtils]: 19: Hoare triple {14842#true} havoc ~lk4~0; {14842#true} is VALID [2020-07-11 01:00:40,821 INFO L280 TraceCheckUtils]: 20: Hoare triple {14842#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {14842#true} is VALID [2020-07-11 01:00:40,821 INFO L280 TraceCheckUtils]: 21: Hoare triple {14842#true} ~p5~0 := #t~nondet4; {14842#true} is VALID [2020-07-11 01:00:40,822 INFO L280 TraceCheckUtils]: 22: Hoare triple {14842#true} havoc #t~nondet4; {14842#true} is VALID [2020-07-11 01:00:40,822 INFO L280 TraceCheckUtils]: 23: Hoare triple {14842#true} havoc ~lk5~0; {14842#true} is VALID [2020-07-11 01:00:40,822 INFO L280 TraceCheckUtils]: 24: Hoare triple {14842#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {14842#true} is VALID [2020-07-11 01:00:40,822 INFO L280 TraceCheckUtils]: 25: Hoare triple {14842#true} ~p6~0 := #t~nondet5; {14842#true} is VALID [2020-07-11 01:00:40,822 INFO L280 TraceCheckUtils]: 26: Hoare triple {14842#true} havoc #t~nondet5; {14842#true} is VALID [2020-07-11 01:00:40,823 INFO L280 TraceCheckUtils]: 27: Hoare triple {14842#true} havoc ~lk6~0; {14842#true} is VALID [2020-07-11 01:00:40,823 INFO L280 TraceCheckUtils]: 28: Hoare triple {14842#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {14842#true} is VALID [2020-07-11 01:00:40,823 INFO L280 TraceCheckUtils]: 29: Hoare triple {14842#true} ~p7~0 := #t~nondet6; {14842#true} is VALID [2020-07-11 01:00:40,823 INFO L280 TraceCheckUtils]: 30: Hoare triple {14842#true} havoc #t~nondet6; {14842#true} is VALID [2020-07-11 01:00:40,823 INFO L280 TraceCheckUtils]: 31: Hoare triple {14842#true} havoc ~lk7~0; {14842#true} is VALID [2020-07-11 01:00:40,824 INFO L280 TraceCheckUtils]: 32: Hoare triple {14842#true} havoc ~cond~0; {14842#true} is VALID [2020-07-11 01:00:40,824 INFO L280 TraceCheckUtils]: 33: Hoare triple {14842#true} assume !false; {14842#true} is VALID [2020-07-11 01:00:40,824 INFO L280 TraceCheckUtils]: 34: Hoare triple {14842#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {14842#true} is VALID [2020-07-11 01:00:40,824 INFO L280 TraceCheckUtils]: 35: Hoare triple {14842#true} ~cond~0 := #t~nondet7; {14842#true} is VALID [2020-07-11 01:00:40,824 INFO L280 TraceCheckUtils]: 36: Hoare triple {14842#true} havoc #t~nondet7; {14842#true} is VALID [2020-07-11 01:00:40,825 INFO L280 TraceCheckUtils]: 37: Hoare triple {14842#true} assume !(0 == ~cond~0); {14842#true} is VALID [2020-07-11 01:00:40,825 INFO L280 TraceCheckUtils]: 38: Hoare triple {14842#true} ~lk1~0 := 0; {14842#true} is VALID [2020-07-11 01:00:40,825 INFO L280 TraceCheckUtils]: 39: Hoare triple {14842#true} ~lk2~0 := 0; {14842#true} is VALID [2020-07-11 01:00:40,825 INFO L280 TraceCheckUtils]: 40: Hoare triple {14842#true} ~lk3~0 := 0; {14842#true} is VALID [2020-07-11 01:00:40,825 INFO L280 TraceCheckUtils]: 41: Hoare triple {14842#true} ~lk4~0 := 0; {14842#true} is VALID [2020-07-11 01:00:40,825 INFO L280 TraceCheckUtils]: 42: Hoare triple {14842#true} ~lk5~0 := 0; {14842#true} is VALID [2020-07-11 01:00:40,826 INFO L280 TraceCheckUtils]: 43: Hoare triple {14842#true} ~lk6~0 := 0; {14842#true} is VALID [2020-07-11 01:00:40,826 INFO L280 TraceCheckUtils]: 44: Hoare triple {14842#true} ~lk7~0 := 0; {14842#true} is VALID [2020-07-11 01:00:40,826 INFO L280 TraceCheckUtils]: 45: Hoare triple {14842#true} assume !(0 != ~p1~0); {14842#true} is VALID [2020-07-11 01:00:40,826 INFO L280 TraceCheckUtils]: 46: Hoare triple {14842#true} assume !(0 != ~p2~0); {14842#true} is VALID [2020-07-11 01:00:40,826 INFO L280 TraceCheckUtils]: 47: Hoare triple {14842#true} assume !(0 != ~p3~0); {14842#true} is VALID [2020-07-11 01:00:40,827 INFO L280 TraceCheckUtils]: 48: Hoare triple {14842#true} assume 0 != ~p4~0; {14842#true} is VALID [2020-07-11 01:00:40,827 INFO L280 TraceCheckUtils]: 49: Hoare triple {14842#true} ~lk4~0 := 1; {14846#(= 1 main_~lk4~0)} is VALID [2020-07-11 01:00:40,828 INFO L280 TraceCheckUtils]: 50: Hoare triple {14846#(= 1 main_~lk4~0)} assume !(0 != ~p5~0); {14846#(= 1 main_~lk4~0)} is VALID [2020-07-11 01:00:40,828 INFO L280 TraceCheckUtils]: 51: Hoare triple {14846#(= 1 main_~lk4~0)} assume !(0 != ~p6~0); {14846#(= 1 main_~lk4~0)} is VALID [2020-07-11 01:00:40,829 INFO L280 TraceCheckUtils]: 52: Hoare triple {14846#(= 1 main_~lk4~0)} assume !(0 != ~p7~0); {14846#(= 1 main_~lk4~0)} is VALID [2020-07-11 01:00:40,829 INFO L280 TraceCheckUtils]: 53: Hoare triple {14846#(= 1 main_~lk4~0)} assume !(0 != ~p1~0); {14846#(= 1 main_~lk4~0)} is VALID [2020-07-11 01:00:40,830 INFO L280 TraceCheckUtils]: 54: Hoare triple {14846#(= 1 main_~lk4~0)} assume !(0 != ~p2~0); {14846#(= 1 main_~lk4~0)} is VALID [2020-07-11 01:00:40,830 INFO L280 TraceCheckUtils]: 55: Hoare triple {14846#(= 1 main_~lk4~0)} assume !(0 != ~p3~0); {14846#(= 1 main_~lk4~0)} is VALID [2020-07-11 01:00:40,831 INFO L280 TraceCheckUtils]: 56: Hoare triple {14846#(= 1 main_~lk4~0)} assume 0 != ~p4~0; {14846#(= 1 main_~lk4~0)} is VALID [2020-07-11 01:00:40,831 INFO L280 TraceCheckUtils]: 57: Hoare triple {14846#(= 1 main_~lk4~0)} assume 1 != ~lk4~0; {14843#false} is VALID [2020-07-11 01:00:40,831 INFO L280 TraceCheckUtils]: 58: Hoare triple {14843#false} assume !false; {14843#false} is VALID [2020-07-11 01:00:40,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 01:00:40,834 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [520116313] [2020-07-11 01:00:40,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:00:40,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:00:40,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682628946] [2020-07-11 01:00:40,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2020-07-11 01:00:40,835 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:00:40,835 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:00:40,899 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:40,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:00:40,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:00:40,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:00:40,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:00:40,900 INFO L87 Difference]: Start difference. First operand 691 states and 906 transitions. Second operand 3 states. [2020-07-11 01:00:42,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:42,607 INFO L93 Difference]: Finished difference Result 839 states and 1100 transitions. [2020-07-11 01:00:42,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:00:42,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2020-07-11 01:00:42,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:00:42,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:42,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2020-07-11 01:00:42,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:42,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2020-07-11 01:00:42,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 147 transitions. [2020-07-11 01:00:42,754 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:42,787 INFO L225 Difference]: With dead ends: 839 [2020-07-11 01:00:42,788 INFO L226 Difference]: Without dead ends: 837 [2020-07-11 01:00:42,788 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11 01:00:42,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2020-07-11 01:00:44,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 691. [2020-07-11 01:00:44,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:00:44,100 INFO L82 GeneralOperation]: Start isEquivalent. First operand 837 states. Second operand 691 states. [2020-07-11 01:00:44,100 INFO L74 IsIncluded]: Start isIncluded. First operand 837 states. Second operand 691 states. [2020-07-11 01:00:44,100 INFO L87 Difference]: Start difference. First operand 837 states. Second operand 691 states. [2020-07-11 01:00:44,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:44,140 INFO L93 Difference]: Finished difference Result 837 states and 1091 transitions. [2020-07-11 01:00:44,140 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1091 transitions. [2020-07-11 01:00:44,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:44,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:44,143 INFO L74 IsIncluded]: Start isIncluded. First operand 691 states. Second operand 837 states. [2020-07-11 01:00:44,143 INFO L87 Difference]: Start difference. First operand 691 states. Second operand 837 states. [2020-07-11 01:00:44,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:44,181 INFO L93 Difference]: Finished difference Result 837 states and 1091 transitions. [2020-07-11 01:00:44,182 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1091 transitions. [2020-07-11 01:00:44,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:44,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:44,184 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:00:44,184 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:00:44,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2020-07-11 01:00:44,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 898 transitions. [2020-07-11 01:00:44,210 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 898 transitions. Word has length 59 [2020-07-11 01:00:44,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:00:44,211 INFO L479 AbstractCegarLoop]: Abstraction has 691 states and 898 transitions. [2020-07-11 01:00:44,211 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:00:44,211 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 691 states and 898 transitions. [2020-07-11 01:00:45,427 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 898 edges. 898 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:45,427 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 898 transitions. [2020-07-11 01:00:45,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-07-11 01:00:45,429 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:00:45,429 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] [2020-07-11 01:00:45,430 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-11 01:00:45,430 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:00:45,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:00:45,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1430933584, now seen corresponding path program 1 times [2020-07-11 01:00:45,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:00:45,432 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [242777994] [2020-07-11 01:00:45,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:00:45,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:45,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:45,488 INFO L280 TraceCheckUtils]: 0: Hoare triple {19583#true} assume true; {19583#true} is VALID [2020-07-11 01:00:45,489 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {19583#true} {19583#true} #199#return; {19583#true} is VALID [2020-07-11 01:00:45,489 INFO L263 TraceCheckUtils]: 0: Hoare triple {19583#true} call ULTIMATE.init(); {19583#true} is VALID [2020-07-11 01:00:45,489 INFO L280 TraceCheckUtils]: 1: Hoare triple {19583#true} assume true; {19583#true} is VALID [2020-07-11 01:00:45,489 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {19583#true} {19583#true} #199#return; {19583#true} is VALID [2020-07-11 01:00:45,490 INFO L263 TraceCheckUtils]: 3: Hoare triple {19583#true} call #t~ret8 := main(); {19583#true} is VALID [2020-07-11 01:00:45,490 INFO L280 TraceCheckUtils]: 4: Hoare triple {19583#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {19583#true} is VALID [2020-07-11 01:00:45,490 INFO L280 TraceCheckUtils]: 5: Hoare triple {19583#true} ~p1~0 := #t~nondet0; {19583#true} is VALID [2020-07-11 01:00:45,490 INFO L280 TraceCheckUtils]: 6: Hoare triple {19583#true} havoc #t~nondet0; {19583#true} is VALID [2020-07-11 01:00:45,490 INFO L280 TraceCheckUtils]: 7: Hoare triple {19583#true} havoc ~lk1~0; {19583#true} is VALID [2020-07-11 01:00:45,491 INFO L280 TraceCheckUtils]: 8: Hoare triple {19583#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {19583#true} is VALID [2020-07-11 01:00:45,491 INFO L280 TraceCheckUtils]: 9: Hoare triple {19583#true} ~p2~0 := #t~nondet1; {19583#true} is VALID [2020-07-11 01:00:45,491 INFO L280 TraceCheckUtils]: 10: Hoare triple {19583#true} havoc #t~nondet1; {19583#true} is VALID [2020-07-11 01:00:45,491 INFO L280 TraceCheckUtils]: 11: Hoare triple {19583#true} havoc ~lk2~0; {19583#true} is VALID [2020-07-11 01:00:45,491 INFO L280 TraceCheckUtils]: 12: Hoare triple {19583#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {19583#true} is VALID [2020-07-11 01:00:45,492 INFO L280 TraceCheckUtils]: 13: Hoare triple {19583#true} ~p3~0 := #t~nondet2; {19583#true} is VALID [2020-07-11 01:00:45,492 INFO L280 TraceCheckUtils]: 14: Hoare triple {19583#true} havoc #t~nondet2; {19583#true} is VALID [2020-07-11 01:00:45,492 INFO L280 TraceCheckUtils]: 15: Hoare triple {19583#true} havoc ~lk3~0; {19583#true} is VALID [2020-07-11 01:00:45,492 INFO L280 TraceCheckUtils]: 16: Hoare triple {19583#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {19583#true} is VALID [2020-07-11 01:00:45,492 INFO L280 TraceCheckUtils]: 17: Hoare triple {19583#true} ~p4~0 := #t~nondet3; {19583#true} is VALID [2020-07-11 01:00:45,492 INFO L280 TraceCheckUtils]: 18: Hoare triple {19583#true} havoc #t~nondet3; {19583#true} is VALID [2020-07-11 01:00:45,493 INFO L280 TraceCheckUtils]: 19: Hoare triple {19583#true} havoc ~lk4~0; {19583#true} is VALID [2020-07-11 01:00:45,493 INFO L280 TraceCheckUtils]: 20: Hoare triple {19583#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {19583#true} is VALID [2020-07-11 01:00:45,493 INFO L280 TraceCheckUtils]: 21: Hoare triple {19583#true} ~p5~0 := #t~nondet4; {19583#true} is VALID [2020-07-11 01:00:45,493 INFO L280 TraceCheckUtils]: 22: Hoare triple {19583#true} havoc #t~nondet4; {19583#true} is VALID [2020-07-11 01:00:45,493 INFO L280 TraceCheckUtils]: 23: Hoare triple {19583#true} havoc ~lk5~0; {19583#true} is VALID [2020-07-11 01:00:45,494 INFO L280 TraceCheckUtils]: 24: Hoare triple {19583#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {19583#true} is VALID [2020-07-11 01:00:45,494 INFO L280 TraceCheckUtils]: 25: Hoare triple {19583#true} ~p6~0 := #t~nondet5; {19583#true} is VALID [2020-07-11 01:00:45,494 INFO L280 TraceCheckUtils]: 26: Hoare triple {19583#true} havoc #t~nondet5; {19583#true} is VALID [2020-07-11 01:00:45,495 INFO L280 TraceCheckUtils]: 27: Hoare triple {19583#true} havoc ~lk6~0; {19583#true} is VALID [2020-07-11 01:00:45,495 INFO L280 TraceCheckUtils]: 28: Hoare triple {19583#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {19583#true} is VALID [2020-07-11 01:00:45,495 INFO L280 TraceCheckUtils]: 29: Hoare triple {19583#true} ~p7~0 := #t~nondet6; {19583#true} is VALID [2020-07-11 01:00:45,496 INFO L280 TraceCheckUtils]: 30: Hoare triple {19583#true} havoc #t~nondet6; {19583#true} is VALID [2020-07-11 01:00:45,496 INFO L280 TraceCheckUtils]: 31: Hoare triple {19583#true} havoc ~lk7~0; {19583#true} is VALID [2020-07-11 01:00:45,496 INFO L280 TraceCheckUtils]: 32: Hoare triple {19583#true} havoc ~cond~0; {19583#true} is VALID [2020-07-11 01:00:45,496 INFO L280 TraceCheckUtils]: 33: Hoare triple {19583#true} assume !false; {19583#true} is VALID [2020-07-11 01:00:45,497 INFO L280 TraceCheckUtils]: 34: Hoare triple {19583#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {19583#true} is VALID [2020-07-11 01:00:45,497 INFO L280 TraceCheckUtils]: 35: Hoare triple {19583#true} ~cond~0 := #t~nondet7; {19583#true} is VALID [2020-07-11 01:00:45,497 INFO L280 TraceCheckUtils]: 36: Hoare triple {19583#true} havoc #t~nondet7; {19583#true} is VALID [2020-07-11 01:00:45,497 INFO L280 TraceCheckUtils]: 37: Hoare triple {19583#true} assume !(0 == ~cond~0); {19583#true} is VALID [2020-07-11 01:00:45,497 INFO L280 TraceCheckUtils]: 38: Hoare triple {19583#true} ~lk1~0 := 0; {19583#true} is VALID [2020-07-11 01:00:45,498 INFO L280 TraceCheckUtils]: 39: Hoare triple {19583#true} ~lk2~0 := 0; {19583#true} is VALID [2020-07-11 01:00:45,498 INFO L280 TraceCheckUtils]: 40: Hoare triple {19583#true} ~lk3~0 := 0; {19583#true} is VALID [2020-07-11 01:00:45,498 INFO L280 TraceCheckUtils]: 41: Hoare triple {19583#true} ~lk4~0 := 0; {19583#true} is VALID [2020-07-11 01:00:45,498 INFO L280 TraceCheckUtils]: 42: Hoare triple {19583#true} ~lk5~0 := 0; {19583#true} is VALID [2020-07-11 01:00:45,499 INFO L280 TraceCheckUtils]: 43: Hoare triple {19583#true} ~lk6~0 := 0; {19583#true} is VALID [2020-07-11 01:00:45,499 INFO L280 TraceCheckUtils]: 44: Hoare triple {19583#true} ~lk7~0 := 0; {19583#true} is VALID [2020-07-11 01:00:45,499 INFO L280 TraceCheckUtils]: 45: Hoare triple {19583#true} assume !(0 != ~p1~0); {19583#true} is VALID [2020-07-11 01:00:45,500 INFO L280 TraceCheckUtils]: 46: Hoare triple {19583#true} assume !(0 != ~p2~0); {19583#true} is VALID [2020-07-11 01:00:45,500 INFO L280 TraceCheckUtils]: 47: Hoare triple {19583#true} assume !(0 != ~p3~0); {19583#true} is VALID [2020-07-11 01:00:45,500 INFO L280 TraceCheckUtils]: 48: Hoare triple {19583#true} assume !(0 != ~p4~0); {19583#true} is VALID [2020-07-11 01:00:45,501 INFO L280 TraceCheckUtils]: 49: Hoare triple {19583#true} assume !(0 != ~p5~0); {19587#(= 0 main_~p5~0)} is VALID [2020-07-11 01:00:45,502 INFO L280 TraceCheckUtils]: 50: Hoare triple {19587#(= 0 main_~p5~0)} assume !(0 != ~p6~0); {19587#(= 0 main_~p5~0)} is VALID [2020-07-11 01:00:45,503 INFO L280 TraceCheckUtils]: 51: Hoare triple {19587#(= 0 main_~p5~0)} assume !(0 != ~p7~0); {19587#(= 0 main_~p5~0)} is VALID [2020-07-11 01:00:45,503 INFO L280 TraceCheckUtils]: 52: Hoare triple {19587#(= 0 main_~p5~0)} assume !(0 != ~p1~0); {19587#(= 0 main_~p5~0)} is VALID [2020-07-11 01:00:45,504 INFO L280 TraceCheckUtils]: 53: Hoare triple {19587#(= 0 main_~p5~0)} assume !(0 != ~p2~0); {19587#(= 0 main_~p5~0)} is VALID [2020-07-11 01:00:45,504 INFO L280 TraceCheckUtils]: 54: Hoare triple {19587#(= 0 main_~p5~0)} assume !(0 != ~p3~0); {19587#(= 0 main_~p5~0)} is VALID [2020-07-11 01:00:45,505 INFO L280 TraceCheckUtils]: 55: Hoare triple {19587#(= 0 main_~p5~0)} assume !(0 != ~p4~0); {19587#(= 0 main_~p5~0)} is VALID [2020-07-11 01:00:45,506 INFO L280 TraceCheckUtils]: 56: Hoare triple {19587#(= 0 main_~p5~0)} assume 0 != ~p5~0; {19584#false} is VALID [2020-07-11 01:00:45,506 INFO L280 TraceCheckUtils]: 57: Hoare triple {19584#false} assume 1 != ~lk5~0; {19584#false} is VALID [2020-07-11 01:00:45,506 INFO L280 TraceCheckUtils]: 58: Hoare triple {19584#false} assume !false; {19584#false} is VALID [2020-07-11 01:00:45,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 01:00:45,511 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [242777994] [2020-07-11 01:00:45,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:00:45,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:00:45,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734424493] [2020-07-11 01:00:45,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2020-07-11 01:00:45,513 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:00:45,513 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:00:45,578 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:45,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:00:45,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:00:45,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:00:45,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:00:45,580 INFO L87 Difference]: Start difference. First operand 691 states and 898 transitions. Second operand 3 states. [2020-07-11 01:00:49,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:49,277 INFO L93 Difference]: Finished difference Result 1959 states and 2564 transitions. [2020-07-11 01:00:49,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:00:49,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2020-07-11 01:00:49,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:00:49,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:49,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2020-07-11 01:00:49,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:49,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2020-07-11 01:00:49,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 224 transitions. [2020-07-11 01:00:49,502 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 224 edges. 224 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:49,595 INFO L225 Difference]: With dead ends: 1959 [2020-07-11 01:00:49,595 INFO L226 Difference]: Without dead ends: 1301 [2020-07-11 01:00:49,597 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11 01:00:49,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2020-07-11 01:00:52,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 1299. [2020-07-11 01:00:52,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:00:52,205 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1301 states. Second operand 1299 states. [2020-07-11 01:00:52,206 INFO L74 IsIncluded]: Start isIncluded. First operand 1301 states. Second operand 1299 states. [2020-07-11 01:00:52,206 INFO L87 Difference]: Start difference. First operand 1301 states. Second operand 1299 states. [2020-07-11 01:00:52,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:52,260 INFO L93 Difference]: Finished difference Result 1301 states and 1667 transitions. [2020-07-11 01:00:52,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1301 states and 1667 transitions. [2020-07-11 01:00:52,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:52,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:52,263 INFO L74 IsIncluded]: Start isIncluded. First operand 1299 states. Second operand 1301 states. [2020-07-11 01:00:52,263 INFO L87 Difference]: Start difference. First operand 1299 states. Second operand 1301 states. [2020-07-11 01:00:52,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:52,321 INFO L93 Difference]: Finished difference Result 1301 states and 1667 transitions. [2020-07-11 01:00:52,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1301 states and 1667 transitions. [2020-07-11 01:00:52,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:00:52,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:00:52,324 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:00:52,324 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:00:52,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1299 states. [2020-07-11 01:00:52,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 1299 states and 1666 transitions. [2020-07-11 01:00:52,409 INFO L78 Accepts]: Start accepts. Automaton has 1299 states and 1666 transitions. Word has length 59 [2020-07-11 01:00:52,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:00:52,409 INFO L479 AbstractCegarLoop]: Abstraction has 1299 states and 1666 transitions. [2020-07-11 01:00:52,409 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:00:52,409 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 1299 states and 1666 transitions. [2020-07-11 01:00:54,500 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 1666 edges. 1666 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:54,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 1666 transitions. [2020-07-11 01:00:54,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-07-11 01:00:54,503 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:00:54,503 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] [2020-07-11 01:00:54,503 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-11 01:00:54,503 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:00:54,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:00:54,504 INFO L82 PathProgramCache]: Analyzing trace with hash -631232587, now seen corresponding path program 1 times [2020-07-11 01:00:54,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:00:54,504 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1692039220] [2020-07-11 01:00:54,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:00:54,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:54,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:00:54,552 INFO L280 TraceCheckUtils]: 0: Hoare triple {28708#true} assume true; {28708#true} is VALID [2020-07-11 01:00:54,553 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {28708#true} {28708#true} #199#return; {28708#true} is VALID [2020-07-11 01:00:54,553 INFO L263 TraceCheckUtils]: 0: Hoare triple {28708#true} call ULTIMATE.init(); {28708#true} is VALID [2020-07-11 01:00:54,553 INFO L280 TraceCheckUtils]: 1: Hoare triple {28708#true} assume true; {28708#true} is VALID [2020-07-11 01:00:54,553 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {28708#true} {28708#true} #199#return; {28708#true} is VALID [2020-07-11 01:00:54,554 INFO L263 TraceCheckUtils]: 3: Hoare triple {28708#true} call #t~ret8 := main(); {28708#true} is VALID [2020-07-11 01:00:54,554 INFO L280 TraceCheckUtils]: 4: Hoare triple {28708#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {28708#true} is VALID [2020-07-11 01:00:54,554 INFO L280 TraceCheckUtils]: 5: Hoare triple {28708#true} ~p1~0 := #t~nondet0; {28708#true} is VALID [2020-07-11 01:00:54,554 INFO L280 TraceCheckUtils]: 6: Hoare triple {28708#true} havoc #t~nondet0; {28708#true} is VALID [2020-07-11 01:00:54,554 INFO L280 TraceCheckUtils]: 7: Hoare triple {28708#true} havoc ~lk1~0; {28708#true} is VALID [2020-07-11 01:00:54,554 INFO L280 TraceCheckUtils]: 8: Hoare triple {28708#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {28708#true} is VALID [2020-07-11 01:00:54,555 INFO L280 TraceCheckUtils]: 9: Hoare triple {28708#true} ~p2~0 := #t~nondet1; {28708#true} is VALID [2020-07-11 01:00:54,555 INFO L280 TraceCheckUtils]: 10: Hoare triple {28708#true} havoc #t~nondet1; {28708#true} is VALID [2020-07-11 01:00:54,555 INFO L280 TraceCheckUtils]: 11: Hoare triple {28708#true} havoc ~lk2~0; {28708#true} is VALID [2020-07-11 01:00:54,555 INFO L280 TraceCheckUtils]: 12: Hoare triple {28708#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {28708#true} is VALID [2020-07-11 01:00:54,555 INFO L280 TraceCheckUtils]: 13: Hoare triple {28708#true} ~p3~0 := #t~nondet2; {28708#true} is VALID [2020-07-11 01:00:54,556 INFO L280 TraceCheckUtils]: 14: Hoare triple {28708#true} havoc #t~nondet2; {28708#true} is VALID [2020-07-11 01:00:54,556 INFO L280 TraceCheckUtils]: 15: Hoare triple {28708#true} havoc ~lk3~0; {28708#true} is VALID [2020-07-11 01:00:54,556 INFO L280 TraceCheckUtils]: 16: Hoare triple {28708#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {28708#true} is VALID [2020-07-11 01:00:54,556 INFO L280 TraceCheckUtils]: 17: Hoare triple {28708#true} ~p4~0 := #t~nondet3; {28708#true} is VALID [2020-07-11 01:00:54,556 INFO L280 TraceCheckUtils]: 18: Hoare triple {28708#true} havoc #t~nondet3; {28708#true} is VALID [2020-07-11 01:00:54,557 INFO L280 TraceCheckUtils]: 19: Hoare triple {28708#true} havoc ~lk4~0; {28708#true} is VALID [2020-07-11 01:00:54,557 INFO L280 TraceCheckUtils]: 20: Hoare triple {28708#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {28708#true} is VALID [2020-07-11 01:00:54,557 INFO L280 TraceCheckUtils]: 21: Hoare triple {28708#true} ~p5~0 := #t~nondet4; {28708#true} is VALID [2020-07-11 01:00:54,557 INFO L280 TraceCheckUtils]: 22: Hoare triple {28708#true} havoc #t~nondet4; {28708#true} is VALID [2020-07-11 01:00:54,557 INFO L280 TraceCheckUtils]: 23: Hoare triple {28708#true} havoc ~lk5~0; {28708#true} is VALID [2020-07-11 01:00:54,557 INFO L280 TraceCheckUtils]: 24: Hoare triple {28708#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {28708#true} is VALID [2020-07-11 01:00:54,558 INFO L280 TraceCheckUtils]: 25: Hoare triple {28708#true} ~p6~0 := #t~nondet5; {28708#true} is VALID [2020-07-11 01:00:54,558 INFO L280 TraceCheckUtils]: 26: Hoare triple {28708#true} havoc #t~nondet5; {28708#true} is VALID [2020-07-11 01:00:54,558 INFO L280 TraceCheckUtils]: 27: Hoare triple {28708#true} havoc ~lk6~0; {28708#true} is VALID [2020-07-11 01:00:54,558 INFO L280 TraceCheckUtils]: 28: Hoare triple {28708#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {28708#true} is VALID [2020-07-11 01:00:54,558 INFO L280 TraceCheckUtils]: 29: Hoare triple {28708#true} ~p7~0 := #t~nondet6; {28708#true} is VALID [2020-07-11 01:00:54,559 INFO L280 TraceCheckUtils]: 30: Hoare triple {28708#true} havoc #t~nondet6; {28708#true} is VALID [2020-07-11 01:00:54,559 INFO L280 TraceCheckUtils]: 31: Hoare triple {28708#true} havoc ~lk7~0; {28708#true} is VALID [2020-07-11 01:00:54,559 INFO L280 TraceCheckUtils]: 32: Hoare triple {28708#true} havoc ~cond~0; {28708#true} is VALID [2020-07-11 01:00:54,559 INFO L280 TraceCheckUtils]: 33: Hoare triple {28708#true} assume !false; {28708#true} is VALID [2020-07-11 01:00:54,559 INFO L280 TraceCheckUtils]: 34: Hoare triple {28708#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {28708#true} is VALID [2020-07-11 01:00:54,559 INFO L280 TraceCheckUtils]: 35: Hoare triple {28708#true} ~cond~0 := #t~nondet7; {28708#true} is VALID [2020-07-11 01:00:54,560 INFO L280 TraceCheckUtils]: 36: Hoare triple {28708#true} havoc #t~nondet7; {28708#true} is VALID [2020-07-11 01:00:54,560 INFO L280 TraceCheckUtils]: 37: Hoare triple {28708#true} assume !(0 == ~cond~0); {28708#true} is VALID [2020-07-11 01:00:54,560 INFO L280 TraceCheckUtils]: 38: Hoare triple {28708#true} ~lk1~0 := 0; {28708#true} is VALID [2020-07-11 01:00:54,560 INFO L280 TraceCheckUtils]: 39: Hoare triple {28708#true} ~lk2~0 := 0; {28708#true} is VALID [2020-07-11 01:00:54,560 INFO L280 TraceCheckUtils]: 40: Hoare triple {28708#true} ~lk3~0 := 0; {28708#true} is VALID [2020-07-11 01:00:54,560 INFO L280 TraceCheckUtils]: 41: Hoare triple {28708#true} ~lk4~0 := 0; {28708#true} is VALID [2020-07-11 01:00:54,561 INFO L280 TraceCheckUtils]: 42: Hoare triple {28708#true} ~lk5~0 := 0; {28708#true} is VALID [2020-07-11 01:00:54,561 INFO L280 TraceCheckUtils]: 43: Hoare triple {28708#true} ~lk6~0 := 0; {28708#true} is VALID [2020-07-11 01:00:54,561 INFO L280 TraceCheckUtils]: 44: Hoare triple {28708#true} ~lk7~0 := 0; {28708#true} is VALID [2020-07-11 01:00:54,561 INFO L280 TraceCheckUtils]: 45: Hoare triple {28708#true} assume !(0 != ~p1~0); {28708#true} is VALID [2020-07-11 01:00:54,561 INFO L280 TraceCheckUtils]: 46: Hoare triple {28708#true} assume !(0 != ~p2~0); {28708#true} is VALID [2020-07-11 01:00:54,562 INFO L280 TraceCheckUtils]: 47: Hoare triple {28708#true} assume !(0 != ~p3~0); {28708#true} is VALID [2020-07-11 01:00:54,562 INFO L280 TraceCheckUtils]: 48: Hoare triple {28708#true} assume !(0 != ~p4~0); {28708#true} is VALID [2020-07-11 01:00:54,562 INFO L280 TraceCheckUtils]: 49: Hoare triple {28708#true} assume 0 != ~p5~0; {28708#true} is VALID [2020-07-11 01:00:54,562 INFO L280 TraceCheckUtils]: 50: Hoare triple {28708#true} ~lk5~0 := 1; {28712#(= 1 main_~lk5~0)} is VALID [2020-07-11 01:00:54,563 INFO L280 TraceCheckUtils]: 51: Hoare triple {28712#(= 1 main_~lk5~0)} assume !(0 != ~p6~0); {28712#(= 1 main_~lk5~0)} is VALID [2020-07-11 01:00:54,563 INFO L280 TraceCheckUtils]: 52: Hoare triple {28712#(= 1 main_~lk5~0)} assume !(0 != ~p7~0); {28712#(= 1 main_~lk5~0)} is VALID [2020-07-11 01:00:54,564 INFO L280 TraceCheckUtils]: 53: Hoare triple {28712#(= 1 main_~lk5~0)} assume !(0 != ~p1~0); {28712#(= 1 main_~lk5~0)} is VALID [2020-07-11 01:00:54,564 INFO L280 TraceCheckUtils]: 54: Hoare triple {28712#(= 1 main_~lk5~0)} assume !(0 != ~p2~0); {28712#(= 1 main_~lk5~0)} is VALID [2020-07-11 01:00:54,565 INFO L280 TraceCheckUtils]: 55: Hoare triple {28712#(= 1 main_~lk5~0)} assume !(0 != ~p3~0); {28712#(= 1 main_~lk5~0)} is VALID [2020-07-11 01:00:54,565 INFO L280 TraceCheckUtils]: 56: Hoare triple {28712#(= 1 main_~lk5~0)} assume !(0 != ~p4~0); {28712#(= 1 main_~lk5~0)} is VALID [2020-07-11 01:00:54,566 INFO L280 TraceCheckUtils]: 57: Hoare triple {28712#(= 1 main_~lk5~0)} assume 0 != ~p5~0; {28712#(= 1 main_~lk5~0)} is VALID [2020-07-11 01:00:54,566 INFO L280 TraceCheckUtils]: 58: Hoare triple {28712#(= 1 main_~lk5~0)} assume 1 != ~lk5~0; {28709#false} is VALID [2020-07-11 01:00:54,566 INFO L280 TraceCheckUtils]: 59: Hoare triple {28709#false} assume !false; {28709#false} is VALID [2020-07-11 01:00:54,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 01:00:54,569 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1692039220] [2020-07-11 01:00:54,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:00:54,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:00:54,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352741407] [2020-07-11 01:00:54,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2020-07-11 01:00:54,570 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:00:54,571 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:00:54,613 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:54,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:00:54,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:00:54,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:00:54,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:00:54,614 INFO L87 Difference]: Start difference. First operand 1299 states and 1666 transitions. Second operand 3 states. [2020-07-11 01:00:58,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:00:58,202 INFO L93 Difference]: Finished difference Result 1559 states and 1988 transitions. [2020-07-11 01:00:58,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:00:58,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2020-07-11 01:00:58,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:00:58,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:58,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2020-07-11 01:00:58,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:00:58,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2020-07-11 01:00:58,206 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 143 transitions. [2020-07-11 01:00:58,337 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:00:58,427 INFO L225 Difference]: With dead ends: 1559 [2020-07-11 01:00:58,428 INFO L226 Difference]: Without dead ends: 1557 [2020-07-11 01:00:58,428 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11 01:00:58,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557 states. [2020-07-11 01:01:01,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557 to 1299. [2020-07-11 01:01:01,388 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:01:01,388 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1557 states. Second operand 1299 states. [2020-07-11 01:01:01,389 INFO L74 IsIncluded]: Start isIncluded. First operand 1557 states. Second operand 1299 states. [2020-07-11 01:01:01,389 INFO L87 Difference]: Start difference. First operand 1557 states. Second operand 1299 states. [2020-07-11 01:01:01,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:01:01,471 INFO L93 Difference]: Finished difference Result 1557 states and 1971 transitions. [2020-07-11 01:01:01,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 1971 transitions. [2020-07-11 01:01:01,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:01:01,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:01:01,473 INFO L74 IsIncluded]: Start isIncluded. First operand 1299 states. Second operand 1557 states. [2020-07-11 01:01:01,473 INFO L87 Difference]: Start difference. First operand 1299 states. Second operand 1557 states. [2020-07-11 01:01:01,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:01:01,564 INFO L93 Difference]: Finished difference Result 1557 states and 1971 transitions. [2020-07-11 01:01:01,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 1971 transitions. [2020-07-11 01:01:01,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:01:01,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:01:01,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:01:01,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:01:01,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1299 states. [2020-07-11 01:01:01,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 1299 states and 1650 transitions. [2020-07-11 01:01:01,620 INFO L78 Accepts]: Start accepts. Automaton has 1299 states and 1650 transitions. Word has length 60 [2020-07-11 01:01:01,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:01:01,620 INFO L479 AbstractCegarLoop]: Abstraction has 1299 states and 1650 transitions. [2020-07-11 01:01:01,620 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:01:01,620 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 1299 states and 1650 transitions. [2020-07-11 01:01:03,818 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 1650 edges. 1650 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:01:03,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 1650 transitions. [2020-07-11 01:01:03,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-07-11 01:01:03,820 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:01:03,820 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] [2020-07-11 01:01:03,821 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-11 01:01:03,821 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:01:03,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:01:03,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1409021686, now seen corresponding path program 1 times [2020-07-11 01:01:03,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:01:03,824 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1104613277] [2020-07-11 01:01:03,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:01:03,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:01:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:01:03,852 INFO L280 TraceCheckUtils]: 0: Hoare triple {37545#true} assume true; {37545#true} is VALID [2020-07-11 01:01:03,852 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {37545#true} {37545#true} #199#return; {37545#true} is VALID [2020-07-11 01:01:03,853 INFO L263 TraceCheckUtils]: 0: Hoare triple {37545#true} call ULTIMATE.init(); {37545#true} is VALID [2020-07-11 01:01:03,853 INFO L280 TraceCheckUtils]: 1: Hoare triple {37545#true} assume true; {37545#true} is VALID [2020-07-11 01:01:03,853 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {37545#true} {37545#true} #199#return; {37545#true} is VALID [2020-07-11 01:01:03,853 INFO L263 TraceCheckUtils]: 3: Hoare triple {37545#true} call #t~ret8 := main(); {37545#true} is VALID [2020-07-11 01:01:03,853 INFO L280 TraceCheckUtils]: 4: Hoare triple {37545#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {37545#true} is VALID [2020-07-11 01:01:03,854 INFO L280 TraceCheckUtils]: 5: Hoare triple {37545#true} ~p1~0 := #t~nondet0; {37545#true} is VALID [2020-07-11 01:01:03,854 INFO L280 TraceCheckUtils]: 6: Hoare triple {37545#true} havoc #t~nondet0; {37545#true} is VALID [2020-07-11 01:01:03,854 INFO L280 TraceCheckUtils]: 7: Hoare triple {37545#true} havoc ~lk1~0; {37545#true} is VALID [2020-07-11 01:01:03,854 INFO L280 TraceCheckUtils]: 8: Hoare triple {37545#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {37545#true} is VALID [2020-07-11 01:01:03,854 INFO L280 TraceCheckUtils]: 9: Hoare triple {37545#true} ~p2~0 := #t~nondet1; {37545#true} is VALID [2020-07-11 01:01:03,854 INFO L280 TraceCheckUtils]: 10: Hoare triple {37545#true} havoc #t~nondet1; {37545#true} is VALID [2020-07-11 01:01:03,855 INFO L280 TraceCheckUtils]: 11: Hoare triple {37545#true} havoc ~lk2~0; {37545#true} is VALID [2020-07-11 01:01:03,855 INFO L280 TraceCheckUtils]: 12: Hoare triple {37545#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {37545#true} is VALID [2020-07-11 01:01:03,855 INFO L280 TraceCheckUtils]: 13: Hoare triple {37545#true} ~p3~0 := #t~nondet2; {37545#true} is VALID [2020-07-11 01:01:03,855 INFO L280 TraceCheckUtils]: 14: Hoare triple {37545#true} havoc #t~nondet2; {37545#true} is VALID [2020-07-11 01:01:03,855 INFO L280 TraceCheckUtils]: 15: Hoare triple {37545#true} havoc ~lk3~0; {37545#true} is VALID [2020-07-11 01:01:03,856 INFO L280 TraceCheckUtils]: 16: Hoare triple {37545#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {37545#true} is VALID [2020-07-11 01:01:03,856 INFO L280 TraceCheckUtils]: 17: Hoare triple {37545#true} ~p4~0 := #t~nondet3; {37545#true} is VALID [2020-07-11 01:01:03,856 INFO L280 TraceCheckUtils]: 18: Hoare triple {37545#true} havoc #t~nondet3; {37545#true} is VALID [2020-07-11 01:01:03,856 INFO L280 TraceCheckUtils]: 19: Hoare triple {37545#true} havoc ~lk4~0; {37545#true} is VALID [2020-07-11 01:01:03,856 INFO L280 TraceCheckUtils]: 20: Hoare triple {37545#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {37545#true} is VALID [2020-07-11 01:01:03,856 INFO L280 TraceCheckUtils]: 21: Hoare triple {37545#true} ~p5~0 := #t~nondet4; {37545#true} is VALID [2020-07-11 01:01:03,857 INFO L280 TraceCheckUtils]: 22: Hoare triple {37545#true} havoc #t~nondet4; {37545#true} is VALID [2020-07-11 01:01:03,857 INFO L280 TraceCheckUtils]: 23: Hoare triple {37545#true} havoc ~lk5~0; {37545#true} is VALID [2020-07-11 01:01:03,857 INFO L280 TraceCheckUtils]: 24: Hoare triple {37545#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {37545#true} is VALID [2020-07-11 01:01:03,857 INFO L280 TraceCheckUtils]: 25: Hoare triple {37545#true} ~p6~0 := #t~nondet5; {37545#true} is VALID [2020-07-11 01:01:03,857 INFO L280 TraceCheckUtils]: 26: Hoare triple {37545#true} havoc #t~nondet5; {37545#true} is VALID [2020-07-11 01:01:03,858 INFO L280 TraceCheckUtils]: 27: Hoare triple {37545#true} havoc ~lk6~0; {37545#true} is VALID [2020-07-11 01:01:03,858 INFO L280 TraceCheckUtils]: 28: Hoare triple {37545#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {37545#true} is VALID [2020-07-11 01:01:03,858 INFO L280 TraceCheckUtils]: 29: Hoare triple {37545#true} ~p7~0 := #t~nondet6; {37545#true} is VALID [2020-07-11 01:01:03,858 INFO L280 TraceCheckUtils]: 30: Hoare triple {37545#true} havoc #t~nondet6; {37545#true} is VALID [2020-07-11 01:01:03,858 INFO L280 TraceCheckUtils]: 31: Hoare triple {37545#true} havoc ~lk7~0; {37545#true} is VALID [2020-07-11 01:01:03,858 INFO L280 TraceCheckUtils]: 32: Hoare triple {37545#true} havoc ~cond~0; {37545#true} is VALID [2020-07-11 01:01:03,859 INFO L280 TraceCheckUtils]: 33: Hoare triple {37545#true} assume !false; {37545#true} is VALID [2020-07-11 01:01:03,859 INFO L280 TraceCheckUtils]: 34: Hoare triple {37545#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {37545#true} is VALID [2020-07-11 01:01:03,859 INFO L280 TraceCheckUtils]: 35: Hoare triple {37545#true} ~cond~0 := #t~nondet7; {37545#true} is VALID [2020-07-11 01:01:03,859 INFO L280 TraceCheckUtils]: 36: Hoare triple {37545#true} havoc #t~nondet7; {37545#true} is VALID [2020-07-11 01:01:03,859 INFO L280 TraceCheckUtils]: 37: Hoare triple {37545#true} assume !(0 == ~cond~0); {37545#true} is VALID [2020-07-11 01:01:03,860 INFO L280 TraceCheckUtils]: 38: Hoare triple {37545#true} ~lk1~0 := 0; {37545#true} is VALID [2020-07-11 01:01:03,860 INFO L280 TraceCheckUtils]: 39: Hoare triple {37545#true} ~lk2~0 := 0; {37545#true} is VALID [2020-07-11 01:01:03,860 INFO L280 TraceCheckUtils]: 40: Hoare triple {37545#true} ~lk3~0 := 0; {37545#true} is VALID [2020-07-11 01:01:03,860 INFO L280 TraceCheckUtils]: 41: Hoare triple {37545#true} ~lk4~0 := 0; {37545#true} is VALID [2020-07-11 01:01:03,860 INFO L280 TraceCheckUtils]: 42: Hoare triple {37545#true} ~lk5~0 := 0; {37545#true} is VALID [2020-07-11 01:01:03,860 INFO L280 TraceCheckUtils]: 43: Hoare triple {37545#true} ~lk6~0 := 0; {37545#true} is VALID [2020-07-11 01:01:03,861 INFO L280 TraceCheckUtils]: 44: Hoare triple {37545#true} ~lk7~0 := 0; {37545#true} is VALID [2020-07-11 01:01:03,861 INFO L280 TraceCheckUtils]: 45: Hoare triple {37545#true} assume !(0 != ~p1~0); {37545#true} is VALID [2020-07-11 01:01:03,861 INFO L280 TraceCheckUtils]: 46: Hoare triple {37545#true} assume !(0 != ~p2~0); {37545#true} is VALID [2020-07-11 01:01:03,861 INFO L280 TraceCheckUtils]: 47: Hoare triple {37545#true} assume !(0 != ~p3~0); {37545#true} is VALID [2020-07-11 01:01:03,861 INFO L280 TraceCheckUtils]: 48: Hoare triple {37545#true} assume !(0 != ~p4~0); {37545#true} is VALID [2020-07-11 01:01:03,862 INFO L280 TraceCheckUtils]: 49: Hoare triple {37545#true} assume !(0 != ~p5~0); {37545#true} is VALID [2020-07-11 01:01:03,862 INFO L280 TraceCheckUtils]: 50: Hoare triple {37545#true} assume !(0 != ~p6~0); {37549#(= 0 main_~p6~0)} is VALID [2020-07-11 01:01:03,863 INFO L280 TraceCheckUtils]: 51: Hoare triple {37549#(= 0 main_~p6~0)} assume !(0 != ~p7~0); {37549#(= 0 main_~p6~0)} is VALID [2020-07-11 01:01:03,863 INFO L280 TraceCheckUtils]: 52: Hoare triple {37549#(= 0 main_~p6~0)} assume !(0 != ~p1~0); {37549#(= 0 main_~p6~0)} is VALID [2020-07-11 01:01:03,864 INFO L280 TraceCheckUtils]: 53: Hoare triple {37549#(= 0 main_~p6~0)} assume !(0 != ~p2~0); {37549#(= 0 main_~p6~0)} is VALID [2020-07-11 01:01:03,864 INFO L280 TraceCheckUtils]: 54: Hoare triple {37549#(= 0 main_~p6~0)} assume !(0 != ~p3~0); {37549#(= 0 main_~p6~0)} is VALID [2020-07-11 01:01:03,865 INFO L280 TraceCheckUtils]: 55: Hoare triple {37549#(= 0 main_~p6~0)} assume !(0 != ~p4~0); {37549#(= 0 main_~p6~0)} is VALID [2020-07-11 01:01:03,865 INFO L280 TraceCheckUtils]: 56: Hoare triple {37549#(= 0 main_~p6~0)} assume !(0 != ~p5~0); {37549#(= 0 main_~p6~0)} is VALID [2020-07-11 01:01:03,866 INFO L280 TraceCheckUtils]: 57: Hoare triple {37549#(= 0 main_~p6~0)} assume 0 != ~p6~0; {37546#false} is VALID [2020-07-11 01:01:03,866 INFO L280 TraceCheckUtils]: 58: Hoare triple {37546#false} assume 1 != ~lk6~0; {37546#false} is VALID [2020-07-11 01:01:03,867 INFO L280 TraceCheckUtils]: 59: Hoare triple {37546#false} assume !false; {37546#false} is VALID [2020-07-11 01:01:03,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 01:01:03,869 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1104613277] [2020-07-11 01:01:03,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:01:03,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:01:03,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421003624] [2020-07-11 01:01:03,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2020-07-11 01:01:03,870 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:01:03,870 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:01:03,930 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:01:03,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:01:03,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:01:03,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:01:03,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:01:03,931 INFO L87 Difference]: Start difference. First operand 1299 states and 1650 transitions. Second operand 3 states. [2020-07-11 01:01:11,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:01:11,006 INFO L93 Difference]: Finished difference Result 3735 states and 4756 transitions. [2020-07-11 01:01:11,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:01:11,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2020-07-11 01:01:11,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:01:11,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:01:11,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 221 transitions. [2020-07-11 01:01:11,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:01:11,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 221 transitions. [2020-07-11 01:01:11,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 221 transitions. [2020-07-11 01:01:11,211 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 221 edges. 221 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:01:11,424 INFO L225 Difference]: With dead ends: 3735 [2020-07-11 01:01:11,424 INFO L226 Difference]: Without dead ends: 2469 [2020-07-11 01:01:11,427 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11 01:01:11,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2469 states. [2020-07-11 01:01:17,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2469 to 2467. [2020-07-11 01:01:17,465 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:01:17,465 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2469 states. Second operand 2467 states. [2020-07-11 01:01:17,465 INFO L74 IsIncluded]: Start isIncluded. First operand 2469 states. Second operand 2467 states. [2020-07-11 01:01:17,465 INFO L87 Difference]: Start difference. First operand 2469 states. Second operand 2467 states. [2020-07-11 01:01:17,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:01:17,641 INFO L93 Difference]: Finished difference Result 2469 states and 3075 transitions. [2020-07-11 01:01:17,641 INFO L276 IsEmpty]: Start isEmpty. Operand 2469 states and 3075 transitions. [2020-07-11 01:01:17,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:01:17,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:01:17,644 INFO L74 IsIncluded]: Start isIncluded. First operand 2467 states. Second operand 2469 states. [2020-07-11 01:01:17,644 INFO L87 Difference]: Start difference. First operand 2467 states. Second operand 2469 states. [2020-07-11 01:01:17,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:01:17,838 INFO L93 Difference]: Finished difference Result 2469 states and 3075 transitions. [2020-07-11 01:01:17,838 INFO L276 IsEmpty]: Start isEmpty. Operand 2469 states and 3075 transitions. [2020-07-11 01:01:17,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:01:17,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:01:17,841 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:01:17,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:01:17,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2467 states. [2020-07-11 01:01:18,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 3074 transitions. [2020-07-11 01:01:18,017 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 3074 transitions. Word has length 60 [2020-07-11 01:01:18,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:01:18,017 INFO L479 AbstractCegarLoop]: Abstraction has 2467 states and 3074 transitions. [2020-07-11 01:01:18,017 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:01:18,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2467 states and 3074 transitions. [2020-07-11 01:01:22,507 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3074 edges. 3074 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:01:22,508 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 3074 transitions. [2020-07-11 01:01:22,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-07-11 01:01:22,510 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:01:22,510 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-11 01:01:22,511 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-11 01:01:22,511 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:01:22,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:01:22,511 INFO L82 PathProgramCache]: Analyzing trace with hash -729752476, now seen corresponding path program 1 times [2020-07-11 01:01:22,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:01:22,511 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1987879048] [2020-07-11 01:01:22,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:01:22,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:01:22,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:01:22,547 INFO L280 TraceCheckUtils]: 0: Hoare triple {54894#true} assume true; {54894#true} is VALID [2020-07-11 01:01:22,547 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {54894#true} {54894#true} #199#return; {54894#true} is VALID [2020-07-11 01:01:22,547 INFO L263 TraceCheckUtils]: 0: Hoare triple {54894#true} call ULTIMATE.init(); {54894#true} is VALID [2020-07-11 01:01:22,548 INFO L280 TraceCheckUtils]: 1: Hoare triple {54894#true} assume true; {54894#true} is VALID [2020-07-11 01:01:22,548 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {54894#true} {54894#true} #199#return; {54894#true} is VALID [2020-07-11 01:01:22,548 INFO L263 TraceCheckUtils]: 3: Hoare triple {54894#true} call #t~ret8 := main(); {54894#true} is VALID [2020-07-11 01:01:22,549 INFO L280 TraceCheckUtils]: 4: Hoare triple {54894#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {54894#true} is VALID [2020-07-11 01:01:22,549 INFO L280 TraceCheckUtils]: 5: Hoare triple {54894#true} ~p1~0 := #t~nondet0; {54894#true} is VALID [2020-07-11 01:01:22,549 INFO L280 TraceCheckUtils]: 6: Hoare triple {54894#true} havoc #t~nondet0; {54894#true} is VALID [2020-07-11 01:01:22,550 INFO L280 TraceCheckUtils]: 7: Hoare triple {54894#true} havoc ~lk1~0; {54894#true} is VALID [2020-07-11 01:01:22,550 INFO L280 TraceCheckUtils]: 8: Hoare triple {54894#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {54894#true} is VALID [2020-07-11 01:01:22,550 INFO L280 TraceCheckUtils]: 9: Hoare triple {54894#true} ~p2~0 := #t~nondet1; {54894#true} is VALID [2020-07-11 01:01:22,550 INFO L280 TraceCheckUtils]: 10: Hoare triple {54894#true} havoc #t~nondet1; {54894#true} is VALID [2020-07-11 01:01:22,551 INFO L280 TraceCheckUtils]: 11: Hoare triple {54894#true} havoc ~lk2~0; {54894#true} is VALID [2020-07-11 01:01:22,551 INFO L280 TraceCheckUtils]: 12: Hoare triple {54894#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {54894#true} is VALID [2020-07-11 01:01:22,551 INFO L280 TraceCheckUtils]: 13: Hoare triple {54894#true} ~p3~0 := #t~nondet2; {54894#true} is VALID [2020-07-11 01:01:22,551 INFO L280 TraceCheckUtils]: 14: Hoare triple {54894#true} havoc #t~nondet2; {54894#true} is VALID [2020-07-11 01:01:22,551 INFO L280 TraceCheckUtils]: 15: Hoare triple {54894#true} havoc ~lk3~0; {54894#true} is VALID [2020-07-11 01:01:22,552 INFO L280 TraceCheckUtils]: 16: Hoare triple {54894#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {54894#true} is VALID [2020-07-11 01:01:22,552 INFO L280 TraceCheckUtils]: 17: Hoare triple {54894#true} ~p4~0 := #t~nondet3; {54894#true} is VALID [2020-07-11 01:01:22,552 INFO L280 TraceCheckUtils]: 18: Hoare triple {54894#true} havoc #t~nondet3; {54894#true} is VALID [2020-07-11 01:01:22,552 INFO L280 TraceCheckUtils]: 19: Hoare triple {54894#true} havoc ~lk4~0; {54894#true} is VALID [2020-07-11 01:01:22,552 INFO L280 TraceCheckUtils]: 20: Hoare triple {54894#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {54894#true} is VALID [2020-07-11 01:01:22,553 INFO L280 TraceCheckUtils]: 21: Hoare triple {54894#true} ~p5~0 := #t~nondet4; {54894#true} is VALID [2020-07-11 01:01:22,553 INFO L280 TraceCheckUtils]: 22: Hoare triple {54894#true} havoc #t~nondet4; {54894#true} is VALID [2020-07-11 01:01:22,553 INFO L280 TraceCheckUtils]: 23: Hoare triple {54894#true} havoc ~lk5~0; {54894#true} is VALID [2020-07-11 01:01:22,553 INFO L280 TraceCheckUtils]: 24: Hoare triple {54894#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {54894#true} is VALID [2020-07-11 01:01:22,553 INFO L280 TraceCheckUtils]: 25: Hoare triple {54894#true} ~p6~0 := #t~nondet5; {54894#true} is VALID [2020-07-11 01:01:22,554 INFO L280 TraceCheckUtils]: 26: Hoare triple {54894#true} havoc #t~nondet5; {54894#true} is VALID [2020-07-11 01:01:22,554 INFO L280 TraceCheckUtils]: 27: Hoare triple {54894#true} havoc ~lk6~0; {54894#true} is VALID [2020-07-11 01:01:22,554 INFO L280 TraceCheckUtils]: 28: Hoare triple {54894#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {54894#true} is VALID [2020-07-11 01:01:22,554 INFO L280 TraceCheckUtils]: 29: Hoare triple {54894#true} ~p7~0 := #t~nondet6; {54894#true} is VALID [2020-07-11 01:01:22,554 INFO L280 TraceCheckUtils]: 30: Hoare triple {54894#true} havoc #t~nondet6; {54894#true} is VALID [2020-07-11 01:01:22,555 INFO L280 TraceCheckUtils]: 31: Hoare triple {54894#true} havoc ~lk7~0; {54894#true} is VALID [2020-07-11 01:01:22,555 INFO L280 TraceCheckUtils]: 32: Hoare triple {54894#true} havoc ~cond~0; {54894#true} is VALID [2020-07-11 01:01:22,555 INFO L280 TraceCheckUtils]: 33: Hoare triple {54894#true} assume !false; {54894#true} is VALID [2020-07-11 01:01:22,555 INFO L280 TraceCheckUtils]: 34: Hoare triple {54894#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {54894#true} is VALID [2020-07-11 01:01:22,556 INFO L280 TraceCheckUtils]: 35: Hoare triple {54894#true} ~cond~0 := #t~nondet7; {54894#true} is VALID [2020-07-11 01:01:22,556 INFO L280 TraceCheckUtils]: 36: Hoare triple {54894#true} havoc #t~nondet7; {54894#true} is VALID [2020-07-11 01:01:22,556 INFO L280 TraceCheckUtils]: 37: Hoare triple {54894#true} assume !(0 == ~cond~0); {54894#true} is VALID [2020-07-11 01:01:22,556 INFO L280 TraceCheckUtils]: 38: Hoare triple {54894#true} ~lk1~0 := 0; {54894#true} is VALID [2020-07-11 01:01:22,556 INFO L280 TraceCheckUtils]: 39: Hoare triple {54894#true} ~lk2~0 := 0; {54894#true} is VALID [2020-07-11 01:01:22,557 INFO L280 TraceCheckUtils]: 40: Hoare triple {54894#true} ~lk3~0 := 0; {54894#true} is VALID [2020-07-11 01:01:22,557 INFO L280 TraceCheckUtils]: 41: Hoare triple {54894#true} ~lk4~0 := 0; {54894#true} is VALID [2020-07-11 01:01:22,557 INFO L280 TraceCheckUtils]: 42: Hoare triple {54894#true} ~lk5~0 := 0; {54894#true} is VALID [2020-07-11 01:01:22,557 INFO L280 TraceCheckUtils]: 43: Hoare triple {54894#true} ~lk6~0 := 0; {54894#true} is VALID [2020-07-11 01:01:22,557 INFO L280 TraceCheckUtils]: 44: Hoare triple {54894#true} ~lk7~0 := 0; {54894#true} is VALID [2020-07-11 01:01:22,558 INFO L280 TraceCheckUtils]: 45: Hoare triple {54894#true} assume !(0 != ~p1~0); {54894#true} is VALID [2020-07-11 01:01:22,558 INFO L280 TraceCheckUtils]: 46: Hoare triple {54894#true} assume !(0 != ~p2~0); {54894#true} is VALID [2020-07-11 01:01:22,558 INFO L280 TraceCheckUtils]: 47: Hoare triple {54894#true} assume !(0 != ~p3~0); {54894#true} is VALID [2020-07-11 01:01:22,558 INFO L280 TraceCheckUtils]: 48: Hoare triple {54894#true} assume !(0 != ~p4~0); {54894#true} is VALID [2020-07-11 01:01:22,558 INFO L280 TraceCheckUtils]: 49: Hoare triple {54894#true} assume !(0 != ~p5~0); {54894#true} is VALID [2020-07-11 01:01:22,559 INFO L280 TraceCheckUtils]: 50: Hoare triple {54894#true} assume !(0 != ~p6~0); {54894#true} is VALID [2020-07-11 01:01:22,562 INFO L280 TraceCheckUtils]: 51: Hoare triple {54894#true} assume !(0 != ~p7~0); {54898#(= 0 main_~p7~0)} is VALID [2020-07-11 01:01:22,569 INFO L280 TraceCheckUtils]: 52: Hoare triple {54898#(= 0 main_~p7~0)} assume !(0 != ~p1~0); {54898#(= 0 main_~p7~0)} is VALID [2020-07-11 01:01:22,569 INFO L280 TraceCheckUtils]: 53: Hoare triple {54898#(= 0 main_~p7~0)} assume !(0 != ~p2~0); {54898#(= 0 main_~p7~0)} is VALID [2020-07-11 01:01:22,570 INFO L280 TraceCheckUtils]: 54: Hoare triple {54898#(= 0 main_~p7~0)} assume !(0 != ~p3~0); {54898#(= 0 main_~p7~0)} is VALID [2020-07-11 01:01:22,570 INFO L280 TraceCheckUtils]: 55: Hoare triple {54898#(= 0 main_~p7~0)} assume !(0 != ~p4~0); {54898#(= 0 main_~p7~0)} is VALID [2020-07-11 01:01:22,571 INFO L280 TraceCheckUtils]: 56: Hoare triple {54898#(= 0 main_~p7~0)} assume !(0 != ~p5~0); {54898#(= 0 main_~p7~0)} is VALID [2020-07-11 01:01:22,574 INFO L280 TraceCheckUtils]: 57: Hoare triple {54898#(= 0 main_~p7~0)} assume !(0 != ~p6~0); {54898#(= 0 main_~p7~0)} is VALID [2020-07-11 01:01:22,578 INFO L280 TraceCheckUtils]: 58: Hoare triple {54898#(= 0 main_~p7~0)} assume 0 != ~p7~0; {54895#false} is VALID [2020-07-11 01:01:22,579 INFO L280 TraceCheckUtils]: 59: Hoare triple {54895#false} assume 1 != ~lk7~0; {54895#false} is VALID [2020-07-11 01:01:22,579 INFO L280 TraceCheckUtils]: 60: Hoare triple {54895#false} assume !false; {54895#false} is VALID [2020-07-11 01:01:22,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 01:01:22,583 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1987879048] [2020-07-11 01:01:22,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:01:22,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:01:22,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514206133] [2020-07-11 01:01:22,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-07-11 01:01:22,585 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:01:22,585 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:01:22,643 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-11 01:01:22,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:01:22,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:01:22,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:01:22,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:01:22,644 INFO L87 Difference]: Start difference. First operand 2467 states and 3074 transitions. Second operand 3 states. [2020-07-11 01:01:38,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:01:38,039 INFO L93 Difference]: Finished difference Result 7143 states and 8900 transitions. [2020-07-11 01:01:38,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:01:38,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-07-11 01:01:38,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:01:38,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:01:38,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 221 transitions. [2020-07-11 01:01:38,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:01:38,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 221 transitions. [2020-07-11 01:01:38,044 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 221 transitions. [2020-07-11 01:01:38,251 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 221 edges. 221 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:01:38,723 INFO L225 Difference]: With dead ends: 7143 [2020-07-11 01:01:38,723 INFO L226 Difference]: Without dead ends: 3637 [2020-07-11 01:01:38,729 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11 01:01:38,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3637 states. [2020-07-11 01:01:47,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3637 to 3635. [2020-07-11 01:01:47,876 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:01:47,876 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3637 states. Second operand 3635 states. [2020-07-11 01:01:47,876 INFO L74 IsIncluded]: Start isIncluded. First operand 3637 states. Second operand 3635 states. [2020-07-11 01:01:47,877 INFO L87 Difference]: Start difference. First operand 3637 states. Second operand 3635 states. [2020-07-11 01:01:48,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:01:48,299 INFO L93 Difference]: Finished difference Result 3637 states and 4371 transitions. [2020-07-11 01:01:48,299 INFO L276 IsEmpty]: Start isEmpty. Operand 3637 states and 4371 transitions. [2020-07-11 01:01:48,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:01:48,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:01:48,303 INFO L74 IsIncluded]: Start isIncluded. First operand 3635 states. Second operand 3637 states. [2020-07-11 01:01:48,303 INFO L87 Difference]: Start difference. First operand 3635 states. Second operand 3637 states. [2020-07-11 01:01:48,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:01:48,755 INFO L93 Difference]: Finished difference Result 3637 states and 4371 transitions. [2020-07-11 01:01:48,755 INFO L276 IsEmpty]: Start isEmpty. Operand 3637 states and 4371 transitions. [2020-07-11 01:01:48,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:01:48,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:01:48,759 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:01:48,759 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:01:48,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3635 states. [2020-07-11 01:01:49,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3635 states to 3635 states and 4370 transitions. [2020-07-11 01:01:49,191 INFO L78 Accepts]: Start accepts. Automaton has 3635 states and 4370 transitions. Word has length 61 [2020-07-11 01:01:49,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:01:49,191 INFO L479 AbstractCegarLoop]: Abstraction has 3635 states and 4370 transitions. [2020-07-11 01:01:49,192 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:01:49,192 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3635 states and 4370 transitions. [2020-07-11 01:01:54,776 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4370 edges. 4370 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:01:54,777 INFO L276 IsEmpty]: Start isEmpty. Operand 3635 states and 4370 transitions. [2020-07-11 01:01:54,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-07-11 01:01:54,780 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:01:54,780 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-11 01:01:54,780 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-11 01:01:54,781 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:01:54,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:01:54,781 INFO L82 PathProgramCache]: Analyzing trace with hash 495374346, now seen corresponding path program 1 times [2020-07-11 01:01:54,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:01:54,781 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1345848119] [2020-07-11 01:01:54,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:01:54,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:01:54,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:01:54,821 INFO L280 TraceCheckUtils]: 0: Hoare triple {83731#true} assume true; {83731#true} is VALID [2020-07-11 01:01:54,822 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {83731#true} {83731#true} #199#return; {83731#true} is VALID [2020-07-11 01:01:54,822 INFO L263 TraceCheckUtils]: 0: Hoare triple {83731#true} call ULTIMATE.init(); {83731#true} is VALID [2020-07-11 01:01:54,822 INFO L280 TraceCheckUtils]: 1: Hoare triple {83731#true} assume true; {83731#true} is VALID [2020-07-11 01:01:54,822 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {83731#true} {83731#true} #199#return; {83731#true} is VALID [2020-07-11 01:01:54,822 INFO L263 TraceCheckUtils]: 3: Hoare triple {83731#true} call #t~ret8 := main(); {83731#true} is VALID [2020-07-11 01:01:54,822 INFO L280 TraceCheckUtils]: 4: Hoare triple {83731#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {83731#true} is VALID [2020-07-11 01:01:54,822 INFO L280 TraceCheckUtils]: 5: Hoare triple {83731#true} ~p1~0 := #t~nondet0; {83731#true} is VALID [2020-07-11 01:01:54,823 INFO L280 TraceCheckUtils]: 6: Hoare triple {83731#true} havoc #t~nondet0; {83731#true} is VALID [2020-07-11 01:01:54,823 INFO L280 TraceCheckUtils]: 7: Hoare triple {83731#true} havoc ~lk1~0; {83731#true} is VALID [2020-07-11 01:01:54,823 INFO L280 TraceCheckUtils]: 8: Hoare triple {83731#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {83731#true} is VALID [2020-07-11 01:01:54,823 INFO L280 TraceCheckUtils]: 9: Hoare triple {83731#true} ~p2~0 := #t~nondet1; {83731#true} is VALID [2020-07-11 01:01:54,823 INFO L280 TraceCheckUtils]: 10: Hoare triple {83731#true} havoc #t~nondet1; {83731#true} is VALID [2020-07-11 01:01:54,823 INFO L280 TraceCheckUtils]: 11: Hoare triple {83731#true} havoc ~lk2~0; {83731#true} is VALID [2020-07-11 01:01:54,823 INFO L280 TraceCheckUtils]: 12: Hoare triple {83731#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {83731#true} is VALID [2020-07-11 01:01:54,823 INFO L280 TraceCheckUtils]: 13: Hoare triple {83731#true} ~p3~0 := #t~nondet2; {83731#true} is VALID [2020-07-11 01:01:54,824 INFO L280 TraceCheckUtils]: 14: Hoare triple {83731#true} havoc #t~nondet2; {83731#true} is VALID [2020-07-11 01:01:54,824 INFO L280 TraceCheckUtils]: 15: Hoare triple {83731#true} havoc ~lk3~0; {83731#true} is VALID [2020-07-11 01:01:54,824 INFO L280 TraceCheckUtils]: 16: Hoare triple {83731#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {83731#true} is VALID [2020-07-11 01:01:54,824 INFO L280 TraceCheckUtils]: 17: Hoare triple {83731#true} ~p4~0 := #t~nondet3; {83731#true} is VALID [2020-07-11 01:01:54,824 INFO L280 TraceCheckUtils]: 18: Hoare triple {83731#true} havoc #t~nondet3; {83731#true} is VALID [2020-07-11 01:01:54,824 INFO L280 TraceCheckUtils]: 19: Hoare triple {83731#true} havoc ~lk4~0; {83731#true} is VALID [2020-07-11 01:01:54,824 INFO L280 TraceCheckUtils]: 20: Hoare triple {83731#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {83731#true} is VALID [2020-07-11 01:01:54,824 INFO L280 TraceCheckUtils]: 21: Hoare triple {83731#true} ~p5~0 := #t~nondet4; {83731#true} is VALID [2020-07-11 01:01:54,825 INFO L280 TraceCheckUtils]: 22: Hoare triple {83731#true} havoc #t~nondet4; {83731#true} is VALID [2020-07-11 01:01:54,825 INFO L280 TraceCheckUtils]: 23: Hoare triple {83731#true} havoc ~lk5~0; {83731#true} is VALID [2020-07-11 01:01:54,825 INFO L280 TraceCheckUtils]: 24: Hoare triple {83731#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {83731#true} is VALID [2020-07-11 01:01:54,825 INFO L280 TraceCheckUtils]: 25: Hoare triple {83731#true} ~p6~0 := #t~nondet5; {83731#true} is VALID [2020-07-11 01:01:54,825 INFO L280 TraceCheckUtils]: 26: Hoare triple {83731#true} havoc #t~nondet5; {83731#true} is VALID [2020-07-11 01:01:54,825 INFO L280 TraceCheckUtils]: 27: Hoare triple {83731#true} havoc ~lk6~0; {83731#true} is VALID [2020-07-11 01:01:54,825 INFO L280 TraceCheckUtils]: 28: Hoare triple {83731#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {83731#true} is VALID [2020-07-11 01:01:54,826 INFO L280 TraceCheckUtils]: 29: Hoare triple {83731#true} ~p7~0 := #t~nondet6; {83731#true} is VALID [2020-07-11 01:01:54,826 INFO L280 TraceCheckUtils]: 30: Hoare triple {83731#true} havoc #t~nondet6; {83731#true} is VALID [2020-07-11 01:01:54,826 INFO L280 TraceCheckUtils]: 31: Hoare triple {83731#true} havoc ~lk7~0; {83731#true} is VALID [2020-07-11 01:01:54,826 INFO L280 TraceCheckUtils]: 32: Hoare triple {83731#true} havoc ~cond~0; {83731#true} is VALID [2020-07-11 01:01:54,826 INFO L280 TraceCheckUtils]: 33: Hoare triple {83731#true} assume !false; {83731#true} is VALID [2020-07-11 01:01:54,826 INFO L280 TraceCheckUtils]: 34: Hoare triple {83731#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {83731#true} is VALID [2020-07-11 01:01:54,827 INFO L280 TraceCheckUtils]: 35: Hoare triple {83731#true} ~cond~0 := #t~nondet7; {83731#true} is VALID [2020-07-11 01:01:54,827 INFO L280 TraceCheckUtils]: 36: Hoare triple {83731#true} havoc #t~nondet7; {83731#true} is VALID [2020-07-11 01:01:54,827 INFO L280 TraceCheckUtils]: 37: Hoare triple {83731#true} assume !(0 == ~cond~0); {83731#true} is VALID [2020-07-11 01:01:54,827 INFO L280 TraceCheckUtils]: 38: Hoare triple {83731#true} ~lk1~0 := 0; {83731#true} is VALID [2020-07-11 01:01:54,827 INFO L280 TraceCheckUtils]: 39: Hoare triple {83731#true} ~lk2~0 := 0; {83731#true} is VALID [2020-07-11 01:01:54,827 INFO L280 TraceCheckUtils]: 40: Hoare triple {83731#true} ~lk3~0 := 0; {83731#true} is VALID [2020-07-11 01:01:54,828 INFO L280 TraceCheckUtils]: 41: Hoare triple {83731#true} ~lk4~0 := 0; {83731#true} is VALID [2020-07-11 01:01:54,828 INFO L280 TraceCheckUtils]: 42: Hoare triple {83731#true} ~lk5~0 := 0; {83731#true} is VALID [2020-07-11 01:01:54,828 INFO L280 TraceCheckUtils]: 43: Hoare triple {83731#true} ~lk6~0 := 0; {83731#true} is VALID [2020-07-11 01:01:54,828 INFO L280 TraceCheckUtils]: 44: Hoare triple {83731#true} ~lk7~0 := 0; {83731#true} is VALID [2020-07-11 01:01:54,828 INFO L280 TraceCheckUtils]: 45: Hoare triple {83731#true} assume !(0 != ~p1~0); {83731#true} is VALID [2020-07-11 01:01:54,829 INFO L280 TraceCheckUtils]: 46: Hoare triple {83731#true} assume !(0 != ~p2~0); {83731#true} is VALID [2020-07-11 01:01:54,829 INFO L280 TraceCheckUtils]: 47: Hoare triple {83731#true} assume !(0 != ~p3~0); {83731#true} is VALID [2020-07-11 01:01:54,829 INFO L280 TraceCheckUtils]: 48: Hoare triple {83731#true} assume !(0 != ~p4~0); {83731#true} is VALID [2020-07-11 01:01:54,829 INFO L280 TraceCheckUtils]: 49: Hoare triple {83731#true} assume !(0 != ~p5~0); {83731#true} is VALID [2020-07-11 01:01:54,829 INFO L280 TraceCheckUtils]: 50: Hoare triple {83731#true} assume 0 != ~p6~0; {83731#true} is VALID [2020-07-11 01:01:54,830 INFO L280 TraceCheckUtils]: 51: Hoare triple {83731#true} ~lk6~0 := 1; {83735#(= 1 main_~lk6~0)} is VALID [2020-07-11 01:01:54,830 INFO L280 TraceCheckUtils]: 52: Hoare triple {83735#(= 1 main_~lk6~0)} assume !(0 != ~p7~0); {83735#(= 1 main_~lk6~0)} is VALID [2020-07-11 01:01:54,831 INFO L280 TraceCheckUtils]: 53: Hoare triple {83735#(= 1 main_~lk6~0)} assume !(0 != ~p1~0); {83735#(= 1 main_~lk6~0)} is VALID [2020-07-11 01:01:54,831 INFO L280 TraceCheckUtils]: 54: Hoare triple {83735#(= 1 main_~lk6~0)} assume !(0 != ~p2~0); {83735#(= 1 main_~lk6~0)} is VALID [2020-07-11 01:01:54,832 INFO L280 TraceCheckUtils]: 55: Hoare triple {83735#(= 1 main_~lk6~0)} assume !(0 != ~p3~0); {83735#(= 1 main_~lk6~0)} is VALID [2020-07-11 01:01:54,832 INFO L280 TraceCheckUtils]: 56: Hoare triple {83735#(= 1 main_~lk6~0)} assume !(0 != ~p4~0); {83735#(= 1 main_~lk6~0)} is VALID [2020-07-11 01:01:54,833 INFO L280 TraceCheckUtils]: 57: Hoare triple {83735#(= 1 main_~lk6~0)} assume !(0 != ~p5~0); {83735#(= 1 main_~lk6~0)} is VALID [2020-07-11 01:01:54,833 INFO L280 TraceCheckUtils]: 58: Hoare triple {83735#(= 1 main_~lk6~0)} assume 0 != ~p6~0; {83735#(= 1 main_~lk6~0)} is VALID [2020-07-11 01:01:54,834 INFO L280 TraceCheckUtils]: 59: Hoare triple {83735#(= 1 main_~lk6~0)} assume 1 != ~lk6~0; {83732#false} is VALID [2020-07-11 01:01:54,834 INFO L280 TraceCheckUtils]: 60: Hoare triple {83732#false} assume !false; {83732#false} is VALID [2020-07-11 01:01:54,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 01:01:54,836 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1345848119] [2020-07-11 01:01:54,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:01:54,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:01:54,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329070384] [2020-07-11 01:01:54,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-07-11 01:01:54,838 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:01:54,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:01:54,890 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-11 01:01:54,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:01:54,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:01:54,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:01:54,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:01:54,892 INFO L87 Difference]: Start difference. First operand 3635 states and 4370 transitions. Second operand 3 states. [2020-07-11 01:02:06,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:02:06,720 INFO L93 Difference]: Finished difference Result 4087 states and 4852 transitions. [2020-07-11 01:02:06,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:02:06,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-07-11 01:02:06,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:02:06,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:02:06,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2020-07-11 01:02:06,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:02:06,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2020-07-11 01:02:06,723 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 137 transitions. [2020-07-11 01:02:06,860 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:02:07,176 INFO L225 Difference]: With dead ends: 4087 [2020-07-11 01:02:07,177 INFO L226 Difference]: Without dead ends: 2917 [2020-07-11 01:02:07,179 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11 01:02:07,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2917 states. [2020-07-11 01:02:13,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2917 to 2467. [2020-07-11 01:02:13,886 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:02:13,887 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2917 states. Second operand 2467 states. [2020-07-11 01:02:13,887 INFO L74 IsIncluded]: Start isIncluded. First operand 2917 states. Second operand 2467 states. [2020-07-11 01:02:13,887 INFO L87 Difference]: Start difference. First operand 2917 states. Second operand 2467 states. [2020-07-11 01:02:14,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:02:14,150 INFO L93 Difference]: Finished difference Result 2917 states and 3395 transitions. [2020-07-11 01:02:14,150 INFO L276 IsEmpty]: Start isEmpty. Operand 2917 states and 3395 transitions. [2020-07-11 01:02:14,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:02:14,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:02:14,153 INFO L74 IsIncluded]: Start isIncluded. First operand 2467 states. Second operand 2917 states. [2020-07-11 01:02:14,153 INFO L87 Difference]: Start difference. First operand 2467 states. Second operand 2917 states. [2020-07-11 01:02:14,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:02:14,393 INFO L93 Difference]: Finished difference Result 2917 states and 3395 transitions. [2020-07-11 01:02:14,393 INFO L276 IsEmpty]: Start isEmpty. Operand 2917 states and 3395 transitions. [2020-07-11 01:02:14,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:02:14,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:02:14,396 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:02:14,396 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:02:14,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2467 states. [2020-07-11 01:02:14,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 2914 transitions. [2020-07-11 01:02:14,584 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 2914 transitions. Word has length 61 [2020-07-11 01:02:14,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:02:14,585 INFO L479 AbstractCegarLoop]: Abstraction has 2467 states and 2914 transitions. [2020-07-11 01:02:14,585 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:02:14,585 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2467 states and 2914 transitions. [2020-07-11 01:02:18,555 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 2914 edges. 2914 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:02:18,556 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 2914 transitions. [2020-07-11 01:02:18,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-07-11 01:02:18,558 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:02:18,558 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-11 01:02:18,558 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-11 01:02:18,558 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:02:18,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:02:18,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1060451273, now seen corresponding path program 1 times [2020-07-11 01:02:18,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:02:18,559 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [549368497] [2020-07-11 01:02:18,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:02:18,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:02:18,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:02:18,604 INFO L280 TraceCheckUtils]: 0: Hoare triple {102680#true} assume true; {102680#true} is VALID [2020-07-11 01:02:18,605 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {102680#true} {102680#true} #199#return; {102680#true} is VALID [2020-07-11 01:02:18,605 INFO L263 TraceCheckUtils]: 0: Hoare triple {102680#true} call ULTIMATE.init(); {102680#true} is VALID [2020-07-11 01:02:18,605 INFO L280 TraceCheckUtils]: 1: Hoare triple {102680#true} assume true; {102680#true} is VALID [2020-07-11 01:02:18,605 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {102680#true} {102680#true} #199#return; {102680#true} is VALID [2020-07-11 01:02:18,606 INFO L263 TraceCheckUtils]: 3: Hoare triple {102680#true} call #t~ret8 := main(); {102680#true} is VALID [2020-07-11 01:02:18,606 INFO L280 TraceCheckUtils]: 4: Hoare triple {102680#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {102680#true} is VALID [2020-07-11 01:02:18,606 INFO L280 TraceCheckUtils]: 5: Hoare triple {102680#true} ~p1~0 := #t~nondet0; {102680#true} is VALID [2020-07-11 01:02:18,606 INFO L280 TraceCheckUtils]: 6: Hoare triple {102680#true} havoc #t~nondet0; {102680#true} is VALID [2020-07-11 01:02:18,606 INFO L280 TraceCheckUtils]: 7: Hoare triple {102680#true} havoc ~lk1~0; {102680#true} is VALID [2020-07-11 01:02:18,607 INFO L280 TraceCheckUtils]: 8: Hoare triple {102680#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {102680#true} is VALID [2020-07-11 01:02:18,607 INFO L280 TraceCheckUtils]: 9: Hoare triple {102680#true} ~p2~0 := #t~nondet1; {102680#true} is VALID [2020-07-11 01:02:18,607 INFO L280 TraceCheckUtils]: 10: Hoare triple {102680#true} havoc #t~nondet1; {102680#true} is VALID [2020-07-11 01:02:18,607 INFO L280 TraceCheckUtils]: 11: Hoare triple {102680#true} havoc ~lk2~0; {102680#true} is VALID [2020-07-11 01:02:18,607 INFO L280 TraceCheckUtils]: 12: Hoare triple {102680#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {102680#true} is VALID [2020-07-11 01:02:18,607 INFO L280 TraceCheckUtils]: 13: Hoare triple {102680#true} ~p3~0 := #t~nondet2; {102680#true} is VALID [2020-07-11 01:02:18,608 INFO L280 TraceCheckUtils]: 14: Hoare triple {102680#true} havoc #t~nondet2; {102680#true} is VALID [2020-07-11 01:02:18,608 INFO L280 TraceCheckUtils]: 15: Hoare triple {102680#true} havoc ~lk3~0; {102680#true} is VALID [2020-07-11 01:02:18,608 INFO L280 TraceCheckUtils]: 16: Hoare triple {102680#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {102680#true} is VALID [2020-07-11 01:02:18,608 INFO L280 TraceCheckUtils]: 17: Hoare triple {102680#true} ~p4~0 := #t~nondet3; {102680#true} is VALID [2020-07-11 01:02:18,608 INFO L280 TraceCheckUtils]: 18: Hoare triple {102680#true} havoc #t~nondet3; {102680#true} is VALID [2020-07-11 01:02:18,609 INFO L280 TraceCheckUtils]: 19: Hoare triple {102680#true} havoc ~lk4~0; {102680#true} is VALID [2020-07-11 01:02:18,609 INFO L280 TraceCheckUtils]: 20: Hoare triple {102680#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {102680#true} is VALID [2020-07-11 01:02:18,609 INFO L280 TraceCheckUtils]: 21: Hoare triple {102680#true} ~p5~0 := #t~nondet4; {102680#true} is VALID [2020-07-11 01:02:18,609 INFO L280 TraceCheckUtils]: 22: Hoare triple {102680#true} havoc #t~nondet4; {102680#true} is VALID [2020-07-11 01:02:18,609 INFO L280 TraceCheckUtils]: 23: Hoare triple {102680#true} havoc ~lk5~0; {102680#true} is VALID [2020-07-11 01:02:18,609 INFO L280 TraceCheckUtils]: 24: Hoare triple {102680#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {102680#true} is VALID [2020-07-11 01:02:18,610 INFO L280 TraceCheckUtils]: 25: Hoare triple {102680#true} ~p6~0 := #t~nondet5; {102680#true} is VALID [2020-07-11 01:02:18,610 INFO L280 TraceCheckUtils]: 26: Hoare triple {102680#true} havoc #t~nondet5; {102680#true} is VALID [2020-07-11 01:02:18,610 INFO L280 TraceCheckUtils]: 27: Hoare triple {102680#true} havoc ~lk6~0; {102680#true} is VALID [2020-07-11 01:02:18,610 INFO L280 TraceCheckUtils]: 28: Hoare triple {102680#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {102680#true} is VALID [2020-07-11 01:02:18,610 INFO L280 TraceCheckUtils]: 29: Hoare triple {102680#true} ~p7~0 := #t~nondet6; {102680#true} is VALID [2020-07-11 01:02:18,610 INFO L280 TraceCheckUtils]: 30: Hoare triple {102680#true} havoc #t~nondet6; {102680#true} is VALID [2020-07-11 01:02:18,611 INFO L280 TraceCheckUtils]: 31: Hoare triple {102680#true} havoc ~lk7~0; {102680#true} is VALID [2020-07-11 01:02:18,611 INFO L280 TraceCheckUtils]: 32: Hoare triple {102680#true} havoc ~cond~0; {102680#true} is VALID [2020-07-11 01:02:18,611 INFO L280 TraceCheckUtils]: 33: Hoare triple {102680#true} assume !false; {102680#true} is VALID [2020-07-11 01:02:18,611 INFO L280 TraceCheckUtils]: 34: Hoare triple {102680#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {102680#true} is VALID [2020-07-11 01:02:18,611 INFO L280 TraceCheckUtils]: 35: Hoare triple {102680#true} ~cond~0 := #t~nondet7; {102680#true} is VALID [2020-07-11 01:02:18,611 INFO L280 TraceCheckUtils]: 36: Hoare triple {102680#true} havoc #t~nondet7; {102680#true} is VALID [2020-07-11 01:02:18,612 INFO L280 TraceCheckUtils]: 37: Hoare triple {102680#true} assume !(0 == ~cond~0); {102680#true} is VALID [2020-07-11 01:02:18,612 INFO L280 TraceCheckUtils]: 38: Hoare triple {102680#true} ~lk1~0 := 0; {102680#true} is VALID [2020-07-11 01:02:18,612 INFO L280 TraceCheckUtils]: 39: Hoare triple {102680#true} ~lk2~0 := 0; {102680#true} is VALID [2020-07-11 01:02:18,612 INFO L280 TraceCheckUtils]: 40: Hoare triple {102680#true} ~lk3~0 := 0; {102680#true} is VALID [2020-07-11 01:02:18,612 INFO L280 TraceCheckUtils]: 41: Hoare triple {102680#true} ~lk4~0 := 0; {102680#true} is VALID [2020-07-11 01:02:18,613 INFO L280 TraceCheckUtils]: 42: Hoare triple {102680#true} ~lk5~0 := 0; {102680#true} is VALID [2020-07-11 01:02:18,613 INFO L280 TraceCheckUtils]: 43: Hoare triple {102680#true} ~lk6~0 := 0; {102680#true} is VALID [2020-07-11 01:02:18,613 INFO L280 TraceCheckUtils]: 44: Hoare triple {102680#true} ~lk7~0 := 0; {102680#true} is VALID [2020-07-11 01:02:18,613 INFO L280 TraceCheckUtils]: 45: Hoare triple {102680#true} assume !(0 != ~p1~0); {102680#true} is VALID [2020-07-11 01:02:18,613 INFO L280 TraceCheckUtils]: 46: Hoare triple {102680#true} assume !(0 != ~p2~0); {102680#true} is VALID [2020-07-11 01:02:18,613 INFO L280 TraceCheckUtils]: 47: Hoare triple {102680#true} assume !(0 != ~p3~0); {102680#true} is VALID [2020-07-11 01:02:18,614 INFO L280 TraceCheckUtils]: 48: Hoare triple {102680#true} assume !(0 != ~p4~0); {102680#true} is VALID [2020-07-11 01:02:18,614 INFO L280 TraceCheckUtils]: 49: Hoare triple {102680#true} assume !(0 != ~p5~0); {102680#true} is VALID [2020-07-11 01:02:18,614 INFO L280 TraceCheckUtils]: 50: Hoare triple {102680#true} assume !(0 != ~p6~0); {102680#true} is VALID [2020-07-11 01:02:18,614 INFO L280 TraceCheckUtils]: 51: Hoare triple {102680#true} assume 0 != ~p7~0; {102680#true} is VALID [2020-07-11 01:02:18,615 INFO L280 TraceCheckUtils]: 52: Hoare triple {102680#true} ~lk7~0 := 1; {102684#(= main_~lk7~0 1)} is VALID [2020-07-11 01:02:18,615 INFO L280 TraceCheckUtils]: 53: Hoare triple {102684#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {102684#(= main_~lk7~0 1)} is VALID [2020-07-11 01:02:18,616 INFO L280 TraceCheckUtils]: 54: Hoare triple {102684#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {102684#(= main_~lk7~0 1)} is VALID [2020-07-11 01:02:18,616 INFO L280 TraceCheckUtils]: 55: Hoare triple {102684#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {102684#(= main_~lk7~0 1)} is VALID [2020-07-11 01:02:18,617 INFO L280 TraceCheckUtils]: 56: Hoare triple {102684#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {102684#(= main_~lk7~0 1)} is VALID [2020-07-11 01:02:18,617 INFO L280 TraceCheckUtils]: 57: Hoare triple {102684#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {102684#(= main_~lk7~0 1)} is VALID [2020-07-11 01:02:18,618 INFO L280 TraceCheckUtils]: 58: Hoare triple {102684#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {102684#(= main_~lk7~0 1)} is VALID [2020-07-11 01:02:18,619 INFO L280 TraceCheckUtils]: 59: Hoare triple {102684#(= main_~lk7~0 1)} assume 0 != ~p7~0; {102684#(= main_~lk7~0 1)} is VALID [2020-07-11 01:02:18,619 INFO L280 TraceCheckUtils]: 60: Hoare triple {102684#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {102681#false} is VALID [2020-07-11 01:02:18,619 INFO L280 TraceCheckUtils]: 61: Hoare triple {102681#false} assume !false; {102681#false} is VALID [2020-07-11 01:02:18,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 01:02:18,622 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [549368497] [2020-07-11 01:02:18,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:02:18,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:02:18,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292736214] [2020-07-11 01:02:18,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2020-07-11 01:02:18,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:02:18,623 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:02:18,676 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-11 01:02:18,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:02:18,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:02:18,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:02:18,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:02:18,678 INFO L87 Difference]: Start difference. First operand 2467 states and 2914 transitions. Second operand 3 states. [2020-07-11 01:02:25,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:02:25,912 INFO L93 Difference]: Finished difference Result 2467 states and 2914 transitions. [2020-07-11 01:02:25,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:02:25,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2020-07-11 01:02:25,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:02:25,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:02:25,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2020-07-11 01:02:25,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:02:25,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2020-07-11 01:02:25,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 94 transitions. [2020-07-11 01:02:26,001 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:02:26,001 INFO L225 Difference]: With dead ends: 2467 [2020-07-11 01:02:26,001 INFO L226 Difference]: Without dead ends: 0 [2020-07-11 01:02:26,007 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11 01:02:26,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-11 01:02:26,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-11 01:02:26,008 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:02:26,008 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-11 01:02:26,008 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 01:02:26,008 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 01:02:26,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:02:26,008 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 01:02:26,008 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 01:02:26,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:02:26,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:02:26,009 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 01:02:26,009 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 01:02:26,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:02:26,009 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 01:02:26,009 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 01:02:26,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:02:26,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:02:26,009 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:02:26,009 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:02:26,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-11 01:02:26,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-11 01:02:26,010 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2020-07-11 01:02:26,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:02:26,010 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-11 01:02:26,010 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:02:26,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-11 01:02:26,010 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:02:26,010 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 01:02:26,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:02:26,011 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-11 01:02:26,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-11 01:02:26,174 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-07-11 01:02:26,430 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 35 [2020-07-11 01:02:26,605 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 275 DAG size of output: 3 [2020-07-11 01:02:26,883 WARN L193 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 340 DAG size of output: 7 [2020-07-11 01:02:27,267 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 91 [2020-07-11 01:02:27,548 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 23 [2020-07-11 01:02:27,915 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 91 [2020-07-11 01:02:28,095 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-07-11 01:02:28,429 WARN L193 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2020-07-11 01:02:28,691 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 11 [2020-07-11 01:02:28,861 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 15 [2020-07-11 01:02:30,024 WARN L193 SmtUtils]: Spent 895.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-07-11 01:02:30,414 WARN L193 SmtUtils]: Spent 384.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-07-11 01:02:30,630 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-11 01:02:31,138 WARN L193 SmtUtils]: Spent 415.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-07-11 01:02:32,157 WARN L193 SmtUtils]: Spent 945.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-07-11 01:02:32,337 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-07-11 01:02:32,510 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-11 01:02:32,955 WARN L193 SmtUtils]: Spent 364.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-11 01:02:33,926 WARN L193 SmtUtils]: Spent 951.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-07-11 01:02:35,089 WARN L193 SmtUtils]: Spent 1.12 s on a formula simplification that was a NOOP. DAG size: 93 [2020-07-11 01:02:35,261 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-07-11 01:02:38,030 WARN L193 SmtUtils]: Spent 2.75 s on a formula simplification that was a NOOP. DAG size: 159 [2020-07-11 01:02:38,388 WARN L193 SmtUtils]: Spent 352.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-11 01:02:38,719 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-11 01:02:39,078 WARN L193 SmtUtils]: Spent 343.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-11 01:02:40,206 WARN L193 SmtUtils]: Spent 1.12 s on a formula simplification that was a NOOP. DAG size: 93 [2020-07-11 01:02:40,221 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-11 01:02:40,221 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-11 01:02:40,222 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-11 01:02:40,222 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-11 01:02:40,222 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-11 01:02:40,222 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-11 01:02:40,223 INFO L264 CegarLoopResult]: At program point L93(line 93) the Hoare annotation is: (let ((.cse0 (= 1 main_~lk7~0)) (.cse1 (= 0 main_~p4~0)) (.cse3 (= 0 main_~p5~0)) (.cse4 (= 0 main_~p6~0)) (.cse6 (= 1 main_~lk6~0)) (.cse5 (= 0 main_~p7~0)) (.cse2 (= 1 main_~lk3~0)) (.cse7 (= 1 main_~lk5~0)) (.cse8 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse2 .cse3 .cse4) (and .cse6 .cse5 .cse1 .cse2 .cse7) (and .cse5 .cse2 .cse4 .cse7 .cse8) (and .cse6 .cse0 .cse2 .cse7 .cse8) (and .cse6 .cse5 .cse2 .cse3 .cse8) (and .cse0 .cse2 .cse3 .cse4 .cse8) (and .cse6 .cse0 .cse1 .cse2 .cse3) (and .cse5 .cse1 .cse2 .cse4 .cse7) (and .cse6 .cse5 .cse1 .cse2 .cse3) (and .cse6 .cse0 .cse2 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse7) (and .cse0 .cse2 .cse4 .cse7 .cse8) (and .cse6 .cse0 .cse1 .cse2 .cse7) (and .cse5 .cse2 .cse3 .cse4 .cse8) (and .cse6 .cse5 .cse2 .cse7 .cse8))) [2020-07-11 01:02:40,223 INFO L264 CegarLoopResult]: At program point L60(line 60) 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-11 01:02:40,223 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 4 121) the Hoare annotation is: true [2020-07-11 01:02:40,224 INFO L271 CegarLoopResult]: At program point L52(line 52) the Hoare annotation is: true [2020-07-11 01:02:40,224 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-07-11 01:02:40,224 INFO L264 CegarLoopResult]: At program point L102(line 102) the Hoare annotation is: (let ((.cse3 (= 1 main_~lk6~0)) (.cse0 (= 0 main_~p7~0)) (.cse4 (= 1 main_~lk7~0)) (.cse1 (= 0 main_~p6~0)) (.cse2 (= 1 main_~lk5~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse3 .cse0 .cse2) (and .cse4 .cse1 .cse2))) [2020-07-11 01:02:40,224 INFO L271 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-07-11 01:02:40,225 INFO L264 CegarLoopResult]: At program point L86-1(lines 30 116) the Hoare annotation is: (let ((.cse5 (= 1 main_~lk7~0)) (.cse1 (= 0 main_~p3~0)) (.cse2 (= 0 main_~p4~0)) (.cse9 (= 1 main_~lk6~0)) (.cse7 (= 1 main_~lk5~0)) (.cse0 (= 0 main_~p7~0)) (.cse6 (= 1 main_~lk3~0)) (.cse3 (= 0 main_~p5~0)) (.cse4 (= 0 main_~p6~0)) (.cse8 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse2 .cse6 .cse3 .cse4) (and .cse0 .cse6 .cse4 .cse7 .cse8) (and .cse5 .cse6 .cse3 .cse4 .cse8) (and .cse9 .cse5 .cse2 .cse6 .cse3) (and .cse9 .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse6 .cse4 .cse7) (and .cse9 .cse5 .cse6 .cse3 .cse8) (and .cse1 .cse5 .cse4 .cse7 .cse8) (and .cse5 .cse2 .cse6 .cse4 .cse7) (and .cse9 .cse0 .cse1 .cse3 .cse8) (and .cse1 .cse5 .cse2 .cse4 .cse7) (and .cse9 .cse1 .cse5 .cse2 .cse7) (and .cse9 .cse5 .cse2 .cse6 .cse7) (and .cse0 .cse1 .cse4 .cse7 .cse8) (and .cse1 .cse5 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4 .cse8) (and .cse9 .cse1 .cse5 .cse7 .cse8) (and .cse0 .cse2 .cse6 .cse3 .cse4) (and .cse9 .cse0 .cse2 .cse6 .cse7) (and .cse9 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse1 .cse5 .cse2 .cse3) (and .cse9 .cse0 .cse1 .cse2 .cse7) (and .cse9 .cse0 .cse6 .cse3 .cse8) (and .cse9 .cse1 .cse5 .cse3 .cse8) (and .cse1 .cse5 .cse3 .cse4 .cse8) (and .cse9 .cse0 .cse2 .cse6 .cse3) (and .cse9 .cse0 .cse1 .cse7 .cse8) (and .cse5 .cse6 .cse4 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse7) (and .cse9 .cse0 .cse6 .cse7 .cse8) (and .cse0 .cse6 .cse3 .cse4 .cse8))) [2020-07-11 01:02:40,225 INFO L271 CegarLoopResult]: At program point L111-1(lines 30 116) the Hoare annotation is: true [2020-07-11 01:02:40,225 INFO L271 CegarLoopResult]: At program point L45(line 45) the Hoare annotation is: true [2020-07-11 01:02:40,225 INFO L271 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-07-11 01:02:40,225 INFO L271 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-07-11 01:02:40,225 INFO L271 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-07-11 01:02:40,225 INFO L264 CegarLoopResult]: At program point L103(line 103) the Hoare annotation is: (let ((.cse3 (= 1 main_~lk6~0)) (.cse0 (= 0 main_~p7~0)) (.cse4 (= 1 main_~lk7~0)) (.cse1 (= 0 main_~p6~0)) (.cse2 (= 1 main_~lk5~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse3 .cse0 .cse2) (and .cse4 .cse1 .cse2))) [2020-07-11 01:02:40,225 INFO L271 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: true [2020-07-11 01:02:40,225 INFO L264 CegarLoopResult]: At program point L120(line 120) the Hoare annotation is: false [2020-07-11 01:02:40,226 INFO L264 CegarLoopResult]: At program point L87(line 87) the Hoare annotation is: (let ((.cse3 (= 1 main_~lk7~0)) (.cse9 (= 1 main_~lk3~0)) (.cse0 (= 1 main_~lk6~0)) (.cse6 (= 0 main_~p4~0)) (.cse7 (= 1 main_~lk5~0)) (.cse8 (= 0 main_~p7~0)) (.cse1 (= 0 main_~p3~0)) (.cse2 (= 1 main_~lk2~0)) (.cse4 (= 0 main_~p5~0)) (.cse10 (= 0 main_~p6~0)) (.cse5 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse4 .cse5) (and .cse2 .cse3 .cse6 .cse9 .cse10 .cse7) (and .cse0 .cse2 .cse3 .cse9 .cse7 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse4) (and .cse8 .cse2 .cse9 .cse4 .cse10 .cse5) (and .cse8 .cse2 .cse6 .cse9 .cse4 .cse10) (and .cse0 .cse8 .cse2 .cse9 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse2 .cse7 .cse5) (and .cse8 .cse2 .cse6 .cse9 .cse10 .cse7) (and .cse2 .cse3 .cse9 .cse10 .cse7 .cse5) (and .cse2 .cse3 .cse6 .cse9 .cse4 .cse10) (and .cse2 .cse3 .cse9 .cse4 .cse10 .cse5) (and .cse1 .cse2 .cse3 .cse6 .cse4 .cse10) (and .cse8 .cse1 .cse2 .cse6 .cse10 .cse7) (and .cse1 .cse2 .cse3 .cse6 .cse10 .cse7) (and .cse1 .cse2 .cse3 .cse10 .cse7 .cse5) (and .cse0 .cse8 .cse1 .cse2 .cse6 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse5) (and .cse0 .cse8 .cse2 .cse6 .cse9 .cse4) (and .cse8 .cse1 .cse2 .cse6 .cse4 .cse10) (and .cse8 .cse2 .cse9 .cse10 .cse7 .cse5) (and .cse0 .cse8 .cse2 .cse9 .cse7 .cse5) (and .cse1 .cse2 .cse3 .cse4 .cse10 .cse5) (and .cse0 .cse2 .cse3 .cse6 .cse9 .cse7) (and .cse0 .cse2 .cse3 .cse6 .cse9 .cse4) (and .cse0 .cse2 .cse3 .cse9 .cse4 .cse5) (and .cse8 .cse1 .cse2 .cse10 .cse7 .cse5) (and .cse0 .cse8 .cse2 .cse6 .cse9 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse6 .cse7) (and .cse8 .cse1 .cse2 .cse4 .cse10 .cse5))) [2020-07-11 01:02:40,226 INFO L271 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-07-11 01:02:40,226 INFO L271 CegarLoopResult]: At program point L21-1(line 21) the Hoare annotation is: true [2020-07-11 01:02:40,226 INFO L271 CegarLoopResult]: At program point L21-2(line 21) the Hoare annotation is: true [2020-07-11 01:02:40,226 INFO L264 CegarLoopResult]: At program point L112(line 112) the Hoare annotation is: (= 1 main_~lk7~0) [2020-07-11 01:02:40,226 INFO L264 CegarLoopResult]: At program point L112-1(lines 5 121) the Hoare annotation is: false [2020-07-11 01:02:40,226 INFO L271 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: true [2020-07-11 01:02:40,226 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 4 121) the Hoare annotation is: true [2020-07-11 01:02:40,227 INFO L264 CegarLoopResult]: At program point L71-1(lines 30 116) 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 .cse0 .cse9 .cse6 .cse3 .cse7 .cse8) (and .cse11 .cse0 .cse9 .cse6 .cse7 .cse8) (and .cse11 .cse0 .cse1 .cse9 .cse2 .cse4) (and .cse11 .cse1 .cse9 .cse10 .cse2 .cse4) (and .cse11 .cse6 .cse10 .cse2 .cse4 .cse5) (and .cse9 .cse6 .cse10 .cse3 .cse4 .cse7) (and .cse11 .cse1 .cse10 .cse4 .cse7 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse4 .cse5) (and .cse11 .cse6 .cse10 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse9 .cse6 .cse2 .cse8) (and .cse9 .cse6 .cse10 .cse3 .cse7 .cse8) (and .cse11 .cse0 .cse1 .cse9 .cse7 .cse8) (and .cse11 .cse1 .cse10 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse9 .cse4 .cse7) (and .cse11 .cse1 .cse10 .cse2 .cse8 .cse5) (and .cse11 .cse0 .cse9 .cse6 .cse4 .cse7) (and .cse11 .cse9 .cse6 .cse10 .cse4 .cse7) (and .cse11 .cse9 .cse6 .cse10 .cse7 .cse8) (and .cse11 .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 .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-11 01:02:40,227 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 119) the Hoare annotation is: false [2020-07-11 01:02:40,227 INFO L264 CegarLoopResult]: At program point L96-1(lines 30 116) the Hoare annotation is: (let ((.cse4 (= 0 main_~p5~0)) (.cse3 (= 1 main_~lk6~0)) (.cse0 (= 0 main_~p7~0)) (.cse5 (= 1 main_~lk7~0)) (.cse1 (= 0 main_~p6~0)) (.cse2 (= 1 main_~lk5~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse0 .cse4) (and .cse0 .cse4 .cse1) (and .cse5 .cse4 .cse1) (and .cse3 .cse5 .cse2) (and .cse3 .cse5 .cse4) (and .cse3 .cse0 .cse2) (and .cse5 .cse1 .cse2))) [2020-07-11 01:02:40,228 INFO L264 CegarLoopResult]: At program point L63-1(lines 30 116) 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-11 01:02:40,228 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 121) the Hoare annotation is: true [2020-07-11 01:02:40,228 INFO L264 CegarLoopResult]: At program point L88(line 88) the Hoare annotation is: (let ((.cse3 (= 1 main_~lk7~0)) (.cse9 (= 1 main_~lk3~0)) (.cse0 (= 1 main_~lk6~0)) (.cse6 (= 0 main_~p4~0)) (.cse7 (= 1 main_~lk5~0)) (.cse8 (= 0 main_~p7~0)) (.cse1 (= 0 main_~p3~0)) (.cse2 (= 1 main_~lk2~0)) (.cse4 (= 0 main_~p5~0)) (.cse10 (= 0 main_~p6~0)) (.cse5 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse4 .cse5) (and .cse2 .cse3 .cse6 .cse9 .cse10 .cse7) (and .cse0 .cse2 .cse3 .cse9 .cse7 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse4) (and .cse8 .cse2 .cse9 .cse4 .cse10 .cse5) (and .cse8 .cse2 .cse6 .cse9 .cse4 .cse10) (and .cse0 .cse8 .cse2 .cse9 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse2 .cse7 .cse5) (and .cse8 .cse2 .cse6 .cse9 .cse10 .cse7) (and .cse2 .cse3 .cse9 .cse10 .cse7 .cse5) (and .cse2 .cse3 .cse6 .cse9 .cse4 .cse10) (and .cse2 .cse3 .cse9 .cse4 .cse10 .cse5) (and .cse1 .cse2 .cse3 .cse6 .cse4 .cse10) (and .cse8 .cse1 .cse2 .cse6 .cse10 .cse7) (and .cse1 .cse2 .cse3 .cse6 .cse10 .cse7) (and .cse1 .cse2 .cse3 .cse10 .cse7 .cse5) (and .cse0 .cse8 .cse1 .cse2 .cse6 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse5) (and .cse0 .cse8 .cse2 .cse6 .cse9 .cse4) (and .cse8 .cse1 .cse2 .cse6 .cse4 .cse10) (and .cse8 .cse2 .cse9 .cse10 .cse7 .cse5) (and .cse0 .cse8 .cse2 .cse9 .cse7 .cse5) (and .cse1 .cse2 .cse3 .cse4 .cse10 .cse5) (and .cse0 .cse2 .cse3 .cse6 .cse9 .cse7) (and .cse0 .cse2 .cse3 .cse6 .cse9 .cse4) (and .cse0 .cse2 .cse3 .cse9 .cse4 .cse5) (and .cse8 .cse1 .cse2 .cse10 .cse7 .cse5) (and .cse0 .cse8 .cse2 .cse6 .cse9 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse6 .cse7) (and .cse8 .cse1 .cse2 .cse4 .cse10 .cse5))) [2020-07-11 01:02:40,228 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-07-11 01:02:40,229 INFO L264 CegarLoopResult]: At program point L55-1(lines 30 116) 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-11 01:02:40,229 INFO L264 CegarLoopResult]: At program point L113(line 113) the Hoare annotation is: (= 1 main_~lk7~0) [2020-07-11 01:02:40,229 INFO L271 CegarLoopResult]: At program point L47(line 47) the Hoare annotation is: true [2020-07-11 01:02:40,229 INFO L264 CegarLoopResult]: At program point L72(line 72) the Hoare annotation is: (let ((.cse1 (= 0 main_~p4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse3 (= 1 main_~lk5~0)) (.cse5 (= 0 main_~p3~0)) (.cse9 (= 0 main_~p1~0)) (.cse7 (= 0 main_~p2~0)) (.cse2 (= 1 main_~lk3~0)) (.cse6 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk1~0)) (.cse8 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse4) (and .cse5 .cse7 .cse3 .cse4 .cse8) (and .cse7 .cse2 .cse9 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse9 .cse3) (and .cse1 .cse7 .cse2 .cse6 .cse4) (and .cse5 .cse7 .cse9 .cse3 .cse8) (and .cse7 .cse2 .cse3 .cse4 .cse8) (and .cse5 .cse0 .cse1 .cse9 .cse3) (and .cse0 .cse2 .cse6 .cse4 .cse8) (and .cse1 .cse7 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse9 .cse3 .cse8) (and .cse5 .cse7 .cse6 .cse4 .cse8) (and .cse5 .cse0 .cse1 .cse6 .cse9) (and .cse5 .cse1 .cse7 .cse6 .cse4) (and .cse0 .cse2 .cse6 .cse9 .cse8) (and .cse5 .cse0 .cse1 .cse3 .cse4) (and .cse1 .cse7 .cse2 .cse9 .cse3) (and .cse5 .cse1 .cse7 .cse3 .cse4) (and .cse1 .cse7 .cse2 .cse6 .cse9) (and .cse5 .cse0 .cse6 .cse4 .cse8) (and .cse7 .cse2 .cse6 .cse9 .cse8) (and .cse0 .cse2 .cse3 .cse4 .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-11 01:02:40,229 INFO L271 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: true [2020-07-11 01:02:40,229 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-07-11 01:02:40,229 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-07-11 01:02:40,230 INFO L264 CegarLoopResult]: At program point L97(line 97) the Hoare annotation is: (let ((.cse5 (= 0 main_~p6~0)) (.cse2 (= 1 main_~lk5~0)) (.cse6 (= 1 main_~lk7~0)) (.cse0 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p7~0)) (.cse4 (= 0 main_~p5~0)) (.cse3 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse4 .cse5 .cse3) (and .cse0 .cse6 .cse2 .cse3) (and .cse6 .cse4 .cse5 .cse3) (and .cse6 .cse5 .cse2 .cse3) (and .cse1 .cse5 .cse2 .cse3) (and .cse0 .cse6 .cse4 .cse3) (and .cse0 .cse1 .cse4 .cse3))) [2020-07-11 01:02:40,230 INFO L264 CegarLoopResult]: At program point L64(line 64) 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-11 01:02:40,230 INFO L271 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: true [2020-07-11 01:02:40,230 INFO L271 CegarLoopResult]: At program point L31-1(line 31) the Hoare annotation is: true [2020-07-11 01:02:40,230 INFO L271 CegarLoopResult]: At program point L31-2(line 31) the Hoare annotation is: true [2020-07-11 01:02:40,230 INFO L264 CegarLoopResult]: At program point L56(line 56) the Hoare annotation is: (or (= 0 main_~p1~0) (= 1 main_~lk1~0)) [2020-07-11 01:02:40,231 INFO L264 CegarLoopResult]: At program point L81-1(lines 30 116) the Hoare annotation is: (let ((.cse4 (= 0 main_~p5~0)) (.cse5 (= 1 main_~lk4~0)) (.cse8 (= 1 main_~lk3~0)) (.cse0 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p7~0)) (.cse3 (= 1 main_~lk2~0)) (.cse2 (= 0 main_~p3~0)) (.cse6 (= 1 main_~lk7~0)) (.cse7 (= 0 main_~p4~0)) (.cse11 (= 0 main_~p2~0)) (.cse9 (= 0 main_~p6~0)) (.cse10 (= 1 main_~lk5~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse3 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse3 .cse6 .cse8 .cse10 .cse5) (and .cse0 .cse2 .cse6 .cse11 .cse4 .cse5) (and .cse1 .cse2 .cse7 .cse11 .cse9 .cse10) (and .cse1 .cse3 .cse8 .cse4 .cse9 .cse5) (and .cse1 .cse3 .cse7 .cse8 .cse4 .cse9) (and .cse0 .cse1 .cse11 .cse8 .cse4 .cse5) (and .cse3 .cse6 .cse8 .cse9 .cse10 .cse5) (and .cse3 .cse6 .cse7 .cse8 .cse4 .cse9) (and .cse0 .cse2 .cse6 .cse11 .cse10 .cse5) (and .cse3 .cse6 .cse8 .cse4 .cse9 .cse5) (and .cse2 .cse3 .cse6 .cse7 .cse4 .cse9) (and .cse1 .cse2 .cse3 .cse7 .cse9 .cse10) (and .cse1 .cse2 .cse7 .cse11 .cse4 .cse9) (and .cse2 .cse3 .cse6 .cse9 .cse10 .cse5) (and .cse2 .cse6 .cse7 .cse11 .cse4 .cse9) (and .cse2 .cse3 .cse6 .cse7 .cse9 .cse10) (and .cse0 .cse2 .cse6 .cse7 .cse11 .cse4) (and .cse1 .cse7 .cse11 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse3 .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse7 .cse11 .cse8 .cse10) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse9) (and .cse2 .cse6 .cse11 .cse4 .cse9 .cse5) (and .cse0 .cse1 .cse2 .cse7 .cse11 .cse10) (and .cse0 .cse1 .cse11 .cse8 .cse10 .cse5) (and .cse0 .cse3 .cse6 .cse7 .cse8 .cse10) (and .cse6 .cse7 .cse11 .cse8 .cse9 .cse10) (and .cse0 .cse6 .cse7 .cse11 .cse8 .cse4) (and .cse0 .cse6 .cse7 .cse11 .cse8 .cse10) (and .cse0 .cse3 .cse6 .cse8 .cse4 .cse5) (and .cse1 .cse2 .cse11 .cse9 .cse10 .cse5) (and .cse1 .cse2 .cse3 .cse9 .cse10 .cse5) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse5) (and .cse0 .cse2 .cse3 .cse6 .cse4 .cse5) (and .cse0 .cse6 .cse11 .cse8 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse6 .cse7 .cse10) (and .cse0 .cse2 .cse6 .cse7 .cse11 .cse10) (and .cse0 .cse1 .cse2 .cse11 .cse10 .cse5) (and .cse2 .cse6 .cse11 .cse9 .cse10 .cse5) (and .cse1 .cse11 .cse8 .cse4 .cse9 .cse5) (and .cse0 .cse2 .cse3 .cse6 .cse7 .cse4) (and .cse1 .cse2 .cse11 .cse4 .cse9 .cse5) (and .cse1 .cse7 .cse11 .cse8 .cse4 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse5) (and .cse0 .cse1 .cse3 .cse8 .cse4 .cse5) (and .cse1 .cse3 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse7 .cse11 .cse8 .cse4) (and .cse1 .cse11 .cse8 .cse9 .cse10 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse4) (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse5) (and .cse1 .cse3 .cse8 .cse9 .cse10 .cse5) (and .cse0 .cse1 .cse3 .cse8 .cse10 .cse5) (and .cse6 .cse7 .cse11 .cse8 .cse4 .cse9) (and .cse6 .cse11 .cse8 .cse4 .cse9 .cse5) (and .cse2 .cse3 .cse6 .cse4 .cse9 .cse5) (and .cse0 .cse3 .cse6 .cse7 .cse8 .cse4) (and .cse0 .cse6 .cse11 .cse8 .cse10 .cse5) (and .cse6 .cse11 .cse8 .cse9 .cse10 .cse5) (and .cse0 .cse1 .cse2 .cse7 .cse11 .cse4) (and .cse0 .cse1 .cse2 .cse11 .cse4 .cse5) (and .cse0 .cse1 .cse3 .cse7 .cse8 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse10) (and .cse2 .cse6 .cse7 .cse11 .cse9 .cse10))) [2020-07-11 01:02:40,231 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-07-11 01:02:40,231 INFO L271 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: true [2020-07-11 01:02:40,231 INFO L271 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: true [2020-07-11 01:02:40,231 INFO L264 CegarLoopResult]: At program point L106-1(lines 30 116) the Hoare annotation is: (or (= 0 main_~p7~0) (= 1 main_~lk7~0)) [2020-07-11 01:02:40,231 INFO L271 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: true [2020-07-11 01:02:40,233 INFO L264 CegarLoopResult]: At program point L98(line 98) the Hoare annotation is: (let ((.cse5 (= 0 main_~p6~0)) (.cse2 (= 1 main_~lk5~0)) (.cse6 (= 1 main_~lk7~0)) (.cse0 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p7~0)) (.cse4 (= 0 main_~p5~0)) (.cse3 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse4 .cse5 .cse3) (and .cse0 .cse6 .cse2 .cse3) (and .cse6 .cse4 .cse5 .cse3) (and .cse1 .cse5 .cse2 .cse3) (and .cse6 .cse5 .cse2 .cse3) (and .cse0 .cse6 .cse4 .cse3) (and .cse0 .cse1 .cse4 .cse3))) [2020-07-11 01:02:40,233 INFO L271 CegarLoopResult]: At program point L32(lines 32 34) the Hoare annotation is: true [2020-07-11 01:02:40,234 INFO L271 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: true [2020-07-11 01:02:40,234 INFO L271 CegarLoopResult]: At program point L24-1(line 24) the Hoare annotation is: true [2020-07-11 01:02:40,234 INFO L271 CegarLoopResult]: At program point L24-2(line 24) the Hoare annotation is: true [2020-07-11 01:02:40,234 INFO L264 CegarLoopResult]: At program point L82(line 82) the Hoare annotation is: (let ((.cse2 (= 0 main_~p2~0)) (.cse8 (= 0 main_~p3~0)) (.cse9 (= main_~lk7~0 1)) (.cse7 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p4~0)) (.cse10 (= 1 main_~lk5~0)) (.cse0 (= 0 main_~p7~0)) (.cse11 (= 1 main_~lk2~0)) (.cse3 (= 1 main_~lk3~0)) (.cse4 (= 0 main_~p5~0)) (.cse5 (= 0 main_~p6~0)) (.cse6 (= 1 main_~lk1~0)) (.cse12 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse1 .cse2 .cse10 .cse6) (and .cse11 .cse9 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse8 .cse11 .cse9 .cse10 .cse6 .cse12) (and .cse7 .cse11 .cse9 .cse1 .cse3 .cse4 .cse6) (and .cse7 .cse11 .cse9 .cse3 .cse4 .cse6 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse5 .cse10 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse9 .cse2 .cse3 .cse4 .cse6 .cse12) (and .cse9 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse9 .cse1 .cse2 .cse3 .cse10 .cse6) (and .cse8 .cse11 .cse9 .cse5 .cse10 .cse6 .cse12) (and .cse0 .cse11 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse1 .cse10 .cse6) (and .cse0 .cse11 .cse1 .cse3 .cse5 .cse10 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse4 .cse6 .cse12) (and .cse7 .cse9 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse0 .cse8 .cse11 .cse1 .cse4 .cse6) (and .cse7 .cse0 .cse8 .cse11 .cse10 .cse6 .cse12) (and .cse7 .cse0 .cse8 .cse11 .cse4 .cse6 .cse12) (and .cse11 .cse9 .cse1 .cse3 .cse5 .cse10 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse1 .cse4 .cse6) (and .cse7 .cse0 .cse8 .cse2 .cse4 .cse6 .cse12) (and .cse7 .cse0 .cse2 .cse3 .cse4 .cse6 .cse12) (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse6 .cse12) (and .cse7 .cse0 .cse8 .cse2 .cse10 .cse6 .cse12) (and .cse7 .cse9 .cse2 .cse3 .cse10 .cse6 .cse12) (and .cse9 .cse2 .cse3 .cse5 .cse10 .cse6 .cse12) (and .cse7 .cse0 .cse8 .cse1 .cse2 .cse4 .cse6) (and .cse11 .cse9 .cse3 .cse5 .cse10 .cse6 .cse12) (and .cse7 .cse0 .cse11 .cse3 .cse10 .cse6 .cse12) (and .cse8 .cse9 .cse2 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse0 .cse8 .cse11 .cse1 .cse10 .cse6) (and .cse7 .cse0 .cse11 .cse1 .cse3 .cse10 .cse6) (and .cse7 .cse8 .cse9 .cse2 .cse10 .cse6 .cse12) (and .cse0 .cse8 .cse11 .cse1 .cse5 .cse10 .cse6) (and .cse7 .cse11 .cse9 .cse1 .cse3 .cse10 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse10 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse8 .cse9 .cse1 .cse2 .cse5 .cse10 .cse6) (and .cse11 .cse9 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse1 .cse2 .cse4 .cse6) (and .cse9 .cse1 .cse2 .cse3 .cse5 .cse10 .cse6) (and .cse7 .cse0 .cse2 .cse3 .cse10 .cse6 .cse12) (and .cse0 .cse8 .cse2 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse11 .cse9 .cse3 .cse10 .cse6 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10 .cse6) (and .cse7 .cse0 .cse8 .cse1 .cse2 .cse10 .cse6) (and .cse7 .cse0 .cse11 .cse3 .cse4 .cse6 .cse12) (and .cse0 .cse8 .cse2 .cse5 .cse10 .cse6 .cse12) (and .cse8 .cse11 .cse9 .cse1 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse2 .cse4 .cse6 .cse12) (and .cse0 .cse8 .cse11 .cse5 .cse10 .cse6 .cse12) (and .cse8 .cse9 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse0 .cse8 .cse11 .cse4 .cse5 .cse6 .cse12) (and .cse0 .cse8 .cse11 .cse1 .cse4 .cse5 .cse6) (and .cse8 .cse11 .cse9 .cse1 .cse5 .cse10 .cse6) (and .cse8 .cse9 .cse2 .cse5 .cse10 .cse6 .cse12) (and .cse8 .cse11 .cse9 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse0 .cse11 .cse1 .cse3 .cse4 .cse6) (and .cse0 .cse11 .cse3 .cse5 .cse10 .cse6 .cse12) (and .cse0 .cse11 .cse3 .cse4 .cse5 .cse6 .cse12))) [2020-07-11 01:02:40,235 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-07-11 01:02:40,235 INFO L264 CegarLoopResult]: At program point L107(line 107) the Hoare annotation is: (let ((.cse0 (= 1 main_~lk6~0))) (or (and .cse0 (= 1 main_~lk7~0)) (and .cse0 (= 0 main_~p7~0)))) [2020-07-11 01:02:40,235 INFO L271 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: true [2020-07-11 01:02:40,235 INFO L264 CegarLoopResult]: At program point L91-1(lines 30 116) the Hoare annotation is: (let ((.cse3 (= 1 main_~lk4~0)) (.cse0 (= 0 main_~p7~0)) (.cse7 (= 1 main_~lk5~0)) (.cse5 (= 1 main_~lk6~0)) (.cse6 (= 1 main_~lk7~0)) (.cse4 (= 0 main_~p4~0)) (.cse1 (= 0 main_~p5~0)) (.cse2 (= 0 main_~p6~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse1 .cse2) (and .cse5 .cse6 .cse7 .cse3) (and .cse6 .cse2 .cse7 .cse3) (and .cse5 .cse0 .cse1 .cse3) (and .cse6 .cse4 .cse2 .cse7) (and .cse5 .cse0 .cse7 .cse3) (and .cse6 .cse1 .cse2 .cse3) (and .cse5 .cse6 .cse4 .cse7) (and .cse5 .cse0 .cse4 .cse1) (and .cse5 .cse0 .cse4 .cse7) (and .cse5 .cse6 .cse1 .cse3) (and .cse0 .cse2 .cse7 .cse3) (and .cse0 .cse4 .cse2 .cse7) (and .cse5 .cse6 .cse4 .cse1) (and .cse6 .cse4 .cse1 .cse2))) [2020-07-11 01:02:40,235 INFO L271 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-07-11 01:02:40,236 INFO L264 CegarLoopResult]: At program point L83(line 83) the Hoare annotation is: (let ((.cse2 (= 0 main_~p2~0)) (.cse8 (= 0 main_~p3~0)) (.cse9 (= main_~lk7~0 1)) (.cse7 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p4~0)) (.cse10 (= 1 main_~lk5~0)) (.cse0 (= 0 main_~p7~0)) (.cse11 (= 1 main_~lk2~0)) (.cse3 (= 1 main_~lk3~0)) (.cse4 (= 0 main_~p5~0)) (.cse5 (= 0 main_~p6~0)) (.cse6 (= 1 main_~lk1~0)) (.cse12 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse1 .cse2 .cse10 .cse6) (and .cse11 .cse9 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse11 .cse9 .cse1 .cse3 .cse4 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse10 .cse6 .cse12) (and .cse7 .cse11 .cse9 .cse3 .cse4 .cse6 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse5 .cse10 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse9 .cse2 .cse3 .cse4 .cse6 .cse12) (and .cse7 .cse9 .cse1 .cse2 .cse3 .cse10 .cse6) (and .cse9 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse8 .cse11 .cse9 .cse5 .cse10 .cse6 .cse12) (and .cse0 .cse11 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse1 .cse10 .cse6) (and .cse0 .cse11 .cse1 .cse3 .cse5 .cse10 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse4 .cse6 .cse12) (and .cse7 .cse0 .cse8 .cse11 .cse1 .cse4 .cse6) (and .cse7 .cse9 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse0 .cse8 .cse11 .cse10 .cse6 .cse12) (and .cse7 .cse0 .cse8 .cse11 .cse4 .cse6 .cse12) (and .cse11 .cse9 .cse1 .cse3 .cse5 .cse10 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse1 .cse4 .cse6) (and .cse7 .cse0 .cse8 .cse2 .cse4 .cse6 .cse12) (and .cse7 .cse0 .cse2 .cse3 .cse4 .cse6 .cse12) (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse6 .cse12) (and .cse7 .cse0 .cse8 .cse2 .cse10 .cse6 .cse12) (and .cse9 .cse2 .cse3 .cse5 .cse10 .cse6 .cse12) (and .cse7 .cse9 .cse2 .cse3 .cse10 .cse6 .cse12) (and .cse7 .cse0 .cse8 .cse1 .cse2 .cse4 .cse6) (and .cse11 .cse9 .cse3 .cse5 .cse10 .cse6 .cse12) (and .cse7 .cse0 .cse11 .cse3 .cse10 .cse6 .cse12) (and .cse8 .cse9 .cse2 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse0 .cse8 .cse11 .cse1 .cse10 .cse6) (and .cse7 .cse8 .cse9 .cse2 .cse10 .cse6 .cse12) (and .cse7 .cse0 .cse11 .cse1 .cse3 .cse10 .cse6) (and .cse0 .cse8 .cse11 .cse1 .cse5 .cse10 .cse6) (and .cse7 .cse11 .cse9 .cse1 .cse3 .cse10 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse10 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse8 .cse9 .cse1 .cse2 .cse5 .cse10 .cse6) (and .cse11 .cse9 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse1 .cse2 .cse4 .cse6) (and .cse9 .cse1 .cse2 .cse3 .cse5 .cse10 .cse6) (and .cse7 .cse0 .cse2 .cse3 .cse10 .cse6 .cse12) (and .cse0 .cse8 .cse2 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse11 .cse9 .cse3 .cse10 .cse6 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10 .cse6) (and .cse7 .cse0 .cse8 .cse1 .cse2 .cse10 .cse6) (and .cse0 .cse8 .cse2 .cse5 .cse10 .cse6 .cse12) (and .cse7 .cse0 .cse11 .cse3 .cse4 .cse6 .cse12) (and .cse8 .cse11 .cse9 .cse1 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse2 .cse4 .cse6 .cse12) (and .cse0 .cse8 .cse11 .cse5 .cse10 .cse6 .cse12) (and .cse0 .cse8 .cse11 .cse4 .cse5 .cse6 .cse12) (and .cse0 .cse8 .cse11 .cse1 .cse4 .cse5 .cse6) (and .cse8 .cse9 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse8 .cse11 .cse9 .cse1 .cse5 .cse10 .cse6) (and .cse8 .cse9 .cse2 .cse5 .cse10 .cse6 .cse12) (and .cse8 .cse11 .cse9 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse0 .cse11 .cse1 .cse3 .cse4 .cse6) (and .cse0 .cse11 .cse3 .cse5 .cse10 .cse6 .cse12) (and .cse0 .cse11 .cse3 .cse4 .cse5 .cse6 .cse12))) [2020-07-11 01:02:40,236 INFO L264 CegarLoopResult]: At program point L108(line 108) the Hoare annotation is: (let ((.cse0 (= 1 main_~lk6~0))) (or (and .cse0 (= 1 main_~lk7~0)) (and .cse0 (= 0 main_~p7~0)))) [2020-07-11 01:02:40,238 INFO L264 CegarLoopResult]: At program point L75-1(lines 30 116) the Hoare annotation is: (let ((.cse7 (= 1 main_~lk6~0)) (.cse6 (= 1 main_~lk5~0)) (.cse8 (= 0 main_~p3~0)) (.cse0 (= main_~lk7~0 1)) (.cse1 (= 0 main_~p4~0)) (.cse2 (= 0 main_~p2~0)) (.cse5 (= 0 main_~p1~0)) (.cse13 (= 0 main_~p7~0)) (.cse9 (= 1 main_~lk2~0)) (.cse3 (= 1 main_~lk3~0)) (.cse10 (= 0 main_~p5~0)) (.cse4 (= 0 main_~p6~0)) (.cse11 (= 1 main_~lk1~0)) (.cse12 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse0 .cse1 .cse10 .cse5) (and .cse9 .cse0 .cse3 .cse10 .cse4 .cse11 .cse12) (and .cse7 .cse9 .cse0 .cse1 .cse3 .cse10 .cse11) (and .cse13 .cse8 .cse1 .cse2 .cse4 .cse6 .cse11) (and .cse7 .cse0 .cse2 .cse3 .cse10 .cse11 .cse12) (and .cse8 .cse9 .cse0 .cse1 .cse10 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse10 .cse4 .cse11 .cse12) (and .cse13 .cse8 .cse1 .cse2 .cse10 .cse4 .cse11) (and .cse13 .cse9 .cse1 .cse3 .cse10 .cse4 .cse5) (and .cse7 .cse9 .cse0 .cse3 .cse10 .cse5 .cse12) (and .cse7 .cse13 .cse8 .cse9 .cse1 .cse10 .cse11) (and .cse13 .cse8 .cse9 .cse1 .cse10 .cse4 .cse5) (and .cse13 .cse9 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse13 .cse8 .cse2 .cse10 .cse5 .cse12) (and .cse9 .cse0 .cse1 .cse3 .cse4 .cse6 .cse11) (and .cse7 .cse8 .cse9 .cse0 .cse1 .cse10 .cse11) (and .cse7 .cse13 .cse8 .cse2 .cse10 .cse11 .cse12) (and .cse13 .cse8 .cse9 .cse10 .cse4 .cse5 .cse12) (and .cse7 .cse8 .cse9 .cse0 .cse10 .cse5 .cse12) (and .cse7 .cse13 .cse8 .cse2 .cse6 .cse11 .cse12) (and .cse7 .cse13 .cse8 .cse2 .cse5 .cse6 .cse12) (and .cse7 .cse0 .cse2 .cse3 .cse5 .cse6 .cse12) (and .cse7 .cse8 .cse0 .cse2 .cse5 .cse6 .cse12) (and .cse7 .cse13 .cse9 .cse1 .cse3 .cse5 .cse6) (and .cse13 .cse8 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse0 .cse2 .cse10 .cse5 .cse12) (and .cse13 .cse1 .cse2 .cse3 .cse10 .cse4 .cse5) (and .cse7 .cse0 .cse2 .cse3 .cse10 .cse5 .cse12) (and .cse7 .cse8 .cse0 .cse2 .cse6 .cse11 .cse12) (and .cse7 .cse13 .cse9 .cse3 .cse5 .cse6 .cse12) (and .cse7 .cse13 .cse8 .cse9 .cse1 .cse10 .cse5) (and .cse9 .cse0 .cse3 .cse10 .cse4 .cse5 .cse12) (and .cse7 .cse9 .cse0 .cse1 .cse3 .cse6 .cse11) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse6 .cse11) (and .cse7 .cse13 .cse8 .cse9 .cse1 .cse5 .cse6) (and .cse9 .cse0 .cse1 .cse3 .cse10 .cse4 .cse11) (and .cse7 .cse8 .cse0 .cse1 .cse2 .cse10 .cse11) (and .cse9 .cse0 .cse1 .cse3 .cse10 .cse4 .cse5) (and .cse9 .cse0 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse13 .cse8 .cse1 .cse2 .cse10 .cse4 .cse5) (and .cse7 .cse13 .cse2 .cse3 .cse6 .cse11 .cse12) (and .cse7 .cse13 .cse9 .cse3 .cse10 .cse5 .cse12) (and .cse7 .cse9 .cse0 .cse3 .cse6 .cse11 .cse12) (and .cse13 .cse1 .cse2 .cse3 .cse4 .cse6 .cse11) (and .cse7 .cse13 .cse8 .cse1 .cse2 .cse6 .cse11) (and .cse7 .cse13 .cse9 .cse3 .cse10 .cse11 .cse12) (and .cse8 .cse9 .cse0 .cse1 .cse10 .cse4 .cse11) (and .cse7 .cse9 .cse0 .cse1 .cse3 .cse10 .cse5) (and .cse13 .cse8 .cse2 .cse10 .cse4 .cse5 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse5) (and .cse7 .cse8 .cse0 .cse2 .cse10 .cse11 .cse12) (and .cse13 .cse2 .cse3 .cse10 .cse4 .cse5 .cse12) (and .cse13 .cse8 .cse9 .cse4 .cse6 .cse11 .cse12) (and .cse13 .cse8 .cse9 .cse1 .cse10 .cse4 .cse11) (and .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse8 .cse0 .cse2 .cse4 .cse6 .cse11 .cse12) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse8 .cse9 .cse0 .cse10 .cse4 .cse11 .cse12) (and .cse7 .cse13 .cse8 .cse1 .cse2 .cse10 .cse5) (and .cse13 .cse8 .cse9 .cse1 .cse4 .cse5 .cse6) (and .cse13 .cse9 .cse3 .cse4 .cse6 .cse11 .cse12) (and .cse13 .cse1 .cse2 .cse3 .cse10 .cse4 .cse11) (and .cse13 .cse8 .cse2 .cse4 .cse5 .cse6 .cse12) (and .cse8 .cse0 .cse2 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse8 .cse0 .cse1 .cse2 .cse6 .cse11) (and .cse0 .cse2 .cse3 .cse10 .cse4 .cse5 .cse12) (and .cse7 .cse8 .cse9 .cse0 .cse6 .cse11 .cse12) (and .cse7 .cse9 .cse0 .cse3 .cse10 .cse11 .cse12) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse13 .cse1 .cse2 .cse3 .cse10 .cse11) (and .cse9 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse6 .cse11) (and .cse8 .cse9 .cse0 .cse4 .cse6 .cse11 .cse12) (and .cse13 .cse9 .cse1 .cse3 .cse10 .cse4 .cse11) (and .cse7 .cse8 .cse9 .cse0 .cse1 .cse6 .cse11) (and .cse13 .cse9 .cse1 .cse3 .cse4 .cse6 .cse11) (and .cse7 .cse8 .cse9 .cse0 .cse10 .cse11 .cse12) (and .cse13 .cse9 .cse3 .cse10 .cse4 .cse5 .cse12) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse10 .cse11) (and .cse7 .cse13 .cse8 .cse9 .cse6 .cse11 .cse12) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse10 .cse5) (and .cse7 .cse13 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse7 .cse13 .cse8 .cse1 .cse2 .cse5 .cse6) (and .cse7 .cse13 .cse2 .cse3 .cse5 .cse6 .cse12) (and .cse7 .cse13 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse8 .cse0 .cse2 .cse10 .cse4 .cse5 .cse12) (and .cse8 .cse9 .cse0 .cse1 .cse4 .cse5 .cse6) (and .cse7 .cse13 .cse2 .cse3 .cse10 .cse11 .cse12) (and .cse13 .cse2 .cse3 .cse4 .cse6 .cse11 .cse12) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse11 .cse12) (and .cse7 .cse0 .cse2 .cse3 .cse6 .cse11 .cse12) (and .cse7 .cse8 .cse0 .cse1 .cse2 .cse10 .cse5) (and .cse7 .cse9 .cse0 .cse1 .cse3 .cse5 .cse6) (and .cse7 .cse13 .cse8 .cse1 .cse2 .cse10 .cse11) (and .cse9 .cse0 .cse3 .cse4 .cse6 .cse11 .cse12) (and .cse7 .cse13 .cse9 .cse3 .cse6 .cse11 .cse12) (and .cse13 .cse8 .cse9 .cse4 .cse5 .cse6 .cse12) (and .cse8 .cse0 .cse2 .cse10 .cse4 .cse11 .cse12) (and .cse7 .cse13 .cse8 .cse9 .cse1 .cse6 .cse11) (and .cse7 .cse13 .cse9 .cse1 .cse3 .cse6 .cse11) (and .cse13 .cse8 .cse9 .cse1 .cse4 .cse6 .cse11) (and .cse13 .cse9 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse0 .cse1 .cse2 .cse5 .cse6) (and .cse13 .cse2 .cse3 .cse10 .cse4 .cse11 .cse12) (and .cse7 .cse13 .cse1 .cse2 .cse3 .cse6 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse11) (and .cse7 .cse13 .cse2 .cse3 .cse10 .cse5 .cse12) (and .cse7 .cse13 .cse8 .cse9 .cse10 .cse5 .cse12) (and .cse8 .cse9 .cse0 .cse4 .cse5 .cse6 .cse12) (and .cse13 .cse8 .cse2 .cse10 .cse4 .cse11 .cse12) (and .cse13 .cse8 .cse2 .cse4 .cse6 .cse11 .cse12) (and .cse7 .cse8 .cse9 .cse0 .cse1 .cse5 .cse6) (and .cse7 .cse13 .cse1 .cse2 .cse3 .cse10 .cse5) (and .cse13 .cse8 .cse9 .cse10 .cse4 .cse11 .cse12) (and .cse8 .cse0 .cse1 .cse2 .cse10 .cse4 .cse11) (and .cse8 .cse9 .cse0 .cse1 .cse4 .cse6 .cse11) (and .cse7 .cse13 .cse9 .cse1 .cse3 .cse10 .cse5) (and .cse7 .cse13 .cse9 .cse1 .cse3 .cse10 .cse11) (and .cse8 .cse9 .cse0 .cse10 .cse4 .cse5 .cse12) (and .cse7 .cse13 .cse8 .cse9 .cse5 .cse6 .cse12) (and .cse13 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse9 .cse0 .cse3 .cse5 .cse6 .cse12) (and .cse7 .cse8 .cse9 .cse0 .cse5 .cse6 .cse12) (and .cse8 .cse0 .cse1 .cse2 .cse10 .cse4 .cse5) (and .cse13 .cse9 .cse3 .cse10 .cse4 .cse11 .cse12))) [2020-07-11 01:02:40,238 INFO L271 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-07-11 01:02:40,238 INFO L271 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: true [2020-07-11 01:02:40,238 INFO L271 CegarLoopResult]: At program point L9-2(line 9) the Hoare annotation is: true [2020-07-11 01:02:40,239 INFO L264 CegarLoopResult]: At program point L67-1(lines 30 116) 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-11 01:02:40,239 INFO L264 CegarLoopResult]: At program point L92(line 92) the Hoare annotation is: (let ((.cse0 (= 1 main_~lk7~0)) (.cse1 (= 0 main_~p4~0)) (.cse3 (= 0 main_~p5~0)) (.cse4 (= 0 main_~p6~0)) (.cse6 (= 1 main_~lk6~0)) (.cse5 (= 0 main_~p7~0)) (.cse2 (= 1 main_~lk3~0)) (.cse7 (= 1 main_~lk5~0)) (.cse8 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse2 .cse3 .cse4) (and .cse6 .cse5 .cse1 .cse2 .cse7) (and .cse5 .cse2 .cse4 .cse7 .cse8) (and .cse6 .cse0 .cse2 .cse7 .cse8) (and .cse0 .cse2 .cse3 .cse4 .cse8) (and .cse6 .cse5 .cse2 .cse3 .cse8) (and .cse6 .cse0 .cse1 .cse2 .cse3) (and .cse5 .cse1 .cse2 .cse4 .cse7) (and .cse6 .cse5 .cse1 .cse2 .cse3) (and .cse6 .cse0 .cse2 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse7) (and .cse0 .cse2 .cse4 .cse7 .cse8) (and .cse6 .cse0 .cse1 .cse2 .cse7) (and .cse5 .cse2 .cse3 .cse4 .cse8) (and .cse6 .cse5 .cse2 .cse7 .cse8))) [2020-07-11 01:02:40,239 INFO L264 CegarLoopResult]: At program point L59-1(lines 30 116) 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-11 01:02:40,239 INFO L271 CegarLoopResult]: At program point L117(lines 5 121) the Hoare annotation is: true [2020-07-11 01:02:40,239 INFO L271 CegarLoopResult]: At program point L51(lines 51 53) the Hoare annotation is: true [2020-07-11 01:02:40,240 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-07-11 01:02:40,240 INFO L271 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: true [2020-07-11 01:02:40,240 INFO L264 CegarLoopResult]: At program point L51-2(lines 30 116) the Hoare annotation is: (or (= 0 main_~p1~0) (= 1 main_~lk1~0)) [2020-07-11 01:02:40,240 INFO L271 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: true [2020-07-11 01:02:40,241 INFO L264 CegarLoopResult]: At program point L76(line 76) 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 .cse0 .cse9 .cse6 .cse2 .cse3 .cse4) (and .cse11 .cse0 .cse6 .cse2 .cse4 .cse5) (and .cse1 .cse9 .cse10 .cse2 .cse3 .cse8) (and .cse1 .cse9 .cse10 .cse3 .cse7 .cse8) (and .cse1 .cse9 .cse10 .cse2 .cse3 .cse4) (and .cse11 .cse1 .cse10 .cse2 .cse4 .cse5) (and .cse11 .cse1 .cse9 .cse10 .cse7 .cse8) (and .cse11 .cse0 .cse6 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse6 .cse7 .cse8 .cse5) (and .cse1 .cse9 .cse10 .cse3 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse9 .cse6 .cse10 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse6 .cse2 .cse8 .cse5) (and .cse6 .cse10 .cse3 .cse4 .cse7 .cse5) (and .cse1 .cse10 .cse3 .cse7 .cse8 .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 .cse9 .cse6 .cse10 .cse4 .cse7) (and .cse11 .cse0 .cse9 .cse6 .cse4 .cse7) (and .cse11 .cse9 .cse6 .cse10 .cse7 .cse8) (and .cse11 .cse0 .cse1 .cse9 .cse2 .cse8) (and .cse11 .cse6 .cse10 .cse2 .cse8 .cse5) (and .cse6 .cse10 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse1 .cse9 .cse10 .cse2 .cse8) (and .cse0 .cse6 .cse3 .cse4 .cse7 .cse5) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse8) (and .cse0 .cse1 .cse3 .cse7 .cse8 .cse5) (and .cse11 .cse9 .cse6 .cse10 .cse2 .cse4) (and .cse11 .cse9 .cse6 .cse10 .cse2 .cse8) (and .cse0 .cse1 .cse9 .cse3 .cse4 .cse7) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4) (and .cse0 .cse9 .cse6 .cse2 .cse3 .cse8) (and .cse11 .cse0 .cse1 .cse2 .cse8 .cse5) (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-11 01:02:40,241 INFO L271 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: true [2020-07-11 01:02:40,241 INFO L271 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: true [2020-07-11 01:02:40,241 INFO L264 CegarLoopResult]: At program point L68(line 68) the Hoare annotation is: (let ((.cse7 (= 0 main_~p2~0)) (.cse4 (= 0 main_~p3~0)) (.cse2 (= 0 main_~p1~0)) (.cse5 (= 0 main_~p4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse1 (= 1 main_~lk3~0)) (.cse6 (= 1 main_~lk1~0)) (.cse3 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse6) (and .cse7 .cse1 .cse6 .cse3) (and .cse4 .cse0 .cse6 .cse3) (and .cse5 .cse7 .cse1 .cse6) (and .cse4 .cse7 .cse6 .cse3) (and .cse7 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse7 .cse6) (and .cse5 .cse7 .cse1 .cse2) (and .cse4 .cse0 .cse5 .cse2) (and .cse4 .cse5 .cse7 .cse2) (and .cse4 .cse7 .cse2 .cse3) (and .cse4 .cse0 .cse2 .cse3) (and .cse0 .cse5 .cse1 .cse2) (and .cse0 .cse5 .cse1 .cse6) (and .cse0 .cse1 .cse6 .cse3))) [2020-07-11 01:02:40,241 INFO L264 CegarLoopResult]: At program point L101-1(lines 30 116) the Hoare annotation is: (let ((.cse1 (= 1 main_~lk7~0)) (.cse3 (= 0 main_~p6~0)) (.cse0 (= 1 main_~lk6~0)) (.cse2 (= 0 main_~p7~0))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse1 .cse3) (and .cse0 .cse2))) [2020-07-11 01:02:40,242 INFO L271 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: true [2020-07-11 01:02:40,365 INFO L163 areAnnotationChecker]: CFG has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-11 01:02:40,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 01:02:40 BoogieIcfgContainer [2020-07-11 01:02:40,378 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 01:02:40,380 INFO L168 Benchmark]: Toolchain (without parser) took 135182.01 ms. Allocated memory was 136.3 MB in the beginning and 902.8 MB in the end (delta: 766.5 MB). Free memory was 100.6 MB in the beginning and 640.4 MB in the end (delta: -539.8 MB). Peak memory consumption was 226.7 MB. Max. memory is 7.1 GB. [2020-07-11 01:02:40,383 INFO L168 Benchmark]: CDTParser took 0.92 ms. Allocated memory is still 136.3 MB. Free memory was 118.5 MB in the beginning and 118.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-11 01:02:40,384 INFO L168 Benchmark]: CACSL2BoogieTranslator took 271.53 ms. Allocated memory is still 136.3 MB. Free memory was 100.4 MB in the beginning and 89.5 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. [2020-07-11 01:02:40,385 INFO L168 Benchmark]: Boogie Preprocessor took 121.43 ms. Allocated memory was 136.3 MB in the beginning and 199.8 MB in the end (delta: 63.4 MB). Free memory was 89.2 MB in the beginning and 177.9 MB in the end (delta: -88.7 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. [2020-07-11 01:02:40,386 INFO L168 Benchmark]: RCFGBuilder took 618.23 ms. Allocated memory is still 199.8 MB. Free memory was 177.9 MB in the beginning and 144.8 MB in the end (delta: 33.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 7.1 GB. [2020-07-11 01:02:40,386 INFO L168 Benchmark]: TraceAbstraction took 134165.04 ms. Allocated memory was 199.8 MB in the beginning and 902.8 MB in the end (delta: 703.1 MB). Free memory was 144.1 MB in the beginning and 640.4 MB in the end (delta: -496.3 MB). Peak memory consumption was 206.8 MB. Max. memory is 7.1 GB. [2020-07-11 01:02:40,389 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.92 ms. Allocated memory is still 136.3 MB. Free memory was 118.5 MB in the beginning and 118.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 271.53 ms. Allocated memory is still 136.3 MB. Free memory was 100.4 MB in the beginning and 89.5 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 121.43 ms. Allocated memory was 136.3 MB in the beginning and 199.8 MB in the end (delta: 63.4 MB). Free memory was 89.2 MB in the beginning and 177.9 MB in the end (delta: -88.7 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 618.23 ms. Allocated memory is still 199.8 MB. Free memory was 177.9 MB in the beginning and 144.8 MB in the end (delta: 33.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 134165.04 ms. Allocated memory was 199.8 MB in the beginning and 902.8 MB in the end (delta: 703.1 MB). Free memory was 144.1 MB in the beginning and 640.4 MB in the end (delta: -496.3 MB). Peak memory consumption was 206.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 119]: 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: 30]: 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, 88 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 119.7s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 59.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 14.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1813 SDtfs, 648 SDslu, 1281 SDs, 0 SdLazy, 69 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3635occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 35.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 1022 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 88 LocationsWithAnnotation, 88 PreInvPairs, 4768 NumberOfFragments, 13918 HoareAnnotationTreeSize, 88 FomulaSimplifications, 98944 FormulaSimplificationTreeSizeReduction, 3.0s HoareSimplificationTime, 88 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 10.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 819 NumberOfCodeBlocks, 819 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 805 ConstructedInterpolants, 0 QuantifiedInterpolants, 58429 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...