/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/locks/test_locks_7.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 18:56:22,223 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 18:56:22,225 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 18:56:22,243 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 18:56:22,244 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 18:56:22,246 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 18:56:22,248 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 18:56:22,257 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 18:56:22,259 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 18:56:22,260 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 18:56:22,262 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 18:56:22,264 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 18:56:22,264 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 18:56:22,267 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 18:56:22,270 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 18:56:22,271 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 18:56:22,273 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 18:56:22,275 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 18:56:22,276 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 18:56:22,281 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 18:56:22,286 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 18:56:22,287 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 18:56:22,288 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 18:56:22,289 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 18:56:22,291 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 18:56:22,291 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 18:56:22,292 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 18:56:22,294 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 18:56:22,295 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 18:56:22,297 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 18:56:22,297 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 18:56:22,298 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 18:56:22,299 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 18:56:22,300 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 18:56:22,302 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 18:56:22,302 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 18:56:22,305 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 18:56:22,305 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 18:56:22,305 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 18:56:22,306 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 18:56:22,308 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 18:56:22,308 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 18:56:22,331 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 18:56:22,338 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 18:56:22,340 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 18:56:22,340 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 18:56:22,343 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 18:56:22,343 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 18:56:22,344 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 18:56:22,344 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 18:56:22,344 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 18:56:22,344 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 18:56:22,344 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 18:56:22,344 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 18:56:22,345 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 18:56:22,345 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 18:56:22,345 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 18:56:22,345 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 18:56:22,345 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 18:56:22,346 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 18:56:22,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 18:56:22,346 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 18:56:22,346 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 18:56:22,346 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 18:56:22,346 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 18:56:22,622 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 18:56:22,636 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 18:56:22,639 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 18:56:22,640 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 18:56:22,640 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 18:56:22,641 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-10 18:56:22,708 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9181ca0c0/e0e2e220683b462cbb9d021d1544ee56/FLAG1e61e9a57 [2020-07-10 18:56:23,164 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 18:56:23,165 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7.c [2020-07-10 18:56:23,172 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9181ca0c0/e0e2e220683b462cbb9d021d1544ee56/FLAG1e61e9a57 [2020-07-10 18:56:23,551 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9181ca0c0/e0e2e220683b462cbb9d021d1544ee56 [2020-07-10 18:56:23,562 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 18:56:23,563 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 18:56:23,564 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 18:56:23,564 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 18:56:23,570 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 18:56:23,571 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 06:56:23" (1/1) ... [2020-07-10 18:56:23,574 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dfdf274 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:56:23, skipping insertion in model container [2020-07-10 18:56:23,574 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 06:56:23" (1/1) ... [2020-07-10 18:56:23,583 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 18:56:23,611 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 18:56:23,808 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 18:56:23,813 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 18:56:23,845 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 18:56:23,867 INFO L208 MainTranslator]: Completed translation [2020-07-10 18:56:23,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:56:23 WrapperNode [2020-07-10 18:56:23,868 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 18:56:23,869 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 18:56:23,869 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 18:56:23,869 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 18:56:23,959 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:56:23" (1/1) ... [2020-07-10 18:56:23,959 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:56:23" (1/1) ... [2020-07-10 18:56:23,965 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:56:23" (1/1) ... [2020-07-10 18:56:23,966 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:56:23" (1/1) ... [2020-07-10 18:56:23,972 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:56:23" (1/1) ... [2020-07-10 18:56:23,981 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:56:23" (1/1) ... [2020-07-10 18:56:23,982 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:56:23" (1/1) ... [2020-07-10 18:56:23,984 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 18:56:23,985 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 18:56:23,985 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 18:56:23,985 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 18:56:23,986 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:56:23" (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-10 18:56:24,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 18:56:24,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 18:56:24,052 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 18:56:24,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 18:56:24,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 18:56:24,053 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 18:56:24,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 18:56:24,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 18:56:24,564 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 18:56:24,564 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 18:56:24,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 06:56:24 BoogieIcfgContainer [2020-07-10 18:56:24,569 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 18:56:24,570 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 18:56:24,571 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 18:56:24,574 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 18:56:24,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 06:56:23" (1/3) ... [2020-07-10 18:56:24,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ffec8b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 06:56:24, skipping insertion in model container [2020-07-10 18:56:24,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:56:23" (2/3) ... [2020-07-10 18:56:24,576 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ffec8b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 06:56:24, skipping insertion in model container [2020-07-10 18:56:24,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 06:56:24" (3/3) ... [2020-07-10 18:56:24,578 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_7.c [2020-07-10 18:56:24,589 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 18:56:24,597 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 18:56:24,612 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 18:56:24,636 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 18:56:24,636 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 18:56:24,636 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 18:56:24,636 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 18:56:24,637 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 18:56:24,637 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 18:56:24,637 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 18:56:24,637 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 18:56:24,656 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2020-07-10 18:56:24,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-07-10 18:56:24,669 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:56:24,671 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-10 18:56:24,671 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:56:24,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:56:24,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1826051656, now seen corresponding path program 1 times [2020-07-10 18:56:24,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:56:24,688 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1469372660] [2020-07-10 18:56:24,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:56:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:56:24,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:56:24,936 INFO L280 TraceCheckUtils]: 0: Hoare triple {91#true} assume true; {91#true} is VALID [2020-07-10 18:56:24,936 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {91#true} {91#true} #199#return; {91#true} is VALID [2020-07-10 18:56:24,938 INFO L263 TraceCheckUtils]: 0: Hoare triple {91#true} call ULTIMATE.init(); {91#true} is VALID [2020-07-10 18:56:24,939 INFO L280 TraceCheckUtils]: 1: Hoare triple {91#true} assume true; {91#true} is VALID [2020-07-10 18:56:24,939 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {91#true} {91#true} #199#return; {91#true} is VALID [2020-07-10 18:56:24,940 INFO L263 TraceCheckUtils]: 3: Hoare triple {91#true} call #t~ret8 := main(); {91#true} is VALID [2020-07-10 18:56:24,940 INFO L280 TraceCheckUtils]: 4: Hoare triple {91#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {91#true} is VALID [2020-07-10 18:56:24,940 INFO L280 TraceCheckUtils]: 5: Hoare triple {91#true} ~p1~0 := #t~nondet0; {91#true} is VALID [2020-07-10 18:56:24,941 INFO L280 TraceCheckUtils]: 6: Hoare triple {91#true} havoc #t~nondet0; {91#true} is VALID [2020-07-10 18:56:24,941 INFO L280 TraceCheckUtils]: 7: Hoare triple {91#true} havoc ~lk1~0; {91#true} is VALID [2020-07-10 18:56:24,941 INFO L280 TraceCheckUtils]: 8: Hoare triple {91#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {91#true} is VALID [2020-07-10 18:56:24,942 INFO L280 TraceCheckUtils]: 9: Hoare triple {91#true} ~p2~0 := #t~nondet1; {91#true} is VALID [2020-07-10 18:56:24,942 INFO L280 TraceCheckUtils]: 10: Hoare triple {91#true} havoc #t~nondet1; {91#true} is VALID [2020-07-10 18:56:24,942 INFO L280 TraceCheckUtils]: 11: Hoare triple {91#true} havoc ~lk2~0; {91#true} is VALID [2020-07-10 18:56:24,943 INFO L280 TraceCheckUtils]: 12: Hoare triple {91#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {91#true} is VALID [2020-07-10 18:56:24,943 INFO L280 TraceCheckUtils]: 13: Hoare triple {91#true} ~p3~0 := #t~nondet2; {91#true} is VALID [2020-07-10 18:56:24,943 INFO L280 TraceCheckUtils]: 14: Hoare triple {91#true} havoc #t~nondet2; {91#true} is VALID [2020-07-10 18:56:24,943 INFO L280 TraceCheckUtils]: 15: Hoare triple {91#true} havoc ~lk3~0; {91#true} is VALID [2020-07-10 18:56:24,944 INFO L280 TraceCheckUtils]: 16: Hoare triple {91#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {91#true} is VALID [2020-07-10 18:56:24,944 INFO L280 TraceCheckUtils]: 17: Hoare triple {91#true} ~p4~0 := #t~nondet3; {91#true} is VALID [2020-07-10 18:56:24,945 INFO L280 TraceCheckUtils]: 18: Hoare triple {91#true} havoc #t~nondet3; {91#true} is VALID [2020-07-10 18:56:24,945 INFO L280 TraceCheckUtils]: 19: Hoare triple {91#true} havoc ~lk4~0; {91#true} is VALID [2020-07-10 18:56:24,945 INFO L280 TraceCheckUtils]: 20: Hoare triple {91#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {91#true} is VALID [2020-07-10 18:56:24,946 INFO L280 TraceCheckUtils]: 21: Hoare triple {91#true} ~p5~0 := #t~nondet4; {91#true} is VALID [2020-07-10 18:56:24,946 INFO L280 TraceCheckUtils]: 22: Hoare triple {91#true} havoc #t~nondet4; {91#true} is VALID [2020-07-10 18:56:24,947 INFO L280 TraceCheckUtils]: 23: Hoare triple {91#true} havoc ~lk5~0; {91#true} is VALID [2020-07-10 18:56:24,947 INFO L280 TraceCheckUtils]: 24: Hoare triple {91#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {91#true} is VALID [2020-07-10 18:56:24,947 INFO L280 TraceCheckUtils]: 25: Hoare triple {91#true} ~p6~0 := #t~nondet5; {91#true} is VALID [2020-07-10 18:56:24,948 INFO L280 TraceCheckUtils]: 26: Hoare triple {91#true} havoc #t~nondet5; {91#true} is VALID [2020-07-10 18:56:24,948 INFO L280 TraceCheckUtils]: 27: Hoare triple {91#true} havoc ~lk6~0; {91#true} is VALID [2020-07-10 18:56:24,949 INFO L280 TraceCheckUtils]: 28: Hoare triple {91#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {91#true} is VALID [2020-07-10 18:56:24,949 INFO L280 TraceCheckUtils]: 29: Hoare triple {91#true} ~p7~0 := #t~nondet6; {91#true} is VALID [2020-07-10 18:56:24,949 INFO L280 TraceCheckUtils]: 30: Hoare triple {91#true} havoc #t~nondet6; {91#true} is VALID [2020-07-10 18:56:24,950 INFO L280 TraceCheckUtils]: 31: Hoare triple {91#true} havoc ~lk7~0; {91#true} is VALID [2020-07-10 18:56:24,950 INFO L280 TraceCheckUtils]: 32: Hoare triple {91#true} havoc ~cond~0; {91#true} is VALID [2020-07-10 18:56:24,950 INFO L280 TraceCheckUtils]: 33: Hoare triple {91#true} assume !false; {91#true} is VALID [2020-07-10 18:56:24,951 INFO L280 TraceCheckUtils]: 34: Hoare triple {91#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {91#true} is VALID [2020-07-10 18:56:24,951 INFO L280 TraceCheckUtils]: 35: Hoare triple {91#true} ~cond~0 := #t~nondet7; {91#true} is VALID [2020-07-10 18:56:24,952 INFO L280 TraceCheckUtils]: 36: Hoare triple {91#true} havoc #t~nondet7; {91#true} is VALID [2020-07-10 18:56:24,952 INFO L280 TraceCheckUtils]: 37: Hoare triple {91#true} assume !(0 == ~cond~0); {91#true} is VALID [2020-07-10 18:56:24,953 INFO L280 TraceCheckUtils]: 38: Hoare triple {91#true} ~lk1~0 := 0; {91#true} is VALID [2020-07-10 18:56:24,953 INFO L280 TraceCheckUtils]: 39: Hoare triple {91#true} ~lk2~0 := 0; {91#true} is VALID [2020-07-10 18:56:24,953 INFO L280 TraceCheckUtils]: 40: Hoare triple {91#true} ~lk3~0 := 0; {91#true} is VALID [2020-07-10 18:56:24,954 INFO L280 TraceCheckUtils]: 41: Hoare triple {91#true} ~lk4~0 := 0; {91#true} is VALID [2020-07-10 18:56:24,954 INFO L280 TraceCheckUtils]: 42: Hoare triple {91#true} ~lk5~0 := 0; {91#true} is VALID [2020-07-10 18:56:24,955 INFO L280 TraceCheckUtils]: 43: Hoare triple {91#true} ~lk6~0 := 0; {91#true} is VALID [2020-07-10 18:56:24,955 INFO L280 TraceCheckUtils]: 44: Hoare triple {91#true} ~lk7~0 := 0; {91#true} is VALID [2020-07-10 18:56:24,956 INFO L280 TraceCheckUtils]: 45: Hoare triple {91#true} assume !(0 != ~p1~0); {95#(= 0 main_~p1~0)} is VALID [2020-07-10 18:56:24,957 INFO L280 TraceCheckUtils]: 46: Hoare triple {95#(= 0 main_~p1~0)} assume !(0 != ~p2~0); {95#(= 0 main_~p1~0)} is VALID [2020-07-10 18:56:24,958 INFO L280 TraceCheckUtils]: 47: Hoare triple {95#(= 0 main_~p1~0)} assume !(0 != ~p3~0); {95#(= 0 main_~p1~0)} is VALID [2020-07-10 18:56:24,959 INFO L280 TraceCheckUtils]: 48: Hoare triple {95#(= 0 main_~p1~0)} assume !(0 != ~p4~0); {95#(= 0 main_~p1~0)} is VALID [2020-07-10 18:56:24,960 INFO L280 TraceCheckUtils]: 49: Hoare triple {95#(= 0 main_~p1~0)} assume !(0 != ~p5~0); {95#(= 0 main_~p1~0)} is VALID [2020-07-10 18:56:24,961 INFO L280 TraceCheckUtils]: 50: Hoare triple {95#(= 0 main_~p1~0)} assume !(0 != ~p6~0); {95#(= 0 main_~p1~0)} is VALID [2020-07-10 18:56:24,962 INFO L280 TraceCheckUtils]: 51: Hoare triple {95#(= 0 main_~p1~0)} assume !(0 != ~p7~0); {95#(= 0 main_~p1~0)} is VALID [2020-07-10 18:56:24,963 INFO L280 TraceCheckUtils]: 52: Hoare triple {95#(= 0 main_~p1~0)} assume 0 != ~p1~0; {92#false} is VALID [2020-07-10 18:56:24,964 INFO L280 TraceCheckUtils]: 53: Hoare triple {92#false} assume 1 != ~lk1~0; {92#false} is VALID [2020-07-10 18:56:24,964 INFO L280 TraceCheckUtils]: 54: Hoare triple {92#false} assume !false; {92#false} is VALID [2020-07-10 18:56:24,973 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-10 18:56:24,974 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:56:24,976 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1469372660] [2020-07-10 18:56:24,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:56:24,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 18:56:24,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221149746] [2020-07-10 18:56:24,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2020-07-10 18:56:24,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:56:24,992 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 18:56:25,095 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-10 18:56:25,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 18:56:25,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:56:25,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 18:56:25,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 18:56:25,108 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 3 states. [2020-07-10 18:56:25,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:25,546 INFO L93 Difference]: Finished difference Result 191 states and 260 transitions. [2020-07-10 18:56:25,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 18:56:25,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2020-07-10 18:56:25,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:56:25,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:56:25,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 260 transitions. [2020-07-10 18:56:25,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:56:25,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 260 transitions. [2020-07-10 18:56:25,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 260 transitions. [2020-07-10 18:56:25,890 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-10 18:56:25,921 INFO L225 Difference]: With dead ends: 191 [2020-07-10 18:56:25,922 INFO L226 Difference]: Without dead ends: 128 [2020-07-10 18:56:25,929 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-10 18:56:25,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-07-10 18:56:26,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2020-07-10 18:56:26,061 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:56:26,062 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand 126 states. [2020-07-10 18:56:26,062 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 126 states. [2020-07-10 18:56:26,062 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 126 states. [2020-07-10 18:56:26,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:26,074 INFO L93 Difference]: Finished difference Result 128 states and 165 transitions. [2020-07-10 18:56:26,074 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 165 transitions. [2020-07-10 18:56:26,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:56:26,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:56:26,076 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 128 states. [2020-07-10 18:56:26,077 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 128 states. [2020-07-10 18:56:26,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:26,088 INFO L93 Difference]: Finished difference Result 128 states and 165 transitions. [2020-07-10 18:56:26,088 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 165 transitions. [2020-07-10 18:56:26,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:56:26,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:56:26,091 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:56:26,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:56:26,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-07-10 18:56:26,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 164 transitions. [2020-07-10 18:56:26,103 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 164 transitions. Word has length 55 [2020-07-10 18:56:26,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:56:26,103 INFO L479 AbstractCegarLoop]: Abstraction has 126 states and 164 transitions. [2020-07-10 18:56:26,104 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 18:56:26,104 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 126 states and 164 transitions. [2020-07-10 18:56:26,316 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-10 18:56:26,317 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 164 transitions. [2020-07-10 18:56:26,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-07-10 18:56:26,319 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:56:26,322 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-10 18:56:26,322 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 18:56:26,323 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:56:26,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:56:26,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1965492109, now seen corresponding path program 1 times [2020-07-10 18:56:26,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:56:26,324 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [450468209] [2020-07-10 18:56:26,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:56:26,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:56:26,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:56:26,439 INFO L280 TraceCheckUtils]: 0: Hoare triple {988#true} assume true; {988#true} is VALID [2020-07-10 18:56:26,439 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {988#true} {988#true} #199#return; {988#true} is VALID [2020-07-10 18:56:26,439 INFO L263 TraceCheckUtils]: 0: Hoare triple {988#true} call ULTIMATE.init(); {988#true} is VALID [2020-07-10 18:56:26,440 INFO L280 TraceCheckUtils]: 1: Hoare triple {988#true} assume true; {988#true} is VALID [2020-07-10 18:56:26,441 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {988#true} {988#true} #199#return; {988#true} is VALID [2020-07-10 18:56:26,442 INFO L263 TraceCheckUtils]: 3: Hoare triple {988#true} call #t~ret8 := main(); {988#true} is VALID [2020-07-10 18:56:26,442 INFO L280 TraceCheckUtils]: 4: Hoare triple {988#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {988#true} is VALID [2020-07-10 18:56:26,442 INFO L280 TraceCheckUtils]: 5: Hoare triple {988#true} ~p1~0 := #t~nondet0; {988#true} is VALID [2020-07-10 18:56:26,442 INFO L280 TraceCheckUtils]: 6: Hoare triple {988#true} havoc #t~nondet0; {988#true} is VALID [2020-07-10 18:56:26,443 INFO L280 TraceCheckUtils]: 7: Hoare triple {988#true} havoc ~lk1~0; {988#true} is VALID [2020-07-10 18:56:26,443 INFO L280 TraceCheckUtils]: 8: Hoare triple {988#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {988#true} is VALID [2020-07-10 18:56:26,443 INFO L280 TraceCheckUtils]: 9: Hoare triple {988#true} ~p2~0 := #t~nondet1; {988#true} is VALID [2020-07-10 18:56:26,444 INFO L280 TraceCheckUtils]: 10: Hoare triple {988#true} havoc #t~nondet1; {988#true} is VALID [2020-07-10 18:56:26,444 INFO L280 TraceCheckUtils]: 11: Hoare triple {988#true} havoc ~lk2~0; {988#true} is VALID [2020-07-10 18:56:26,444 INFO L280 TraceCheckUtils]: 12: Hoare triple {988#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {988#true} is VALID [2020-07-10 18:56:26,445 INFO L280 TraceCheckUtils]: 13: Hoare triple {988#true} ~p3~0 := #t~nondet2; {988#true} is VALID [2020-07-10 18:56:26,445 INFO L280 TraceCheckUtils]: 14: Hoare triple {988#true} havoc #t~nondet2; {988#true} is VALID [2020-07-10 18:56:26,445 INFO L280 TraceCheckUtils]: 15: Hoare triple {988#true} havoc ~lk3~0; {988#true} is VALID [2020-07-10 18:56:26,446 INFO L280 TraceCheckUtils]: 16: Hoare triple {988#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {988#true} is VALID [2020-07-10 18:56:26,446 INFO L280 TraceCheckUtils]: 17: Hoare triple {988#true} ~p4~0 := #t~nondet3; {988#true} is VALID [2020-07-10 18:56:26,446 INFO L280 TraceCheckUtils]: 18: Hoare triple {988#true} havoc #t~nondet3; {988#true} is VALID [2020-07-10 18:56:26,447 INFO L280 TraceCheckUtils]: 19: Hoare triple {988#true} havoc ~lk4~0; {988#true} is VALID [2020-07-10 18:56:26,447 INFO L280 TraceCheckUtils]: 20: Hoare triple {988#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {988#true} is VALID [2020-07-10 18:56:26,447 INFO L280 TraceCheckUtils]: 21: Hoare triple {988#true} ~p5~0 := #t~nondet4; {988#true} is VALID [2020-07-10 18:56:26,447 INFO L280 TraceCheckUtils]: 22: Hoare triple {988#true} havoc #t~nondet4; {988#true} is VALID [2020-07-10 18:56:26,448 INFO L280 TraceCheckUtils]: 23: Hoare triple {988#true} havoc ~lk5~0; {988#true} is VALID [2020-07-10 18:56:26,448 INFO L280 TraceCheckUtils]: 24: Hoare triple {988#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {988#true} is VALID [2020-07-10 18:56:26,448 INFO L280 TraceCheckUtils]: 25: Hoare triple {988#true} ~p6~0 := #t~nondet5; {988#true} is VALID [2020-07-10 18:56:26,449 INFO L280 TraceCheckUtils]: 26: Hoare triple {988#true} havoc #t~nondet5; {988#true} is VALID [2020-07-10 18:56:26,449 INFO L280 TraceCheckUtils]: 27: Hoare triple {988#true} havoc ~lk6~0; {988#true} is VALID [2020-07-10 18:56:26,449 INFO L280 TraceCheckUtils]: 28: Hoare triple {988#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {988#true} is VALID [2020-07-10 18:56:26,450 INFO L280 TraceCheckUtils]: 29: Hoare triple {988#true} ~p7~0 := #t~nondet6; {988#true} is VALID [2020-07-10 18:56:26,450 INFO L280 TraceCheckUtils]: 30: Hoare triple {988#true} havoc #t~nondet6; {988#true} is VALID [2020-07-10 18:56:26,450 INFO L280 TraceCheckUtils]: 31: Hoare triple {988#true} havoc ~lk7~0; {988#true} is VALID [2020-07-10 18:56:26,451 INFO L280 TraceCheckUtils]: 32: Hoare triple {988#true} havoc ~cond~0; {988#true} is VALID [2020-07-10 18:56:26,451 INFO L280 TraceCheckUtils]: 33: Hoare triple {988#true} assume !false; {988#true} is VALID [2020-07-10 18:56:26,451 INFO L280 TraceCheckUtils]: 34: Hoare triple {988#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {988#true} is VALID [2020-07-10 18:56:26,451 INFO L280 TraceCheckUtils]: 35: Hoare triple {988#true} ~cond~0 := #t~nondet7; {988#true} is VALID [2020-07-10 18:56:26,452 INFO L280 TraceCheckUtils]: 36: Hoare triple {988#true} havoc #t~nondet7; {988#true} is VALID [2020-07-10 18:56:26,452 INFO L280 TraceCheckUtils]: 37: Hoare triple {988#true} assume !(0 == ~cond~0); {988#true} is VALID [2020-07-10 18:56:26,452 INFO L280 TraceCheckUtils]: 38: Hoare triple {988#true} ~lk1~0 := 0; {988#true} is VALID [2020-07-10 18:56:26,453 INFO L280 TraceCheckUtils]: 39: Hoare triple {988#true} ~lk2~0 := 0; {988#true} is VALID [2020-07-10 18:56:26,453 INFO L280 TraceCheckUtils]: 40: Hoare triple {988#true} ~lk3~0 := 0; {988#true} is VALID [2020-07-10 18:56:26,453 INFO L280 TraceCheckUtils]: 41: Hoare triple {988#true} ~lk4~0 := 0; {988#true} is VALID [2020-07-10 18:56:26,454 INFO L280 TraceCheckUtils]: 42: Hoare triple {988#true} ~lk5~0 := 0; {988#true} is VALID [2020-07-10 18:56:26,454 INFO L280 TraceCheckUtils]: 43: Hoare triple {988#true} ~lk6~0 := 0; {988#true} is VALID [2020-07-10 18:56:26,454 INFO L280 TraceCheckUtils]: 44: Hoare triple {988#true} ~lk7~0 := 0; {988#true} is VALID [2020-07-10 18:56:26,454 INFO L280 TraceCheckUtils]: 45: Hoare triple {988#true} assume 0 != ~p1~0; {988#true} is VALID [2020-07-10 18:56:26,455 INFO L280 TraceCheckUtils]: 46: Hoare triple {988#true} ~lk1~0 := 1; {992#(= 1 main_~lk1~0)} is VALID [2020-07-10 18:56:26,457 INFO L280 TraceCheckUtils]: 47: Hoare triple {992#(= 1 main_~lk1~0)} assume !(0 != ~p2~0); {992#(= 1 main_~lk1~0)} is VALID [2020-07-10 18:56:26,458 INFO L280 TraceCheckUtils]: 48: Hoare triple {992#(= 1 main_~lk1~0)} assume !(0 != ~p3~0); {992#(= 1 main_~lk1~0)} is VALID [2020-07-10 18:56:26,459 INFO L280 TraceCheckUtils]: 49: Hoare triple {992#(= 1 main_~lk1~0)} assume !(0 != ~p4~0); {992#(= 1 main_~lk1~0)} is VALID [2020-07-10 18:56:26,460 INFO L280 TraceCheckUtils]: 50: Hoare triple {992#(= 1 main_~lk1~0)} assume !(0 != ~p5~0); {992#(= 1 main_~lk1~0)} is VALID [2020-07-10 18:56:26,461 INFO L280 TraceCheckUtils]: 51: Hoare triple {992#(= 1 main_~lk1~0)} assume !(0 != ~p6~0); {992#(= 1 main_~lk1~0)} is VALID [2020-07-10 18:56:26,462 INFO L280 TraceCheckUtils]: 52: Hoare triple {992#(= 1 main_~lk1~0)} assume !(0 != ~p7~0); {992#(= 1 main_~lk1~0)} is VALID [2020-07-10 18:56:26,463 INFO L280 TraceCheckUtils]: 53: Hoare triple {992#(= 1 main_~lk1~0)} assume 0 != ~p1~0; {992#(= 1 main_~lk1~0)} is VALID [2020-07-10 18:56:26,464 INFO L280 TraceCheckUtils]: 54: Hoare triple {992#(= 1 main_~lk1~0)} assume 1 != ~lk1~0; {989#false} is VALID [2020-07-10 18:56:26,464 INFO L280 TraceCheckUtils]: 55: Hoare triple {989#false} assume !false; {989#false} is VALID [2020-07-10 18:56:26,469 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-10 18:56:26,469 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:56:26,470 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [450468209] [2020-07-10 18:56:26,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:56:26,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 18:56:26,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419082721] [2020-07-10 18:56:26,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2020-07-10 18:56:26,472 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:56:26,472 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 18:56:26,530 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-10 18:56:26,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 18:56:26,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:56:26,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 18:56:26,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 18:56:26,531 INFO L87 Difference]: Start difference. First operand 126 states and 164 transitions. Second operand 3 states. [2020-07-10 18:56:26,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:26,808 INFO L93 Difference]: Finished difference Result 154 states and 202 transitions. [2020-07-10 18:56:26,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 18:56:26,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2020-07-10 18:56:26,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:56:26,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:56:26,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2020-07-10 18:56:26,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:56:26,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2020-07-10 18:56:26,818 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 159 transitions. [2020-07-10 18:56:26,983 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-10 18:56:26,990 INFO L225 Difference]: With dead ends: 154 [2020-07-10 18:56:26,990 INFO L226 Difference]: Without dead ends: 152 [2020-07-10 18:56:26,992 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-10 18:56:26,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-07-10 18:56:27,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 126. [2020-07-10 18:56:27,094 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:56:27,094 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand 126 states. [2020-07-10 18:56:27,095 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 126 states. [2020-07-10 18:56:27,095 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 126 states. [2020-07-10 18:56:27,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:27,103 INFO L93 Difference]: Finished difference Result 152 states and 200 transitions. [2020-07-10 18:56:27,103 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 200 transitions. [2020-07-10 18:56:27,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:56:27,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:56:27,111 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 152 states. [2020-07-10 18:56:27,111 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 152 states. [2020-07-10 18:56:27,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:27,126 INFO L93 Difference]: Finished difference Result 152 states and 200 transitions. [2020-07-10 18:56:27,126 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 200 transitions. [2020-07-10 18:56:27,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:56:27,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:56:27,133 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:56:27,134 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:56:27,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-07-10 18:56:27,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 163 transitions. [2020-07-10 18:56:27,151 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 163 transitions. Word has length 56 [2020-07-10 18:56:27,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:56:27,151 INFO L479 AbstractCegarLoop]: Abstraction has 126 states and 163 transitions. [2020-07-10 18:56:27,152 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 18:56:27,152 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 126 states and 163 transitions. [2020-07-10 18:56:27,337 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-10 18:56:27,338 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 163 transitions. [2020-07-10 18:56:27,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-07-10 18:56:27,340 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:56:27,341 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-10 18:56:27,341 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 18:56:27,341 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:56:27,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:56:27,344 INFO L82 PathProgramCache]: Analyzing trace with hash 773271458, now seen corresponding path program 1 times [2020-07-10 18:56:27,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:56:27,344 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2079773687] [2020-07-10 18:56:27,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:56:27,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:56:27,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:56:27,434 INFO L280 TraceCheckUtils]: 0: Hoare triple {1859#true} assume true; {1859#true} is VALID [2020-07-10 18:56:27,434 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1859#true} {1859#true} #199#return; {1859#true} is VALID [2020-07-10 18:56:27,435 INFO L263 TraceCheckUtils]: 0: Hoare triple {1859#true} call ULTIMATE.init(); {1859#true} is VALID [2020-07-10 18:56:27,435 INFO L280 TraceCheckUtils]: 1: Hoare triple {1859#true} assume true; {1859#true} is VALID [2020-07-10 18:56:27,435 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1859#true} {1859#true} #199#return; {1859#true} is VALID [2020-07-10 18:56:27,435 INFO L263 TraceCheckUtils]: 3: Hoare triple {1859#true} call #t~ret8 := main(); {1859#true} is VALID [2020-07-10 18:56:27,436 INFO L280 TraceCheckUtils]: 4: Hoare triple {1859#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1859#true} is VALID [2020-07-10 18:56:27,436 INFO L280 TraceCheckUtils]: 5: Hoare triple {1859#true} ~p1~0 := #t~nondet0; {1859#true} is VALID [2020-07-10 18:56:27,436 INFO L280 TraceCheckUtils]: 6: Hoare triple {1859#true} havoc #t~nondet0; {1859#true} is VALID [2020-07-10 18:56:27,436 INFO L280 TraceCheckUtils]: 7: Hoare triple {1859#true} havoc ~lk1~0; {1859#true} is VALID [2020-07-10 18:56:27,437 INFO L280 TraceCheckUtils]: 8: Hoare triple {1859#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1859#true} is VALID [2020-07-10 18:56:27,437 INFO L280 TraceCheckUtils]: 9: Hoare triple {1859#true} ~p2~0 := #t~nondet1; {1859#true} is VALID [2020-07-10 18:56:27,437 INFO L280 TraceCheckUtils]: 10: Hoare triple {1859#true} havoc #t~nondet1; {1859#true} is VALID [2020-07-10 18:56:27,437 INFO L280 TraceCheckUtils]: 11: Hoare triple {1859#true} havoc ~lk2~0; {1859#true} is VALID [2020-07-10 18:56:27,438 INFO L280 TraceCheckUtils]: 12: Hoare triple {1859#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1859#true} is VALID [2020-07-10 18:56:27,438 INFO L280 TraceCheckUtils]: 13: Hoare triple {1859#true} ~p3~0 := #t~nondet2; {1859#true} is VALID [2020-07-10 18:56:27,443 INFO L280 TraceCheckUtils]: 14: Hoare triple {1859#true} havoc #t~nondet2; {1859#true} is VALID [2020-07-10 18:56:27,444 INFO L280 TraceCheckUtils]: 15: Hoare triple {1859#true} havoc ~lk3~0; {1859#true} is VALID [2020-07-10 18:56:27,444 INFO L280 TraceCheckUtils]: 16: Hoare triple {1859#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1859#true} is VALID [2020-07-10 18:56:27,444 INFO L280 TraceCheckUtils]: 17: Hoare triple {1859#true} ~p4~0 := #t~nondet3; {1859#true} is VALID [2020-07-10 18:56:27,444 INFO L280 TraceCheckUtils]: 18: Hoare triple {1859#true} havoc #t~nondet3; {1859#true} is VALID [2020-07-10 18:56:27,445 INFO L280 TraceCheckUtils]: 19: Hoare triple {1859#true} havoc ~lk4~0; {1859#true} is VALID [2020-07-10 18:56:27,445 INFO L280 TraceCheckUtils]: 20: Hoare triple {1859#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1859#true} is VALID [2020-07-10 18:56:27,445 INFO L280 TraceCheckUtils]: 21: Hoare triple {1859#true} ~p5~0 := #t~nondet4; {1859#true} is VALID [2020-07-10 18:56:27,445 INFO L280 TraceCheckUtils]: 22: Hoare triple {1859#true} havoc #t~nondet4; {1859#true} is VALID [2020-07-10 18:56:27,446 INFO L280 TraceCheckUtils]: 23: Hoare triple {1859#true} havoc ~lk5~0; {1859#true} is VALID [2020-07-10 18:56:27,446 INFO L280 TraceCheckUtils]: 24: Hoare triple {1859#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1859#true} is VALID [2020-07-10 18:56:27,446 INFO L280 TraceCheckUtils]: 25: Hoare triple {1859#true} ~p6~0 := #t~nondet5; {1859#true} is VALID [2020-07-10 18:56:27,447 INFO L280 TraceCheckUtils]: 26: Hoare triple {1859#true} havoc #t~nondet5; {1859#true} is VALID [2020-07-10 18:56:27,447 INFO L280 TraceCheckUtils]: 27: Hoare triple {1859#true} havoc ~lk6~0; {1859#true} is VALID [2020-07-10 18:56:27,447 INFO L280 TraceCheckUtils]: 28: Hoare triple {1859#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {1859#true} is VALID [2020-07-10 18:56:27,447 INFO L280 TraceCheckUtils]: 29: Hoare triple {1859#true} ~p7~0 := #t~nondet6; {1859#true} is VALID [2020-07-10 18:56:27,448 INFO L280 TraceCheckUtils]: 30: Hoare triple {1859#true} havoc #t~nondet6; {1859#true} is VALID [2020-07-10 18:56:27,448 INFO L280 TraceCheckUtils]: 31: Hoare triple {1859#true} havoc ~lk7~0; {1859#true} is VALID [2020-07-10 18:56:27,448 INFO L280 TraceCheckUtils]: 32: Hoare triple {1859#true} havoc ~cond~0; {1859#true} is VALID [2020-07-10 18:56:27,448 INFO L280 TraceCheckUtils]: 33: Hoare triple {1859#true} assume !false; {1859#true} is VALID [2020-07-10 18:56:27,449 INFO L280 TraceCheckUtils]: 34: Hoare triple {1859#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {1859#true} is VALID [2020-07-10 18:56:27,449 INFO L280 TraceCheckUtils]: 35: Hoare triple {1859#true} ~cond~0 := #t~nondet7; {1859#true} is VALID [2020-07-10 18:56:27,449 INFO L280 TraceCheckUtils]: 36: Hoare triple {1859#true} havoc #t~nondet7; {1859#true} is VALID [2020-07-10 18:56:27,449 INFO L280 TraceCheckUtils]: 37: Hoare triple {1859#true} assume !(0 == ~cond~0); {1859#true} is VALID [2020-07-10 18:56:27,450 INFO L280 TraceCheckUtils]: 38: Hoare triple {1859#true} ~lk1~0 := 0; {1859#true} is VALID [2020-07-10 18:56:27,450 INFO L280 TraceCheckUtils]: 39: Hoare triple {1859#true} ~lk2~0 := 0; {1859#true} is VALID [2020-07-10 18:56:27,450 INFO L280 TraceCheckUtils]: 40: Hoare triple {1859#true} ~lk3~0 := 0; {1859#true} is VALID [2020-07-10 18:56:27,450 INFO L280 TraceCheckUtils]: 41: Hoare triple {1859#true} ~lk4~0 := 0; {1859#true} is VALID [2020-07-10 18:56:27,451 INFO L280 TraceCheckUtils]: 42: Hoare triple {1859#true} ~lk5~0 := 0; {1859#true} is VALID [2020-07-10 18:56:27,451 INFO L280 TraceCheckUtils]: 43: Hoare triple {1859#true} ~lk6~0 := 0; {1859#true} is VALID [2020-07-10 18:56:27,451 INFO L280 TraceCheckUtils]: 44: Hoare triple {1859#true} ~lk7~0 := 0; {1859#true} is VALID [2020-07-10 18:56:27,451 INFO L280 TraceCheckUtils]: 45: Hoare triple {1859#true} assume !(0 != ~p1~0); {1859#true} is VALID [2020-07-10 18:56:27,452 INFO L280 TraceCheckUtils]: 46: Hoare triple {1859#true} assume !(0 != ~p2~0); {1863#(= 0 main_~p2~0)} is VALID [2020-07-10 18:56:27,453 INFO L280 TraceCheckUtils]: 47: Hoare triple {1863#(= 0 main_~p2~0)} assume !(0 != ~p3~0); {1863#(= 0 main_~p2~0)} is VALID [2020-07-10 18:56:27,453 INFO L280 TraceCheckUtils]: 48: Hoare triple {1863#(= 0 main_~p2~0)} assume !(0 != ~p4~0); {1863#(= 0 main_~p2~0)} is VALID [2020-07-10 18:56:27,454 INFO L280 TraceCheckUtils]: 49: Hoare triple {1863#(= 0 main_~p2~0)} assume !(0 != ~p5~0); {1863#(= 0 main_~p2~0)} is VALID [2020-07-10 18:56:27,454 INFO L280 TraceCheckUtils]: 50: Hoare triple {1863#(= 0 main_~p2~0)} assume !(0 != ~p6~0); {1863#(= 0 main_~p2~0)} is VALID [2020-07-10 18:56:27,454 INFO L280 TraceCheckUtils]: 51: Hoare triple {1863#(= 0 main_~p2~0)} assume !(0 != ~p7~0); {1863#(= 0 main_~p2~0)} is VALID [2020-07-10 18:56:27,455 INFO L280 TraceCheckUtils]: 52: Hoare triple {1863#(= 0 main_~p2~0)} assume !(0 != ~p1~0); {1863#(= 0 main_~p2~0)} is VALID [2020-07-10 18:56:27,455 INFO L280 TraceCheckUtils]: 53: Hoare triple {1863#(= 0 main_~p2~0)} assume 0 != ~p2~0; {1860#false} is VALID [2020-07-10 18:56:27,455 INFO L280 TraceCheckUtils]: 54: Hoare triple {1860#false} assume 1 != ~lk2~0; {1860#false} is VALID [2020-07-10 18:56:27,456 INFO L280 TraceCheckUtils]: 55: Hoare triple {1860#false} assume !false; {1860#false} is VALID [2020-07-10 18:56:27,459 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-10 18:56:27,459 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:56:27,460 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2079773687] [2020-07-10 18:56:27,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:56:27,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 18:56:27,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192928248] [2020-07-10 18:56:27,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2020-07-10 18:56:27,461 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:56:27,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 18:56:27,521 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-10 18:56:27,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 18:56:27,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:56:27,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 18:56:27,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 18:56:27,523 INFO L87 Difference]: Start difference. First operand 126 states and 163 transitions. Second operand 3 states. [2020-07-10 18:56:27,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:27,966 INFO L93 Difference]: Finished difference Result 306 states and 415 transitions. [2020-07-10 18:56:27,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 18:56:27,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2020-07-10 18:56:27,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:56:27,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:56:27,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 233 transitions. [2020-07-10 18:56:27,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:56:27,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 233 transitions. [2020-07-10 18:56:27,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 233 transitions. [2020-07-10 18:56:28,208 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-10 18:56:28,214 INFO L225 Difference]: With dead ends: 306 [2020-07-10 18:56:28,214 INFO L226 Difference]: Without dead ends: 213 [2020-07-10 18:56:28,215 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-10 18:56:28,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2020-07-10 18:56:28,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2020-07-10 18:56:28,427 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:56:28,427 INFO L82 GeneralOperation]: Start isEquivalent. First operand 213 states. Second operand 211 states. [2020-07-10 18:56:28,427 INFO L74 IsIncluded]: Start isIncluded. First operand 213 states. Second operand 211 states. [2020-07-10 18:56:28,427 INFO L87 Difference]: Start difference. First operand 213 states. Second operand 211 states. [2020-07-10 18:56:28,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:28,438 INFO L93 Difference]: Finished difference Result 213 states and 281 transitions. [2020-07-10 18:56:28,438 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 281 transitions. [2020-07-10 18:56:28,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:56:28,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:56:28,439 INFO L74 IsIncluded]: Start isIncluded. First operand 211 states. Second operand 213 states. [2020-07-10 18:56:28,440 INFO L87 Difference]: Start difference. First operand 211 states. Second operand 213 states. [2020-07-10 18:56:28,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:28,448 INFO L93 Difference]: Finished difference Result 213 states and 281 transitions. [2020-07-10 18:56:28,449 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 281 transitions. [2020-07-10 18:56:28,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:56:28,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:56:28,450 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:56:28,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:56:28,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-07-10 18:56:28,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 280 transitions. [2020-07-10 18:56:28,462 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 280 transitions. Word has length 56 [2020-07-10 18:56:28,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:56:28,463 INFO L479 AbstractCegarLoop]: Abstraction has 211 states and 280 transitions. [2020-07-10 18:56:28,463 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 18:56:28,463 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 211 states and 280 transitions. [2020-07-10 18:56:28,770 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-10 18:56:28,770 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 280 transitions. [2020-07-10 18:56:28,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-07-10 18:56:28,771 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:56:28,771 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-10 18:56:28,772 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 18:56:28,772 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:56:28,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:56:28,772 INFO L82 PathProgramCache]: Analyzing trace with hash -610540190, now seen corresponding path program 1 times [2020-07-10 18:56:28,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:56:28,773 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [872207502] [2020-07-10 18:56:28,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:56:28,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:56:28,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:56:28,846 INFO L280 TraceCheckUtils]: 0: Hoare triple {3326#true} assume true; {3326#true} is VALID [2020-07-10 18:56:28,847 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3326#true} {3326#true} #199#return; {3326#true} is VALID [2020-07-10 18:56:28,847 INFO L263 TraceCheckUtils]: 0: Hoare triple {3326#true} call ULTIMATE.init(); {3326#true} is VALID [2020-07-10 18:56:28,847 INFO L280 TraceCheckUtils]: 1: Hoare triple {3326#true} assume true; {3326#true} is VALID [2020-07-10 18:56:28,848 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3326#true} {3326#true} #199#return; {3326#true} is VALID [2020-07-10 18:56:28,848 INFO L263 TraceCheckUtils]: 3: Hoare triple {3326#true} call #t~ret8 := main(); {3326#true} is VALID [2020-07-10 18:56:28,848 INFO L280 TraceCheckUtils]: 4: Hoare triple {3326#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {3326#true} is VALID [2020-07-10 18:56:28,849 INFO L280 TraceCheckUtils]: 5: Hoare triple {3326#true} ~p1~0 := #t~nondet0; {3326#true} is VALID [2020-07-10 18:56:28,849 INFO L280 TraceCheckUtils]: 6: Hoare triple {3326#true} havoc #t~nondet0; {3326#true} is VALID [2020-07-10 18:56:28,849 INFO L280 TraceCheckUtils]: 7: Hoare triple {3326#true} havoc ~lk1~0; {3326#true} is VALID [2020-07-10 18:56:28,849 INFO L280 TraceCheckUtils]: 8: Hoare triple {3326#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3326#true} is VALID [2020-07-10 18:56:28,850 INFO L280 TraceCheckUtils]: 9: Hoare triple {3326#true} ~p2~0 := #t~nondet1; {3326#true} is VALID [2020-07-10 18:56:28,850 INFO L280 TraceCheckUtils]: 10: Hoare triple {3326#true} havoc #t~nondet1; {3326#true} is VALID [2020-07-10 18:56:28,850 INFO L280 TraceCheckUtils]: 11: Hoare triple {3326#true} havoc ~lk2~0; {3326#true} is VALID [2020-07-10 18:56:28,850 INFO L280 TraceCheckUtils]: 12: Hoare triple {3326#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3326#true} is VALID [2020-07-10 18:56:28,851 INFO L280 TraceCheckUtils]: 13: Hoare triple {3326#true} ~p3~0 := #t~nondet2; {3326#true} is VALID [2020-07-10 18:56:28,851 INFO L280 TraceCheckUtils]: 14: Hoare triple {3326#true} havoc #t~nondet2; {3326#true} is VALID [2020-07-10 18:56:28,851 INFO L280 TraceCheckUtils]: 15: Hoare triple {3326#true} havoc ~lk3~0; {3326#true} is VALID [2020-07-10 18:56:28,852 INFO L280 TraceCheckUtils]: 16: Hoare triple {3326#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {3326#true} is VALID [2020-07-10 18:56:28,852 INFO L280 TraceCheckUtils]: 17: Hoare triple {3326#true} ~p4~0 := #t~nondet3; {3326#true} is VALID [2020-07-10 18:56:28,852 INFO L280 TraceCheckUtils]: 18: Hoare triple {3326#true} havoc #t~nondet3; {3326#true} is VALID [2020-07-10 18:56:28,853 INFO L280 TraceCheckUtils]: 19: Hoare triple {3326#true} havoc ~lk4~0; {3326#true} is VALID [2020-07-10 18:56:28,853 INFO L280 TraceCheckUtils]: 20: Hoare triple {3326#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {3326#true} is VALID [2020-07-10 18:56:28,853 INFO L280 TraceCheckUtils]: 21: Hoare triple {3326#true} ~p5~0 := #t~nondet4; {3326#true} is VALID [2020-07-10 18:56:28,854 INFO L280 TraceCheckUtils]: 22: Hoare triple {3326#true} havoc #t~nondet4; {3326#true} is VALID [2020-07-10 18:56:28,854 INFO L280 TraceCheckUtils]: 23: Hoare triple {3326#true} havoc ~lk5~0; {3326#true} is VALID [2020-07-10 18:56:28,854 INFO L280 TraceCheckUtils]: 24: Hoare triple {3326#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {3326#true} is VALID [2020-07-10 18:56:28,854 INFO L280 TraceCheckUtils]: 25: Hoare triple {3326#true} ~p6~0 := #t~nondet5; {3326#true} is VALID [2020-07-10 18:56:28,855 INFO L280 TraceCheckUtils]: 26: Hoare triple {3326#true} havoc #t~nondet5; {3326#true} is VALID [2020-07-10 18:56:28,855 INFO L280 TraceCheckUtils]: 27: Hoare triple {3326#true} havoc ~lk6~0; {3326#true} is VALID [2020-07-10 18:56:28,855 INFO L280 TraceCheckUtils]: 28: Hoare triple {3326#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {3326#true} is VALID [2020-07-10 18:56:28,855 INFO L280 TraceCheckUtils]: 29: Hoare triple {3326#true} ~p7~0 := #t~nondet6; {3326#true} is VALID [2020-07-10 18:56:28,856 INFO L280 TraceCheckUtils]: 30: Hoare triple {3326#true} havoc #t~nondet6; {3326#true} is VALID [2020-07-10 18:56:28,856 INFO L280 TraceCheckUtils]: 31: Hoare triple {3326#true} havoc ~lk7~0; {3326#true} is VALID [2020-07-10 18:56:28,856 INFO L280 TraceCheckUtils]: 32: Hoare triple {3326#true} havoc ~cond~0; {3326#true} is VALID [2020-07-10 18:56:28,857 INFO L280 TraceCheckUtils]: 33: Hoare triple {3326#true} assume !false; {3326#true} is VALID [2020-07-10 18:56:28,857 INFO L280 TraceCheckUtils]: 34: Hoare triple {3326#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {3326#true} is VALID [2020-07-10 18:56:28,857 INFO L280 TraceCheckUtils]: 35: Hoare triple {3326#true} ~cond~0 := #t~nondet7; {3326#true} is VALID [2020-07-10 18:56:28,858 INFO L280 TraceCheckUtils]: 36: Hoare triple {3326#true} havoc #t~nondet7; {3326#true} is VALID [2020-07-10 18:56:28,858 INFO L280 TraceCheckUtils]: 37: Hoare triple {3326#true} assume !(0 == ~cond~0); {3326#true} is VALID [2020-07-10 18:56:28,858 INFO L280 TraceCheckUtils]: 38: Hoare triple {3326#true} ~lk1~0 := 0; {3326#true} is VALID [2020-07-10 18:56:28,858 INFO L280 TraceCheckUtils]: 39: Hoare triple {3326#true} ~lk2~0 := 0; {3326#true} is VALID [2020-07-10 18:56:28,859 INFO L280 TraceCheckUtils]: 40: Hoare triple {3326#true} ~lk3~0 := 0; {3326#true} is VALID [2020-07-10 18:56:28,859 INFO L280 TraceCheckUtils]: 41: Hoare triple {3326#true} ~lk4~0 := 0; {3326#true} is VALID [2020-07-10 18:56:28,859 INFO L280 TraceCheckUtils]: 42: Hoare triple {3326#true} ~lk5~0 := 0; {3326#true} is VALID [2020-07-10 18:56:28,860 INFO L280 TraceCheckUtils]: 43: Hoare triple {3326#true} ~lk6~0 := 0; {3326#true} is VALID [2020-07-10 18:56:28,860 INFO L280 TraceCheckUtils]: 44: Hoare triple {3326#true} ~lk7~0 := 0; {3326#true} is VALID [2020-07-10 18:56:28,860 INFO L280 TraceCheckUtils]: 45: Hoare triple {3326#true} assume !(0 != ~p1~0); {3326#true} is VALID [2020-07-10 18:56:28,860 INFO L280 TraceCheckUtils]: 46: Hoare triple {3326#true} assume 0 != ~p2~0; {3326#true} is VALID [2020-07-10 18:56:28,861 INFO L280 TraceCheckUtils]: 47: Hoare triple {3326#true} ~lk2~0 := 1; {3330#(= 1 main_~lk2~0)} is VALID [2020-07-10 18:56:28,862 INFO L280 TraceCheckUtils]: 48: Hoare triple {3330#(= 1 main_~lk2~0)} assume !(0 != ~p3~0); {3330#(= 1 main_~lk2~0)} is VALID [2020-07-10 18:56:28,863 INFO L280 TraceCheckUtils]: 49: Hoare triple {3330#(= 1 main_~lk2~0)} assume !(0 != ~p4~0); {3330#(= 1 main_~lk2~0)} is VALID [2020-07-10 18:56:28,863 INFO L280 TraceCheckUtils]: 50: Hoare triple {3330#(= 1 main_~lk2~0)} assume !(0 != ~p5~0); {3330#(= 1 main_~lk2~0)} is VALID [2020-07-10 18:56:28,864 INFO L280 TraceCheckUtils]: 51: Hoare triple {3330#(= 1 main_~lk2~0)} assume !(0 != ~p6~0); {3330#(= 1 main_~lk2~0)} is VALID [2020-07-10 18:56:28,865 INFO L280 TraceCheckUtils]: 52: Hoare triple {3330#(= 1 main_~lk2~0)} assume !(0 != ~p7~0); {3330#(= 1 main_~lk2~0)} is VALID [2020-07-10 18:56:28,865 INFO L280 TraceCheckUtils]: 53: Hoare triple {3330#(= 1 main_~lk2~0)} assume !(0 != ~p1~0); {3330#(= 1 main_~lk2~0)} is VALID [2020-07-10 18:56:28,866 INFO L280 TraceCheckUtils]: 54: Hoare triple {3330#(= 1 main_~lk2~0)} assume 0 != ~p2~0; {3330#(= 1 main_~lk2~0)} is VALID [2020-07-10 18:56:28,867 INFO L280 TraceCheckUtils]: 55: Hoare triple {3330#(= 1 main_~lk2~0)} assume 1 != ~lk2~0; {3327#false} is VALID [2020-07-10 18:56:28,867 INFO L280 TraceCheckUtils]: 56: Hoare triple {3327#false} assume !false; {3327#false} is VALID [2020-07-10 18:56:28,871 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-10 18:56:28,871 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:56:28,872 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [872207502] [2020-07-10 18:56:28,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:56:28,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 18:56:28,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977143577] [2020-07-10 18:56:28,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2020-07-10 18:56:28,873 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:56:28,873 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 18:56:28,925 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-10 18:56:28,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 18:56:28,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:56:28,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 18:56:28,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 18:56:28,927 INFO L87 Difference]: Start difference. First operand 211 states and 280 transitions. Second operand 3 states. [2020-07-10 18:56:29,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:29,347 INFO L93 Difference]: Finished difference Result 259 states and 346 transitions. [2020-07-10 18:56:29,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 18:56:29,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2020-07-10 18:56:29,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:56:29,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:56:29,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2020-07-10 18:56:29,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:56:29,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2020-07-10 18:56:29,353 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 155 transitions. [2020-07-10 18:56:29,489 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-10 18:56:29,494 INFO L225 Difference]: With dead ends: 259 [2020-07-10 18:56:29,494 INFO L226 Difference]: Without dead ends: 257 [2020-07-10 18:56:29,495 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-10 18:56:29,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2020-07-10 18:56:29,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 211. [2020-07-10 18:56:29,732 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:56:29,732 INFO L82 GeneralOperation]: Start isEquivalent. First operand 257 states. Second operand 211 states. [2020-07-10 18:56:29,732 INFO L74 IsIncluded]: Start isIncluded. First operand 257 states. Second operand 211 states. [2020-07-10 18:56:29,733 INFO L87 Difference]: Start difference. First operand 257 states. Second operand 211 states. [2020-07-10 18:56:29,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:29,745 INFO L93 Difference]: Finished difference Result 257 states and 343 transitions. [2020-07-10 18:56:29,746 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 343 transitions. [2020-07-10 18:56:29,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:56:29,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:56:29,747 INFO L74 IsIncluded]: Start isIncluded. First operand 211 states. Second operand 257 states. [2020-07-10 18:56:29,747 INFO L87 Difference]: Start difference. First operand 211 states. Second operand 257 states. [2020-07-10 18:56:29,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:29,757 INFO L93 Difference]: Finished difference Result 257 states and 343 transitions. [2020-07-10 18:56:29,757 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 343 transitions. [2020-07-10 18:56:29,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:56:29,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:56:29,758 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:56:29,758 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:56:29,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-07-10 18:56:29,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 278 transitions. [2020-07-10 18:56:29,772 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 278 transitions. Word has length 57 [2020-07-10 18:56:29,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:56:29,772 INFO L479 AbstractCegarLoop]: Abstraction has 211 states and 278 transitions. [2020-07-10 18:56:29,772 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 18:56:29,773 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 211 states and 278 transitions. [2020-07-10 18:56:30,066 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-10 18:56:30,067 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 278 transitions. [2020-07-10 18:56:30,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-07-10 18:56:30,068 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:56:30,068 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-10 18:56:30,069 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 18:56:30,069 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:56:30,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:56:30,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1798143236, now seen corresponding path program 1 times [2020-07-10 18:56:30,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:56:30,070 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1879680976] [2020-07-10 18:56:30,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:56:30,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:56:30,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:56:30,112 INFO L280 TraceCheckUtils]: 0: Hoare triple {4787#true} assume true; {4787#true} is VALID [2020-07-10 18:56:30,112 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {4787#true} {4787#true} #199#return; {4787#true} is VALID [2020-07-10 18:56:30,113 INFO L263 TraceCheckUtils]: 0: Hoare triple {4787#true} call ULTIMATE.init(); {4787#true} is VALID [2020-07-10 18:56:30,113 INFO L280 TraceCheckUtils]: 1: Hoare triple {4787#true} assume true; {4787#true} is VALID [2020-07-10 18:56:30,113 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4787#true} {4787#true} #199#return; {4787#true} is VALID [2020-07-10 18:56:30,113 INFO L263 TraceCheckUtils]: 3: Hoare triple {4787#true} call #t~ret8 := main(); {4787#true} is VALID [2020-07-10 18:56:30,114 INFO L280 TraceCheckUtils]: 4: Hoare triple {4787#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {4787#true} is VALID [2020-07-10 18:56:30,114 INFO L280 TraceCheckUtils]: 5: Hoare triple {4787#true} ~p1~0 := #t~nondet0; {4787#true} is VALID [2020-07-10 18:56:30,114 INFO L280 TraceCheckUtils]: 6: Hoare triple {4787#true} havoc #t~nondet0; {4787#true} is VALID [2020-07-10 18:56:30,114 INFO L280 TraceCheckUtils]: 7: Hoare triple {4787#true} havoc ~lk1~0; {4787#true} is VALID [2020-07-10 18:56:30,114 INFO L280 TraceCheckUtils]: 8: Hoare triple {4787#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {4787#true} is VALID [2020-07-10 18:56:30,115 INFO L280 TraceCheckUtils]: 9: Hoare triple {4787#true} ~p2~0 := #t~nondet1; {4787#true} is VALID [2020-07-10 18:56:30,115 INFO L280 TraceCheckUtils]: 10: Hoare triple {4787#true} havoc #t~nondet1; {4787#true} is VALID [2020-07-10 18:56:30,115 INFO L280 TraceCheckUtils]: 11: Hoare triple {4787#true} havoc ~lk2~0; {4787#true} is VALID [2020-07-10 18:56:30,115 INFO L280 TraceCheckUtils]: 12: Hoare triple {4787#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {4787#true} is VALID [2020-07-10 18:56:30,116 INFO L280 TraceCheckUtils]: 13: Hoare triple {4787#true} ~p3~0 := #t~nondet2; {4787#true} is VALID [2020-07-10 18:56:30,116 INFO L280 TraceCheckUtils]: 14: Hoare triple {4787#true} havoc #t~nondet2; {4787#true} is VALID [2020-07-10 18:56:30,116 INFO L280 TraceCheckUtils]: 15: Hoare triple {4787#true} havoc ~lk3~0; {4787#true} is VALID [2020-07-10 18:56:30,116 INFO L280 TraceCheckUtils]: 16: Hoare triple {4787#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {4787#true} is VALID [2020-07-10 18:56:30,116 INFO L280 TraceCheckUtils]: 17: Hoare triple {4787#true} ~p4~0 := #t~nondet3; {4787#true} is VALID [2020-07-10 18:56:30,117 INFO L280 TraceCheckUtils]: 18: Hoare triple {4787#true} havoc #t~nondet3; {4787#true} is VALID [2020-07-10 18:56:30,117 INFO L280 TraceCheckUtils]: 19: Hoare triple {4787#true} havoc ~lk4~0; {4787#true} is VALID [2020-07-10 18:56:30,117 INFO L280 TraceCheckUtils]: 20: Hoare triple {4787#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {4787#true} is VALID [2020-07-10 18:56:30,117 INFO L280 TraceCheckUtils]: 21: Hoare triple {4787#true} ~p5~0 := #t~nondet4; {4787#true} is VALID [2020-07-10 18:56:30,118 INFO L280 TraceCheckUtils]: 22: Hoare triple {4787#true} havoc #t~nondet4; {4787#true} is VALID [2020-07-10 18:56:30,118 INFO L280 TraceCheckUtils]: 23: Hoare triple {4787#true} havoc ~lk5~0; {4787#true} is VALID [2020-07-10 18:56:30,118 INFO L280 TraceCheckUtils]: 24: Hoare triple {4787#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {4787#true} is VALID [2020-07-10 18:56:30,118 INFO L280 TraceCheckUtils]: 25: Hoare triple {4787#true} ~p6~0 := #t~nondet5; {4787#true} is VALID [2020-07-10 18:56:30,119 INFO L280 TraceCheckUtils]: 26: Hoare triple {4787#true} havoc #t~nondet5; {4787#true} is VALID [2020-07-10 18:56:30,119 INFO L280 TraceCheckUtils]: 27: Hoare triple {4787#true} havoc ~lk6~0; {4787#true} is VALID [2020-07-10 18:56:30,119 INFO L280 TraceCheckUtils]: 28: Hoare triple {4787#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {4787#true} is VALID [2020-07-10 18:56:30,119 INFO L280 TraceCheckUtils]: 29: Hoare triple {4787#true} ~p7~0 := #t~nondet6; {4787#true} is VALID [2020-07-10 18:56:30,120 INFO L280 TraceCheckUtils]: 30: Hoare triple {4787#true} havoc #t~nondet6; {4787#true} is VALID [2020-07-10 18:56:30,120 INFO L280 TraceCheckUtils]: 31: Hoare triple {4787#true} havoc ~lk7~0; {4787#true} is VALID [2020-07-10 18:56:30,120 INFO L280 TraceCheckUtils]: 32: Hoare triple {4787#true} havoc ~cond~0; {4787#true} is VALID [2020-07-10 18:56:30,120 INFO L280 TraceCheckUtils]: 33: Hoare triple {4787#true} assume !false; {4787#true} is VALID [2020-07-10 18:56:30,121 INFO L280 TraceCheckUtils]: 34: Hoare triple {4787#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {4787#true} is VALID [2020-07-10 18:56:30,121 INFO L280 TraceCheckUtils]: 35: Hoare triple {4787#true} ~cond~0 := #t~nondet7; {4787#true} is VALID [2020-07-10 18:56:30,121 INFO L280 TraceCheckUtils]: 36: Hoare triple {4787#true} havoc #t~nondet7; {4787#true} is VALID [2020-07-10 18:56:30,121 INFO L280 TraceCheckUtils]: 37: Hoare triple {4787#true} assume !(0 == ~cond~0); {4787#true} is VALID [2020-07-10 18:56:30,122 INFO L280 TraceCheckUtils]: 38: Hoare triple {4787#true} ~lk1~0 := 0; {4787#true} is VALID [2020-07-10 18:56:30,122 INFO L280 TraceCheckUtils]: 39: Hoare triple {4787#true} ~lk2~0 := 0; {4787#true} is VALID [2020-07-10 18:56:30,122 INFO L280 TraceCheckUtils]: 40: Hoare triple {4787#true} ~lk3~0 := 0; {4787#true} is VALID [2020-07-10 18:56:30,122 INFO L280 TraceCheckUtils]: 41: Hoare triple {4787#true} ~lk4~0 := 0; {4787#true} is VALID [2020-07-10 18:56:30,123 INFO L280 TraceCheckUtils]: 42: Hoare triple {4787#true} ~lk5~0 := 0; {4787#true} is VALID [2020-07-10 18:56:30,123 INFO L280 TraceCheckUtils]: 43: Hoare triple {4787#true} ~lk6~0 := 0; {4787#true} is VALID [2020-07-10 18:56:30,123 INFO L280 TraceCheckUtils]: 44: Hoare triple {4787#true} ~lk7~0 := 0; {4787#true} is VALID [2020-07-10 18:56:30,123 INFO L280 TraceCheckUtils]: 45: Hoare triple {4787#true} assume !(0 != ~p1~0); {4787#true} is VALID [2020-07-10 18:56:30,123 INFO L280 TraceCheckUtils]: 46: Hoare triple {4787#true} assume !(0 != ~p2~0); {4787#true} is VALID [2020-07-10 18:56:30,124 INFO L280 TraceCheckUtils]: 47: Hoare triple {4787#true} assume !(0 != ~p3~0); {4791#(= 0 main_~p3~0)} is VALID [2020-07-10 18:56:30,125 INFO L280 TraceCheckUtils]: 48: Hoare triple {4791#(= 0 main_~p3~0)} assume !(0 != ~p4~0); {4791#(= 0 main_~p3~0)} is VALID [2020-07-10 18:56:30,125 INFO L280 TraceCheckUtils]: 49: Hoare triple {4791#(= 0 main_~p3~0)} assume !(0 != ~p5~0); {4791#(= 0 main_~p3~0)} is VALID [2020-07-10 18:56:30,126 INFO L280 TraceCheckUtils]: 50: Hoare triple {4791#(= 0 main_~p3~0)} assume !(0 != ~p6~0); {4791#(= 0 main_~p3~0)} is VALID [2020-07-10 18:56:30,126 INFO L280 TraceCheckUtils]: 51: Hoare triple {4791#(= 0 main_~p3~0)} assume !(0 != ~p7~0); {4791#(= 0 main_~p3~0)} is VALID [2020-07-10 18:56:30,127 INFO L280 TraceCheckUtils]: 52: Hoare triple {4791#(= 0 main_~p3~0)} assume !(0 != ~p1~0); {4791#(= 0 main_~p3~0)} is VALID [2020-07-10 18:56:30,127 INFO L280 TraceCheckUtils]: 53: Hoare triple {4791#(= 0 main_~p3~0)} assume !(0 != ~p2~0); {4791#(= 0 main_~p3~0)} is VALID [2020-07-10 18:56:30,128 INFO L280 TraceCheckUtils]: 54: Hoare triple {4791#(= 0 main_~p3~0)} assume 0 != ~p3~0; {4788#false} is VALID [2020-07-10 18:56:30,128 INFO L280 TraceCheckUtils]: 55: Hoare triple {4788#false} assume 1 != ~lk3~0; {4788#false} is VALID [2020-07-10 18:56:30,129 INFO L280 TraceCheckUtils]: 56: Hoare triple {4788#false} assume !false; {4788#false} is VALID [2020-07-10 18:56:30,131 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-10 18:56:30,131 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:56:30,131 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1879680976] [2020-07-10 18:56:30,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:56:30,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 18:56:30,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022155841] [2020-07-10 18:56:30,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2020-07-10 18:56:30,132 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:56:30,132 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 18:56:30,182 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-10 18:56:30,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 18:56:30,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:56:30,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 18:56:30,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 18:56:30,183 INFO L87 Difference]: Start difference. First operand 211 states and 278 transitions. Second operand 3 states. [2020-07-10 18:56:30,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:30,922 INFO L93 Difference]: Finished difference Result 555 states and 752 transitions. [2020-07-10 18:56:30,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 18:56:30,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2020-07-10 18:56:30,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:56:30,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:56:30,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 230 transitions. [2020-07-10 18:56:30,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:56:30,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 230 transitions. [2020-07-10 18:56:30,930 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 230 transitions. [2020-07-10 18:56:31,149 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-10 18:56:31,159 INFO L225 Difference]: With dead ends: 555 [2020-07-10 18:56:31,160 INFO L226 Difference]: Without dead ends: 377 [2020-07-10 18:56:31,161 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-10 18:56:31,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2020-07-10 18:56:31,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 375. [2020-07-10 18:56:31,602 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:56:31,602 INFO L82 GeneralOperation]: Start isEquivalent. First operand 377 states. Second operand 375 states. [2020-07-10 18:56:31,602 INFO L74 IsIncluded]: Start isIncluded. First operand 377 states. Second operand 375 states. [2020-07-10 18:56:31,602 INFO L87 Difference]: Start difference. First operand 377 states. Second operand 375 states. [2020-07-10 18:56:31,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:31,618 INFO L93 Difference]: Finished difference Result 377 states and 499 transitions. [2020-07-10 18:56:31,618 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 499 transitions. [2020-07-10 18:56:31,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:56:31,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:56:31,619 INFO L74 IsIncluded]: Start isIncluded. First operand 375 states. Second operand 377 states. [2020-07-10 18:56:31,619 INFO L87 Difference]: Start difference. First operand 375 states. Second operand 377 states. [2020-07-10 18:56:31,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:31,635 INFO L93 Difference]: Finished difference Result 377 states and 499 transitions. [2020-07-10 18:56:31,635 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 499 transitions. [2020-07-10 18:56:31,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:56:31,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:56:31,636 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:56:31,636 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:56:31,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-07-10 18:56:31,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 498 transitions. [2020-07-10 18:56:31,651 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 498 transitions. Word has length 57 [2020-07-10 18:56:31,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:56:31,652 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 498 transitions. [2020-07-10 18:56:31,652 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 18:56:31,652 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 375 states and 498 transitions. [2020-07-10 18:56:32,193 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-10 18:56:32,193 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 498 transitions. [2020-07-10 18:56:32,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-07-10 18:56:32,194 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:56:32,194 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-10 18:56:32,195 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 18:56:32,195 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:56:32,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:56:32,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1136837537, now seen corresponding path program 1 times [2020-07-10 18:56:32,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:56:32,196 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [358401761] [2020-07-10 18:56:32,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:56:32,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:56:32,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:56:32,237 INFO L280 TraceCheckUtils]: 0: Hoare triple {7408#true} assume true; {7408#true} is VALID [2020-07-10 18:56:32,238 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {7408#true} {7408#true} #199#return; {7408#true} is VALID [2020-07-10 18:56:32,238 INFO L263 TraceCheckUtils]: 0: Hoare triple {7408#true} call ULTIMATE.init(); {7408#true} is VALID [2020-07-10 18:56:32,238 INFO L280 TraceCheckUtils]: 1: Hoare triple {7408#true} assume true; {7408#true} is VALID [2020-07-10 18:56:32,238 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {7408#true} {7408#true} #199#return; {7408#true} is VALID [2020-07-10 18:56:32,238 INFO L263 TraceCheckUtils]: 3: Hoare triple {7408#true} call #t~ret8 := main(); {7408#true} is VALID [2020-07-10 18:56:32,239 INFO L280 TraceCheckUtils]: 4: Hoare triple {7408#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {7408#true} is VALID [2020-07-10 18:56:32,239 INFO L280 TraceCheckUtils]: 5: Hoare triple {7408#true} ~p1~0 := #t~nondet0; {7408#true} is VALID [2020-07-10 18:56:32,239 INFO L280 TraceCheckUtils]: 6: Hoare triple {7408#true} havoc #t~nondet0; {7408#true} is VALID [2020-07-10 18:56:32,239 INFO L280 TraceCheckUtils]: 7: Hoare triple {7408#true} havoc ~lk1~0; {7408#true} is VALID [2020-07-10 18:56:32,239 INFO L280 TraceCheckUtils]: 8: Hoare triple {7408#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {7408#true} is VALID [2020-07-10 18:56:32,239 INFO L280 TraceCheckUtils]: 9: Hoare triple {7408#true} ~p2~0 := #t~nondet1; {7408#true} is VALID [2020-07-10 18:56:32,240 INFO L280 TraceCheckUtils]: 10: Hoare triple {7408#true} havoc #t~nondet1; {7408#true} is VALID [2020-07-10 18:56:32,240 INFO L280 TraceCheckUtils]: 11: Hoare triple {7408#true} havoc ~lk2~0; {7408#true} is VALID [2020-07-10 18:56:32,240 INFO L280 TraceCheckUtils]: 12: Hoare triple {7408#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {7408#true} is VALID [2020-07-10 18:56:32,240 INFO L280 TraceCheckUtils]: 13: Hoare triple {7408#true} ~p3~0 := #t~nondet2; {7408#true} is VALID [2020-07-10 18:56:32,241 INFO L280 TraceCheckUtils]: 14: Hoare triple {7408#true} havoc #t~nondet2; {7408#true} is VALID [2020-07-10 18:56:32,241 INFO L280 TraceCheckUtils]: 15: Hoare triple {7408#true} havoc ~lk3~0; {7408#true} is VALID [2020-07-10 18:56:32,241 INFO L280 TraceCheckUtils]: 16: Hoare triple {7408#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {7408#true} is VALID [2020-07-10 18:56:32,241 INFO L280 TraceCheckUtils]: 17: Hoare triple {7408#true} ~p4~0 := #t~nondet3; {7408#true} is VALID [2020-07-10 18:56:32,241 INFO L280 TraceCheckUtils]: 18: Hoare triple {7408#true} havoc #t~nondet3; {7408#true} is VALID [2020-07-10 18:56:32,242 INFO L280 TraceCheckUtils]: 19: Hoare triple {7408#true} havoc ~lk4~0; {7408#true} is VALID [2020-07-10 18:56:32,242 INFO L280 TraceCheckUtils]: 20: Hoare triple {7408#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {7408#true} is VALID [2020-07-10 18:56:32,242 INFO L280 TraceCheckUtils]: 21: Hoare triple {7408#true} ~p5~0 := #t~nondet4; {7408#true} is VALID [2020-07-10 18:56:32,242 INFO L280 TraceCheckUtils]: 22: Hoare triple {7408#true} havoc #t~nondet4; {7408#true} is VALID [2020-07-10 18:56:32,242 INFO L280 TraceCheckUtils]: 23: Hoare triple {7408#true} havoc ~lk5~0; {7408#true} is VALID [2020-07-10 18:56:32,243 INFO L280 TraceCheckUtils]: 24: Hoare triple {7408#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {7408#true} is VALID [2020-07-10 18:56:32,243 INFO L280 TraceCheckUtils]: 25: Hoare triple {7408#true} ~p6~0 := #t~nondet5; {7408#true} is VALID [2020-07-10 18:56:32,243 INFO L280 TraceCheckUtils]: 26: Hoare triple {7408#true} havoc #t~nondet5; {7408#true} is VALID [2020-07-10 18:56:32,243 INFO L280 TraceCheckUtils]: 27: Hoare triple {7408#true} havoc ~lk6~0; {7408#true} is VALID [2020-07-10 18:56:32,244 INFO L280 TraceCheckUtils]: 28: Hoare triple {7408#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {7408#true} is VALID [2020-07-10 18:56:32,244 INFO L280 TraceCheckUtils]: 29: Hoare triple {7408#true} ~p7~0 := #t~nondet6; {7408#true} is VALID [2020-07-10 18:56:32,244 INFO L280 TraceCheckUtils]: 30: Hoare triple {7408#true} havoc #t~nondet6; {7408#true} is VALID [2020-07-10 18:56:32,244 INFO L280 TraceCheckUtils]: 31: Hoare triple {7408#true} havoc ~lk7~0; {7408#true} is VALID [2020-07-10 18:56:32,245 INFO L280 TraceCheckUtils]: 32: Hoare triple {7408#true} havoc ~cond~0; {7408#true} is VALID [2020-07-10 18:56:32,245 INFO L280 TraceCheckUtils]: 33: Hoare triple {7408#true} assume !false; {7408#true} is VALID [2020-07-10 18:56:32,245 INFO L280 TraceCheckUtils]: 34: Hoare triple {7408#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {7408#true} is VALID [2020-07-10 18:56:32,245 INFO L280 TraceCheckUtils]: 35: Hoare triple {7408#true} ~cond~0 := #t~nondet7; {7408#true} is VALID [2020-07-10 18:56:32,245 INFO L280 TraceCheckUtils]: 36: Hoare triple {7408#true} havoc #t~nondet7; {7408#true} is VALID [2020-07-10 18:56:32,246 INFO L280 TraceCheckUtils]: 37: Hoare triple {7408#true} assume !(0 == ~cond~0); {7408#true} is VALID [2020-07-10 18:56:32,246 INFO L280 TraceCheckUtils]: 38: Hoare triple {7408#true} ~lk1~0 := 0; {7408#true} is VALID [2020-07-10 18:56:32,246 INFO L280 TraceCheckUtils]: 39: Hoare triple {7408#true} ~lk2~0 := 0; {7408#true} is VALID [2020-07-10 18:56:32,246 INFO L280 TraceCheckUtils]: 40: Hoare triple {7408#true} ~lk3~0 := 0; {7408#true} is VALID [2020-07-10 18:56:32,247 INFO L280 TraceCheckUtils]: 41: Hoare triple {7408#true} ~lk4~0 := 0; {7408#true} is VALID [2020-07-10 18:56:32,247 INFO L280 TraceCheckUtils]: 42: Hoare triple {7408#true} ~lk5~0 := 0; {7408#true} is VALID [2020-07-10 18:56:32,247 INFO L280 TraceCheckUtils]: 43: Hoare triple {7408#true} ~lk6~0 := 0; {7408#true} is VALID [2020-07-10 18:56:32,247 INFO L280 TraceCheckUtils]: 44: Hoare triple {7408#true} ~lk7~0 := 0; {7408#true} is VALID [2020-07-10 18:56:32,247 INFO L280 TraceCheckUtils]: 45: Hoare triple {7408#true} assume !(0 != ~p1~0); {7408#true} is VALID [2020-07-10 18:56:32,248 INFO L280 TraceCheckUtils]: 46: Hoare triple {7408#true} assume !(0 != ~p2~0); {7408#true} is VALID [2020-07-10 18:56:32,248 INFO L280 TraceCheckUtils]: 47: Hoare triple {7408#true} assume 0 != ~p3~0; {7408#true} is VALID [2020-07-10 18:56:32,249 INFO L280 TraceCheckUtils]: 48: Hoare triple {7408#true} ~lk3~0 := 1; {7412#(= 1 main_~lk3~0)} is VALID [2020-07-10 18:56:32,249 INFO L280 TraceCheckUtils]: 49: Hoare triple {7412#(= 1 main_~lk3~0)} assume !(0 != ~p4~0); {7412#(= 1 main_~lk3~0)} is VALID [2020-07-10 18:56:32,250 INFO L280 TraceCheckUtils]: 50: Hoare triple {7412#(= 1 main_~lk3~0)} assume !(0 != ~p5~0); {7412#(= 1 main_~lk3~0)} is VALID [2020-07-10 18:56:32,250 INFO L280 TraceCheckUtils]: 51: Hoare triple {7412#(= 1 main_~lk3~0)} assume !(0 != ~p6~0); {7412#(= 1 main_~lk3~0)} is VALID [2020-07-10 18:56:32,251 INFO L280 TraceCheckUtils]: 52: Hoare triple {7412#(= 1 main_~lk3~0)} assume !(0 != ~p7~0); {7412#(= 1 main_~lk3~0)} is VALID [2020-07-10 18:56:32,251 INFO L280 TraceCheckUtils]: 53: Hoare triple {7412#(= 1 main_~lk3~0)} assume !(0 != ~p1~0); {7412#(= 1 main_~lk3~0)} is VALID [2020-07-10 18:56:32,252 INFO L280 TraceCheckUtils]: 54: Hoare triple {7412#(= 1 main_~lk3~0)} assume !(0 != ~p2~0); {7412#(= 1 main_~lk3~0)} is VALID [2020-07-10 18:56:32,252 INFO L280 TraceCheckUtils]: 55: Hoare triple {7412#(= 1 main_~lk3~0)} assume 0 != ~p3~0; {7412#(= 1 main_~lk3~0)} is VALID [2020-07-10 18:56:32,252 INFO L280 TraceCheckUtils]: 56: Hoare triple {7412#(= 1 main_~lk3~0)} assume 1 != ~lk3~0; {7409#false} is VALID [2020-07-10 18:56:32,253 INFO L280 TraceCheckUtils]: 57: Hoare triple {7409#false} assume !false; {7409#false} is VALID [2020-07-10 18:56:32,255 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-10 18:56:32,255 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:56:32,255 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [358401761] [2020-07-10 18:56:32,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:56:32,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 18:56:32,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268696599] [2020-07-10 18:56:32,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2020-07-10 18:56:32,256 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:56:32,257 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 18:56:32,308 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-10 18:56:32,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 18:56:32,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:56:32,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 18:56:32,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 18:56:32,310 INFO L87 Difference]: Start difference. First operand 375 states and 498 transitions. Second operand 3 states. [2020-07-10 18:56:33,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:33,192 INFO L93 Difference]: Finished difference Result 459 states and 612 transitions. [2020-07-10 18:56:33,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 18:56:33,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2020-07-10 18:56:33,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:56:33,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:56:33,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2020-07-10 18:56:33,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:56:33,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2020-07-10 18:56:33,200 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 151 transitions. [2020-07-10 18:56:33,391 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-10 18:56:33,420 INFO L225 Difference]: With dead ends: 459 [2020-07-10 18:56:33,421 INFO L226 Difference]: Without dead ends: 457 [2020-07-10 18:56:33,422 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-10 18:56:33,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2020-07-10 18:56:34,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 375. [2020-07-10 18:56:34,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:56:34,166 INFO L82 GeneralOperation]: Start isEquivalent. First operand 457 states. Second operand 375 states. [2020-07-10 18:56:34,166 INFO L74 IsIncluded]: Start isIncluded. First operand 457 states. Second operand 375 states. [2020-07-10 18:56:34,167 INFO L87 Difference]: Start difference. First operand 457 states. Second operand 375 states. [2020-07-10 18:56:34,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:34,196 INFO L93 Difference]: Finished difference Result 457 states and 607 transitions. [2020-07-10 18:56:34,196 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 607 transitions. [2020-07-10 18:56:34,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:56:34,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:56:34,198 INFO L74 IsIncluded]: Start isIncluded. First operand 375 states. Second operand 457 states. [2020-07-10 18:56:34,198 INFO L87 Difference]: Start difference. First operand 375 states. Second operand 457 states. [2020-07-10 18:56:34,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:34,226 INFO L93 Difference]: Finished difference Result 457 states and 607 transitions. [2020-07-10 18:56:34,226 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 607 transitions. [2020-07-10 18:56:34,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:56:34,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:56:34,228 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:56:34,228 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:56:34,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-07-10 18:56:34,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 494 transitions. [2020-07-10 18:56:34,243 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 494 transitions. Word has length 58 [2020-07-10 18:56:34,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:56:34,244 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 494 transitions. [2020-07-10 18:56:34,244 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 18:56:34,244 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 375 states and 494 transitions. [2020-07-10 18:56:34,929 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-10 18:56:34,929 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 494 transitions. [2020-07-10 18:56:34,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-07-10 18:56:34,930 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:56:34,931 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-10 18:56:34,931 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-10 18:56:34,931 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:56:34,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:56:34,931 INFO L82 PathProgramCache]: Analyzing trace with hash 92380246, now seen corresponding path program 1 times [2020-07-10 18:56:34,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:56:34,932 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [31511819] [2020-07-10 18:56:34,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:56:34,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:56:34,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:56:34,975 INFO L280 TraceCheckUtils]: 0: Hoare triple {9997#true} assume true; {9997#true} is VALID [2020-07-10 18:56:34,976 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {9997#true} {9997#true} #199#return; {9997#true} is VALID [2020-07-10 18:56:34,976 INFO L263 TraceCheckUtils]: 0: Hoare triple {9997#true} call ULTIMATE.init(); {9997#true} is VALID [2020-07-10 18:56:34,976 INFO L280 TraceCheckUtils]: 1: Hoare triple {9997#true} assume true; {9997#true} is VALID [2020-07-10 18:56:34,977 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {9997#true} {9997#true} #199#return; {9997#true} is VALID [2020-07-10 18:56:34,977 INFO L263 TraceCheckUtils]: 3: Hoare triple {9997#true} call #t~ret8 := main(); {9997#true} is VALID [2020-07-10 18:56:34,977 INFO L280 TraceCheckUtils]: 4: Hoare triple {9997#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {9997#true} is VALID [2020-07-10 18:56:34,977 INFO L280 TraceCheckUtils]: 5: Hoare triple {9997#true} ~p1~0 := #t~nondet0; {9997#true} is VALID [2020-07-10 18:56:34,977 INFO L280 TraceCheckUtils]: 6: Hoare triple {9997#true} havoc #t~nondet0; {9997#true} is VALID [2020-07-10 18:56:34,978 INFO L280 TraceCheckUtils]: 7: Hoare triple {9997#true} havoc ~lk1~0; {9997#true} is VALID [2020-07-10 18:56:34,978 INFO L280 TraceCheckUtils]: 8: Hoare triple {9997#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {9997#true} is VALID [2020-07-10 18:56:34,978 INFO L280 TraceCheckUtils]: 9: Hoare triple {9997#true} ~p2~0 := #t~nondet1; {9997#true} is VALID [2020-07-10 18:56:34,978 INFO L280 TraceCheckUtils]: 10: Hoare triple {9997#true} havoc #t~nondet1; {9997#true} is VALID [2020-07-10 18:56:34,978 INFO L280 TraceCheckUtils]: 11: Hoare triple {9997#true} havoc ~lk2~0; {9997#true} is VALID [2020-07-10 18:56:34,979 INFO L280 TraceCheckUtils]: 12: Hoare triple {9997#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {9997#true} is VALID [2020-07-10 18:56:34,979 INFO L280 TraceCheckUtils]: 13: Hoare triple {9997#true} ~p3~0 := #t~nondet2; {9997#true} is VALID [2020-07-10 18:56:34,979 INFO L280 TraceCheckUtils]: 14: Hoare triple {9997#true} havoc #t~nondet2; {9997#true} is VALID [2020-07-10 18:56:34,979 INFO L280 TraceCheckUtils]: 15: Hoare triple {9997#true} havoc ~lk3~0; {9997#true} is VALID [2020-07-10 18:56:34,980 INFO L280 TraceCheckUtils]: 16: Hoare triple {9997#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {9997#true} is VALID [2020-07-10 18:56:34,980 INFO L280 TraceCheckUtils]: 17: Hoare triple {9997#true} ~p4~0 := #t~nondet3; {9997#true} is VALID [2020-07-10 18:56:34,980 INFO L280 TraceCheckUtils]: 18: Hoare triple {9997#true} havoc #t~nondet3; {9997#true} is VALID [2020-07-10 18:56:34,980 INFO L280 TraceCheckUtils]: 19: Hoare triple {9997#true} havoc ~lk4~0; {9997#true} is VALID [2020-07-10 18:56:34,980 INFO L280 TraceCheckUtils]: 20: Hoare triple {9997#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {9997#true} is VALID [2020-07-10 18:56:34,981 INFO L280 TraceCheckUtils]: 21: Hoare triple {9997#true} ~p5~0 := #t~nondet4; {9997#true} is VALID [2020-07-10 18:56:34,981 INFO L280 TraceCheckUtils]: 22: Hoare triple {9997#true} havoc #t~nondet4; {9997#true} is VALID [2020-07-10 18:56:34,981 INFO L280 TraceCheckUtils]: 23: Hoare triple {9997#true} havoc ~lk5~0; {9997#true} is VALID [2020-07-10 18:56:34,981 INFO L280 TraceCheckUtils]: 24: Hoare triple {9997#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {9997#true} is VALID [2020-07-10 18:56:34,981 INFO L280 TraceCheckUtils]: 25: Hoare triple {9997#true} ~p6~0 := #t~nondet5; {9997#true} is VALID [2020-07-10 18:56:34,982 INFO L280 TraceCheckUtils]: 26: Hoare triple {9997#true} havoc #t~nondet5; {9997#true} is VALID [2020-07-10 18:56:34,982 INFO L280 TraceCheckUtils]: 27: Hoare triple {9997#true} havoc ~lk6~0; {9997#true} is VALID [2020-07-10 18:56:34,983 INFO L280 TraceCheckUtils]: 28: Hoare triple {9997#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {9997#true} is VALID [2020-07-10 18:56:34,983 INFO L280 TraceCheckUtils]: 29: Hoare triple {9997#true} ~p7~0 := #t~nondet6; {9997#true} is VALID [2020-07-10 18:56:34,986 INFO L280 TraceCheckUtils]: 30: Hoare triple {9997#true} havoc #t~nondet6; {9997#true} is VALID [2020-07-10 18:56:34,987 INFO L280 TraceCheckUtils]: 31: Hoare triple {9997#true} havoc ~lk7~0; {9997#true} is VALID [2020-07-10 18:56:34,987 INFO L280 TraceCheckUtils]: 32: Hoare triple {9997#true} havoc ~cond~0; {9997#true} is VALID [2020-07-10 18:56:34,987 INFO L280 TraceCheckUtils]: 33: Hoare triple {9997#true} assume !false; {9997#true} is VALID [2020-07-10 18:56:34,988 INFO L280 TraceCheckUtils]: 34: Hoare triple {9997#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {9997#true} is VALID [2020-07-10 18:56:34,988 INFO L280 TraceCheckUtils]: 35: Hoare triple {9997#true} ~cond~0 := #t~nondet7; {9997#true} is VALID [2020-07-10 18:56:34,988 INFO L280 TraceCheckUtils]: 36: Hoare triple {9997#true} havoc #t~nondet7; {9997#true} is VALID [2020-07-10 18:56:34,995 INFO L280 TraceCheckUtils]: 37: Hoare triple {9997#true} assume !(0 == ~cond~0); {9997#true} is VALID [2020-07-10 18:56:34,996 INFO L280 TraceCheckUtils]: 38: Hoare triple {9997#true} ~lk1~0 := 0; {9997#true} is VALID [2020-07-10 18:56:34,996 INFO L280 TraceCheckUtils]: 39: Hoare triple {9997#true} ~lk2~0 := 0; {9997#true} is VALID [2020-07-10 18:56:34,996 INFO L280 TraceCheckUtils]: 40: Hoare triple {9997#true} ~lk3~0 := 0; {9997#true} is VALID [2020-07-10 18:56:34,996 INFO L280 TraceCheckUtils]: 41: Hoare triple {9997#true} ~lk4~0 := 0; {9997#true} is VALID [2020-07-10 18:56:34,997 INFO L280 TraceCheckUtils]: 42: Hoare triple {9997#true} ~lk5~0 := 0; {9997#true} is VALID [2020-07-10 18:56:34,997 INFO L280 TraceCheckUtils]: 43: Hoare triple {9997#true} ~lk6~0 := 0; {9997#true} is VALID [2020-07-10 18:56:34,997 INFO L280 TraceCheckUtils]: 44: Hoare triple {9997#true} ~lk7~0 := 0; {9997#true} is VALID [2020-07-10 18:56:35,000 INFO L280 TraceCheckUtils]: 45: Hoare triple {9997#true} assume !(0 != ~p1~0); {9997#true} is VALID [2020-07-10 18:56:35,001 INFO L280 TraceCheckUtils]: 46: Hoare triple {9997#true} assume !(0 != ~p2~0); {9997#true} is VALID [2020-07-10 18:56:35,001 INFO L280 TraceCheckUtils]: 47: Hoare triple {9997#true} assume !(0 != ~p3~0); {9997#true} is VALID [2020-07-10 18:56:35,002 INFO L280 TraceCheckUtils]: 48: Hoare triple {9997#true} assume !(0 != ~p4~0); {10001#(= 0 main_~p4~0)} is VALID [2020-07-10 18:56:35,003 INFO L280 TraceCheckUtils]: 49: Hoare triple {10001#(= 0 main_~p4~0)} assume !(0 != ~p5~0); {10001#(= 0 main_~p4~0)} is VALID [2020-07-10 18:56:35,004 INFO L280 TraceCheckUtils]: 50: Hoare triple {10001#(= 0 main_~p4~0)} assume !(0 != ~p6~0); {10001#(= 0 main_~p4~0)} is VALID [2020-07-10 18:56:35,004 INFO L280 TraceCheckUtils]: 51: Hoare triple {10001#(= 0 main_~p4~0)} assume !(0 != ~p7~0); {10001#(= 0 main_~p4~0)} is VALID [2020-07-10 18:56:35,005 INFO L280 TraceCheckUtils]: 52: Hoare triple {10001#(= 0 main_~p4~0)} assume !(0 != ~p1~0); {10001#(= 0 main_~p4~0)} is VALID [2020-07-10 18:56:35,005 INFO L280 TraceCheckUtils]: 53: Hoare triple {10001#(= 0 main_~p4~0)} assume !(0 != ~p2~0); {10001#(= 0 main_~p4~0)} is VALID [2020-07-10 18:56:35,006 INFO L280 TraceCheckUtils]: 54: Hoare triple {10001#(= 0 main_~p4~0)} assume !(0 != ~p3~0); {10001#(= 0 main_~p4~0)} is VALID [2020-07-10 18:56:35,007 INFO L280 TraceCheckUtils]: 55: Hoare triple {10001#(= 0 main_~p4~0)} assume 0 != ~p4~0; {9998#false} is VALID [2020-07-10 18:56:35,007 INFO L280 TraceCheckUtils]: 56: Hoare triple {9998#false} assume 1 != ~lk4~0; {9998#false} is VALID [2020-07-10 18:56:35,007 INFO L280 TraceCheckUtils]: 57: Hoare triple {9998#false} assume !false; {9998#false} is VALID [2020-07-10 18:56:35,009 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-10 18:56:35,010 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:56:35,010 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [31511819] [2020-07-10 18:56:35,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:56:35,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 18:56:35,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900879371] [2020-07-10 18:56:35,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2020-07-10 18:56:35,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:56:35,012 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 18:56:35,061 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-10 18:56:35,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 18:56:35,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:56:35,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 18:56:35,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 18:56:35,062 INFO L87 Difference]: Start difference. First operand 375 states and 494 transitions. Second operand 3 states. [2020-07-10 18:56:36,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:36,492 INFO L93 Difference]: Finished difference Result 1035 states and 1384 transitions. [2020-07-10 18:56:36,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 18:56:36,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2020-07-10 18:56:36,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:56:36,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:56:36,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 227 transitions. [2020-07-10 18:56:36,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:56:36,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 227 transitions. [2020-07-10 18:56:36,498 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 227 transitions. [2020-07-10 18:56:36,684 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-10 18:56:36,723 INFO L225 Difference]: With dead ends: 1035 [2020-07-10 18:56:36,723 INFO L226 Difference]: Without dead ends: 693 [2020-07-10 18:56:36,728 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-10 18:56:36,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2020-07-10 18:56:37,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 691. [2020-07-10 18:56:37,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:56:37,754 INFO L82 GeneralOperation]: Start isEquivalent. First operand 693 states. Second operand 691 states. [2020-07-10 18:56:37,754 INFO L74 IsIncluded]: Start isIncluded. First operand 693 states. Second operand 691 states. [2020-07-10 18:56:37,754 INFO L87 Difference]: Start difference. First operand 693 states. Second operand 691 states. [2020-07-10 18:56:37,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:37,785 INFO L93 Difference]: Finished difference Result 693 states and 907 transitions. [2020-07-10 18:56:37,785 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 907 transitions. [2020-07-10 18:56:37,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:56:37,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:56:37,787 INFO L74 IsIncluded]: Start isIncluded. First operand 691 states. Second operand 693 states. [2020-07-10 18:56:37,788 INFO L87 Difference]: Start difference. First operand 691 states. Second operand 693 states. [2020-07-10 18:56:37,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:37,816 INFO L93 Difference]: Finished difference Result 693 states and 907 transitions. [2020-07-10 18:56:37,816 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 907 transitions. [2020-07-10 18:56:37,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:56:37,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:56:37,818 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:56:37,818 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:56:37,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2020-07-10 18:56:37,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 906 transitions. [2020-07-10 18:56:37,849 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 906 transitions. Word has length 58 [2020-07-10 18:56:37,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:56:37,850 INFO L479 AbstractCegarLoop]: Abstraction has 691 states and 906 transitions. [2020-07-10 18:56:37,850 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 18:56:37,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 691 states and 906 transitions. [2020-07-10 18:56:38,837 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-10 18:56:38,838 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 906 transitions. [2020-07-10 18:56:38,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-07-10 18:56:38,839 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:56:38,840 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-10 18:56:38,840 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-10 18:56:38,840 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:56:38,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:56:38,841 INFO L82 PathProgramCache]: Analyzing trace with hash -529027402, now seen corresponding path program 1 times [2020-07-10 18:56:38,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:56:38,841 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1440121219] [2020-07-10 18:56:38,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:56:38,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:56:38,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:56:38,885 INFO L280 TraceCheckUtils]: 0: Hoare triple {14842#true} assume true; {14842#true} is VALID [2020-07-10 18:56:38,886 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {14842#true} {14842#true} #199#return; {14842#true} is VALID [2020-07-10 18:56:38,886 INFO L263 TraceCheckUtils]: 0: Hoare triple {14842#true} call ULTIMATE.init(); {14842#true} is VALID [2020-07-10 18:56:38,886 INFO L280 TraceCheckUtils]: 1: Hoare triple {14842#true} assume true; {14842#true} is VALID [2020-07-10 18:56:38,886 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {14842#true} {14842#true} #199#return; {14842#true} is VALID [2020-07-10 18:56:38,886 INFO L263 TraceCheckUtils]: 3: Hoare triple {14842#true} call #t~ret8 := main(); {14842#true} is VALID [2020-07-10 18:56:38,887 INFO L280 TraceCheckUtils]: 4: Hoare triple {14842#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {14842#true} is VALID [2020-07-10 18:56:38,887 INFO L280 TraceCheckUtils]: 5: Hoare triple {14842#true} ~p1~0 := #t~nondet0; {14842#true} is VALID [2020-07-10 18:56:38,887 INFO L280 TraceCheckUtils]: 6: Hoare triple {14842#true} havoc #t~nondet0; {14842#true} is VALID [2020-07-10 18:56:38,887 INFO L280 TraceCheckUtils]: 7: Hoare triple {14842#true} havoc ~lk1~0; {14842#true} is VALID [2020-07-10 18:56:38,888 INFO L280 TraceCheckUtils]: 8: Hoare triple {14842#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {14842#true} is VALID [2020-07-10 18:56:38,888 INFO L280 TraceCheckUtils]: 9: Hoare triple {14842#true} ~p2~0 := #t~nondet1; {14842#true} is VALID [2020-07-10 18:56:38,888 INFO L280 TraceCheckUtils]: 10: Hoare triple {14842#true} havoc #t~nondet1; {14842#true} is VALID [2020-07-10 18:56:38,888 INFO L280 TraceCheckUtils]: 11: Hoare triple {14842#true} havoc ~lk2~0; {14842#true} is VALID [2020-07-10 18:56:38,888 INFO L280 TraceCheckUtils]: 12: Hoare triple {14842#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {14842#true} is VALID [2020-07-10 18:56:38,889 INFO L280 TraceCheckUtils]: 13: Hoare triple {14842#true} ~p3~0 := #t~nondet2; {14842#true} is VALID [2020-07-10 18:56:38,889 INFO L280 TraceCheckUtils]: 14: Hoare triple {14842#true} havoc #t~nondet2; {14842#true} is VALID [2020-07-10 18:56:38,889 INFO L280 TraceCheckUtils]: 15: Hoare triple {14842#true} havoc ~lk3~0; {14842#true} is VALID [2020-07-10 18:56:38,889 INFO L280 TraceCheckUtils]: 16: Hoare triple {14842#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {14842#true} is VALID [2020-07-10 18:56:38,889 INFO L280 TraceCheckUtils]: 17: Hoare triple {14842#true} ~p4~0 := #t~nondet3; {14842#true} is VALID [2020-07-10 18:56:38,890 INFO L280 TraceCheckUtils]: 18: Hoare triple {14842#true} havoc #t~nondet3; {14842#true} is VALID [2020-07-10 18:56:38,890 INFO L280 TraceCheckUtils]: 19: Hoare triple {14842#true} havoc ~lk4~0; {14842#true} is VALID [2020-07-10 18:56:38,890 INFO L280 TraceCheckUtils]: 20: Hoare triple {14842#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {14842#true} is VALID [2020-07-10 18:56:38,890 INFO L280 TraceCheckUtils]: 21: Hoare triple {14842#true} ~p5~0 := #t~nondet4; {14842#true} is VALID [2020-07-10 18:56:38,890 INFO L280 TraceCheckUtils]: 22: Hoare triple {14842#true} havoc #t~nondet4; {14842#true} is VALID [2020-07-10 18:56:38,891 INFO L280 TraceCheckUtils]: 23: Hoare triple {14842#true} havoc ~lk5~0; {14842#true} is VALID [2020-07-10 18:56:38,891 INFO L280 TraceCheckUtils]: 24: Hoare triple {14842#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {14842#true} is VALID [2020-07-10 18:56:38,891 INFO L280 TraceCheckUtils]: 25: Hoare triple {14842#true} ~p6~0 := #t~nondet5; {14842#true} is VALID [2020-07-10 18:56:38,892 INFO L280 TraceCheckUtils]: 26: Hoare triple {14842#true} havoc #t~nondet5; {14842#true} is VALID [2020-07-10 18:56:38,892 INFO L280 TraceCheckUtils]: 27: Hoare triple {14842#true} havoc ~lk6~0; {14842#true} is VALID [2020-07-10 18:56:38,892 INFO L280 TraceCheckUtils]: 28: Hoare triple {14842#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {14842#true} is VALID [2020-07-10 18:56:38,892 INFO L280 TraceCheckUtils]: 29: Hoare triple {14842#true} ~p7~0 := #t~nondet6; {14842#true} is VALID [2020-07-10 18:56:38,892 INFO L280 TraceCheckUtils]: 30: Hoare triple {14842#true} havoc #t~nondet6; {14842#true} is VALID [2020-07-10 18:56:38,893 INFO L280 TraceCheckUtils]: 31: Hoare triple {14842#true} havoc ~lk7~0; {14842#true} is VALID [2020-07-10 18:56:38,893 INFO L280 TraceCheckUtils]: 32: Hoare triple {14842#true} havoc ~cond~0; {14842#true} is VALID [2020-07-10 18:56:38,893 INFO L280 TraceCheckUtils]: 33: Hoare triple {14842#true} assume !false; {14842#true} is VALID [2020-07-10 18:56:38,893 INFO L280 TraceCheckUtils]: 34: Hoare triple {14842#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {14842#true} is VALID [2020-07-10 18:56:38,893 INFO L280 TraceCheckUtils]: 35: Hoare triple {14842#true} ~cond~0 := #t~nondet7; {14842#true} is VALID [2020-07-10 18:56:38,894 INFO L280 TraceCheckUtils]: 36: Hoare triple {14842#true} havoc #t~nondet7; {14842#true} is VALID [2020-07-10 18:56:38,894 INFO L280 TraceCheckUtils]: 37: Hoare triple {14842#true} assume !(0 == ~cond~0); {14842#true} is VALID [2020-07-10 18:56:38,894 INFO L280 TraceCheckUtils]: 38: Hoare triple {14842#true} ~lk1~0 := 0; {14842#true} is VALID [2020-07-10 18:56:38,894 INFO L280 TraceCheckUtils]: 39: Hoare triple {14842#true} ~lk2~0 := 0; {14842#true} is VALID [2020-07-10 18:56:38,894 INFO L280 TraceCheckUtils]: 40: Hoare triple {14842#true} ~lk3~0 := 0; {14842#true} is VALID [2020-07-10 18:56:38,895 INFO L280 TraceCheckUtils]: 41: Hoare triple {14842#true} ~lk4~0 := 0; {14842#true} is VALID [2020-07-10 18:56:38,895 INFO L280 TraceCheckUtils]: 42: Hoare triple {14842#true} ~lk5~0 := 0; {14842#true} is VALID [2020-07-10 18:56:38,895 INFO L280 TraceCheckUtils]: 43: Hoare triple {14842#true} ~lk6~0 := 0; {14842#true} is VALID [2020-07-10 18:56:38,895 INFO L280 TraceCheckUtils]: 44: Hoare triple {14842#true} ~lk7~0 := 0; {14842#true} is VALID [2020-07-10 18:56:38,895 INFO L280 TraceCheckUtils]: 45: Hoare triple {14842#true} assume !(0 != ~p1~0); {14842#true} is VALID [2020-07-10 18:56:38,896 INFO L280 TraceCheckUtils]: 46: Hoare triple {14842#true} assume !(0 != ~p2~0); {14842#true} is VALID [2020-07-10 18:56:38,896 INFO L280 TraceCheckUtils]: 47: Hoare triple {14842#true} assume !(0 != ~p3~0); {14842#true} is VALID [2020-07-10 18:56:38,896 INFO L280 TraceCheckUtils]: 48: Hoare triple {14842#true} assume 0 != ~p4~0; {14842#true} is VALID [2020-07-10 18:56:38,897 INFO L280 TraceCheckUtils]: 49: Hoare triple {14842#true} ~lk4~0 := 1; {14846#(= 1 main_~lk4~0)} is VALID [2020-07-10 18:56:38,897 INFO L280 TraceCheckUtils]: 50: Hoare triple {14846#(= 1 main_~lk4~0)} assume !(0 != ~p5~0); {14846#(= 1 main_~lk4~0)} is VALID [2020-07-10 18:56:38,898 INFO L280 TraceCheckUtils]: 51: Hoare triple {14846#(= 1 main_~lk4~0)} assume !(0 != ~p6~0); {14846#(= 1 main_~lk4~0)} is VALID [2020-07-10 18:56:38,898 INFO L280 TraceCheckUtils]: 52: Hoare triple {14846#(= 1 main_~lk4~0)} assume !(0 != ~p7~0); {14846#(= 1 main_~lk4~0)} is VALID [2020-07-10 18:56:38,899 INFO L280 TraceCheckUtils]: 53: Hoare triple {14846#(= 1 main_~lk4~0)} assume !(0 != ~p1~0); {14846#(= 1 main_~lk4~0)} is VALID [2020-07-10 18:56:38,899 INFO L280 TraceCheckUtils]: 54: Hoare triple {14846#(= 1 main_~lk4~0)} assume !(0 != ~p2~0); {14846#(= 1 main_~lk4~0)} is VALID [2020-07-10 18:56:38,900 INFO L280 TraceCheckUtils]: 55: Hoare triple {14846#(= 1 main_~lk4~0)} assume !(0 != ~p3~0); {14846#(= 1 main_~lk4~0)} is VALID [2020-07-10 18:56:38,900 INFO L280 TraceCheckUtils]: 56: Hoare triple {14846#(= 1 main_~lk4~0)} assume 0 != ~p4~0; {14846#(= 1 main_~lk4~0)} is VALID [2020-07-10 18:56:38,901 INFO L280 TraceCheckUtils]: 57: Hoare triple {14846#(= 1 main_~lk4~0)} assume 1 != ~lk4~0; {14843#false} is VALID [2020-07-10 18:56:38,901 INFO L280 TraceCheckUtils]: 58: Hoare triple {14843#false} assume !false; {14843#false} is VALID [2020-07-10 18:56:38,903 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-10 18:56:38,903 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:56:38,904 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1440121219] [2020-07-10 18:56:38,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:56:38,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 18:56:38,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157287736] [2020-07-10 18:56:38,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2020-07-10 18:56:38,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:56:38,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 18:56:38,957 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-10 18:56:38,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 18:56:38,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:56:38,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 18:56:38,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 18:56:38,958 INFO L87 Difference]: Start difference. First operand 691 states and 906 transitions. Second operand 3 states. [2020-07-10 18:56:40,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:40,577 INFO L93 Difference]: Finished difference Result 839 states and 1100 transitions. [2020-07-10 18:56:40,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 18:56:40,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2020-07-10 18:56:40,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:56:40,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:56:40,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2020-07-10 18:56:40,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:56:40,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2020-07-10 18:56:40,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 147 transitions. [2020-07-10 18:56:40,729 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-10 18:56:40,799 INFO L225 Difference]: With dead ends: 839 [2020-07-10 18:56:40,799 INFO L226 Difference]: Without dead ends: 837 [2020-07-10 18:56:40,800 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-10 18:56:40,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2020-07-10 18:56:42,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 691. [2020-07-10 18:56:42,066 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:56:42,066 INFO L82 GeneralOperation]: Start isEquivalent. First operand 837 states. Second operand 691 states. [2020-07-10 18:56:42,066 INFO L74 IsIncluded]: Start isIncluded. First operand 837 states. Second operand 691 states. [2020-07-10 18:56:42,067 INFO L87 Difference]: Start difference. First operand 837 states. Second operand 691 states. [2020-07-10 18:56:42,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:42,114 INFO L93 Difference]: Finished difference Result 837 states and 1091 transitions. [2020-07-10 18:56:42,114 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1091 transitions. [2020-07-10 18:56:42,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:56:42,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:56:42,116 INFO L74 IsIncluded]: Start isIncluded. First operand 691 states. Second operand 837 states. [2020-07-10 18:56:42,116 INFO L87 Difference]: Start difference. First operand 691 states. Second operand 837 states. [2020-07-10 18:56:42,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:42,158 INFO L93 Difference]: Finished difference Result 837 states and 1091 transitions. [2020-07-10 18:56:42,158 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1091 transitions. [2020-07-10 18:56:42,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:56:42,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:56:42,160 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:56:42,160 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:56:42,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2020-07-10 18:56:42,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 898 transitions. [2020-07-10 18:56:42,190 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 898 transitions. Word has length 59 [2020-07-10 18:56:42,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:56:42,190 INFO L479 AbstractCegarLoop]: Abstraction has 691 states and 898 transitions. [2020-07-10 18:56:42,191 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 18:56:42,191 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 691 states and 898 transitions. [2020-07-10 18:56:43,267 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-10 18:56:43,267 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 898 transitions. [2020-07-10 18:56:43,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-07-10 18:56:43,268 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:56:43,269 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-10 18:56:43,269 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-10 18:56:43,269 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:56:43,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:56:43,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1430933584, now seen corresponding path program 1 times [2020-07-10 18:56:43,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:56:43,271 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [295153536] [2020-07-10 18:56:43,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:56:43,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:56:43,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:56:43,335 INFO L280 TraceCheckUtils]: 0: Hoare triple {19583#true} assume true; {19583#true} is VALID [2020-07-10 18:56:43,335 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {19583#true} {19583#true} #199#return; {19583#true} is VALID [2020-07-10 18:56:43,336 INFO L263 TraceCheckUtils]: 0: Hoare triple {19583#true} call ULTIMATE.init(); {19583#true} is VALID [2020-07-10 18:56:43,336 INFO L280 TraceCheckUtils]: 1: Hoare triple {19583#true} assume true; {19583#true} is VALID [2020-07-10 18:56:43,336 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {19583#true} {19583#true} #199#return; {19583#true} is VALID [2020-07-10 18:56:43,336 INFO L263 TraceCheckUtils]: 3: Hoare triple {19583#true} call #t~ret8 := main(); {19583#true} is VALID [2020-07-10 18:56:43,336 INFO L280 TraceCheckUtils]: 4: Hoare triple {19583#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {19583#true} is VALID [2020-07-10 18:56:43,337 INFO L280 TraceCheckUtils]: 5: Hoare triple {19583#true} ~p1~0 := #t~nondet0; {19583#true} is VALID [2020-07-10 18:56:43,337 INFO L280 TraceCheckUtils]: 6: Hoare triple {19583#true} havoc #t~nondet0; {19583#true} is VALID [2020-07-10 18:56:43,337 INFO L280 TraceCheckUtils]: 7: Hoare triple {19583#true} havoc ~lk1~0; {19583#true} is VALID [2020-07-10 18:56:43,337 INFO L280 TraceCheckUtils]: 8: Hoare triple {19583#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {19583#true} is VALID [2020-07-10 18:56:43,337 INFO L280 TraceCheckUtils]: 9: Hoare triple {19583#true} ~p2~0 := #t~nondet1; {19583#true} is VALID [2020-07-10 18:56:43,338 INFO L280 TraceCheckUtils]: 10: Hoare triple {19583#true} havoc #t~nondet1; {19583#true} is VALID [2020-07-10 18:56:43,338 INFO L280 TraceCheckUtils]: 11: Hoare triple {19583#true} havoc ~lk2~0; {19583#true} is VALID [2020-07-10 18:56:43,338 INFO L280 TraceCheckUtils]: 12: Hoare triple {19583#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {19583#true} is VALID [2020-07-10 18:56:43,338 INFO L280 TraceCheckUtils]: 13: Hoare triple {19583#true} ~p3~0 := #t~nondet2; {19583#true} is VALID [2020-07-10 18:56:43,338 INFO L280 TraceCheckUtils]: 14: Hoare triple {19583#true} havoc #t~nondet2; {19583#true} is VALID [2020-07-10 18:56:43,339 INFO L280 TraceCheckUtils]: 15: Hoare triple {19583#true} havoc ~lk3~0; {19583#true} is VALID [2020-07-10 18:56:43,339 INFO L280 TraceCheckUtils]: 16: Hoare triple {19583#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {19583#true} is VALID [2020-07-10 18:56:43,339 INFO L280 TraceCheckUtils]: 17: Hoare triple {19583#true} ~p4~0 := #t~nondet3; {19583#true} is VALID [2020-07-10 18:56:43,339 INFO L280 TraceCheckUtils]: 18: Hoare triple {19583#true} havoc #t~nondet3; {19583#true} is VALID [2020-07-10 18:56:43,339 INFO L280 TraceCheckUtils]: 19: Hoare triple {19583#true} havoc ~lk4~0; {19583#true} is VALID [2020-07-10 18:56:43,340 INFO L280 TraceCheckUtils]: 20: Hoare triple {19583#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {19583#true} is VALID [2020-07-10 18:56:43,340 INFO L280 TraceCheckUtils]: 21: Hoare triple {19583#true} ~p5~0 := #t~nondet4; {19583#true} is VALID [2020-07-10 18:56:43,340 INFO L280 TraceCheckUtils]: 22: Hoare triple {19583#true} havoc #t~nondet4; {19583#true} is VALID [2020-07-10 18:56:43,340 INFO L280 TraceCheckUtils]: 23: Hoare triple {19583#true} havoc ~lk5~0; {19583#true} is VALID [2020-07-10 18:56:43,340 INFO L280 TraceCheckUtils]: 24: Hoare triple {19583#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {19583#true} is VALID [2020-07-10 18:56:43,340 INFO L280 TraceCheckUtils]: 25: Hoare triple {19583#true} ~p6~0 := #t~nondet5; {19583#true} is VALID [2020-07-10 18:56:43,341 INFO L280 TraceCheckUtils]: 26: Hoare triple {19583#true} havoc #t~nondet5; {19583#true} is VALID [2020-07-10 18:56:43,341 INFO L280 TraceCheckUtils]: 27: Hoare triple {19583#true} havoc ~lk6~0; {19583#true} is VALID [2020-07-10 18:56:43,341 INFO L280 TraceCheckUtils]: 28: Hoare triple {19583#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {19583#true} is VALID [2020-07-10 18:56:43,341 INFO L280 TraceCheckUtils]: 29: Hoare triple {19583#true} ~p7~0 := #t~nondet6; {19583#true} is VALID [2020-07-10 18:56:43,341 INFO L280 TraceCheckUtils]: 30: Hoare triple {19583#true} havoc #t~nondet6; {19583#true} is VALID [2020-07-10 18:56:43,342 INFO L280 TraceCheckUtils]: 31: Hoare triple {19583#true} havoc ~lk7~0; {19583#true} is VALID [2020-07-10 18:56:43,342 INFO L280 TraceCheckUtils]: 32: Hoare triple {19583#true} havoc ~cond~0; {19583#true} is VALID [2020-07-10 18:56:43,342 INFO L280 TraceCheckUtils]: 33: Hoare triple {19583#true} assume !false; {19583#true} is VALID [2020-07-10 18:56:43,342 INFO L280 TraceCheckUtils]: 34: Hoare triple {19583#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {19583#true} is VALID [2020-07-10 18:56:43,342 INFO L280 TraceCheckUtils]: 35: Hoare triple {19583#true} ~cond~0 := #t~nondet7; {19583#true} is VALID [2020-07-10 18:56:43,343 INFO L280 TraceCheckUtils]: 36: Hoare triple {19583#true} havoc #t~nondet7; {19583#true} is VALID [2020-07-10 18:56:43,343 INFO L280 TraceCheckUtils]: 37: Hoare triple {19583#true} assume !(0 == ~cond~0); {19583#true} is VALID [2020-07-10 18:56:43,343 INFO L280 TraceCheckUtils]: 38: Hoare triple {19583#true} ~lk1~0 := 0; {19583#true} is VALID [2020-07-10 18:56:43,343 INFO L280 TraceCheckUtils]: 39: Hoare triple {19583#true} ~lk2~0 := 0; {19583#true} is VALID [2020-07-10 18:56:43,343 INFO L280 TraceCheckUtils]: 40: Hoare triple {19583#true} ~lk3~0 := 0; {19583#true} is VALID [2020-07-10 18:56:43,344 INFO L280 TraceCheckUtils]: 41: Hoare triple {19583#true} ~lk4~0 := 0; {19583#true} is VALID [2020-07-10 18:56:43,344 INFO L280 TraceCheckUtils]: 42: Hoare triple {19583#true} ~lk5~0 := 0; {19583#true} is VALID [2020-07-10 18:56:43,344 INFO L280 TraceCheckUtils]: 43: Hoare triple {19583#true} ~lk6~0 := 0; {19583#true} is VALID [2020-07-10 18:56:43,344 INFO L280 TraceCheckUtils]: 44: Hoare triple {19583#true} ~lk7~0 := 0; {19583#true} is VALID [2020-07-10 18:56:43,345 INFO L280 TraceCheckUtils]: 45: Hoare triple {19583#true} assume !(0 != ~p1~0); {19583#true} is VALID [2020-07-10 18:56:43,345 INFO L280 TraceCheckUtils]: 46: Hoare triple {19583#true} assume !(0 != ~p2~0); {19583#true} is VALID [2020-07-10 18:56:43,345 INFO L280 TraceCheckUtils]: 47: Hoare triple {19583#true} assume !(0 != ~p3~0); {19583#true} is VALID [2020-07-10 18:56:43,345 INFO L280 TraceCheckUtils]: 48: Hoare triple {19583#true} assume !(0 != ~p4~0); {19583#true} is VALID [2020-07-10 18:56:43,347 INFO L280 TraceCheckUtils]: 49: Hoare triple {19583#true} assume !(0 != ~p5~0); {19587#(= 0 main_~p5~0)} is VALID [2020-07-10 18:56:43,348 INFO L280 TraceCheckUtils]: 50: Hoare triple {19587#(= 0 main_~p5~0)} assume !(0 != ~p6~0); {19587#(= 0 main_~p5~0)} is VALID [2020-07-10 18:56:43,349 INFO L280 TraceCheckUtils]: 51: Hoare triple {19587#(= 0 main_~p5~0)} assume !(0 != ~p7~0); {19587#(= 0 main_~p5~0)} is VALID [2020-07-10 18:56:43,350 INFO L280 TraceCheckUtils]: 52: Hoare triple {19587#(= 0 main_~p5~0)} assume !(0 != ~p1~0); {19587#(= 0 main_~p5~0)} is VALID [2020-07-10 18:56:43,350 INFO L280 TraceCheckUtils]: 53: Hoare triple {19587#(= 0 main_~p5~0)} assume !(0 != ~p2~0); {19587#(= 0 main_~p5~0)} is VALID [2020-07-10 18:56:43,351 INFO L280 TraceCheckUtils]: 54: Hoare triple {19587#(= 0 main_~p5~0)} assume !(0 != ~p3~0); {19587#(= 0 main_~p5~0)} is VALID [2020-07-10 18:56:43,351 INFO L280 TraceCheckUtils]: 55: Hoare triple {19587#(= 0 main_~p5~0)} assume !(0 != ~p4~0); {19587#(= 0 main_~p5~0)} is VALID [2020-07-10 18:56:43,352 INFO L280 TraceCheckUtils]: 56: Hoare triple {19587#(= 0 main_~p5~0)} assume 0 != ~p5~0; {19584#false} is VALID [2020-07-10 18:56:43,352 INFO L280 TraceCheckUtils]: 57: Hoare triple {19584#false} assume 1 != ~lk5~0; {19584#false} is VALID [2020-07-10 18:56:43,352 INFO L280 TraceCheckUtils]: 58: Hoare triple {19584#false} assume !false; {19584#false} is VALID [2020-07-10 18:56:43,354 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-10 18:56:43,354 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:56:43,355 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [295153536] [2020-07-10 18:56:43,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:56:43,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 18:56:43,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526022381] [2020-07-10 18:56:43,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2020-07-10 18:56:43,356 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:56:43,356 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 18:56:43,410 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-10 18:56:43,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 18:56:43,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:56:43,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 18:56:43,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 18:56:43,411 INFO L87 Difference]: Start difference. First operand 691 states and 898 transitions. Second operand 3 states. [2020-07-10 18:56:46,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:46,563 INFO L93 Difference]: Finished difference Result 1959 states and 2564 transitions. [2020-07-10 18:56:46,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 18:56:46,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2020-07-10 18:56:46,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:56:46,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:56:46,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2020-07-10 18:56:46,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:56:46,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2020-07-10 18:56:46,569 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 224 transitions. [2020-07-10 18:56:46,783 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-10 18:56:46,879 INFO L225 Difference]: With dead ends: 1959 [2020-07-10 18:56:46,880 INFO L226 Difference]: Without dead ends: 1301 [2020-07-10 18:56:46,881 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-10 18:56:46,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2020-07-10 18:56:49,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 1299. [2020-07-10 18:56:49,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:56:49,555 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1301 states. Second operand 1299 states. [2020-07-10 18:56:49,556 INFO L74 IsIncluded]: Start isIncluded. First operand 1301 states. Second operand 1299 states. [2020-07-10 18:56:49,556 INFO L87 Difference]: Start difference. First operand 1301 states. Second operand 1299 states. [2020-07-10 18:56:49,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:49,650 INFO L93 Difference]: Finished difference Result 1301 states and 1667 transitions. [2020-07-10 18:56:49,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1301 states and 1667 transitions. [2020-07-10 18:56:49,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:56:49,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:56:49,653 INFO L74 IsIncluded]: Start isIncluded. First operand 1299 states. Second operand 1301 states. [2020-07-10 18:56:49,654 INFO L87 Difference]: Start difference. First operand 1299 states. Second operand 1301 states. [2020-07-10 18:56:49,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:49,751 INFO L93 Difference]: Finished difference Result 1301 states and 1667 transitions. [2020-07-10 18:56:49,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1301 states and 1667 transitions. [2020-07-10 18:56:49,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:56:49,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:56:49,755 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:56:49,755 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:56:49,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1299 states. [2020-07-10 18:56:49,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 1299 states and 1666 transitions. [2020-07-10 18:56:49,867 INFO L78 Accepts]: Start accepts. Automaton has 1299 states and 1666 transitions. Word has length 59 [2020-07-10 18:56:49,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:56:49,867 INFO L479 AbstractCegarLoop]: Abstraction has 1299 states and 1666 transitions. [2020-07-10 18:56:49,867 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 18:56:49,868 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 1299 states and 1666 transitions. [2020-07-10 18:56:51,891 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-10 18:56:51,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 1666 transitions. [2020-07-10 18:56:51,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-07-10 18:56:51,893 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:56:51,893 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-10 18:56:51,895 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-10 18:56:51,896 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:56:51,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:56:51,896 INFO L82 PathProgramCache]: Analyzing trace with hash -631232587, now seen corresponding path program 1 times [2020-07-10 18:56:51,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:56:51,896 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1586714859] [2020-07-10 18:56:51,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:56:51,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:56:51,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:56:51,960 INFO L280 TraceCheckUtils]: 0: Hoare triple {28708#true} assume true; {28708#true} is VALID [2020-07-10 18:56:51,960 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {28708#true} {28708#true} #199#return; {28708#true} is VALID [2020-07-10 18:56:51,961 INFO L263 TraceCheckUtils]: 0: Hoare triple {28708#true} call ULTIMATE.init(); {28708#true} is VALID [2020-07-10 18:56:51,961 INFO L280 TraceCheckUtils]: 1: Hoare triple {28708#true} assume true; {28708#true} is VALID [2020-07-10 18:56:51,961 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {28708#true} {28708#true} #199#return; {28708#true} is VALID [2020-07-10 18:56:51,961 INFO L263 TraceCheckUtils]: 3: Hoare triple {28708#true} call #t~ret8 := main(); {28708#true} is VALID [2020-07-10 18:56:51,961 INFO L280 TraceCheckUtils]: 4: Hoare triple {28708#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {28708#true} is VALID [2020-07-10 18:56:51,961 INFO L280 TraceCheckUtils]: 5: Hoare triple {28708#true} ~p1~0 := #t~nondet0; {28708#true} is VALID [2020-07-10 18:56:51,961 INFO L280 TraceCheckUtils]: 6: Hoare triple {28708#true} havoc #t~nondet0; {28708#true} is VALID [2020-07-10 18:56:51,962 INFO L280 TraceCheckUtils]: 7: Hoare triple {28708#true} havoc ~lk1~0; {28708#true} is VALID [2020-07-10 18:56:51,962 INFO L280 TraceCheckUtils]: 8: Hoare triple {28708#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {28708#true} is VALID [2020-07-10 18:56:51,962 INFO L280 TraceCheckUtils]: 9: Hoare triple {28708#true} ~p2~0 := #t~nondet1; {28708#true} is VALID [2020-07-10 18:56:51,962 INFO L280 TraceCheckUtils]: 10: Hoare triple {28708#true} havoc #t~nondet1; {28708#true} is VALID [2020-07-10 18:56:51,962 INFO L280 TraceCheckUtils]: 11: Hoare triple {28708#true} havoc ~lk2~0; {28708#true} is VALID [2020-07-10 18:56:51,962 INFO L280 TraceCheckUtils]: 12: Hoare triple {28708#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {28708#true} is VALID [2020-07-10 18:56:51,962 INFO L280 TraceCheckUtils]: 13: Hoare triple {28708#true} ~p3~0 := #t~nondet2; {28708#true} is VALID [2020-07-10 18:56:51,962 INFO L280 TraceCheckUtils]: 14: Hoare triple {28708#true} havoc #t~nondet2; {28708#true} is VALID [2020-07-10 18:56:51,963 INFO L280 TraceCheckUtils]: 15: Hoare triple {28708#true} havoc ~lk3~0; {28708#true} is VALID [2020-07-10 18:56:51,963 INFO L280 TraceCheckUtils]: 16: Hoare triple {28708#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {28708#true} is VALID [2020-07-10 18:56:51,963 INFO L280 TraceCheckUtils]: 17: Hoare triple {28708#true} ~p4~0 := #t~nondet3; {28708#true} is VALID [2020-07-10 18:56:51,963 INFO L280 TraceCheckUtils]: 18: Hoare triple {28708#true} havoc #t~nondet3; {28708#true} is VALID [2020-07-10 18:56:51,963 INFO L280 TraceCheckUtils]: 19: Hoare triple {28708#true} havoc ~lk4~0; {28708#true} is VALID [2020-07-10 18:56:51,963 INFO L280 TraceCheckUtils]: 20: Hoare triple {28708#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {28708#true} is VALID [2020-07-10 18:56:51,963 INFO L280 TraceCheckUtils]: 21: Hoare triple {28708#true} ~p5~0 := #t~nondet4; {28708#true} is VALID [2020-07-10 18:56:51,963 INFO L280 TraceCheckUtils]: 22: Hoare triple {28708#true} havoc #t~nondet4; {28708#true} is VALID [2020-07-10 18:56:51,964 INFO L280 TraceCheckUtils]: 23: Hoare triple {28708#true} havoc ~lk5~0; {28708#true} is VALID [2020-07-10 18:56:51,964 INFO L280 TraceCheckUtils]: 24: Hoare triple {28708#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {28708#true} is VALID [2020-07-10 18:56:51,964 INFO L280 TraceCheckUtils]: 25: Hoare triple {28708#true} ~p6~0 := #t~nondet5; {28708#true} is VALID [2020-07-10 18:56:51,964 INFO L280 TraceCheckUtils]: 26: Hoare triple {28708#true} havoc #t~nondet5; {28708#true} is VALID [2020-07-10 18:56:51,964 INFO L280 TraceCheckUtils]: 27: Hoare triple {28708#true} havoc ~lk6~0; {28708#true} is VALID [2020-07-10 18:56:51,964 INFO L280 TraceCheckUtils]: 28: Hoare triple {28708#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {28708#true} is VALID [2020-07-10 18:56:51,964 INFO L280 TraceCheckUtils]: 29: Hoare triple {28708#true} ~p7~0 := #t~nondet6; {28708#true} is VALID [2020-07-10 18:56:51,965 INFO L280 TraceCheckUtils]: 30: Hoare triple {28708#true} havoc #t~nondet6; {28708#true} is VALID [2020-07-10 18:56:51,965 INFO L280 TraceCheckUtils]: 31: Hoare triple {28708#true} havoc ~lk7~0; {28708#true} is VALID [2020-07-10 18:56:51,965 INFO L280 TraceCheckUtils]: 32: Hoare triple {28708#true} havoc ~cond~0; {28708#true} is VALID [2020-07-10 18:56:51,965 INFO L280 TraceCheckUtils]: 33: Hoare triple {28708#true} assume !false; {28708#true} is VALID [2020-07-10 18:56:51,965 INFO L280 TraceCheckUtils]: 34: Hoare triple {28708#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {28708#true} is VALID [2020-07-10 18:56:51,965 INFO L280 TraceCheckUtils]: 35: Hoare triple {28708#true} ~cond~0 := #t~nondet7; {28708#true} is VALID [2020-07-10 18:56:51,965 INFO L280 TraceCheckUtils]: 36: Hoare triple {28708#true} havoc #t~nondet7; {28708#true} is VALID [2020-07-10 18:56:51,965 INFO L280 TraceCheckUtils]: 37: Hoare triple {28708#true} assume !(0 == ~cond~0); {28708#true} is VALID [2020-07-10 18:56:51,966 INFO L280 TraceCheckUtils]: 38: Hoare triple {28708#true} ~lk1~0 := 0; {28708#true} is VALID [2020-07-10 18:56:51,966 INFO L280 TraceCheckUtils]: 39: Hoare triple {28708#true} ~lk2~0 := 0; {28708#true} is VALID [2020-07-10 18:56:51,966 INFO L280 TraceCheckUtils]: 40: Hoare triple {28708#true} ~lk3~0 := 0; {28708#true} is VALID [2020-07-10 18:56:51,966 INFO L280 TraceCheckUtils]: 41: Hoare triple {28708#true} ~lk4~0 := 0; {28708#true} is VALID [2020-07-10 18:56:51,966 INFO L280 TraceCheckUtils]: 42: Hoare triple {28708#true} ~lk5~0 := 0; {28708#true} is VALID [2020-07-10 18:56:51,966 INFO L280 TraceCheckUtils]: 43: Hoare triple {28708#true} ~lk6~0 := 0; {28708#true} is VALID [2020-07-10 18:56:51,966 INFO L280 TraceCheckUtils]: 44: Hoare triple {28708#true} ~lk7~0 := 0; {28708#true} is VALID [2020-07-10 18:56:51,967 INFO L280 TraceCheckUtils]: 45: Hoare triple {28708#true} assume !(0 != ~p1~0); {28708#true} is VALID [2020-07-10 18:56:51,967 INFO L280 TraceCheckUtils]: 46: Hoare triple {28708#true} assume !(0 != ~p2~0); {28708#true} is VALID [2020-07-10 18:56:51,967 INFO L280 TraceCheckUtils]: 47: Hoare triple {28708#true} assume !(0 != ~p3~0); {28708#true} is VALID [2020-07-10 18:56:51,967 INFO L280 TraceCheckUtils]: 48: Hoare triple {28708#true} assume !(0 != ~p4~0); {28708#true} is VALID [2020-07-10 18:56:51,967 INFO L280 TraceCheckUtils]: 49: Hoare triple {28708#true} assume 0 != ~p5~0; {28708#true} is VALID [2020-07-10 18:56:51,968 INFO L280 TraceCheckUtils]: 50: Hoare triple {28708#true} ~lk5~0 := 1; {28712#(= 1 main_~lk5~0)} is VALID [2020-07-10 18:56:51,968 INFO L280 TraceCheckUtils]: 51: Hoare triple {28712#(= 1 main_~lk5~0)} assume !(0 != ~p6~0); {28712#(= 1 main_~lk5~0)} is VALID [2020-07-10 18:56:51,968 INFO L280 TraceCheckUtils]: 52: Hoare triple {28712#(= 1 main_~lk5~0)} assume !(0 != ~p7~0); {28712#(= 1 main_~lk5~0)} is VALID [2020-07-10 18:56:51,969 INFO L280 TraceCheckUtils]: 53: Hoare triple {28712#(= 1 main_~lk5~0)} assume !(0 != ~p1~0); {28712#(= 1 main_~lk5~0)} is VALID [2020-07-10 18:56:51,969 INFO L280 TraceCheckUtils]: 54: Hoare triple {28712#(= 1 main_~lk5~0)} assume !(0 != ~p2~0); {28712#(= 1 main_~lk5~0)} is VALID [2020-07-10 18:56:51,969 INFO L280 TraceCheckUtils]: 55: Hoare triple {28712#(= 1 main_~lk5~0)} assume !(0 != ~p3~0); {28712#(= 1 main_~lk5~0)} is VALID [2020-07-10 18:56:51,970 INFO L280 TraceCheckUtils]: 56: Hoare triple {28712#(= 1 main_~lk5~0)} assume !(0 != ~p4~0); {28712#(= 1 main_~lk5~0)} is VALID [2020-07-10 18:56:51,970 INFO L280 TraceCheckUtils]: 57: Hoare triple {28712#(= 1 main_~lk5~0)} assume 0 != ~p5~0; {28712#(= 1 main_~lk5~0)} is VALID [2020-07-10 18:56:51,970 INFO L280 TraceCheckUtils]: 58: Hoare triple {28712#(= 1 main_~lk5~0)} assume 1 != ~lk5~0; {28709#false} is VALID [2020-07-10 18:56:51,971 INFO L280 TraceCheckUtils]: 59: Hoare triple {28709#false} assume !false; {28709#false} is VALID [2020-07-10 18:56:51,973 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-10 18:56:51,973 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:56:51,973 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1586714859] [2020-07-10 18:56:51,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:56:51,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 18:56:51,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759709404] [2020-07-10 18:56:51,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2020-07-10 18:56:51,974 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:56:51,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 18:56:52,025 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-10 18:56:52,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 18:56:52,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:56:52,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 18:56:52,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 18:56:52,027 INFO L87 Difference]: Start difference. First operand 1299 states and 1666 transitions. Second operand 3 states. [2020-07-10 18:56:55,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:55,658 INFO L93 Difference]: Finished difference Result 1559 states and 1988 transitions. [2020-07-10 18:56:55,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 18:56:55,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2020-07-10 18:56:55,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:56:55,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:56:55,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2020-07-10 18:56:55,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:56:55,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2020-07-10 18:56:55,663 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 143 transitions. [2020-07-10 18:56:55,800 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-10 18:56:55,892 INFO L225 Difference]: With dead ends: 1559 [2020-07-10 18:56:55,892 INFO L226 Difference]: Without dead ends: 1557 [2020-07-10 18:56:55,893 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-10 18:56:55,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557 states. [2020-07-10 18:56:58,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557 to 1299. [2020-07-10 18:56:58,843 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:56:58,843 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1557 states. Second operand 1299 states. [2020-07-10 18:56:58,843 INFO L74 IsIncluded]: Start isIncluded. First operand 1557 states. Second operand 1299 states. [2020-07-10 18:56:58,843 INFO L87 Difference]: Start difference. First operand 1557 states. Second operand 1299 states. [2020-07-10 18:56:58,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:58,925 INFO L93 Difference]: Finished difference Result 1557 states and 1971 transitions. [2020-07-10 18:56:58,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 1971 transitions. [2020-07-10 18:56:58,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:56:58,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:56:58,927 INFO L74 IsIncluded]: Start isIncluded. First operand 1299 states. Second operand 1557 states. [2020-07-10 18:56:58,927 INFO L87 Difference]: Start difference. First operand 1299 states. Second operand 1557 states. [2020-07-10 18:56:59,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:59,011 INFO L93 Difference]: Finished difference Result 1557 states and 1971 transitions. [2020-07-10 18:56:59,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 1971 transitions. [2020-07-10 18:56:59,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:56:59,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:56:59,013 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:56:59,013 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:56:59,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1299 states. [2020-07-10 18:56:59,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 1299 states and 1650 transitions. [2020-07-10 18:56:59,065 INFO L78 Accepts]: Start accepts. Automaton has 1299 states and 1650 transitions. Word has length 60 [2020-07-10 18:56:59,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:56:59,065 INFO L479 AbstractCegarLoop]: Abstraction has 1299 states and 1650 transitions. [2020-07-10 18:56:59,065 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 18:56:59,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 1299 states and 1650 transitions. [2020-07-10 18:57:01,235 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-10 18:57:01,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 1650 transitions. [2020-07-10 18:57:01,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-07-10 18:57:01,237 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:57:01,237 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-10 18:57:01,237 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-10 18:57:01,238 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:57:01,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:57:01,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1409021686, now seen corresponding path program 1 times [2020-07-10 18:57:01,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:57:01,239 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1405727225] [2020-07-10 18:57:01,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:57:01,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:57:01,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:57:01,272 INFO L280 TraceCheckUtils]: 0: Hoare triple {37545#true} assume true; {37545#true} is VALID [2020-07-10 18:57:01,272 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {37545#true} {37545#true} #199#return; {37545#true} is VALID [2020-07-10 18:57:01,272 INFO L263 TraceCheckUtils]: 0: Hoare triple {37545#true} call ULTIMATE.init(); {37545#true} is VALID [2020-07-10 18:57:01,272 INFO L280 TraceCheckUtils]: 1: Hoare triple {37545#true} assume true; {37545#true} is VALID [2020-07-10 18:57:01,273 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {37545#true} {37545#true} #199#return; {37545#true} is VALID [2020-07-10 18:57:01,273 INFO L263 TraceCheckUtils]: 3: Hoare triple {37545#true} call #t~ret8 := main(); {37545#true} is VALID [2020-07-10 18:57:01,273 INFO L280 TraceCheckUtils]: 4: Hoare triple {37545#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {37545#true} is VALID [2020-07-10 18:57:01,273 INFO L280 TraceCheckUtils]: 5: Hoare triple {37545#true} ~p1~0 := #t~nondet0; {37545#true} is VALID [2020-07-10 18:57:01,273 INFO L280 TraceCheckUtils]: 6: Hoare triple {37545#true} havoc #t~nondet0; {37545#true} is VALID [2020-07-10 18:57:01,274 INFO L280 TraceCheckUtils]: 7: Hoare triple {37545#true} havoc ~lk1~0; {37545#true} is VALID [2020-07-10 18:57:01,274 INFO L280 TraceCheckUtils]: 8: Hoare triple {37545#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {37545#true} is VALID [2020-07-10 18:57:01,274 INFO L280 TraceCheckUtils]: 9: Hoare triple {37545#true} ~p2~0 := #t~nondet1; {37545#true} is VALID [2020-07-10 18:57:01,274 INFO L280 TraceCheckUtils]: 10: Hoare triple {37545#true} havoc #t~nondet1; {37545#true} is VALID [2020-07-10 18:57:01,274 INFO L280 TraceCheckUtils]: 11: Hoare triple {37545#true} havoc ~lk2~0; {37545#true} is VALID [2020-07-10 18:57:01,274 INFO L280 TraceCheckUtils]: 12: Hoare triple {37545#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {37545#true} is VALID [2020-07-10 18:57:01,275 INFO L280 TraceCheckUtils]: 13: Hoare triple {37545#true} ~p3~0 := #t~nondet2; {37545#true} is VALID [2020-07-10 18:57:01,275 INFO L280 TraceCheckUtils]: 14: Hoare triple {37545#true} havoc #t~nondet2; {37545#true} is VALID [2020-07-10 18:57:01,275 INFO L280 TraceCheckUtils]: 15: Hoare triple {37545#true} havoc ~lk3~0; {37545#true} is VALID [2020-07-10 18:57:01,275 INFO L280 TraceCheckUtils]: 16: Hoare triple {37545#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {37545#true} is VALID [2020-07-10 18:57:01,275 INFO L280 TraceCheckUtils]: 17: Hoare triple {37545#true} ~p4~0 := #t~nondet3; {37545#true} is VALID [2020-07-10 18:57:01,276 INFO L280 TraceCheckUtils]: 18: Hoare triple {37545#true} havoc #t~nondet3; {37545#true} is VALID [2020-07-10 18:57:01,276 INFO L280 TraceCheckUtils]: 19: Hoare triple {37545#true} havoc ~lk4~0; {37545#true} is VALID [2020-07-10 18:57:01,276 INFO L280 TraceCheckUtils]: 20: Hoare triple {37545#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {37545#true} is VALID [2020-07-10 18:57:01,276 INFO L280 TraceCheckUtils]: 21: Hoare triple {37545#true} ~p5~0 := #t~nondet4; {37545#true} is VALID [2020-07-10 18:57:01,276 INFO L280 TraceCheckUtils]: 22: Hoare triple {37545#true} havoc #t~nondet4; {37545#true} is VALID [2020-07-10 18:57:01,277 INFO L280 TraceCheckUtils]: 23: Hoare triple {37545#true} havoc ~lk5~0; {37545#true} is VALID [2020-07-10 18:57:01,277 INFO L280 TraceCheckUtils]: 24: Hoare triple {37545#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {37545#true} is VALID [2020-07-10 18:57:01,277 INFO L280 TraceCheckUtils]: 25: Hoare triple {37545#true} ~p6~0 := #t~nondet5; {37545#true} is VALID [2020-07-10 18:57:01,283 INFO L280 TraceCheckUtils]: 26: Hoare triple {37545#true} havoc #t~nondet5; {37545#true} is VALID [2020-07-10 18:57:01,283 INFO L280 TraceCheckUtils]: 27: Hoare triple {37545#true} havoc ~lk6~0; {37545#true} is VALID [2020-07-10 18:57:01,284 INFO L280 TraceCheckUtils]: 28: Hoare triple {37545#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {37545#true} is VALID [2020-07-10 18:57:01,284 INFO L280 TraceCheckUtils]: 29: Hoare triple {37545#true} ~p7~0 := #t~nondet6; {37545#true} is VALID [2020-07-10 18:57:01,284 INFO L280 TraceCheckUtils]: 30: Hoare triple {37545#true} havoc #t~nondet6; {37545#true} is VALID [2020-07-10 18:57:01,284 INFO L280 TraceCheckUtils]: 31: Hoare triple {37545#true} havoc ~lk7~0; {37545#true} is VALID [2020-07-10 18:57:01,284 INFO L280 TraceCheckUtils]: 32: Hoare triple {37545#true} havoc ~cond~0; {37545#true} is VALID [2020-07-10 18:57:01,285 INFO L280 TraceCheckUtils]: 33: Hoare triple {37545#true} assume !false; {37545#true} is VALID [2020-07-10 18:57:01,285 INFO L280 TraceCheckUtils]: 34: Hoare triple {37545#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {37545#true} is VALID [2020-07-10 18:57:01,285 INFO L280 TraceCheckUtils]: 35: Hoare triple {37545#true} ~cond~0 := #t~nondet7; {37545#true} is VALID [2020-07-10 18:57:01,285 INFO L280 TraceCheckUtils]: 36: Hoare triple {37545#true} havoc #t~nondet7; {37545#true} is VALID [2020-07-10 18:57:01,285 INFO L280 TraceCheckUtils]: 37: Hoare triple {37545#true} assume !(0 == ~cond~0); {37545#true} is VALID [2020-07-10 18:57:01,285 INFO L280 TraceCheckUtils]: 38: Hoare triple {37545#true} ~lk1~0 := 0; {37545#true} is VALID [2020-07-10 18:57:01,285 INFO L280 TraceCheckUtils]: 39: Hoare triple {37545#true} ~lk2~0 := 0; {37545#true} is VALID [2020-07-10 18:57:01,286 INFO L280 TraceCheckUtils]: 40: Hoare triple {37545#true} ~lk3~0 := 0; {37545#true} is VALID [2020-07-10 18:57:01,286 INFO L280 TraceCheckUtils]: 41: Hoare triple {37545#true} ~lk4~0 := 0; {37545#true} is VALID [2020-07-10 18:57:01,286 INFO L280 TraceCheckUtils]: 42: Hoare triple {37545#true} ~lk5~0 := 0; {37545#true} is VALID [2020-07-10 18:57:01,286 INFO L280 TraceCheckUtils]: 43: Hoare triple {37545#true} ~lk6~0 := 0; {37545#true} is VALID [2020-07-10 18:57:01,286 INFO L280 TraceCheckUtils]: 44: Hoare triple {37545#true} ~lk7~0 := 0; {37545#true} is VALID [2020-07-10 18:57:01,286 INFO L280 TraceCheckUtils]: 45: Hoare triple {37545#true} assume !(0 != ~p1~0); {37545#true} is VALID [2020-07-10 18:57:01,286 INFO L280 TraceCheckUtils]: 46: Hoare triple {37545#true} assume !(0 != ~p2~0); {37545#true} is VALID [2020-07-10 18:57:01,287 INFO L280 TraceCheckUtils]: 47: Hoare triple {37545#true} assume !(0 != ~p3~0); {37545#true} is VALID [2020-07-10 18:57:01,287 INFO L280 TraceCheckUtils]: 48: Hoare triple {37545#true} assume !(0 != ~p4~0); {37545#true} is VALID [2020-07-10 18:57:01,287 INFO L280 TraceCheckUtils]: 49: Hoare triple {37545#true} assume !(0 != ~p5~0); {37545#true} is VALID [2020-07-10 18:57:01,287 INFO L280 TraceCheckUtils]: 50: Hoare triple {37545#true} assume !(0 != ~p6~0); {37549#(= 0 main_~p6~0)} is VALID [2020-07-10 18:57:01,288 INFO L280 TraceCheckUtils]: 51: Hoare triple {37549#(= 0 main_~p6~0)} assume !(0 != ~p7~0); {37549#(= 0 main_~p6~0)} is VALID [2020-07-10 18:57:01,294 INFO L280 TraceCheckUtils]: 52: Hoare triple {37549#(= 0 main_~p6~0)} assume !(0 != ~p1~0); {37549#(= 0 main_~p6~0)} is VALID [2020-07-10 18:57:01,295 INFO L280 TraceCheckUtils]: 53: Hoare triple {37549#(= 0 main_~p6~0)} assume !(0 != ~p2~0); {37549#(= 0 main_~p6~0)} is VALID [2020-07-10 18:57:01,296 INFO L280 TraceCheckUtils]: 54: Hoare triple {37549#(= 0 main_~p6~0)} assume !(0 != ~p3~0); {37549#(= 0 main_~p6~0)} is VALID [2020-07-10 18:57:01,301 INFO L280 TraceCheckUtils]: 55: Hoare triple {37549#(= 0 main_~p6~0)} assume !(0 != ~p4~0); {37549#(= 0 main_~p6~0)} is VALID [2020-07-10 18:57:01,302 INFO L280 TraceCheckUtils]: 56: Hoare triple {37549#(= 0 main_~p6~0)} assume !(0 != ~p5~0); {37549#(= 0 main_~p6~0)} is VALID [2020-07-10 18:57:01,305 INFO L280 TraceCheckUtils]: 57: Hoare triple {37549#(= 0 main_~p6~0)} assume 0 != ~p6~0; {37546#false} is VALID [2020-07-10 18:57:01,305 INFO L280 TraceCheckUtils]: 58: Hoare triple {37546#false} assume 1 != ~lk6~0; {37546#false} is VALID [2020-07-10 18:57:01,305 INFO L280 TraceCheckUtils]: 59: Hoare triple {37546#false} assume !false; {37546#false} is VALID [2020-07-10 18:57:01,307 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-10 18:57:01,307 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:57:01,308 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1405727225] [2020-07-10 18:57:01,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:57:01,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 18:57:01,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119270897] [2020-07-10 18:57:01,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2020-07-10 18:57:01,309 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:57:01,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 18:57:01,363 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-10 18:57:01,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 18:57:01,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:57:01,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 18:57:01,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 18:57:01,364 INFO L87 Difference]: Start difference. First operand 1299 states and 1650 transitions. Second operand 3 states. [2020-07-10 18:57:08,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:57:08,182 INFO L93 Difference]: Finished difference Result 3735 states and 4756 transitions. [2020-07-10 18:57:08,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 18:57:08,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2020-07-10 18:57:08,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:57:08,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:57:08,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 221 transitions. [2020-07-10 18:57:08,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:57:08,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 221 transitions. [2020-07-10 18:57:08,185 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 221 transitions. [2020-07-10 18:57:08,392 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-10 18:57:08,601 INFO L225 Difference]: With dead ends: 3735 [2020-07-10 18:57:08,601 INFO L226 Difference]: Without dead ends: 2469 [2020-07-10 18:57:08,604 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-10 18:57:08,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2469 states. [2020-07-10 18:57:14,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2469 to 2467. [2020-07-10 18:57:14,653 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:57:14,653 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2469 states. Second operand 2467 states. [2020-07-10 18:57:14,653 INFO L74 IsIncluded]: Start isIncluded. First operand 2469 states. Second operand 2467 states. [2020-07-10 18:57:14,653 INFO L87 Difference]: Start difference. First operand 2469 states. Second operand 2467 states. [2020-07-10 18:57:14,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:57:14,827 INFO L93 Difference]: Finished difference Result 2469 states and 3075 transitions. [2020-07-10 18:57:14,827 INFO L276 IsEmpty]: Start isEmpty. Operand 2469 states and 3075 transitions. [2020-07-10 18:57:14,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:57:14,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:57:14,830 INFO L74 IsIncluded]: Start isIncluded. First operand 2467 states. Second operand 2469 states. [2020-07-10 18:57:14,830 INFO L87 Difference]: Start difference. First operand 2467 states. Second operand 2469 states. [2020-07-10 18:57:15,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:57:15,015 INFO L93 Difference]: Finished difference Result 2469 states and 3075 transitions. [2020-07-10 18:57:15,015 INFO L276 IsEmpty]: Start isEmpty. Operand 2469 states and 3075 transitions. [2020-07-10 18:57:15,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:57:15,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:57:15,018 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:57:15,018 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:57:15,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2467 states. [2020-07-10 18:57:15,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 3074 transitions. [2020-07-10 18:57:15,199 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 3074 transitions. Word has length 60 [2020-07-10 18:57:15,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:57:15,199 INFO L479 AbstractCegarLoop]: Abstraction has 2467 states and 3074 transitions. [2020-07-10 18:57:15,199 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 18:57:15,199 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2467 states and 3074 transitions. [2020-07-10 18:57:19,144 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-10 18:57:19,144 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 3074 transitions. [2020-07-10 18:57:19,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-07-10 18:57:19,146 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:57:19,146 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-10 18:57:19,147 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-10 18:57:19,147 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:57:19,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:57:19,147 INFO L82 PathProgramCache]: Analyzing trace with hash -729752476, now seen corresponding path program 1 times [2020-07-10 18:57:19,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:57:19,147 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [286495395] [2020-07-10 18:57:19,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:57:19,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:57:19,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:57:19,180 INFO L280 TraceCheckUtils]: 0: Hoare triple {54894#true} assume true; {54894#true} is VALID [2020-07-10 18:57:19,180 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {54894#true} {54894#true} #199#return; {54894#true} is VALID [2020-07-10 18:57:19,180 INFO L263 TraceCheckUtils]: 0: Hoare triple {54894#true} call ULTIMATE.init(); {54894#true} is VALID [2020-07-10 18:57:19,180 INFO L280 TraceCheckUtils]: 1: Hoare triple {54894#true} assume true; {54894#true} is VALID [2020-07-10 18:57:19,181 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {54894#true} {54894#true} #199#return; {54894#true} is VALID [2020-07-10 18:57:19,181 INFO L263 TraceCheckUtils]: 3: Hoare triple {54894#true} call #t~ret8 := main(); {54894#true} is VALID [2020-07-10 18:57:19,181 INFO L280 TraceCheckUtils]: 4: Hoare triple {54894#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {54894#true} is VALID [2020-07-10 18:57:19,182 INFO L280 TraceCheckUtils]: 5: Hoare triple {54894#true} ~p1~0 := #t~nondet0; {54894#true} is VALID [2020-07-10 18:57:19,182 INFO L280 TraceCheckUtils]: 6: Hoare triple {54894#true} havoc #t~nondet0; {54894#true} is VALID [2020-07-10 18:57:19,182 INFO L280 TraceCheckUtils]: 7: Hoare triple {54894#true} havoc ~lk1~0; {54894#true} is VALID [2020-07-10 18:57:19,183 INFO L280 TraceCheckUtils]: 8: Hoare triple {54894#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {54894#true} is VALID [2020-07-10 18:57:19,183 INFO L280 TraceCheckUtils]: 9: Hoare triple {54894#true} ~p2~0 := #t~nondet1; {54894#true} is VALID [2020-07-10 18:57:19,183 INFO L280 TraceCheckUtils]: 10: Hoare triple {54894#true} havoc #t~nondet1; {54894#true} is VALID [2020-07-10 18:57:19,183 INFO L280 TraceCheckUtils]: 11: Hoare triple {54894#true} havoc ~lk2~0; {54894#true} is VALID [2020-07-10 18:57:19,183 INFO L280 TraceCheckUtils]: 12: Hoare triple {54894#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {54894#true} is VALID [2020-07-10 18:57:19,184 INFO L280 TraceCheckUtils]: 13: Hoare triple {54894#true} ~p3~0 := #t~nondet2; {54894#true} is VALID [2020-07-10 18:57:19,184 INFO L280 TraceCheckUtils]: 14: Hoare triple {54894#true} havoc #t~nondet2; {54894#true} is VALID [2020-07-10 18:57:19,184 INFO L280 TraceCheckUtils]: 15: Hoare triple {54894#true} havoc ~lk3~0; {54894#true} is VALID [2020-07-10 18:57:19,184 INFO L280 TraceCheckUtils]: 16: Hoare triple {54894#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {54894#true} is VALID [2020-07-10 18:57:19,184 INFO L280 TraceCheckUtils]: 17: Hoare triple {54894#true} ~p4~0 := #t~nondet3; {54894#true} is VALID [2020-07-10 18:57:19,185 INFO L280 TraceCheckUtils]: 18: Hoare triple {54894#true} havoc #t~nondet3; {54894#true} is VALID [2020-07-10 18:57:19,185 INFO L280 TraceCheckUtils]: 19: Hoare triple {54894#true} havoc ~lk4~0; {54894#true} is VALID [2020-07-10 18:57:19,185 INFO L280 TraceCheckUtils]: 20: Hoare triple {54894#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {54894#true} is VALID [2020-07-10 18:57:19,185 INFO L280 TraceCheckUtils]: 21: Hoare triple {54894#true} ~p5~0 := #t~nondet4; {54894#true} is VALID [2020-07-10 18:57:19,185 INFO L280 TraceCheckUtils]: 22: Hoare triple {54894#true} havoc #t~nondet4; {54894#true} is VALID [2020-07-10 18:57:19,185 INFO L280 TraceCheckUtils]: 23: Hoare triple {54894#true} havoc ~lk5~0; {54894#true} is VALID [2020-07-10 18:57:19,186 INFO L280 TraceCheckUtils]: 24: Hoare triple {54894#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {54894#true} is VALID [2020-07-10 18:57:19,186 INFO L280 TraceCheckUtils]: 25: Hoare triple {54894#true} ~p6~0 := #t~nondet5; {54894#true} is VALID [2020-07-10 18:57:19,186 INFO L280 TraceCheckUtils]: 26: Hoare triple {54894#true} havoc #t~nondet5; {54894#true} is VALID [2020-07-10 18:57:19,186 INFO L280 TraceCheckUtils]: 27: Hoare triple {54894#true} havoc ~lk6~0; {54894#true} is VALID [2020-07-10 18:57:19,186 INFO L280 TraceCheckUtils]: 28: Hoare triple {54894#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {54894#true} is VALID [2020-07-10 18:57:19,187 INFO L280 TraceCheckUtils]: 29: Hoare triple {54894#true} ~p7~0 := #t~nondet6; {54894#true} is VALID [2020-07-10 18:57:19,187 INFO L280 TraceCheckUtils]: 30: Hoare triple {54894#true} havoc #t~nondet6; {54894#true} is VALID [2020-07-10 18:57:19,187 INFO L280 TraceCheckUtils]: 31: Hoare triple {54894#true} havoc ~lk7~0; {54894#true} is VALID [2020-07-10 18:57:19,187 INFO L280 TraceCheckUtils]: 32: Hoare triple {54894#true} havoc ~cond~0; {54894#true} is VALID [2020-07-10 18:57:19,187 INFO L280 TraceCheckUtils]: 33: Hoare triple {54894#true} assume !false; {54894#true} is VALID [2020-07-10 18:57:19,187 INFO L280 TraceCheckUtils]: 34: Hoare triple {54894#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {54894#true} is VALID [2020-07-10 18:57:19,188 INFO L280 TraceCheckUtils]: 35: Hoare triple {54894#true} ~cond~0 := #t~nondet7; {54894#true} is VALID [2020-07-10 18:57:19,188 INFO L280 TraceCheckUtils]: 36: Hoare triple {54894#true} havoc #t~nondet7; {54894#true} is VALID [2020-07-10 18:57:19,188 INFO L280 TraceCheckUtils]: 37: Hoare triple {54894#true} assume !(0 == ~cond~0); {54894#true} is VALID [2020-07-10 18:57:19,188 INFO L280 TraceCheckUtils]: 38: Hoare triple {54894#true} ~lk1~0 := 0; {54894#true} is VALID [2020-07-10 18:57:19,188 INFO L280 TraceCheckUtils]: 39: Hoare triple {54894#true} ~lk2~0 := 0; {54894#true} is VALID [2020-07-10 18:57:19,189 INFO L280 TraceCheckUtils]: 40: Hoare triple {54894#true} ~lk3~0 := 0; {54894#true} is VALID [2020-07-10 18:57:19,189 INFO L280 TraceCheckUtils]: 41: Hoare triple {54894#true} ~lk4~0 := 0; {54894#true} is VALID [2020-07-10 18:57:19,189 INFO L280 TraceCheckUtils]: 42: Hoare triple {54894#true} ~lk5~0 := 0; {54894#true} is VALID [2020-07-10 18:57:19,189 INFO L280 TraceCheckUtils]: 43: Hoare triple {54894#true} ~lk6~0 := 0; {54894#true} is VALID [2020-07-10 18:57:19,189 INFO L280 TraceCheckUtils]: 44: Hoare triple {54894#true} ~lk7~0 := 0; {54894#true} is VALID [2020-07-10 18:57:19,189 INFO L280 TraceCheckUtils]: 45: Hoare triple {54894#true} assume !(0 != ~p1~0); {54894#true} is VALID [2020-07-10 18:57:19,190 INFO L280 TraceCheckUtils]: 46: Hoare triple {54894#true} assume !(0 != ~p2~0); {54894#true} is VALID [2020-07-10 18:57:19,190 INFO L280 TraceCheckUtils]: 47: Hoare triple {54894#true} assume !(0 != ~p3~0); {54894#true} is VALID [2020-07-10 18:57:19,190 INFO L280 TraceCheckUtils]: 48: Hoare triple {54894#true} assume !(0 != ~p4~0); {54894#true} is VALID [2020-07-10 18:57:19,190 INFO L280 TraceCheckUtils]: 49: Hoare triple {54894#true} assume !(0 != ~p5~0); {54894#true} is VALID [2020-07-10 18:57:19,190 INFO L280 TraceCheckUtils]: 50: Hoare triple {54894#true} assume !(0 != ~p6~0); {54894#true} is VALID [2020-07-10 18:57:19,199 INFO L280 TraceCheckUtils]: 51: Hoare triple {54894#true} assume !(0 != ~p7~0); {54898#(= 0 main_~p7~0)} is VALID [2020-07-10 18:57:19,200 INFO L280 TraceCheckUtils]: 52: Hoare triple {54898#(= 0 main_~p7~0)} assume !(0 != ~p1~0); {54898#(= 0 main_~p7~0)} is VALID [2020-07-10 18:57:19,200 INFO L280 TraceCheckUtils]: 53: Hoare triple {54898#(= 0 main_~p7~0)} assume !(0 != ~p2~0); {54898#(= 0 main_~p7~0)} is VALID [2020-07-10 18:57:19,201 INFO L280 TraceCheckUtils]: 54: Hoare triple {54898#(= 0 main_~p7~0)} assume !(0 != ~p3~0); {54898#(= 0 main_~p7~0)} is VALID [2020-07-10 18:57:19,201 INFO L280 TraceCheckUtils]: 55: Hoare triple {54898#(= 0 main_~p7~0)} assume !(0 != ~p4~0); {54898#(= 0 main_~p7~0)} is VALID [2020-07-10 18:57:19,202 INFO L280 TraceCheckUtils]: 56: Hoare triple {54898#(= 0 main_~p7~0)} assume !(0 != ~p5~0); {54898#(= 0 main_~p7~0)} is VALID [2020-07-10 18:57:19,202 INFO L280 TraceCheckUtils]: 57: Hoare triple {54898#(= 0 main_~p7~0)} assume !(0 != ~p6~0); {54898#(= 0 main_~p7~0)} is VALID [2020-07-10 18:57:19,203 INFO L280 TraceCheckUtils]: 58: Hoare triple {54898#(= 0 main_~p7~0)} assume 0 != ~p7~0; {54895#false} is VALID [2020-07-10 18:57:19,203 INFO L280 TraceCheckUtils]: 59: Hoare triple {54895#false} assume 1 != ~lk7~0; {54895#false} is VALID [2020-07-10 18:57:19,203 INFO L280 TraceCheckUtils]: 60: Hoare triple {54895#false} assume !false; {54895#false} is VALID [2020-07-10 18:57:19,205 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-10 18:57:19,205 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:57:19,205 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [286495395] [2020-07-10 18:57:19,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:57:19,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 18:57:19,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792196516] [2020-07-10 18:57:19,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-07-10 18:57:19,206 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:57:19,206 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 18:57:19,258 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-10 18:57:19,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 18:57:19,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:57:19,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 18:57:19,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 18:57:19,259 INFO L87 Difference]: Start difference. First operand 2467 states and 3074 transitions. Second operand 3 states. [2020-07-10 18:57:34,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:57:34,029 INFO L93 Difference]: Finished difference Result 7143 states and 8900 transitions. [2020-07-10 18:57:34,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 18:57:34,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-07-10 18:57:34,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:57:34,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:57:34,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 221 transitions. [2020-07-10 18:57:34,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:57:34,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 221 transitions. [2020-07-10 18:57:34,032 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 221 transitions. [2020-07-10 18:57:34,231 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-10 18:57:34,701 INFO L225 Difference]: With dead ends: 7143 [2020-07-10 18:57:34,702 INFO L226 Difference]: Without dead ends: 3637 [2020-07-10 18:57:34,708 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-10 18:57:34,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3637 states. [2020-07-10 18:57:43,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3637 to 3635. [2020-07-10 18:57:43,773 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:57:43,774 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3637 states. Second operand 3635 states. [2020-07-10 18:57:43,774 INFO L74 IsIncluded]: Start isIncluded. First operand 3637 states. Second operand 3635 states. [2020-07-10 18:57:43,774 INFO L87 Difference]: Start difference. First operand 3637 states. Second operand 3635 states. [2020-07-10 18:57:44,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:57:44,173 INFO L93 Difference]: Finished difference Result 3637 states and 4371 transitions. [2020-07-10 18:57:44,173 INFO L276 IsEmpty]: Start isEmpty. Operand 3637 states and 4371 transitions. [2020-07-10 18:57:44,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:57:44,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:57:44,177 INFO L74 IsIncluded]: Start isIncluded. First operand 3635 states. Second operand 3637 states. [2020-07-10 18:57:44,177 INFO L87 Difference]: Start difference. First operand 3635 states. Second operand 3637 states. [2020-07-10 18:57:44,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:57:44,587 INFO L93 Difference]: Finished difference Result 3637 states and 4371 transitions. [2020-07-10 18:57:44,587 INFO L276 IsEmpty]: Start isEmpty. Operand 3637 states and 4371 transitions. [2020-07-10 18:57:44,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:57:44,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:57:44,590 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:57:44,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:57:44,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3635 states. [2020-07-10 18:57:45,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3635 states to 3635 states and 4370 transitions. [2020-07-10 18:57:45,007 INFO L78 Accepts]: Start accepts. Automaton has 3635 states and 4370 transitions. Word has length 61 [2020-07-10 18:57:45,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:57:45,007 INFO L479 AbstractCegarLoop]: Abstraction has 3635 states and 4370 transitions. [2020-07-10 18:57:45,007 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 18:57:45,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3635 states and 4370 transitions. [2020-07-10 18:57:50,414 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-10 18:57:50,415 INFO L276 IsEmpty]: Start isEmpty. Operand 3635 states and 4370 transitions. [2020-07-10 18:57:50,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-07-10 18:57:50,417 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:57:50,417 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-10 18:57:50,417 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-10 18:57:50,418 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:57:50,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:57:50,418 INFO L82 PathProgramCache]: Analyzing trace with hash 495374346, now seen corresponding path program 1 times [2020-07-10 18:57:50,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:57:50,418 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1992933437] [2020-07-10 18:57:50,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:57:50,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:57:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:57:50,461 INFO L280 TraceCheckUtils]: 0: Hoare triple {83731#true} assume true; {83731#true} is VALID [2020-07-10 18:57:50,461 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {83731#true} {83731#true} #199#return; {83731#true} is VALID [2020-07-10 18:57:50,461 INFO L263 TraceCheckUtils]: 0: Hoare triple {83731#true} call ULTIMATE.init(); {83731#true} is VALID [2020-07-10 18:57:50,462 INFO L280 TraceCheckUtils]: 1: Hoare triple {83731#true} assume true; {83731#true} is VALID [2020-07-10 18:57:50,462 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {83731#true} {83731#true} #199#return; {83731#true} is VALID [2020-07-10 18:57:50,462 INFO L263 TraceCheckUtils]: 3: Hoare triple {83731#true} call #t~ret8 := main(); {83731#true} is VALID [2020-07-10 18:57:50,463 INFO L280 TraceCheckUtils]: 4: Hoare triple {83731#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {83731#true} is VALID [2020-07-10 18:57:50,464 INFO L280 TraceCheckUtils]: 5: Hoare triple {83731#true} ~p1~0 := #t~nondet0; {83731#true} is VALID [2020-07-10 18:57:50,464 INFO L280 TraceCheckUtils]: 6: Hoare triple {83731#true} havoc #t~nondet0; {83731#true} is VALID [2020-07-10 18:57:50,464 INFO L280 TraceCheckUtils]: 7: Hoare triple {83731#true} havoc ~lk1~0; {83731#true} is VALID [2020-07-10 18:57:50,464 INFO L280 TraceCheckUtils]: 8: Hoare triple {83731#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {83731#true} is VALID [2020-07-10 18:57:50,464 INFO L280 TraceCheckUtils]: 9: Hoare triple {83731#true} ~p2~0 := #t~nondet1; {83731#true} is VALID [2020-07-10 18:57:50,464 INFO L280 TraceCheckUtils]: 10: Hoare triple {83731#true} havoc #t~nondet1; {83731#true} is VALID [2020-07-10 18:57:50,464 INFO L280 TraceCheckUtils]: 11: Hoare triple {83731#true} havoc ~lk2~0; {83731#true} is VALID [2020-07-10 18:57:50,464 INFO L280 TraceCheckUtils]: 12: Hoare triple {83731#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {83731#true} is VALID [2020-07-10 18:57:50,465 INFO L280 TraceCheckUtils]: 13: Hoare triple {83731#true} ~p3~0 := #t~nondet2; {83731#true} is VALID [2020-07-10 18:57:50,465 INFO L280 TraceCheckUtils]: 14: Hoare triple {83731#true} havoc #t~nondet2; {83731#true} is VALID [2020-07-10 18:57:50,465 INFO L280 TraceCheckUtils]: 15: Hoare triple {83731#true} havoc ~lk3~0; {83731#true} is VALID [2020-07-10 18:57:50,465 INFO L280 TraceCheckUtils]: 16: Hoare triple {83731#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {83731#true} is VALID [2020-07-10 18:57:50,465 INFO L280 TraceCheckUtils]: 17: Hoare triple {83731#true} ~p4~0 := #t~nondet3; {83731#true} is VALID [2020-07-10 18:57:50,465 INFO L280 TraceCheckUtils]: 18: Hoare triple {83731#true} havoc #t~nondet3; {83731#true} is VALID [2020-07-10 18:57:50,465 INFO L280 TraceCheckUtils]: 19: Hoare triple {83731#true} havoc ~lk4~0; {83731#true} is VALID [2020-07-10 18:57:50,465 INFO L280 TraceCheckUtils]: 20: Hoare triple {83731#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {83731#true} is VALID [2020-07-10 18:57:50,465 INFO L280 TraceCheckUtils]: 21: Hoare triple {83731#true} ~p5~0 := #t~nondet4; {83731#true} is VALID [2020-07-10 18:57:50,466 INFO L280 TraceCheckUtils]: 22: Hoare triple {83731#true} havoc #t~nondet4; {83731#true} is VALID [2020-07-10 18:57:50,466 INFO L280 TraceCheckUtils]: 23: Hoare triple {83731#true} havoc ~lk5~0; {83731#true} is VALID [2020-07-10 18:57:50,466 INFO L280 TraceCheckUtils]: 24: Hoare triple {83731#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {83731#true} is VALID [2020-07-10 18:57:50,466 INFO L280 TraceCheckUtils]: 25: Hoare triple {83731#true} ~p6~0 := #t~nondet5; {83731#true} is VALID [2020-07-10 18:57:50,466 INFO L280 TraceCheckUtils]: 26: Hoare triple {83731#true} havoc #t~nondet5; {83731#true} is VALID [2020-07-10 18:57:50,466 INFO L280 TraceCheckUtils]: 27: Hoare triple {83731#true} havoc ~lk6~0; {83731#true} is VALID [2020-07-10 18:57:50,466 INFO L280 TraceCheckUtils]: 28: Hoare triple {83731#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {83731#true} is VALID [2020-07-10 18:57:50,466 INFO L280 TraceCheckUtils]: 29: Hoare triple {83731#true} ~p7~0 := #t~nondet6; {83731#true} is VALID [2020-07-10 18:57:50,467 INFO L280 TraceCheckUtils]: 30: Hoare triple {83731#true} havoc #t~nondet6; {83731#true} is VALID [2020-07-10 18:57:50,467 INFO L280 TraceCheckUtils]: 31: Hoare triple {83731#true} havoc ~lk7~0; {83731#true} is VALID [2020-07-10 18:57:50,467 INFO L280 TraceCheckUtils]: 32: Hoare triple {83731#true} havoc ~cond~0; {83731#true} is VALID [2020-07-10 18:57:50,467 INFO L280 TraceCheckUtils]: 33: Hoare triple {83731#true} assume !false; {83731#true} is VALID [2020-07-10 18:57:50,467 INFO L280 TraceCheckUtils]: 34: Hoare triple {83731#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {83731#true} is VALID [2020-07-10 18:57:50,467 INFO L280 TraceCheckUtils]: 35: Hoare triple {83731#true} ~cond~0 := #t~nondet7; {83731#true} is VALID [2020-07-10 18:57:50,467 INFO L280 TraceCheckUtils]: 36: Hoare triple {83731#true} havoc #t~nondet7; {83731#true} is VALID [2020-07-10 18:57:50,467 INFO L280 TraceCheckUtils]: 37: Hoare triple {83731#true} assume !(0 == ~cond~0); {83731#true} is VALID [2020-07-10 18:57:50,468 INFO L280 TraceCheckUtils]: 38: Hoare triple {83731#true} ~lk1~0 := 0; {83731#true} is VALID [2020-07-10 18:57:50,468 INFO L280 TraceCheckUtils]: 39: Hoare triple {83731#true} ~lk2~0 := 0; {83731#true} is VALID [2020-07-10 18:57:50,468 INFO L280 TraceCheckUtils]: 40: Hoare triple {83731#true} ~lk3~0 := 0; {83731#true} is VALID [2020-07-10 18:57:50,468 INFO L280 TraceCheckUtils]: 41: Hoare triple {83731#true} ~lk4~0 := 0; {83731#true} is VALID [2020-07-10 18:57:50,468 INFO L280 TraceCheckUtils]: 42: Hoare triple {83731#true} ~lk5~0 := 0; {83731#true} is VALID [2020-07-10 18:57:50,468 INFO L280 TraceCheckUtils]: 43: Hoare triple {83731#true} ~lk6~0 := 0; {83731#true} is VALID [2020-07-10 18:57:50,468 INFO L280 TraceCheckUtils]: 44: Hoare triple {83731#true} ~lk7~0 := 0; {83731#true} is VALID [2020-07-10 18:57:50,468 INFO L280 TraceCheckUtils]: 45: Hoare triple {83731#true} assume !(0 != ~p1~0); {83731#true} is VALID [2020-07-10 18:57:50,468 INFO L280 TraceCheckUtils]: 46: Hoare triple {83731#true} assume !(0 != ~p2~0); {83731#true} is VALID [2020-07-10 18:57:50,469 INFO L280 TraceCheckUtils]: 47: Hoare triple {83731#true} assume !(0 != ~p3~0); {83731#true} is VALID [2020-07-10 18:57:50,469 INFO L280 TraceCheckUtils]: 48: Hoare triple {83731#true} assume !(0 != ~p4~0); {83731#true} is VALID [2020-07-10 18:57:50,469 INFO L280 TraceCheckUtils]: 49: Hoare triple {83731#true} assume !(0 != ~p5~0); {83731#true} is VALID [2020-07-10 18:57:50,469 INFO L280 TraceCheckUtils]: 50: Hoare triple {83731#true} assume 0 != ~p6~0; {83731#true} is VALID [2020-07-10 18:57:50,470 INFO L280 TraceCheckUtils]: 51: Hoare triple {83731#true} ~lk6~0 := 1; {83735#(= 1 main_~lk6~0)} is VALID [2020-07-10 18:57:50,470 INFO L280 TraceCheckUtils]: 52: Hoare triple {83735#(= 1 main_~lk6~0)} assume !(0 != ~p7~0); {83735#(= 1 main_~lk6~0)} is VALID [2020-07-10 18:57:50,471 INFO L280 TraceCheckUtils]: 53: Hoare triple {83735#(= 1 main_~lk6~0)} assume !(0 != ~p1~0); {83735#(= 1 main_~lk6~0)} is VALID [2020-07-10 18:57:50,471 INFO L280 TraceCheckUtils]: 54: Hoare triple {83735#(= 1 main_~lk6~0)} assume !(0 != ~p2~0); {83735#(= 1 main_~lk6~0)} is VALID [2020-07-10 18:57:50,472 INFO L280 TraceCheckUtils]: 55: Hoare triple {83735#(= 1 main_~lk6~0)} assume !(0 != ~p3~0); {83735#(= 1 main_~lk6~0)} is VALID [2020-07-10 18:57:50,472 INFO L280 TraceCheckUtils]: 56: Hoare triple {83735#(= 1 main_~lk6~0)} assume !(0 != ~p4~0); {83735#(= 1 main_~lk6~0)} is VALID [2020-07-10 18:57:50,472 INFO L280 TraceCheckUtils]: 57: Hoare triple {83735#(= 1 main_~lk6~0)} assume !(0 != ~p5~0); {83735#(= 1 main_~lk6~0)} is VALID [2020-07-10 18:57:50,473 INFO L280 TraceCheckUtils]: 58: Hoare triple {83735#(= 1 main_~lk6~0)} assume 0 != ~p6~0; {83735#(= 1 main_~lk6~0)} is VALID [2020-07-10 18:57:50,473 INFO L280 TraceCheckUtils]: 59: Hoare triple {83735#(= 1 main_~lk6~0)} assume 1 != ~lk6~0; {83732#false} is VALID [2020-07-10 18:57:50,474 INFO L280 TraceCheckUtils]: 60: Hoare triple {83732#false} assume !false; {83732#false} is VALID [2020-07-10 18:57:50,476 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-10 18:57:50,476 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:57:50,476 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1992933437] [2020-07-10 18:57:50,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:57:50,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 18:57:50,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711751038] [2020-07-10 18:57:50,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-07-10 18:57:50,477 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:57:50,477 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 18:57:50,521 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-10 18:57:50,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 18:57:50,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:57:50,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 18:57:50,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 18:57:50,522 INFO L87 Difference]: Start difference. First operand 3635 states and 4370 transitions. Second operand 3 states. [2020-07-10 18:58:02,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:58:02,088 INFO L93 Difference]: Finished difference Result 4087 states and 4852 transitions. [2020-07-10 18:58:02,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 18:58:02,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-07-10 18:58:02,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:58:02,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:58:02,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2020-07-10 18:58:02,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:58:02,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2020-07-10 18:58:02,091 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 137 transitions. [2020-07-10 18:58:02,222 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-10 18:58:02,519 INFO L225 Difference]: With dead ends: 4087 [2020-07-10 18:58:02,519 INFO L226 Difference]: Without dead ends: 2917 [2020-07-10 18:58:02,522 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-10 18:58:02,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2917 states. [2020-07-10 18:58:08,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2917 to 2467. [2020-07-10 18:58:08,871 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:58:08,871 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2917 states. Second operand 2467 states. [2020-07-10 18:58:08,871 INFO L74 IsIncluded]: Start isIncluded. First operand 2917 states. Second operand 2467 states. [2020-07-10 18:58:08,872 INFO L87 Difference]: Start difference. First operand 2917 states. Second operand 2467 states. [2020-07-10 18:58:09,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:58:09,102 INFO L93 Difference]: Finished difference Result 2917 states and 3395 transitions. [2020-07-10 18:58:09,102 INFO L276 IsEmpty]: Start isEmpty. Operand 2917 states and 3395 transitions. [2020-07-10 18:58:09,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:58:09,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:58:09,105 INFO L74 IsIncluded]: Start isIncluded. First operand 2467 states. Second operand 2917 states. [2020-07-10 18:58:09,105 INFO L87 Difference]: Start difference. First operand 2467 states. Second operand 2917 states. [2020-07-10 18:58:09,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:58:09,348 INFO L93 Difference]: Finished difference Result 2917 states and 3395 transitions. [2020-07-10 18:58:09,348 INFO L276 IsEmpty]: Start isEmpty. Operand 2917 states and 3395 transitions. [2020-07-10 18:58:09,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:58:09,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:58:09,351 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:58:09,351 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:58:09,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2467 states. [2020-07-10 18:58:09,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 2914 transitions. [2020-07-10 18:58:09,523 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 2914 transitions. Word has length 61 [2020-07-10 18:58:09,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:58:09,523 INFO L479 AbstractCegarLoop]: Abstraction has 2467 states and 2914 transitions. [2020-07-10 18:58:09,523 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 18:58:09,524 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2467 states and 2914 transitions. [2020-07-10 18:58:13,305 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-10 18:58:13,306 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 2914 transitions. [2020-07-10 18:58:13,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-07-10 18:58:13,308 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:58:13,308 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-10 18:58:13,308 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-10 18:58:13,308 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:58:13,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:58:13,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1060451273, now seen corresponding path program 1 times [2020-07-10 18:58:13,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:58:13,309 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1435833263] [2020-07-10 18:58:13,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:58:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:58:13,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:58:13,349 INFO L280 TraceCheckUtils]: 0: Hoare triple {102680#true} assume true; {102680#true} is VALID [2020-07-10 18:58:13,350 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {102680#true} {102680#true} #199#return; {102680#true} is VALID [2020-07-10 18:58:13,350 INFO L263 TraceCheckUtils]: 0: Hoare triple {102680#true} call ULTIMATE.init(); {102680#true} is VALID [2020-07-10 18:58:13,350 INFO L280 TraceCheckUtils]: 1: Hoare triple {102680#true} assume true; {102680#true} is VALID [2020-07-10 18:58:13,350 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {102680#true} {102680#true} #199#return; {102680#true} is VALID [2020-07-10 18:58:13,350 INFO L263 TraceCheckUtils]: 3: Hoare triple {102680#true} call #t~ret8 := main(); {102680#true} is VALID [2020-07-10 18:58:13,351 INFO L280 TraceCheckUtils]: 4: Hoare triple {102680#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {102680#true} is VALID [2020-07-10 18:58:13,351 INFO L280 TraceCheckUtils]: 5: Hoare triple {102680#true} ~p1~0 := #t~nondet0; {102680#true} is VALID [2020-07-10 18:58:13,351 INFO L280 TraceCheckUtils]: 6: Hoare triple {102680#true} havoc #t~nondet0; {102680#true} is VALID [2020-07-10 18:58:13,351 INFO L280 TraceCheckUtils]: 7: Hoare triple {102680#true} havoc ~lk1~0; {102680#true} is VALID [2020-07-10 18:58:13,351 INFO L280 TraceCheckUtils]: 8: Hoare triple {102680#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {102680#true} is VALID [2020-07-10 18:58:13,352 INFO L280 TraceCheckUtils]: 9: Hoare triple {102680#true} ~p2~0 := #t~nondet1; {102680#true} is VALID [2020-07-10 18:58:13,352 INFO L280 TraceCheckUtils]: 10: Hoare triple {102680#true} havoc #t~nondet1; {102680#true} is VALID [2020-07-10 18:58:13,352 INFO L280 TraceCheckUtils]: 11: Hoare triple {102680#true} havoc ~lk2~0; {102680#true} is VALID [2020-07-10 18:58:13,352 INFO L280 TraceCheckUtils]: 12: Hoare triple {102680#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {102680#true} is VALID [2020-07-10 18:58:13,352 INFO L280 TraceCheckUtils]: 13: Hoare triple {102680#true} ~p3~0 := #t~nondet2; {102680#true} is VALID [2020-07-10 18:58:13,353 INFO L280 TraceCheckUtils]: 14: Hoare triple {102680#true} havoc #t~nondet2; {102680#true} is VALID [2020-07-10 18:58:13,353 INFO L280 TraceCheckUtils]: 15: Hoare triple {102680#true} havoc ~lk3~0; {102680#true} is VALID [2020-07-10 18:58:13,353 INFO L280 TraceCheckUtils]: 16: Hoare triple {102680#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {102680#true} is VALID [2020-07-10 18:58:13,353 INFO L280 TraceCheckUtils]: 17: Hoare triple {102680#true} ~p4~0 := #t~nondet3; {102680#true} is VALID [2020-07-10 18:58:13,353 INFO L280 TraceCheckUtils]: 18: Hoare triple {102680#true} havoc #t~nondet3; {102680#true} is VALID [2020-07-10 18:58:13,353 INFO L280 TraceCheckUtils]: 19: Hoare triple {102680#true} havoc ~lk4~0; {102680#true} is VALID [2020-07-10 18:58:13,354 INFO L280 TraceCheckUtils]: 20: Hoare triple {102680#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {102680#true} is VALID [2020-07-10 18:58:13,354 INFO L280 TraceCheckUtils]: 21: Hoare triple {102680#true} ~p5~0 := #t~nondet4; {102680#true} is VALID [2020-07-10 18:58:13,354 INFO L280 TraceCheckUtils]: 22: Hoare triple {102680#true} havoc #t~nondet4; {102680#true} is VALID [2020-07-10 18:58:13,354 INFO L280 TraceCheckUtils]: 23: Hoare triple {102680#true} havoc ~lk5~0; {102680#true} is VALID [2020-07-10 18:58:13,354 INFO L280 TraceCheckUtils]: 24: Hoare triple {102680#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {102680#true} is VALID [2020-07-10 18:58:13,355 INFO L280 TraceCheckUtils]: 25: Hoare triple {102680#true} ~p6~0 := #t~nondet5; {102680#true} is VALID [2020-07-10 18:58:13,355 INFO L280 TraceCheckUtils]: 26: Hoare triple {102680#true} havoc #t~nondet5; {102680#true} is VALID [2020-07-10 18:58:13,355 INFO L280 TraceCheckUtils]: 27: Hoare triple {102680#true} havoc ~lk6~0; {102680#true} is VALID [2020-07-10 18:58:13,355 INFO L280 TraceCheckUtils]: 28: Hoare triple {102680#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {102680#true} is VALID [2020-07-10 18:58:13,355 INFO L280 TraceCheckUtils]: 29: Hoare triple {102680#true} ~p7~0 := #t~nondet6; {102680#true} is VALID [2020-07-10 18:58:13,355 INFO L280 TraceCheckUtils]: 30: Hoare triple {102680#true} havoc #t~nondet6; {102680#true} is VALID [2020-07-10 18:58:13,356 INFO L280 TraceCheckUtils]: 31: Hoare triple {102680#true} havoc ~lk7~0; {102680#true} is VALID [2020-07-10 18:58:13,356 INFO L280 TraceCheckUtils]: 32: Hoare triple {102680#true} havoc ~cond~0; {102680#true} is VALID [2020-07-10 18:58:13,356 INFO L280 TraceCheckUtils]: 33: Hoare triple {102680#true} assume !false; {102680#true} is VALID [2020-07-10 18:58:13,356 INFO L280 TraceCheckUtils]: 34: Hoare triple {102680#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {102680#true} is VALID [2020-07-10 18:58:13,356 INFO L280 TraceCheckUtils]: 35: Hoare triple {102680#true} ~cond~0 := #t~nondet7; {102680#true} is VALID [2020-07-10 18:58:13,357 INFO L280 TraceCheckUtils]: 36: Hoare triple {102680#true} havoc #t~nondet7; {102680#true} is VALID [2020-07-10 18:58:13,357 INFO L280 TraceCheckUtils]: 37: Hoare triple {102680#true} assume !(0 == ~cond~0); {102680#true} is VALID [2020-07-10 18:58:13,357 INFO L280 TraceCheckUtils]: 38: Hoare triple {102680#true} ~lk1~0 := 0; {102680#true} is VALID [2020-07-10 18:58:13,357 INFO L280 TraceCheckUtils]: 39: Hoare triple {102680#true} ~lk2~0 := 0; {102680#true} is VALID [2020-07-10 18:58:13,357 INFO L280 TraceCheckUtils]: 40: Hoare triple {102680#true} ~lk3~0 := 0; {102680#true} is VALID [2020-07-10 18:58:13,358 INFO L280 TraceCheckUtils]: 41: Hoare triple {102680#true} ~lk4~0 := 0; {102680#true} is VALID [2020-07-10 18:58:13,358 INFO L280 TraceCheckUtils]: 42: Hoare triple {102680#true} ~lk5~0 := 0; {102680#true} is VALID [2020-07-10 18:58:13,358 INFO L280 TraceCheckUtils]: 43: Hoare triple {102680#true} ~lk6~0 := 0; {102680#true} is VALID [2020-07-10 18:58:13,358 INFO L280 TraceCheckUtils]: 44: Hoare triple {102680#true} ~lk7~0 := 0; {102680#true} is VALID [2020-07-10 18:58:13,358 INFO L280 TraceCheckUtils]: 45: Hoare triple {102680#true} assume !(0 != ~p1~0); {102680#true} is VALID [2020-07-10 18:58:13,358 INFO L280 TraceCheckUtils]: 46: Hoare triple {102680#true} assume !(0 != ~p2~0); {102680#true} is VALID [2020-07-10 18:58:13,359 INFO L280 TraceCheckUtils]: 47: Hoare triple {102680#true} assume !(0 != ~p3~0); {102680#true} is VALID [2020-07-10 18:58:13,359 INFO L280 TraceCheckUtils]: 48: Hoare triple {102680#true} assume !(0 != ~p4~0); {102680#true} is VALID [2020-07-10 18:58:13,359 INFO L280 TraceCheckUtils]: 49: Hoare triple {102680#true} assume !(0 != ~p5~0); {102680#true} is VALID [2020-07-10 18:58:13,359 INFO L280 TraceCheckUtils]: 50: Hoare triple {102680#true} assume !(0 != ~p6~0); {102680#true} is VALID [2020-07-10 18:58:13,359 INFO L280 TraceCheckUtils]: 51: Hoare triple {102680#true} assume 0 != ~p7~0; {102680#true} is VALID [2020-07-10 18:58:13,360 INFO L280 TraceCheckUtils]: 52: Hoare triple {102680#true} ~lk7~0 := 1; {102684#(= main_~lk7~0 1)} is VALID [2020-07-10 18:58:13,360 INFO L280 TraceCheckUtils]: 53: Hoare triple {102684#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {102684#(= main_~lk7~0 1)} is VALID [2020-07-10 18:58:13,361 INFO L280 TraceCheckUtils]: 54: Hoare triple {102684#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {102684#(= main_~lk7~0 1)} is VALID [2020-07-10 18:58:13,361 INFO L280 TraceCheckUtils]: 55: Hoare triple {102684#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {102684#(= main_~lk7~0 1)} is VALID [2020-07-10 18:58:13,362 INFO L280 TraceCheckUtils]: 56: Hoare triple {102684#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {102684#(= main_~lk7~0 1)} is VALID [2020-07-10 18:58:13,362 INFO L280 TraceCheckUtils]: 57: Hoare triple {102684#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {102684#(= main_~lk7~0 1)} is VALID [2020-07-10 18:58:13,363 INFO L280 TraceCheckUtils]: 58: Hoare triple {102684#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {102684#(= main_~lk7~0 1)} is VALID [2020-07-10 18:58:13,363 INFO L280 TraceCheckUtils]: 59: Hoare triple {102684#(= main_~lk7~0 1)} assume 0 != ~p7~0; {102684#(= main_~lk7~0 1)} is VALID [2020-07-10 18:58:13,364 INFO L280 TraceCheckUtils]: 60: Hoare triple {102684#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {102681#false} is VALID [2020-07-10 18:58:13,364 INFO L280 TraceCheckUtils]: 61: Hoare triple {102681#false} assume !false; {102681#false} is VALID [2020-07-10 18:58:13,367 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-10 18:58:13,367 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:58:13,367 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1435833263] [2020-07-10 18:58:13,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:58:13,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 18:58:13,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616951308] [2020-07-10 18:58:13,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2020-07-10 18:58:13,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:58:13,369 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 18:58:13,433 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-10 18:58:13,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 18:58:13,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:58:13,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 18:58:13,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 18:58:13,434 INFO L87 Difference]: Start difference. First operand 2467 states and 2914 transitions. Second operand 3 states. [2020-07-10 18:58:20,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:58:20,463 INFO L93 Difference]: Finished difference Result 2467 states and 2914 transitions. [2020-07-10 18:58:20,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 18:58:20,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2020-07-10 18:58:20,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:58:20,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:58:20,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2020-07-10 18:58:20,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:58:20,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2020-07-10 18:58:20,466 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 94 transitions. [2020-07-10 18:58:20,552 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-10 18:58:20,553 INFO L225 Difference]: With dead ends: 2467 [2020-07-10 18:58:20,553 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 18:58:20,559 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-10 18:58:20,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 18:58:20,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 18:58:20,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:58:20,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 18:58:20,560 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 18:58:20,560 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 18:58:20,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:58:20,561 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 18:58:20,561 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 18:58:20,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:58:20,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:58:20,561 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 18:58:20,561 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 18:58:20,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:58:20,562 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 18:58:20,562 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 18:58:20,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:58:20,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:58:20,562 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:58:20,562 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:58:20,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 18:58:20,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 18:58:20,563 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2020-07-10 18:58:20,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:58:20,563 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 18:58:20,563 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 18:58:20,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-10 18:58:20,563 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-10 18:58:20,563 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 18:58:20,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:58:20,564 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-10 18:58:20,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 18:58:20,700 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-07-10 18:58:21,066 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 275 DAG size of output: 3 [2020-07-10 18:58:21,342 WARN L193 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 340 DAG size of output: 7 [2020-07-10 18:58:21,731 WARN L193 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 91 [2020-07-10 18:58:22,144 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 55 [2020-07-10 18:58:22,321 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 91 [2020-07-10 18:58:22,827 WARN L193 SmtUtils]: Spent 349.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2020-07-10 18:58:23,185 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 15 [2020-07-10 18:58:24,304 WARN L193 SmtUtils]: Spent 881.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-07-10 18:58:24,691 WARN L193 SmtUtils]: Spent 375.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-07-10 18:58:24,909 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-10 18:58:25,388 WARN L193 SmtUtils]: Spent 387.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-07-10 18:58:26,341 WARN L193 SmtUtils]: Spent 891.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-07-10 18:58:26,507 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-07-10 18:58:26,665 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-10 18:58:27,065 WARN L193 SmtUtils]: Spent 321.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-10 18:58:27,976 WARN L193 SmtUtils]: Spent 893.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-07-10 18:58:29,073 WARN L193 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 93 [2020-07-10 18:58:29,245 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-07-10 18:58:31,816 WARN L193 SmtUtils]: Spent 2.56 s on a formula simplification that was a NOOP. DAG size: 159 [2020-07-10 18:58:32,145 WARN L193 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-10 18:58:32,442 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-10 18:58:32,786 WARN L193 SmtUtils]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-10 18:58:33,804 WARN L193 SmtUtils]: Spent 1.01 s on a formula simplification that was a NOOP. DAG size: 93 [2020-07-10 18:58:33,820 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 18:58:33,821 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-10 18:58:33,821 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-10 18:58:33,821 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 18:58:33,821 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 18:58:33,821 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-10 18:58:33,821 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-10 18:58:33,822 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-10 18:58:33,822 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 4 121) the Hoare annotation is: true [2020-07-10 18:58:33,822 INFO L271 CegarLoopResult]: At program point L52(line 52) the Hoare annotation is: true [2020-07-10 18:58:33,822 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-07-10 18:58:33,822 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-10 18:58:33,822 INFO L271 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-07-10 18:58:33,823 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-10 18:58:33,823 INFO L271 CegarLoopResult]: At program point L111-1(lines 30 116) the Hoare annotation is: true [2020-07-10 18:58:33,823 INFO L271 CegarLoopResult]: At program point L45(line 45) the Hoare annotation is: true [2020-07-10 18:58:33,823 INFO L271 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-07-10 18:58:33,823 INFO L271 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-07-10 18:58:33,824 INFO L271 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-07-10 18:58:33,824 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-10 18:58:33,824 INFO L271 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: true [2020-07-10 18:58:33,824 INFO L264 CegarLoopResult]: At program point L120(line 120) the Hoare annotation is: false [2020-07-10 18:58:33,824 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-10 18:58:33,824 INFO L271 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-07-10 18:58:33,824 INFO L271 CegarLoopResult]: At program point L21-1(line 21) the Hoare annotation is: true [2020-07-10 18:58:33,824 INFO L271 CegarLoopResult]: At program point L21-2(line 21) the Hoare annotation is: true [2020-07-10 18:58:33,825 INFO L264 CegarLoopResult]: At program point L112(line 112) the Hoare annotation is: (= 1 main_~lk7~0) [2020-07-10 18:58:33,825 INFO L264 CegarLoopResult]: At program point L112-1(lines 5 121) the Hoare annotation is: false [2020-07-10 18:58:33,825 INFO L271 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: true [2020-07-10 18:58:33,825 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 4 121) the Hoare annotation is: true [2020-07-10 18:58:33,825 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-10 18:58:33,826 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 119) the Hoare annotation is: false [2020-07-10 18:58:33,826 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-10 18:58:33,826 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-10 18:58:33,826 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 121) the Hoare annotation is: true [2020-07-10 18:58:33,827 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-10 18:58:33,827 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-07-10 18:58:33,827 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-10 18:58:33,827 INFO L264 CegarLoopResult]: At program point L113(line 113) the Hoare annotation is: (= 1 main_~lk7~0) [2020-07-10 18:58:33,827 INFO L271 CegarLoopResult]: At program point L47(line 47) the Hoare annotation is: true [2020-07-10 18:58:33,828 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-10 18:58:33,828 INFO L271 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: true [2020-07-10 18:58:33,828 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-07-10 18:58:33,828 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-07-10 18:58:33,828 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-10 18:58:33,828 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-10 18:58:33,828 INFO L271 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: true [2020-07-10 18:58:33,828 INFO L271 CegarLoopResult]: At program point L31-1(line 31) the Hoare annotation is: true [2020-07-10 18:58:33,829 INFO L271 CegarLoopResult]: At program point L31-2(line 31) the Hoare annotation is: true [2020-07-10 18:58:33,829 INFO L264 CegarLoopResult]: At program point L56(line 56) the Hoare annotation is: (or (= 0 main_~p1~0) (= 1 main_~lk1~0)) [2020-07-10 18:58:33,829 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-10 18:58:33,829 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-07-10 18:58:33,829 INFO L271 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: true [2020-07-10 18:58:33,830 INFO L271 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: true [2020-07-10 18:58:33,830 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-10 18:58:33,830 INFO L271 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: true [2020-07-10 18:58:33,830 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-10 18:58:33,830 INFO L271 CegarLoopResult]: At program point L32(lines 32 34) the Hoare annotation is: true [2020-07-10 18:58:33,830 INFO L271 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: true [2020-07-10 18:58:33,831 INFO L271 CegarLoopResult]: At program point L24-1(line 24) the Hoare annotation is: true [2020-07-10 18:58:33,831 INFO L271 CegarLoopResult]: At program point L24-2(line 24) the Hoare annotation is: true [2020-07-10 18:58:33,841 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-10 18:58:33,842 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-07-10 18:58:33,842 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-10 18:58:33,842 INFO L271 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: true [2020-07-10 18:58:33,842 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-10 18:58:33,842 INFO L271 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-07-10 18:58:33,843 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-10 18:58:33,843 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-10 18:58:33,845 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-10 18:58:33,845 INFO L271 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-07-10 18:58:33,845 INFO L271 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: true [2020-07-10 18:58:33,845 INFO L271 CegarLoopResult]: At program point L9-2(line 9) the Hoare annotation is: true [2020-07-10 18:58:33,846 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-10 18:58:33,846 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-10 18:58:33,846 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-10 18:58:33,846 INFO L271 CegarLoopResult]: At program point L117(lines 5 121) the Hoare annotation is: true [2020-07-10 18:58:33,846 INFO L271 CegarLoopResult]: At program point L51(lines 51 53) the Hoare annotation is: true [2020-07-10 18:58:33,846 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-07-10 18:58:33,846 INFO L271 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: true [2020-07-10 18:58:33,847 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-10 18:58:33,847 INFO L271 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: true [2020-07-10 18:58:33,847 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-10 18:58:33,847 INFO L271 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: true [2020-07-10 18:58:33,848 INFO L271 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: true [2020-07-10 18:58:33,848 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-10 18:58:33,848 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-10 18:58:33,848 INFO L271 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: true [2020-07-10 18:58:33,955 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-10 18:58:33,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 06:58:33 BoogieIcfgContainer [2020-07-10 18:58:33,967 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 18:58:33,969 INFO L168 Benchmark]: Toolchain (without parser) took 130406.47 ms. Allocated memory was 136.8 MB in the beginning and 811.6 MB in the end (delta: 674.8 MB). Free memory was 100.4 MB in the beginning and 568.8 MB in the end (delta: -468.4 MB). Peak memory consumption was 206.4 MB. Max. memory is 7.1 GB. [2020-07-10 18:58:33,969 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 136.8 MB. Free memory is still 118.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 18:58:33,970 INFO L168 Benchmark]: CACSL2BoogieTranslator took 304.29 ms. Allocated memory is still 136.8 MB. Free memory was 100.0 MB in the beginning and 89.7 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2020-07-10 18:58:33,970 INFO L168 Benchmark]: Boogie Preprocessor took 115.43 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 89.7 MB in the beginning and 178.4 MB in the end (delta: -88.7 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2020-07-10 18:58:33,971 INFO L168 Benchmark]: RCFGBuilder took 584.72 ms. Allocated memory is still 200.8 MB. Free memory was 178.4 MB in the beginning and 145.2 MB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 7.1 GB. [2020-07-10 18:58:33,971 INFO L168 Benchmark]: TraceAbstraction took 129396.75 ms. Allocated memory was 200.8 MB in the beginning and 811.6 MB in the end (delta: 610.8 MB). Free memory was 145.2 MB in the beginning and 568.8 MB in the end (delta: -423.5 MB). Peak memory consumption was 187.3 MB. Max. memory is 7.1 GB. [2020-07-10 18:58:33,974 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.21 ms. Allocated memory is still 136.8 MB. Free memory is still 118.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 304.29 ms. Allocated memory is still 136.8 MB. Free memory was 100.0 MB in the beginning and 89.7 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 115.43 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 89.7 MB in the beginning and 178.4 MB in the end (delta: -88.7 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 584.72 ms. Allocated memory is still 200.8 MB. Free memory was 178.4 MB in the beginning and 145.2 MB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 129396.75 ms. Allocated memory was 200.8 MB in the beginning and 811.6 MB in the end (delta: 610.8 MB). Free memory was 145.2 MB in the beginning and 568.8 MB in the end (delta: -423.5 MB). Peak memory consumption was 187.3 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: 115.9s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 57.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 13.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: 34.7s AutomataMinimizationTime, 14 MinimizatonAttempts, 1022 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 88 LocationsWithAnnotation, 88 PreInvPairs, 4768 NumberOfFragments, 13918 HoareAnnotationTreeSize, 88 FomulaSimplifications, 98944 FormulaSimplificationTreeSizeReduction, 2.8s HoareSimplificationTime, 88 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 10.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...