/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/locks/test_locks_10.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:25:59,603 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:25:59,607 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:25:59,628 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:25:59,629 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:25:59,630 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:25:59,632 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:25:59,646 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:25:59,651 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:25:59,653 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:25:59,654 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:25:59,657 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:25:59,658 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:25:59,659 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:25:59,662 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:25:59,664 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:25:59,666 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:25:59,667 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:25:59,669 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:25:59,673 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:25:59,675 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:25:59,679 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:25:59,681 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:25:59,683 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:25:59,687 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:25:59,687 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:25:59,687 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:25:59,691 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:25:59,692 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:25:59,693 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:25:59,693 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:25:59,694 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:25:59,696 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:25:59,696 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:25:59,700 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:25:59,700 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:25:59,701 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:25:59,701 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:25:59,701 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:25:59,702 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:25:59,703 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:25:59,704 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:25:59,719 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:25:59,720 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:25:59,721 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:25:59,721 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:25:59,722 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:25:59,722 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:25:59,722 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:25:59,722 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:25:59,723 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:25:59,723 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:25:59,723 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:25:59,723 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:25:59,723 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:25:59,724 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:25:59,724 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:25:59,724 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:25:59,724 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:25:59,725 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:25:59,725 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:25:59,725 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:25:59,725 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:25:59,725 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:25:59,726 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:25:59,726 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:25:59,726 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:25:59,726 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:25:59,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:25:59,727 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:25:59,727 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:25:59,727 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:26:00,030 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:26:00,046 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:26:00,050 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:26:00,052 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:26:00,052 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:26:00,053 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_10.c [2020-07-17 22:26:00,138 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f479c25a8/c2ef88c6d3ba41bc89ac66c64208a3a5/FLAG683c31344 [2020-07-17 22:26:00,693 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:26:00,694 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_10.c [2020-07-17 22:26:00,704 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f479c25a8/c2ef88c6d3ba41bc89ac66c64208a3a5/FLAG683c31344 [2020-07-17 22:26:01,033 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f479c25a8/c2ef88c6d3ba41bc89ac66c64208a3a5 [2020-07-17 22:26:01,045 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:26:01,048 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:26:01,049 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:26:01,049 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:26:01,053 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:26:01,055 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:26:01" (1/1) ... [2020-07-17 22:26:01,058 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e73a39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:01, skipping insertion in model container [2020-07-17 22:26:01,059 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:26:01" (1/1) ... [2020-07-17 22:26:01,068 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:26:01,094 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:26:01,328 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:26:01,334 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:26:01,363 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:26:01,381 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:26:01,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:01 WrapperNode [2020-07-17 22:26:01,383 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:26:01,384 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:26:01,384 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:26:01,384 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:26:01,509 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:01" (1/1) ... [2020-07-17 22:26:01,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:01" (1/1) ... [2020-07-17 22:26:01,519 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:01" (1/1) ... [2020-07-17 22:26:01,519 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:01" (1/1) ... [2020-07-17 22:26:01,545 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:01" (1/1) ... [2020-07-17 22:26:01,564 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:01" (1/1) ... [2020-07-17 22:26:01,567 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:01" (1/1) ... [2020-07-17 22:26:01,570 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:26:01,571 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:26:01,571 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:26:01,571 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:26:01,572 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:01" (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-17 22:26:01,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:26:01,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:26:01,653 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:26:01,653 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:26:01,654 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:26:01,654 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:26:01,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:26:01,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:26:02,228 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:26:02,228 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-17 22:26:02,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:26:02 BoogieIcfgContainer [2020-07-17 22:26:02,233 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:26:02,235 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:26:02,235 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:26:02,239 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:26:02,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:26:01" (1/3) ... [2020-07-17 22:26:02,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d839b88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:26:02, skipping insertion in model container [2020-07-17 22:26:02,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:01" (2/3) ... [2020-07-17 22:26:02,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d839b88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:26:02, skipping insertion in model container [2020-07-17 22:26:02,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:26:02" (3/3) ... [2020-07-17 22:26:02,244 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_10.c [2020-07-17 22:26:02,253 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:26:02,262 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:26:02,278 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:26:02,304 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:26:02,304 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:26:02,304 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:26:02,304 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:26:02,305 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:26:02,305 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:26:02,305 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:26:02,306 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:26:02,329 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-07-17 22:26:02,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-17 22:26:02,336 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:02,337 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] [2020-07-17 22:26:02,338 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:02,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:02,344 INFO L82 PathProgramCache]: Analyzing trace with hash -917347053, now seen corresponding path program 1 times [2020-07-17 22:26:02,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:02,354 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356372014] [2020-07-17 22:26:02,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:02,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:02,611 INFO L280 TraceCheckUtils]: 0: Hoare triple {47#true} assume true; {47#true} is VALID [2020-07-17 22:26:02,612 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {47#true} {47#true} #197#return; {47#true} is VALID [2020-07-17 22:26:02,614 INFO L263 TraceCheckUtils]: 0: Hoare triple {47#true} call ULTIMATE.init(); {47#true} is VALID [2020-07-17 22:26:02,615 INFO L280 TraceCheckUtils]: 1: Hoare triple {47#true} assume true; {47#true} is VALID [2020-07-17 22:26:02,616 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {47#true} {47#true} #197#return; {47#true} is VALID [2020-07-17 22:26:02,616 INFO L263 TraceCheckUtils]: 3: Hoare triple {47#true} call #t~ret11 := main(); {47#true} is VALID [2020-07-17 22:26:02,617 INFO L280 TraceCheckUtils]: 4: Hoare triple {47#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {47#true} is VALID [2020-07-17 22:26:02,617 INFO L280 TraceCheckUtils]: 5: Hoare triple {47#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {47#true} is VALID [2020-07-17 22:26:02,618 INFO L280 TraceCheckUtils]: 6: Hoare triple {47#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {47#true} is VALID [2020-07-17 22:26:02,620 INFO L280 TraceCheckUtils]: 7: Hoare triple {47#true} assume 0 != ~p1~0;~lk1~0 := 1; {51#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:02,621 INFO L280 TraceCheckUtils]: 8: Hoare triple {51#(= 1 main_~lk1~0)} assume 0 != ~p2~0;~lk2~0 := 1; {51#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:02,623 INFO L280 TraceCheckUtils]: 9: Hoare triple {51#(= 1 main_~lk1~0)} assume 0 != ~p3~0;~lk3~0 := 1; {51#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:02,624 INFO L280 TraceCheckUtils]: 10: Hoare triple {51#(= 1 main_~lk1~0)} assume 0 != ~p4~0;~lk4~0 := 1; {51#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:02,625 INFO L280 TraceCheckUtils]: 11: Hoare triple {51#(= 1 main_~lk1~0)} assume 0 != ~p5~0;~lk5~0 := 1; {51#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:02,626 INFO L280 TraceCheckUtils]: 12: Hoare triple {51#(= 1 main_~lk1~0)} assume 0 != ~p6~0;~lk6~0 := 1; {51#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:02,627 INFO L280 TraceCheckUtils]: 13: Hoare triple {51#(= 1 main_~lk1~0)} assume 0 != ~p7~0;~lk7~0 := 1; {51#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:02,629 INFO L280 TraceCheckUtils]: 14: Hoare triple {51#(= 1 main_~lk1~0)} assume !(0 != ~p8~0); {51#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:02,630 INFO L280 TraceCheckUtils]: 15: Hoare triple {51#(= 1 main_~lk1~0)} assume 0 != ~p9~0;~lk9~0 := 1; {51#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:02,631 INFO L280 TraceCheckUtils]: 16: Hoare triple {51#(= 1 main_~lk1~0)} assume 0 != ~p10~0;~lk10~0 := 1; {51#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:02,632 INFO L280 TraceCheckUtils]: 17: Hoare triple {51#(= 1 main_~lk1~0)} assume 0 != ~p1~0; {51#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:02,633 INFO L280 TraceCheckUtils]: 18: Hoare triple {51#(= 1 main_~lk1~0)} assume 1 != ~lk1~0; {48#false} is VALID [2020-07-17 22:26:02,634 INFO L280 TraceCheckUtils]: 19: Hoare triple {48#false} assume !false; {48#false} is VALID [2020-07-17 22:26:02,637 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-17 22:26:02,638 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356372014] [2020-07-17 22:26:02,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:02,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:02,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277103425] [2020-07-17 22:26:02,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-17 22:26:02,652 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:02,657 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:02,710 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:02,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:02,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:02,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:02,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:02,727 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2020-07-17 22:26:03,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:03,017 INFO L93 Difference]: Finished difference Result 87 states and 150 transitions. [2020-07-17 22:26:03,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:03,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-17 22:26:03,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:03,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:03,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2020-07-17 22:26:03,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:03,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2020-07-17 22:26:03,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 150 transitions. [2020-07-17 22:26:03,299 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:03,318 INFO L225 Difference]: With dead ends: 87 [2020-07-17 22:26:03,318 INFO L226 Difference]: Without dead ends: 72 [2020-07-17 22:26:03,324 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-17 22:26:03,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-07-17 22:26:03,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2020-07-17 22:26:03,381 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:03,382 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 50 states. [2020-07-17 22:26:03,382 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 50 states. [2020-07-17 22:26:03,383 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 50 states. [2020-07-17 22:26:03,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:03,393 INFO L93 Difference]: Finished difference Result 72 states and 128 transitions. [2020-07-17 22:26:03,393 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 128 transitions. [2020-07-17 22:26:03,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:03,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:03,395 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 72 states. [2020-07-17 22:26:03,395 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 72 states. [2020-07-17 22:26:03,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:03,405 INFO L93 Difference]: Finished difference Result 72 states and 128 transitions. [2020-07-17 22:26:03,405 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 128 transitions. [2020-07-17 22:26:03,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:03,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:03,407 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:03,407 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:03,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-17 22:26:03,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 89 transitions. [2020-07-17 22:26:03,414 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 89 transitions. Word has length 20 [2020-07-17 22:26:03,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:03,415 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 89 transitions. [2020-07-17 22:26:03,415 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:03,415 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 89 transitions. [2020-07-17 22:26:03,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-17 22:26:03,417 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:03,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] [2020-07-17 22:26:03,418 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:26:03,418 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:03,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:03,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1504153067, now seen corresponding path program 1 times [2020-07-17 22:26:03,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:03,420 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407294134] [2020-07-17 22:26:03,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:03,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:03,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:03,534 INFO L280 TraceCheckUtils]: 0: Hoare triple {353#true} assume true; {353#true} is VALID [2020-07-17 22:26:03,534 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {353#true} {353#true} #197#return; {353#true} is VALID [2020-07-17 22:26:03,535 INFO L263 TraceCheckUtils]: 0: Hoare triple {353#true} call ULTIMATE.init(); {353#true} is VALID [2020-07-17 22:26:03,535 INFO L280 TraceCheckUtils]: 1: Hoare triple {353#true} assume true; {353#true} is VALID [2020-07-17 22:26:03,535 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {353#true} {353#true} #197#return; {353#true} is VALID [2020-07-17 22:26:03,536 INFO L263 TraceCheckUtils]: 3: Hoare triple {353#true} call #t~ret11 := main(); {353#true} is VALID [2020-07-17 22:26:03,536 INFO L280 TraceCheckUtils]: 4: Hoare triple {353#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {353#true} is VALID [2020-07-17 22:26:03,536 INFO L280 TraceCheckUtils]: 5: Hoare triple {353#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {353#true} is VALID [2020-07-17 22:26:03,537 INFO L280 TraceCheckUtils]: 6: Hoare triple {353#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {353#true} is VALID [2020-07-17 22:26:03,538 INFO L280 TraceCheckUtils]: 7: Hoare triple {353#true} assume !(0 != ~p1~0); {357#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:03,539 INFO L280 TraceCheckUtils]: 8: Hoare triple {357#(= 0 main_~p1~0)} assume 0 != ~p2~0;~lk2~0 := 1; {357#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:03,540 INFO L280 TraceCheckUtils]: 9: Hoare triple {357#(= 0 main_~p1~0)} assume 0 != ~p3~0;~lk3~0 := 1; {357#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:03,540 INFO L280 TraceCheckUtils]: 10: Hoare triple {357#(= 0 main_~p1~0)} assume 0 != ~p4~0;~lk4~0 := 1; {357#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:03,541 INFO L280 TraceCheckUtils]: 11: Hoare triple {357#(= 0 main_~p1~0)} assume 0 != ~p5~0;~lk5~0 := 1; {357#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:03,542 INFO L280 TraceCheckUtils]: 12: Hoare triple {357#(= 0 main_~p1~0)} assume 0 != ~p6~0;~lk6~0 := 1; {357#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:03,543 INFO L280 TraceCheckUtils]: 13: Hoare triple {357#(= 0 main_~p1~0)} assume 0 != ~p7~0;~lk7~0 := 1; {357#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:03,543 INFO L280 TraceCheckUtils]: 14: Hoare triple {357#(= 0 main_~p1~0)} assume !(0 != ~p8~0); {357#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:03,544 INFO L280 TraceCheckUtils]: 15: Hoare triple {357#(= 0 main_~p1~0)} assume 0 != ~p9~0;~lk9~0 := 1; {357#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:03,545 INFO L280 TraceCheckUtils]: 16: Hoare triple {357#(= 0 main_~p1~0)} assume 0 != ~p10~0;~lk10~0 := 1; {357#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:03,546 INFO L280 TraceCheckUtils]: 17: Hoare triple {357#(= 0 main_~p1~0)} assume 0 != ~p1~0; {354#false} is VALID [2020-07-17 22:26:03,546 INFO L280 TraceCheckUtils]: 18: Hoare triple {354#false} assume 1 != ~lk1~0; {354#false} is VALID [2020-07-17 22:26:03,547 INFO L280 TraceCheckUtils]: 19: Hoare triple {354#false} assume !false; {354#false} is VALID [2020-07-17 22:26:03,548 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-17 22:26:03,549 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407294134] [2020-07-17 22:26:03,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:03,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:03,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399143243] [2020-07-17 22:26:03,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-17 22:26:03,552 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:03,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:03,578 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:03,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:03,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:03,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:03,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:03,579 INFO L87 Difference]: Start difference. First operand 50 states and 89 transitions. Second operand 3 states. [2020-07-17 22:26:03,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:03,733 INFO L93 Difference]: Finished difference Result 117 states and 212 transitions. [2020-07-17 22:26:03,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:03,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-17 22:26:03,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:03,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:03,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2020-07-17 22:26:03,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:03,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2020-07-17 22:26:03,744 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 191 transitions. [2020-07-17 22:26:04,000 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:04,004 INFO L225 Difference]: With dead ends: 117 [2020-07-17 22:26:04,005 INFO L226 Difference]: Without dead ends: 72 [2020-07-17 22:26:04,007 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:04,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-07-17 22:26:04,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2020-07-17 22:26:04,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:04,022 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 70 states. [2020-07-17 22:26:04,023 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 70 states. [2020-07-17 22:26:04,023 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 70 states. [2020-07-17 22:26:04,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:04,030 INFO L93 Difference]: Finished difference Result 72 states and 126 transitions. [2020-07-17 22:26:04,031 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 126 transitions. [2020-07-17 22:26:04,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:04,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:04,032 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 72 states. [2020-07-17 22:26:04,033 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 72 states. [2020-07-17 22:26:04,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:04,039 INFO L93 Difference]: Finished difference Result 72 states and 126 transitions. [2020-07-17 22:26:04,040 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 126 transitions. [2020-07-17 22:26:04,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:04,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:04,042 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:04,042 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:04,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-17 22:26:04,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 125 transitions. [2020-07-17 22:26:04,048 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 125 transitions. Word has length 20 [2020-07-17 22:26:04,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:04,049 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 125 transitions. [2020-07-17 22:26:04,049 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:04,049 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 125 transitions. [2020-07-17 22:26:04,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-17 22:26:04,050 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:04,051 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] [2020-07-17 22:26:04,051 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:26:04,051 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:04,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:04,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1627225809, now seen corresponding path program 1 times [2020-07-17 22:26:04,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:04,053 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362948187] [2020-07-17 22:26:04,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:04,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:04,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:04,146 INFO L280 TraceCheckUtils]: 0: Hoare triple {708#true} assume true; {708#true} is VALID [2020-07-17 22:26:04,146 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {708#true} {708#true} #197#return; {708#true} is VALID [2020-07-17 22:26:04,147 INFO L263 TraceCheckUtils]: 0: Hoare triple {708#true} call ULTIMATE.init(); {708#true} is VALID [2020-07-17 22:26:04,148 INFO L280 TraceCheckUtils]: 1: Hoare triple {708#true} assume true; {708#true} is VALID [2020-07-17 22:26:04,149 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {708#true} {708#true} #197#return; {708#true} is VALID [2020-07-17 22:26:04,150 INFO L263 TraceCheckUtils]: 3: Hoare triple {708#true} call #t~ret11 := main(); {708#true} is VALID [2020-07-17 22:26:04,150 INFO L280 TraceCheckUtils]: 4: Hoare triple {708#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {708#true} is VALID [2020-07-17 22:26:04,151 INFO L280 TraceCheckUtils]: 5: Hoare triple {708#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {708#true} is VALID [2020-07-17 22:26:04,151 INFO L280 TraceCheckUtils]: 6: Hoare triple {708#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {708#true} is VALID [2020-07-17 22:26:04,152 INFO L280 TraceCheckUtils]: 7: Hoare triple {708#true} assume 0 != ~p1~0;~lk1~0 := 1; {712#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:04,154 INFO L280 TraceCheckUtils]: 8: Hoare triple {712#(not (= 0 main_~p1~0))} assume 0 != ~p2~0;~lk2~0 := 1; {712#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:04,155 INFO L280 TraceCheckUtils]: 9: Hoare triple {712#(not (= 0 main_~p1~0))} assume 0 != ~p3~0;~lk3~0 := 1; {712#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:04,157 INFO L280 TraceCheckUtils]: 10: Hoare triple {712#(not (= 0 main_~p1~0))} assume 0 != ~p4~0;~lk4~0 := 1; {712#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:04,158 INFO L280 TraceCheckUtils]: 11: Hoare triple {712#(not (= 0 main_~p1~0))} assume 0 != ~p5~0;~lk5~0 := 1; {712#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:04,159 INFO L280 TraceCheckUtils]: 12: Hoare triple {712#(not (= 0 main_~p1~0))} assume 0 != ~p6~0;~lk6~0 := 1; {712#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:04,160 INFO L280 TraceCheckUtils]: 13: Hoare triple {712#(not (= 0 main_~p1~0))} assume 0 != ~p7~0;~lk7~0 := 1; {712#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:04,160 INFO L280 TraceCheckUtils]: 14: Hoare triple {712#(not (= 0 main_~p1~0))} assume !(0 != ~p8~0); {712#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:04,161 INFO L280 TraceCheckUtils]: 15: Hoare triple {712#(not (= 0 main_~p1~0))} assume 0 != ~p9~0;~lk9~0 := 1; {712#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:04,162 INFO L280 TraceCheckUtils]: 16: Hoare triple {712#(not (= 0 main_~p1~0))} assume 0 != ~p10~0;~lk10~0 := 1; {712#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:04,163 INFO L280 TraceCheckUtils]: 17: Hoare triple {712#(not (= 0 main_~p1~0))} assume !(0 != ~p1~0); {709#false} is VALID [2020-07-17 22:26:04,164 INFO L280 TraceCheckUtils]: 18: Hoare triple {709#false} assume 0 != ~p2~0; {709#false} is VALID [2020-07-17 22:26:04,164 INFO L280 TraceCheckUtils]: 19: Hoare triple {709#false} assume 1 != ~lk2~0; {709#false} is VALID [2020-07-17 22:26:04,164 INFO L280 TraceCheckUtils]: 20: Hoare triple {709#false} assume !false; {709#false} is VALID [2020-07-17 22:26:04,166 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-17 22:26:04,167 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362948187] [2020-07-17 22:26:04,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:04,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:04,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969472844] [2020-07-17 22:26:04,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-17 22:26:04,169 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:04,169 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:04,199 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:04,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:04,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:04,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:04,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:04,201 INFO L87 Difference]: Start difference. First operand 70 states and 125 transitions. Second operand 3 states. [2020-07-17 22:26:04,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:04,409 INFO L93 Difference]: Finished difference Result 108 states and 189 transitions. [2020-07-17 22:26:04,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:04,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-17 22:26:04,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:04,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:04,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2020-07-17 22:26:04,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:04,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2020-07-17 22:26:04,420 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 186 transitions. [2020-07-17 22:26:04,626 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:04,629 INFO L225 Difference]: With dead ends: 108 [2020-07-17 22:26:04,629 INFO L226 Difference]: Without dead ends: 75 [2020-07-17 22:26:04,630 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-17 22:26:04,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-07-17 22:26:04,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2020-07-17 22:26:04,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:04,652 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 73 states. [2020-07-17 22:26:04,652 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 73 states. [2020-07-17 22:26:04,653 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 73 states. [2020-07-17 22:26:04,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:04,657 INFO L93 Difference]: Finished difference Result 75 states and 128 transitions. [2020-07-17 22:26:04,657 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 128 transitions. [2020-07-17 22:26:04,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:04,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:04,658 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 75 states. [2020-07-17 22:26:04,658 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 75 states. [2020-07-17 22:26:04,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:04,663 INFO L93 Difference]: Finished difference Result 75 states and 128 transitions. [2020-07-17 22:26:04,664 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 128 transitions. [2020-07-17 22:26:04,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:04,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:04,665 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:04,665 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:04,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-07-17 22:26:04,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 127 transitions. [2020-07-17 22:26:04,670 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 127 transitions. Word has length 21 [2020-07-17 22:26:04,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:04,670 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 127 transitions. [2020-07-17 22:26:04,670 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:04,670 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 127 transitions. [2020-07-17 22:26:04,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-17 22:26:04,671 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:04,672 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] [2020-07-17 22:26:04,672 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 22:26:04,672 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:04,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:04,673 INFO L82 PathProgramCache]: Analyzing trace with hash 616108559, now seen corresponding path program 1 times [2020-07-17 22:26:04,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:04,674 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569010159] [2020-07-17 22:26:04,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:04,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:04,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:04,729 INFO L280 TraceCheckUtils]: 0: Hoare triple {1065#true} assume true; {1065#true} is VALID [2020-07-17 22:26:04,730 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1065#true} {1065#true} #197#return; {1065#true} is VALID [2020-07-17 22:26:04,730 INFO L263 TraceCheckUtils]: 0: Hoare triple {1065#true} call ULTIMATE.init(); {1065#true} is VALID [2020-07-17 22:26:04,731 INFO L280 TraceCheckUtils]: 1: Hoare triple {1065#true} assume true; {1065#true} is VALID [2020-07-17 22:26:04,731 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1065#true} {1065#true} #197#return; {1065#true} is VALID [2020-07-17 22:26:04,731 INFO L263 TraceCheckUtils]: 3: Hoare triple {1065#true} call #t~ret11 := main(); {1065#true} is VALID [2020-07-17 22:26:04,732 INFO L280 TraceCheckUtils]: 4: Hoare triple {1065#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {1065#true} is VALID [2020-07-17 22:26:04,732 INFO L280 TraceCheckUtils]: 5: Hoare triple {1065#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {1065#true} is VALID [2020-07-17 22:26:04,732 INFO L280 TraceCheckUtils]: 6: Hoare triple {1065#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {1065#true} is VALID [2020-07-17 22:26:04,733 INFO L280 TraceCheckUtils]: 7: Hoare triple {1065#true} assume !(0 != ~p1~0); {1065#true} is VALID [2020-07-17 22:26:04,734 INFO L280 TraceCheckUtils]: 8: Hoare triple {1065#true} assume 0 != ~p2~0;~lk2~0 := 1; {1069#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:04,735 INFO L280 TraceCheckUtils]: 9: Hoare triple {1069#(= 1 main_~lk2~0)} assume 0 != ~p3~0;~lk3~0 := 1; {1069#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:04,736 INFO L280 TraceCheckUtils]: 10: Hoare triple {1069#(= 1 main_~lk2~0)} assume 0 != ~p4~0;~lk4~0 := 1; {1069#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:04,736 INFO L280 TraceCheckUtils]: 11: Hoare triple {1069#(= 1 main_~lk2~0)} assume 0 != ~p5~0;~lk5~0 := 1; {1069#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:04,737 INFO L280 TraceCheckUtils]: 12: Hoare triple {1069#(= 1 main_~lk2~0)} assume 0 != ~p6~0;~lk6~0 := 1; {1069#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:04,738 INFO L280 TraceCheckUtils]: 13: Hoare triple {1069#(= 1 main_~lk2~0)} assume 0 != ~p7~0;~lk7~0 := 1; {1069#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:04,739 INFO L280 TraceCheckUtils]: 14: Hoare triple {1069#(= 1 main_~lk2~0)} assume !(0 != ~p8~0); {1069#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:04,740 INFO L280 TraceCheckUtils]: 15: Hoare triple {1069#(= 1 main_~lk2~0)} assume 0 != ~p9~0;~lk9~0 := 1; {1069#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:04,740 INFO L280 TraceCheckUtils]: 16: Hoare triple {1069#(= 1 main_~lk2~0)} assume 0 != ~p10~0;~lk10~0 := 1; {1069#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:04,741 INFO L280 TraceCheckUtils]: 17: Hoare triple {1069#(= 1 main_~lk2~0)} assume !(0 != ~p1~0); {1069#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:04,742 INFO L280 TraceCheckUtils]: 18: Hoare triple {1069#(= 1 main_~lk2~0)} assume 0 != ~p2~0; {1069#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:04,743 INFO L280 TraceCheckUtils]: 19: Hoare triple {1069#(= 1 main_~lk2~0)} assume 1 != ~lk2~0; {1066#false} is VALID [2020-07-17 22:26:04,743 INFO L280 TraceCheckUtils]: 20: Hoare triple {1066#false} assume !false; {1066#false} is VALID [2020-07-17 22:26:04,744 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-17 22:26:04,744 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569010159] [2020-07-17 22:26:04,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:04,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:04,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574964353] [2020-07-17 22:26:04,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-17 22:26:04,746 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:04,746 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:04,772 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:04,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:04,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:04,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:04,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:04,774 INFO L87 Difference]: Start difference. First operand 73 states and 127 transitions. Second operand 3 states. [2020-07-17 22:26:04,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:04,919 INFO L93 Difference]: Finished difference Result 136 states and 240 transitions. [2020-07-17 22:26:04,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:04,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-17 22:26:04,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:04,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:04,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2020-07-17 22:26:04,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:04,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2020-07-17 22:26:04,928 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 126 transitions. [2020-07-17 22:26:05,087 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:05,094 INFO L225 Difference]: With dead ends: 136 [2020-07-17 22:26:05,094 INFO L226 Difference]: Without dead ends: 134 [2020-07-17 22:26:05,095 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-17 22:26:05,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-07-17 22:26:05,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 96. [2020-07-17 22:26:05,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:05,121 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand 96 states. [2020-07-17 22:26:05,121 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 96 states. [2020-07-17 22:26:05,121 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 96 states. [2020-07-17 22:26:05,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:05,131 INFO L93 Difference]: Finished difference Result 134 states and 237 transitions. [2020-07-17 22:26:05,131 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 237 transitions. [2020-07-17 22:26:05,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:05,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:05,132 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 134 states. [2020-07-17 22:26:05,132 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 134 states. [2020-07-17 22:26:05,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:05,140 INFO L93 Difference]: Finished difference Result 134 states and 237 transitions. [2020-07-17 22:26:05,140 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 237 transitions. [2020-07-17 22:26:05,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:05,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:05,141 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:05,141 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:05,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-07-17 22:26:05,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 168 transitions. [2020-07-17 22:26:05,146 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 168 transitions. Word has length 21 [2020-07-17 22:26:05,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:05,147 INFO L479 AbstractCegarLoop]: Abstraction has 96 states and 168 transitions. [2020-07-17 22:26:05,147 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:05,147 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 168 transitions. [2020-07-17 22:26:05,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-17 22:26:05,148 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:05,148 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] [2020-07-17 22:26:05,148 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-17 22:26:05,149 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:05,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:05,151 INFO L82 PathProgramCache]: Analyzing trace with hash 29302545, now seen corresponding path program 1 times [2020-07-17 22:26:05,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:05,151 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179293491] [2020-07-17 22:26:05,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:05,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:05,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:05,249 INFO L280 TraceCheckUtils]: 0: Hoare triple {1592#true} assume true; {1592#true} is VALID [2020-07-17 22:26:05,250 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1592#true} {1592#true} #197#return; {1592#true} is VALID [2020-07-17 22:26:05,250 INFO L263 TraceCheckUtils]: 0: Hoare triple {1592#true} call ULTIMATE.init(); {1592#true} is VALID [2020-07-17 22:26:05,250 INFO L280 TraceCheckUtils]: 1: Hoare triple {1592#true} assume true; {1592#true} is VALID [2020-07-17 22:26:05,251 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1592#true} {1592#true} #197#return; {1592#true} is VALID [2020-07-17 22:26:05,251 INFO L263 TraceCheckUtils]: 3: Hoare triple {1592#true} call #t~ret11 := main(); {1592#true} is VALID [2020-07-17 22:26:05,251 INFO L280 TraceCheckUtils]: 4: Hoare triple {1592#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {1592#true} is VALID [2020-07-17 22:26:05,252 INFO L280 TraceCheckUtils]: 5: Hoare triple {1592#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {1592#true} is VALID [2020-07-17 22:26:05,252 INFO L280 TraceCheckUtils]: 6: Hoare triple {1592#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {1592#true} is VALID [2020-07-17 22:26:05,252 INFO L280 TraceCheckUtils]: 7: Hoare triple {1592#true} assume !(0 != ~p1~0); {1592#true} is VALID [2020-07-17 22:26:05,253 INFO L280 TraceCheckUtils]: 8: Hoare triple {1592#true} assume !(0 != ~p2~0); {1596#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:05,254 INFO L280 TraceCheckUtils]: 9: Hoare triple {1596#(= 0 main_~p2~0)} assume 0 != ~p3~0;~lk3~0 := 1; {1596#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:05,254 INFO L280 TraceCheckUtils]: 10: Hoare triple {1596#(= 0 main_~p2~0)} assume 0 != ~p4~0;~lk4~0 := 1; {1596#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:05,255 INFO L280 TraceCheckUtils]: 11: Hoare triple {1596#(= 0 main_~p2~0)} assume 0 != ~p5~0;~lk5~0 := 1; {1596#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:05,256 INFO L280 TraceCheckUtils]: 12: Hoare triple {1596#(= 0 main_~p2~0)} assume 0 != ~p6~0;~lk6~0 := 1; {1596#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:05,256 INFO L280 TraceCheckUtils]: 13: Hoare triple {1596#(= 0 main_~p2~0)} assume 0 != ~p7~0;~lk7~0 := 1; {1596#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:05,257 INFO L280 TraceCheckUtils]: 14: Hoare triple {1596#(= 0 main_~p2~0)} assume !(0 != ~p8~0); {1596#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:05,258 INFO L280 TraceCheckUtils]: 15: Hoare triple {1596#(= 0 main_~p2~0)} assume 0 != ~p9~0;~lk9~0 := 1; {1596#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:05,258 INFO L280 TraceCheckUtils]: 16: Hoare triple {1596#(= 0 main_~p2~0)} assume 0 != ~p10~0;~lk10~0 := 1; {1596#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:05,259 INFO L280 TraceCheckUtils]: 17: Hoare triple {1596#(= 0 main_~p2~0)} assume !(0 != ~p1~0); {1596#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:05,260 INFO L280 TraceCheckUtils]: 18: Hoare triple {1596#(= 0 main_~p2~0)} assume 0 != ~p2~0; {1593#false} is VALID [2020-07-17 22:26:05,260 INFO L280 TraceCheckUtils]: 19: Hoare triple {1593#false} assume 1 != ~lk2~0; {1593#false} is VALID [2020-07-17 22:26:05,260 INFO L280 TraceCheckUtils]: 20: Hoare triple {1593#false} assume !false; {1593#false} is VALID [2020-07-17 22:26:05,261 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-17 22:26:05,262 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179293491] [2020-07-17 22:26:05,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:05,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:05,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854204831] [2020-07-17 22:26:05,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-17 22:26:05,263 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:05,263 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:05,288 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:05,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:05,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:05,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:05,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:05,289 INFO L87 Difference]: Start difference. First operand 96 states and 168 transitions. Second operand 3 states. [2020-07-17 22:26:05,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:05,460 INFO L93 Difference]: Finished difference Result 224 states and 398 transitions. [2020-07-17 22:26:05,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:05,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-17 22:26:05,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:05,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:05,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 188 transitions. [2020-07-17 22:26:05,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:05,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 188 transitions. [2020-07-17 22:26:05,468 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 188 transitions. [2020-07-17 22:26:05,679 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:05,684 INFO L225 Difference]: With dead ends: 224 [2020-07-17 22:26:05,685 INFO L226 Difference]: Without dead ends: 136 [2020-07-17 22:26:05,686 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-17 22:26:05,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-07-17 22:26:05,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2020-07-17 22:26:05,727 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:05,727 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand 134 states. [2020-07-17 22:26:05,728 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 134 states. [2020-07-17 22:26:05,728 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 134 states. [2020-07-17 22:26:05,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:05,734 INFO L93 Difference]: Finished difference Result 136 states and 235 transitions. [2020-07-17 22:26:05,735 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 235 transitions. [2020-07-17 22:26:05,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:05,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:05,735 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 136 states. [2020-07-17 22:26:05,736 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 136 states. [2020-07-17 22:26:05,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:05,742 INFO L93 Difference]: Finished difference Result 136 states and 235 transitions. [2020-07-17 22:26:05,742 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 235 transitions. [2020-07-17 22:26:05,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:05,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:05,743 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:05,743 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:05,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-07-17 22:26:05,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 234 transitions. [2020-07-17 22:26:05,750 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 234 transitions. Word has length 21 [2020-07-17 22:26:05,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:05,751 INFO L479 AbstractCegarLoop]: Abstraction has 134 states and 234 transitions. [2020-07-17 22:26:05,751 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:05,751 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 234 transitions. [2020-07-17 22:26:05,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-17 22:26:05,752 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:05,752 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] [2020-07-17 22:26:05,752 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-17 22:26:05,752 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:05,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:05,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1919709866, now seen corresponding path program 1 times [2020-07-17 22:26:05,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:05,756 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491137936] [2020-07-17 22:26:05,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:05,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:05,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:05,838 INFO L280 TraceCheckUtils]: 0: Hoare triple {2253#true} assume true; {2253#true} is VALID [2020-07-17 22:26:05,839 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2253#true} {2253#true} #197#return; {2253#true} is VALID [2020-07-17 22:26:05,839 INFO L263 TraceCheckUtils]: 0: Hoare triple {2253#true} call ULTIMATE.init(); {2253#true} is VALID [2020-07-17 22:26:05,839 INFO L280 TraceCheckUtils]: 1: Hoare triple {2253#true} assume true; {2253#true} is VALID [2020-07-17 22:26:05,839 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2253#true} {2253#true} #197#return; {2253#true} is VALID [2020-07-17 22:26:05,839 INFO L263 TraceCheckUtils]: 3: Hoare triple {2253#true} call #t~ret11 := main(); {2253#true} is VALID [2020-07-17 22:26:05,840 INFO L280 TraceCheckUtils]: 4: Hoare triple {2253#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {2253#true} is VALID [2020-07-17 22:26:05,840 INFO L280 TraceCheckUtils]: 5: Hoare triple {2253#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {2253#true} is VALID [2020-07-17 22:26:05,840 INFO L280 TraceCheckUtils]: 6: Hoare triple {2253#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {2253#true} is VALID [2020-07-17 22:26:05,840 INFO L280 TraceCheckUtils]: 7: Hoare triple {2253#true} assume !(0 != ~p1~0); {2253#true} is VALID [2020-07-17 22:26:05,842 INFO L280 TraceCheckUtils]: 8: Hoare triple {2253#true} assume 0 != ~p2~0;~lk2~0 := 1; {2257#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:05,842 INFO L280 TraceCheckUtils]: 9: Hoare triple {2257#(not (= 0 main_~p2~0))} assume 0 != ~p3~0;~lk3~0 := 1; {2257#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:05,843 INFO L280 TraceCheckUtils]: 10: Hoare triple {2257#(not (= 0 main_~p2~0))} assume 0 != ~p4~0;~lk4~0 := 1; {2257#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:05,844 INFO L280 TraceCheckUtils]: 11: Hoare triple {2257#(not (= 0 main_~p2~0))} assume 0 != ~p5~0;~lk5~0 := 1; {2257#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:05,844 INFO L280 TraceCheckUtils]: 12: Hoare triple {2257#(not (= 0 main_~p2~0))} assume 0 != ~p6~0;~lk6~0 := 1; {2257#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:05,845 INFO L280 TraceCheckUtils]: 13: Hoare triple {2257#(not (= 0 main_~p2~0))} assume 0 != ~p7~0;~lk7~0 := 1; {2257#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:05,845 INFO L280 TraceCheckUtils]: 14: Hoare triple {2257#(not (= 0 main_~p2~0))} assume !(0 != ~p8~0); {2257#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:05,846 INFO L280 TraceCheckUtils]: 15: Hoare triple {2257#(not (= 0 main_~p2~0))} assume 0 != ~p9~0;~lk9~0 := 1; {2257#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:05,847 INFO L280 TraceCheckUtils]: 16: Hoare triple {2257#(not (= 0 main_~p2~0))} assume 0 != ~p10~0;~lk10~0 := 1; {2257#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:05,847 INFO L280 TraceCheckUtils]: 17: Hoare triple {2257#(not (= 0 main_~p2~0))} assume !(0 != ~p1~0); {2257#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:05,848 INFO L280 TraceCheckUtils]: 18: Hoare triple {2257#(not (= 0 main_~p2~0))} assume !(0 != ~p2~0); {2254#false} is VALID [2020-07-17 22:26:05,849 INFO L280 TraceCheckUtils]: 19: Hoare triple {2254#false} assume 0 != ~p3~0; {2254#false} is VALID [2020-07-17 22:26:05,849 INFO L280 TraceCheckUtils]: 20: Hoare triple {2254#false} assume 1 != ~lk3~0; {2254#false} is VALID [2020-07-17 22:26:05,849 INFO L280 TraceCheckUtils]: 21: Hoare triple {2254#false} assume !false; {2254#false} is VALID [2020-07-17 22:26:05,850 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-17 22:26:05,851 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491137936] [2020-07-17 22:26:05,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:05,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:05,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710378992] [2020-07-17 22:26:05,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-17 22:26:05,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:05,853 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:05,879 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:05,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:05,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:05,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:05,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:05,881 INFO L87 Difference]: Start difference. First operand 134 states and 234 transitions. Second operand 3 states. [2020-07-17 22:26:06,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:06,044 INFO L93 Difference]: Finished difference Result 201 states and 349 transitions. [2020-07-17 22:26:06,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:06,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-17 22:26:06,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:06,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:06,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 183 transitions. [2020-07-17 22:26:06,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:06,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 183 transitions. [2020-07-17 22:26:06,052 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 183 transitions. [2020-07-17 22:26:06,262 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:06,266 INFO L225 Difference]: With dead ends: 201 [2020-07-17 22:26:06,266 INFO L226 Difference]: Without dead ends: 138 [2020-07-17 22:26:06,268 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-17 22:26:06,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-07-17 22:26:06,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2020-07-17 22:26:06,292 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:06,292 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand 136 states. [2020-07-17 22:26:06,293 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 136 states. [2020-07-17 22:26:06,293 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 136 states. [2020-07-17 22:26:06,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:06,298 INFO L93 Difference]: Finished difference Result 138 states and 235 transitions. [2020-07-17 22:26:06,299 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 235 transitions. [2020-07-17 22:26:06,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:06,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:06,301 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 138 states. [2020-07-17 22:26:06,301 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 138 states. [2020-07-17 22:26:06,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:06,307 INFO L93 Difference]: Finished difference Result 138 states and 235 transitions. [2020-07-17 22:26:06,307 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 235 transitions. [2020-07-17 22:26:06,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:06,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:06,308 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:06,308 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:06,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2020-07-17 22:26:06,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 234 transitions. [2020-07-17 22:26:06,314 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 234 transitions. Word has length 22 [2020-07-17 22:26:06,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:06,314 INFO L479 AbstractCegarLoop]: Abstraction has 136 states and 234 transitions. [2020-07-17 22:26:06,314 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:06,314 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 234 transitions. [2020-07-17 22:26:06,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-17 22:26:06,315 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:06,315 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] [2020-07-17 22:26:06,316 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-17 22:26:06,316 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:06,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:06,316 INFO L82 PathProgramCache]: Analyzing trace with hash 908592616, now seen corresponding path program 1 times [2020-07-17 22:26:06,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:06,317 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543221900] [2020-07-17 22:26:06,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:06,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:06,386 INFO L280 TraceCheckUtils]: 0: Hoare triple {2897#true} assume true; {2897#true} is VALID [2020-07-17 22:26:06,386 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2897#true} {2897#true} #197#return; {2897#true} is VALID [2020-07-17 22:26:06,386 INFO L263 TraceCheckUtils]: 0: Hoare triple {2897#true} call ULTIMATE.init(); {2897#true} is VALID [2020-07-17 22:26:06,387 INFO L280 TraceCheckUtils]: 1: Hoare triple {2897#true} assume true; {2897#true} is VALID [2020-07-17 22:26:06,387 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2897#true} {2897#true} #197#return; {2897#true} is VALID [2020-07-17 22:26:06,387 INFO L263 TraceCheckUtils]: 3: Hoare triple {2897#true} call #t~ret11 := main(); {2897#true} is VALID [2020-07-17 22:26:06,387 INFO L280 TraceCheckUtils]: 4: Hoare triple {2897#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {2897#true} is VALID [2020-07-17 22:26:06,387 INFO L280 TraceCheckUtils]: 5: Hoare triple {2897#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {2897#true} is VALID [2020-07-17 22:26:06,387 INFO L280 TraceCheckUtils]: 6: Hoare triple {2897#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {2897#true} is VALID [2020-07-17 22:26:06,388 INFO L280 TraceCheckUtils]: 7: Hoare triple {2897#true} assume !(0 != ~p1~0); {2897#true} is VALID [2020-07-17 22:26:06,388 INFO L280 TraceCheckUtils]: 8: Hoare triple {2897#true} assume !(0 != ~p2~0); {2897#true} is VALID [2020-07-17 22:26:06,388 INFO L280 TraceCheckUtils]: 9: Hoare triple {2897#true} assume 0 != ~p3~0;~lk3~0 := 1; {2901#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:06,392 INFO L280 TraceCheckUtils]: 10: Hoare triple {2901#(= 1 main_~lk3~0)} assume 0 != ~p4~0;~lk4~0 := 1; {2901#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:06,393 INFO L280 TraceCheckUtils]: 11: Hoare triple {2901#(= 1 main_~lk3~0)} assume 0 != ~p5~0;~lk5~0 := 1; {2901#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:06,393 INFO L280 TraceCheckUtils]: 12: Hoare triple {2901#(= 1 main_~lk3~0)} assume 0 != ~p6~0;~lk6~0 := 1; {2901#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:06,394 INFO L280 TraceCheckUtils]: 13: Hoare triple {2901#(= 1 main_~lk3~0)} assume 0 != ~p7~0;~lk7~0 := 1; {2901#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:06,394 INFO L280 TraceCheckUtils]: 14: Hoare triple {2901#(= 1 main_~lk3~0)} assume !(0 != ~p8~0); {2901#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:06,395 INFO L280 TraceCheckUtils]: 15: Hoare triple {2901#(= 1 main_~lk3~0)} assume 0 != ~p9~0;~lk9~0 := 1; {2901#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:06,395 INFO L280 TraceCheckUtils]: 16: Hoare triple {2901#(= 1 main_~lk3~0)} assume 0 != ~p10~0;~lk10~0 := 1; {2901#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:06,395 INFO L280 TraceCheckUtils]: 17: Hoare triple {2901#(= 1 main_~lk3~0)} assume !(0 != ~p1~0); {2901#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:06,396 INFO L280 TraceCheckUtils]: 18: Hoare triple {2901#(= 1 main_~lk3~0)} assume !(0 != ~p2~0); {2901#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:06,396 INFO L280 TraceCheckUtils]: 19: Hoare triple {2901#(= 1 main_~lk3~0)} assume 0 != ~p3~0; {2901#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:06,397 INFO L280 TraceCheckUtils]: 20: Hoare triple {2901#(= 1 main_~lk3~0)} assume 1 != ~lk3~0; {2898#false} is VALID [2020-07-17 22:26:06,397 INFO L280 TraceCheckUtils]: 21: Hoare triple {2898#false} assume !false; {2898#false} is VALID [2020-07-17 22:26:06,398 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-17 22:26:06,398 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543221900] [2020-07-17 22:26:06,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:06,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:06,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95209991] [2020-07-17 22:26:06,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-17 22:26:06,400 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:06,400 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:06,432 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:06,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:06,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:06,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:06,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:06,434 INFO L87 Difference]: Start difference. First operand 136 states and 234 transitions. Second operand 3 states. [2020-07-17 22:26:06,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:06,588 INFO L93 Difference]: Finished difference Result 252 states and 440 transitions. [2020-07-17 22:26:06,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:06,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-17 22:26:06,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:06,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:06,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2020-07-17 22:26:06,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:06,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2020-07-17 22:26:06,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 122 transitions. [2020-07-17 22:26:06,721 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:06,728 INFO L225 Difference]: With dead ends: 252 [2020-07-17 22:26:06,729 INFO L226 Difference]: Without dead ends: 250 [2020-07-17 22:26:06,730 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-17 22:26:06,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2020-07-17 22:26:06,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 184. [2020-07-17 22:26:06,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:06,756 INFO L82 GeneralOperation]: Start isEquivalent. First operand 250 states. Second operand 184 states. [2020-07-17 22:26:06,756 INFO L74 IsIncluded]: Start isIncluded. First operand 250 states. Second operand 184 states. [2020-07-17 22:26:06,756 INFO L87 Difference]: Start difference. First operand 250 states. Second operand 184 states. [2020-07-17 22:26:06,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:06,768 INFO L93 Difference]: Finished difference Result 250 states and 435 transitions. [2020-07-17 22:26:06,768 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 435 transitions. [2020-07-17 22:26:06,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:06,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:06,769 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand 250 states. [2020-07-17 22:26:06,769 INFO L87 Difference]: Start difference. First operand 184 states. Second operand 250 states. [2020-07-17 22:26:06,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:06,779 INFO L93 Difference]: Finished difference Result 250 states and 435 transitions. [2020-07-17 22:26:06,780 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 435 transitions. [2020-07-17 22:26:06,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:06,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:06,781 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:06,781 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:06,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-07-17 22:26:06,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 314 transitions. [2020-07-17 22:26:06,787 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 314 transitions. Word has length 22 [2020-07-17 22:26:06,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:06,788 INFO L479 AbstractCegarLoop]: Abstraction has 184 states and 314 transitions. [2020-07-17 22:26:06,788 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:06,788 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 314 transitions. [2020-07-17 22:26:06,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-17 22:26:06,789 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:06,789 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] [2020-07-17 22:26:06,790 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-17 22:26:06,790 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:06,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:06,790 INFO L82 PathProgramCache]: Analyzing trace with hash 321786602, now seen corresponding path program 1 times [2020-07-17 22:26:06,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:06,791 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562756840] [2020-07-17 22:26:06,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:06,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:06,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:06,834 INFO L280 TraceCheckUtils]: 0: Hoare triple {3866#true} assume true; {3866#true} is VALID [2020-07-17 22:26:06,835 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3866#true} {3866#true} #197#return; {3866#true} is VALID [2020-07-17 22:26:06,835 INFO L263 TraceCheckUtils]: 0: Hoare triple {3866#true} call ULTIMATE.init(); {3866#true} is VALID [2020-07-17 22:26:06,835 INFO L280 TraceCheckUtils]: 1: Hoare triple {3866#true} assume true; {3866#true} is VALID [2020-07-17 22:26:06,835 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3866#true} {3866#true} #197#return; {3866#true} is VALID [2020-07-17 22:26:06,836 INFO L263 TraceCheckUtils]: 3: Hoare triple {3866#true} call #t~ret11 := main(); {3866#true} is VALID [2020-07-17 22:26:06,836 INFO L280 TraceCheckUtils]: 4: Hoare triple {3866#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {3866#true} is VALID [2020-07-17 22:26:06,836 INFO L280 TraceCheckUtils]: 5: Hoare triple {3866#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {3866#true} is VALID [2020-07-17 22:26:06,836 INFO L280 TraceCheckUtils]: 6: Hoare triple {3866#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {3866#true} is VALID [2020-07-17 22:26:06,837 INFO L280 TraceCheckUtils]: 7: Hoare triple {3866#true} assume !(0 != ~p1~0); {3866#true} is VALID [2020-07-17 22:26:06,837 INFO L280 TraceCheckUtils]: 8: Hoare triple {3866#true} assume !(0 != ~p2~0); {3866#true} is VALID [2020-07-17 22:26:06,838 INFO L280 TraceCheckUtils]: 9: Hoare triple {3866#true} assume !(0 != ~p3~0); {3870#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:06,838 INFO L280 TraceCheckUtils]: 10: Hoare triple {3870#(= 0 main_~p3~0)} assume 0 != ~p4~0;~lk4~0 := 1; {3870#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:06,839 INFO L280 TraceCheckUtils]: 11: Hoare triple {3870#(= 0 main_~p3~0)} assume 0 != ~p5~0;~lk5~0 := 1; {3870#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:06,839 INFO L280 TraceCheckUtils]: 12: Hoare triple {3870#(= 0 main_~p3~0)} assume 0 != ~p6~0;~lk6~0 := 1; {3870#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:06,839 INFO L280 TraceCheckUtils]: 13: Hoare triple {3870#(= 0 main_~p3~0)} assume 0 != ~p7~0;~lk7~0 := 1; {3870#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:06,840 INFO L280 TraceCheckUtils]: 14: Hoare triple {3870#(= 0 main_~p3~0)} assume !(0 != ~p8~0); {3870#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:06,840 INFO L280 TraceCheckUtils]: 15: Hoare triple {3870#(= 0 main_~p3~0)} assume 0 != ~p9~0;~lk9~0 := 1; {3870#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:06,841 INFO L280 TraceCheckUtils]: 16: Hoare triple {3870#(= 0 main_~p3~0)} assume 0 != ~p10~0;~lk10~0 := 1; {3870#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:06,841 INFO L280 TraceCheckUtils]: 17: Hoare triple {3870#(= 0 main_~p3~0)} assume !(0 != ~p1~0); {3870#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:06,842 INFO L280 TraceCheckUtils]: 18: Hoare triple {3870#(= 0 main_~p3~0)} assume !(0 != ~p2~0); {3870#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:06,842 INFO L280 TraceCheckUtils]: 19: Hoare triple {3870#(= 0 main_~p3~0)} assume 0 != ~p3~0; {3867#false} is VALID [2020-07-17 22:26:06,842 INFO L280 TraceCheckUtils]: 20: Hoare triple {3867#false} assume 1 != ~lk3~0; {3867#false} is VALID [2020-07-17 22:26:06,843 INFO L280 TraceCheckUtils]: 21: Hoare triple {3867#false} assume !false; {3867#false} is VALID [2020-07-17 22:26:06,843 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-17 22:26:06,844 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562756840] [2020-07-17 22:26:06,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:06,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:06,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389550807] [2020-07-17 22:26:06,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-17 22:26:06,845 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:06,846 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:06,872 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:06,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:06,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:06,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:06,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:06,874 INFO L87 Difference]: Start difference. First operand 184 states and 314 transitions. Second operand 3 states. [2020-07-17 22:26:07,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:07,064 INFO L93 Difference]: Finished difference Result 432 states and 744 transitions. [2020-07-17 22:26:07,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:07,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-17 22:26:07,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:07,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:07,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 185 transitions. [2020-07-17 22:26:07,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:07,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 185 transitions. [2020-07-17 22:26:07,072 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 185 transitions. [2020-07-17 22:26:07,272 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 185 edges. 185 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:07,280 INFO L225 Difference]: With dead ends: 432 [2020-07-17 22:26:07,280 INFO L226 Difference]: Without dead ends: 258 [2020-07-17 22:26:07,282 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-17 22:26:07,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2020-07-17 22:26:07,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2020-07-17 22:26:07,345 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:07,345 INFO L82 GeneralOperation]: Start isEquivalent. First operand 258 states. Second operand 256 states. [2020-07-17 22:26:07,345 INFO L74 IsIncluded]: Start isIncluded. First operand 258 states. Second operand 256 states. [2020-07-17 22:26:07,345 INFO L87 Difference]: Start difference. First operand 258 states. Second operand 256 states. [2020-07-17 22:26:07,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:07,356 INFO L93 Difference]: Finished difference Result 258 states and 435 transitions. [2020-07-17 22:26:07,356 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 435 transitions. [2020-07-17 22:26:07,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:07,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:07,358 INFO L74 IsIncluded]: Start isIncluded. First operand 256 states. Second operand 258 states. [2020-07-17 22:26:07,358 INFO L87 Difference]: Start difference. First operand 256 states. Second operand 258 states. [2020-07-17 22:26:07,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:07,369 INFO L93 Difference]: Finished difference Result 258 states and 435 transitions. [2020-07-17 22:26:07,370 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 435 transitions. [2020-07-17 22:26:07,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:07,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:07,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:07,372 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:07,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2020-07-17 22:26:07,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 434 transitions. [2020-07-17 22:26:07,382 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 434 transitions. Word has length 22 [2020-07-17 22:26:07,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:07,395 INFO L479 AbstractCegarLoop]: Abstraction has 256 states and 434 transitions. [2020-07-17 22:26:07,395 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:07,395 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 434 transitions. [2020-07-17 22:26:07,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-17 22:26:07,396 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:07,396 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] [2020-07-17 22:26:07,397 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-17 22:26:07,397 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:07,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:07,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1898185914, now seen corresponding path program 1 times [2020-07-17 22:26:07,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:07,398 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587475169] [2020-07-17 22:26:07,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:07,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:07,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:07,440 INFO L280 TraceCheckUtils]: 0: Hoare triple {5111#true} assume true; {5111#true} is VALID [2020-07-17 22:26:07,440 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {5111#true} {5111#true} #197#return; {5111#true} is VALID [2020-07-17 22:26:07,441 INFO L263 TraceCheckUtils]: 0: Hoare triple {5111#true} call ULTIMATE.init(); {5111#true} is VALID [2020-07-17 22:26:07,441 INFO L280 TraceCheckUtils]: 1: Hoare triple {5111#true} assume true; {5111#true} is VALID [2020-07-17 22:26:07,441 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5111#true} {5111#true} #197#return; {5111#true} is VALID [2020-07-17 22:26:07,442 INFO L263 TraceCheckUtils]: 3: Hoare triple {5111#true} call #t~ret11 := main(); {5111#true} is VALID [2020-07-17 22:26:07,442 INFO L280 TraceCheckUtils]: 4: Hoare triple {5111#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {5111#true} is VALID [2020-07-17 22:26:07,442 INFO L280 TraceCheckUtils]: 5: Hoare triple {5111#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {5111#true} is VALID [2020-07-17 22:26:07,443 INFO L280 TraceCheckUtils]: 6: Hoare triple {5111#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {5111#true} is VALID [2020-07-17 22:26:07,443 INFO L280 TraceCheckUtils]: 7: Hoare triple {5111#true} assume !(0 != ~p1~0); {5111#true} is VALID [2020-07-17 22:26:07,443 INFO L280 TraceCheckUtils]: 8: Hoare triple {5111#true} assume !(0 != ~p2~0); {5111#true} is VALID [2020-07-17 22:26:07,444 INFO L280 TraceCheckUtils]: 9: Hoare triple {5111#true} assume 0 != ~p3~0;~lk3~0 := 1; {5115#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:07,445 INFO L280 TraceCheckUtils]: 10: Hoare triple {5115#(not (= 0 main_~p3~0))} assume 0 != ~p4~0;~lk4~0 := 1; {5115#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:07,446 INFO L280 TraceCheckUtils]: 11: Hoare triple {5115#(not (= 0 main_~p3~0))} assume 0 != ~p5~0;~lk5~0 := 1; {5115#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:07,446 INFO L280 TraceCheckUtils]: 12: Hoare triple {5115#(not (= 0 main_~p3~0))} assume 0 != ~p6~0;~lk6~0 := 1; {5115#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:07,447 INFO L280 TraceCheckUtils]: 13: Hoare triple {5115#(not (= 0 main_~p3~0))} assume 0 != ~p7~0;~lk7~0 := 1; {5115#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:07,448 INFO L280 TraceCheckUtils]: 14: Hoare triple {5115#(not (= 0 main_~p3~0))} assume !(0 != ~p8~0); {5115#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:07,448 INFO L280 TraceCheckUtils]: 15: Hoare triple {5115#(not (= 0 main_~p3~0))} assume 0 != ~p9~0;~lk9~0 := 1; {5115#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:07,449 INFO L280 TraceCheckUtils]: 16: Hoare triple {5115#(not (= 0 main_~p3~0))} assume 0 != ~p10~0;~lk10~0 := 1; {5115#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:07,450 INFO L280 TraceCheckUtils]: 17: Hoare triple {5115#(not (= 0 main_~p3~0))} assume !(0 != ~p1~0); {5115#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:07,450 INFO L280 TraceCheckUtils]: 18: Hoare triple {5115#(not (= 0 main_~p3~0))} assume !(0 != ~p2~0); {5115#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:07,451 INFO L280 TraceCheckUtils]: 19: Hoare triple {5115#(not (= 0 main_~p3~0))} assume !(0 != ~p3~0); {5112#false} is VALID [2020-07-17 22:26:07,451 INFO L280 TraceCheckUtils]: 20: Hoare triple {5112#false} assume 0 != ~p4~0; {5112#false} is VALID [2020-07-17 22:26:07,452 INFO L280 TraceCheckUtils]: 21: Hoare triple {5112#false} assume 1 != ~lk4~0; {5112#false} is VALID [2020-07-17 22:26:07,452 INFO L280 TraceCheckUtils]: 22: Hoare triple {5112#false} assume !false; {5112#false} is VALID [2020-07-17 22:26:07,453 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-17 22:26:07,453 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587475169] [2020-07-17 22:26:07,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:07,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:07,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70337099] [2020-07-17 22:26:07,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-17 22:26:07,455 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:07,455 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:07,484 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:07,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:07,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:07,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:07,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:07,485 INFO L87 Difference]: Start difference. First operand 256 states and 434 transitions. Second operand 3 states. [2020-07-17 22:26:07,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:07,673 INFO L93 Difference]: Finished difference Result 384 states and 648 transitions. [2020-07-17 22:26:07,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:07,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-17 22:26:07,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:07,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:07,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2020-07-17 22:26:07,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:07,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2020-07-17 22:26:07,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 180 transitions. [2020-07-17 22:26:07,888 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:07,895 INFO L225 Difference]: With dead ends: 384 [2020-07-17 22:26:07,896 INFO L226 Difference]: Without dead ends: 262 [2020-07-17 22:26:07,897 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-17 22:26:07,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2020-07-17 22:26:07,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2020-07-17 22:26:07,936 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:07,936 INFO L82 GeneralOperation]: Start isEquivalent. First operand 262 states. Second operand 260 states. [2020-07-17 22:26:07,937 INFO L74 IsIncluded]: Start isIncluded. First operand 262 states. Second operand 260 states. [2020-07-17 22:26:07,937 INFO L87 Difference]: Start difference. First operand 262 states. Second operand 260 states. [2020-07-17 22:26:07,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:07,949 INFO L93 Difference]: Finished difference Result 262 states and 435 transitions. [2020-07-17 22:26:07,949 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 435 transitions. [2020-07-17 22:26:07,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:07,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:07,951 INFO L74 IsIncluded]: Start isIncluded. First operand 260 states. Second operand 262 states. [2020-07-17 22:26:07,951 INFO L87 Difference]: Start difference. First operand 260 states. Second operand 262 states. [2020-07-17 22:26:07,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:07,963 INFO L93 Difference]: Finished difference Result 262 states and 435 transitions. [2020-07-17 22:26:07,963 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 435 transitions. [2020-07-17 22:26:07,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:07,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:07,964 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:07,965 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:07,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2020-07-17 22:26:07,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 434 transitions. [2020-07-17 22:26:07,977 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 434 transitions. Word has length 23 [2020-07-17 22:26:07,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:07,977 INFO L479 AbstractCegarLoop]: Abstraction has 260 states and 434 transitions. [2020-07-17 22:26:07,978 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:07,978 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 434 transitions. [2020-07-17 22:26:07,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-17 22:26:07,984 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:07,984 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] [2020-07-17 22:26:07,984 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-17 22:26:07,985 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:07,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:07,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1385664132, now seen corresponding path program 1 times [2020-07-17 22:26:07,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:07,986 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322701851] [2020-07-17 22:26:07,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:08,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:08,043 INFO L280 TraceCheckUtils]: 0: Hoare triple {6320#true} assume true; {6320#true} is VALID [2020-07-17 22:26:08,043 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {6320#true} {6320#true} #197#return; {6320#true} is VALID [2020-07-17 22:26:08,043 INFO L263 TraceCheckUtils]: 0: Hoare triple {6320#true} call ULTIMATE.init(); {6320#true} is VALID [2020-07-17 22:26:08,044 INFO L280 TraceCheckUtils]: 1: Hoare triple {6320#true} assume true; {6320#true} is VALID [2020-07-17 22:26:08,044 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {6320#true} {6320#true} #197#return; {6320#true} is VALID [2020-07-17 22:26:08,044 INFO L263 TraceCheckUtils]: 3: Hoare triple {6320#true} call #t~ret11 := main(); {6320#true} is VALID [2020-07-17 22:26:08,044 INFO L280 TraceCheckUtils]: 4: Hoare triple {6320#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {6320#true} is VALID [2020-07-17 22:26:08,045 INFO L280 TraceCheckUtils]: 5: Hoare triple {6320#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {6320#true} is VALID [2020-07-17 22:26:08,045 INFO L280 TraceCheckUtils]: 6: Hoare triple {6320#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {6320#true} is VALID [2020-07-17 22:26:08,045 INFO L280 TraceCheckUtils]: 7: Hoare triple {6320#true} assume !(0 != ~p1~0); {6320#true} is VALID [2020-07-17 22:26:08,045 INFO L280 TraceCheckUtils]: 8: Hoare triple {6320#true} assume !(0 != ~p2~0); {6320#true} is VALID [2020-07-17 22:26:08,045 INFO L280 TraceCheckUtils]: 9: Hoare triple {6320#true} assume !(0 != ~p3~0); {6320#true} is VALID [2020-07-17 22:26:08,048 INFO L280 TraceCheckUtils]: 10: Hoare triple {6320#true} assume 0 != ~p4~0;~lk4~0 := 1; {6324#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:08,049 INFO L280 TraceCheckUtils]: 11: Hoare triple {6324#(= 1 main_~lk4~0)} assume 0 != ~p5~0;~lk5~0 := 1; {6324#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:08,050 INFO L280 TraceCheckUtils]: 12: Hoare triple {6324#(= 1 main_~lk4~0)} assume 0 != ~p6~0;~lk6~0 := 1; {6324#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:08,050 INFO L280 TraceCheckUtils]: 13: Hoare triple {6324#(= 1 main_~lk4~0)} assume 0 != ~p7~0;~lk7~0 := 1; {6324#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:08,051 INFO L280 TraceCheckUtils]: 14: Hoare triple {6324#(= 1 main_~lk4~0)} assume !(0 != ~p8~0); {6324#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:08,052 INFO L280 TraceCheckUtils]: 15: Hoare triple {6324#(= 1 main_~lk4~0)} assume 0 != ~p9~0;~lk9~0 := 1; {6324#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:08,052 INFO L280 TraceCheckUtils]: 16: Hoare triple {6324#(= 1 main_~lk4~0)} assume 0 != ~p10~0;~lk10~0 := 1; {6324#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:08,053 INFO L280 TraceCheckUtils]: 17: Hoare triple {6324#(= 1 main_~lk4~0)} assume !(0 != ~p1~0); {6324#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:08,054 INFO L280 TraceCheckUtils]: 18: Hoare triple {6324#(= 1 main_~lk4~0)} assume !(0 != ~p2~0); {6324#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:08,055 INFO L280 TraceCheckUtils]: 19: Hoare triple {6324#(= 1 main_~lk4~0)} assume !(0 != ~p3~0); {6324#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:08,056 INFO L280 TraceCheckUtils]: 20: Hoare triple {6324#(= 1 main_~lk4~0)} assume 0 != ~p4~0; {6324#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:08,056 INFO L280 TraceCheckUtils]: 21: Hoare triple {6324#(= 1 main_~lk4~0)} assume 1 != ~lk4~0; {6321#false} is VALID [2020-07-17 22:26:08,057 INFO L280 TraceCheckUtils]: 22: Hoare triple {6321#false} assume !false; {6321#false} is VALID [2020-07-17 22:26:08,057 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-17 22:26:08,058 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322701851] [2020-07-17 22:26:08,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:08,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:08,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517764631] [2020-07-17 22:26:08,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-17 22:26:08,061 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:08,061 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:08,088 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:08,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:08,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:08,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:08,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:08,089 INFO L87 Difference]: Start difference. First operand 260 states and 434 transitions. Second operand 3 states. [2020-07-17 22:26:08,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:08,283 INFO L93 Difference]: Finished difference Result 476 states and 808 transitions. [2020-07-17 22:26:08,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:08,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-17 22:26:08,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:08,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:08,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2020-07-17 22:26:08,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:08,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2020-07-17 22:26:08,288 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 118 transitions. [2020-07-17 22:26:08,413 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:08,432 INFO L225 Difference]: With dead ends: 476 [2020-07-17 22:26:08,432 INFO L226 Difference]: Without dead ends: 474 [2020-07-17 22:26:08,433 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-17 22:26:08,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2020-07-17 22:26:08,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 360. [2020-07-17 22:26:08,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:08,479 INFO L82 GeneralOperation]: Start isEquivalent. First operand 474 states. Second operand 360 states. [2020-07-17 22:26:08,479 INFO L74 IsIncluded]: Start isIncluded. First operand 474 states. Second operand 360 states. [2020-07-17 22:26:08,480 INFO L87 Difference]: Start difference. First operand 474 states. Second operand 360 states. [2020-07-17 22:26:08,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:08,504 INFO L93 Difference]: Finished difference Result 474 states and 799 transitions. [2020-07-17 22:26:08,505 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 799 transitions. [2020-07-17 22:26:08,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:08,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:08,507 INFO L74 IsIncluded]: Start isIncluded. First operand 360 states. Second operand 474 states. [2020-07-17 22:26:08,507 INFO L87 Difference]: Start difference. First operand 360 states. Second operand 474 states. [2020-07-17 22:26:08,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:08,549 INFO L93 Difference]: Finished difference Result 474 states and 799 transitions. [2020-07-17 22:26:08,550 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 799 transitions. [2020-07-17 22:26:08,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:08,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:08,553 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:08,553 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:08,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2020-07-17 22:26:08,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 590 transitions. [2020-07-17 22:26:08,571 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 590 transitions. Word has length 23 [2020-07-17 22:26:08,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:08,571 INFO L479 AbstractCegarLoop]: Abstraction has 360 states and 590 transitions. [2020-07-17 22:26:08,571 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:08,571 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 590 transitions. [2020-07-17 22:26:08,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-17 22:26:08,573 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:08,573 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] [2020-07-17 22:26:08,573 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-17 22:26:08,573 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:08,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:08,574 INFO L82 PathProgramCache]: Analyzing trace with hash 798858118, now seen corresponding path program 1 times [2020-07-17 22:26:08,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:08,575 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529111338] [2020-07-17 22:26:08,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:08,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:08,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:08,607 INFO L280 TraceCheckUtils]: 0: Hoare triple {8149#true} assume true; {8149#true} is VALID [2020-07-17 22:26:08,607 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {8149#true} {8149#true} #197#return; {8149#true} is VALID [2020-07-17 22:26:08,608 INFO L263 TraceCheckUtils]: 0: Hoare triple {8149#true} call ULTIMATE.init(); {8149#true} is VALID [2020-07-17 22:26:08,608 INFO L280 TraceCheckUtils]: 1: Hoare triple {8149#true} assume true; {8149#true} is VALID [2020-07-17 22:26:08,608 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {8149#true} {8149#true} #197#return; {8149#true} is VALID [2020-07-17 22:26:08,609 INFO L263 TraceCheckUtils]: 3: Hoare triple {8149#true} call #t~ret11 := main(); {8149#true} is VALID [2020-07-17 22:26:08,609 INFO L280 TraceCheckUtils]: 4: Hoare triple {8149#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {8149#true} is VALID [2020-07-17 22:26:08,609 INFO L280 TraceCheckUtils]: 5: Hoare triple {8149#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {8149#true} is VALID [2020-07-17 22:26:08,609 INFO L280 TraceCheckUtils]: 6: Hoare triple {8149#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {8149#true} is VALID [2020-07-17 22:26:08,610 INFO L280 TraceCheckUtils]: 7: Hoare triple {8149#true} assume !(0 != ~p1~0); {8149#true} is VALID [2020-07-17 22:26:08,610 INFO L280 TraceCheckUtils]: 8: Hoare triple {8149#true} assume !(0 != ~p2~0); {8149#true} is VALID [2020-07-17 22:26:08,610 INFO L280 TraceCheckUtils]: 9: Hoare triple {8149#true} assume !(0 != ~p3~0); {8149#true} is VALID [2020-07-17 22:26:08,612 INFO L280 TraceCheckUtils]: 10: Hoare triple {8149#true} assume !(0 != ~p4~0); {8153#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:08,612 INFO L280 TraceCheckUtils]: 11: Hoare triple {8153#(= 0 main_~p4~0)} assume 0 != ~p5~0;~lk5~0 := 1; {8153#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:08,613 INFO L280 TraceCheckUtils]: 12: Hoare triple {8153#(= 0 main_~p4~0)} assume 0 != ~p6~0;~lk6~0 := 1; {8153#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:08,614 INFO L280 TraceCheckUtils]: 13: Hoare triple {8153#(= 0 main_~p4~0)} assume 0 != ~p7~0;~lk7~0 := 1; {8153#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:08,614 INFO L280 TraceCheckUtils]: 14: Hoare triple {8153#(= 0 main_~p4~0)} assume !(0 != ~p8~0); {8153#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:08,615 INFO L280 TraceCheckUtils]: 15: Hoare triple {8153#(= 0 main_~p4~0)} assume 0 != ~p9~0;~lk9~0 := 1; {8153#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:08,616 INFO L280 TraceCheckUtils]: 16: Hoare triple {8153#(= 0 main_~p4~0)} assume 0 != ~p10~0;~lk10~0 := 1; {8153#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:08,616 INFO L280 TraceCheckUtils]: 17: Hoare triple {8153#(= 0 main_~p4~0)} assume !(0 != ~p1~0); {8153#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:08,617 INFO L280 TraceCheckUtils]: 18: Hoare triple {8153#(= 0 main_~p4~0)} assume !(0 != ~p2~0); {8153#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:08,618 INFO L280 TraceCheckUtils]: 19: Hoare triple {8153#(= 0 main_~p4~0)} assume !(0 != ~p3~0); {8153#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:08,618 INFO L280 TraceCheckUtils]: 20: Hoare triple {8153#(= 0 main_~p4~0)} assume 0 != ~p4~0; {8150#false} is VALID [2020-07-17 22:26:08,619 INFO L280 TraceCheckUtils]: 21: Hoare triple {8150#false} assume 1 != ~lk4~0; {8150#false} is VALID [2020-07-17 22:26:08,619 INFO L280 TraceCheckUtils]: 22: Hoare triple {8150#false} assume !false; {8150#false} is VALID [2020-07-17 22:26:08,620 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-17 22:26:08,620 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529111338] [2020-07-17 22:26:08,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:08,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:08,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751989286] [2020-07-17 22:26:08,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-17 22:26:08,622 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:08,622 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:08,652 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:08,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:08,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:08,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:08,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:08,654 INFO L87 Difference]: Start difference. First operand 360 states and 590 transitions. Second operand 3 states. [2020-07-17 22:26:08,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:08,921 INFO L93 Difference]: Finished difference Result 844 states and 1392 transitions. [2020-07-17 22:26:08,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:08,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-17 22:26:08,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:08,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:08,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2020-07-17 22:26:08,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:08,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2020-07-17 22:26:08,930 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 182 transitions. [2020-07-17 22:26:09,127 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:09,146 INFO L225 Difference]: With dead ends: 844 [2020-07-17 22:26:09,147 INFO L226 Difference]: Without dead ends: 498 [2020-07-17 22:26:09,149 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-17 22:26:09,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2020-07-17 22:26:09,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 496. [2020-07-17 22:26:09,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:09,247 INFO L82 GeneralOperation]: Start isEquivalent. First operand 498 states. Second operand 496 states. [2020-07-17 22:26:09,247 INFO L74 IsIncluded]: Start isIncluded. First operand 498 states. Second operand 496 states. [2020-07-17 22:26:09,247 INFO L87 Difference]: Start difference. First operand 498 states. Second operand 496 states. [2020-07-17 22:26:09,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:09,277 INFO L93 Difference]: Finished difference Result 498 states and 807 transitions. [2020-07-17 22:26:09,277 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 807 transitions. [2020-07-17 22:26:09,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:09,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:09,279 INFO L74 IsIncluded]: Start isIncluded. First operand 496 states. Second operand 498 states. [2020-07-17 22:26:09,279 INFO L87 Difference]: Start difference. First operand 496 states. Second operand 498 states. [2020-07-17 22:26:09,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:09,305 INFO L93 Difference]: Finished difference Result 498 states and 807 transitions. [2020-07-17 22:26:09,305 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 807 transitions. [2020-07-17 22:26:09,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:09,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:09,307 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:09,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:09,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2020-07-17 22:26:09,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 806 transitions. [2020-07-17 22:26:09,330 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 806 transitions. Word has length 23 [2020-07-17 22:26:09,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:09,330 INFO L479 AbstractCegarLoop]: Abstraction has 496 states and 806 transitions. [2020-07-17 22:26:09,330 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:09,330 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 806 transitions. [2020-07-17 22:26:09,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-17 22:26:09,333 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:09,333 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] [2020-07-17 22:26:09,333 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-17 22:26:09,334 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:09,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:09,334 INFO L82 PathProgramCache]: Analyzing trace with hash 6129535, now seen corresponding path program 1 times [2020-07-17 22:26:09,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:09,335 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053873270] [2020-07-17 22:26:09,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:09,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:09,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:09,398 INFO L280 TraceCheckUtils]: 0: Hoare triple {10546#true} assume true; {10546#true} is VALID [2020-07-17 22:26:09,398 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {10546#true} {10546#true} #197#return; {10546#true} is VALID [2020-07-17 22:26:09,399 INFO L263 TraceCheckUtils]: 0: Hoare triple {10546#true} call ULTIMATE.init(); {10546#true} is VALID [2020-07-17 22:26:09,399 INFO L280 TraceCheckUtils]: 1: Hoare triple {10546#true} assume true; {10546#true} is VALID [2020-07-17 22:26:09,399 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {10546#true} {10546#true} #197#return; {10546#true} is VALID [2020-07-17 22:26:09,400 INFO L263 TraceCheckUtils]: 3: Hoare triple {10546#true} call #t~ret11 := main(); {10546#true} is VALID [2020-07-17 22:26:09,400 INFO L280 TraceCheckUtils]: 4: Hoare triple {10546#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {10546#true} is VALID [2020-07-17 22:26:09,400 INFO L280 TraceCheckUtils]: 5: Hoare triple {10546#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {10546#true} is VALID [2020-07-17 22:26:09,400 INFO L280 TraceCheckUtils]: 6: Hoare triple {10546#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {10546#true} is VALID [2020-07-17 22:26:09,400 INFO L280 TraceCheckUtils]: 7: Hoare triple {10546#true} assume !(0 != ~p1~0); {10546#true} is VALID [2020-07-17 22:26:09,401 INFO L280 TraceCheckUtils]: 8: Hoare triple {10546#true} assume !(0 != ~p2~0); {10546#true} is VALID [2020-07-17 22:26:09,401 INFO L280 TraceCheckUtils]: 9: Hoare triple {10546#true} assume !(0 != ~p3~0); {10546#true} is VALID [2020-07-17 22:26:09,402 INFO L280 TraceCheckUtils]: 10: Hoare triple {10546#true} assume 0 != ~p4~0;~lk4~0 := 1; {10550#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:09,403 INFO L280 TraceCheckUtils]: 11: Hoare triple {10550#(not (= 0 main_~p4~0))} assume 0 != ~p5~0;~lk5~0 := 1; {10550#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:09,404 INFO L280 TraceCheckUtils]: 12: Hoare triple {10550#(not (= 0 main_~p4~0))} assume 0 != ~p6~0;~lk6~0 := 1; {10550#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:09,404 INFO L280 TraceCheckUtils]: 13: Hoare triple {10550#(not (= 0 main_~p4~0))} assume 0 != ~p7~0;~lk7~0 := 1; {10550#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:09,405 INFO L280 TraceCheckUtils]: 14: Hoare triple {10550#(not (= 0 main_~p4~0))} assume !(0 != ~p8~0); {10550#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:09,406 INFO L280 TraceCheckUtils]: 15: Hoare triple {10550#(not (= 0 main_~p4~0))} assume 0 != ~p9~0;~lk9~0 := 1; {10550#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:09,406 INFO L280 TraceCheckUtils]: 16: Hoare triple {10550#(not (= 0 main_~p4~0))} assume 0 != ~p10~0;~lk10~0 := 1; {10550#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:09,407 INFO L280 TraceCheckUtils]: 17: Hoare triple {10550#(not (= 0 main_~p4~0))} assume !(0 != ~p1~0); {10550#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:09,407 INFO L280 TraceCheckUtils]: 18: Hoare triple {10550#(not (= 0 main_~p4~0))} assume !(0 != ~p2~0); {10550#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:09,408 INFO L280 TraceCheckUtils]: 19: Hoare triple {10550#(not (= 0 main_~p4~0))} assume !(0 != ~p3~0); {10550#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:09,409 INFO L280 TraceCheckUtils]: 20: Hoare triple {10550#(not (= 0 main_~p4~0))} assume !(0 != ~p4~0); {10547#false} is VALID [2020-07-17 22:26:09,409 INFO L280 TraceCheckUtils]: 21: Hoare triple {10547#false} assume 0 != ~p5~0; {10547#false} is VALID [2020-07-17 22:26:09,409 INFO L280 TraceCheckUtils]: 22: Hoare triple {10547#false} assume 1 != ~lk5~0; {10547#false} is VALID [2020-07-17 22:26:09,409 INFO L280 TraceCheckUtils]: 23: Hoare triple {10547#false} assume !false; {10547#false} is VALID [2020-07-17 22:26:09,410 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-17 22:26:09,410 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053873270] [2020-07-17 22:26:09,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:09,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:09,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114687180] [2020-07-17 22:26:09,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-17 22:26:09,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:09,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:09,440 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:09,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:09,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:09,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:09,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:09,442 INFO L87 Difference]: Start difference. First operand 496 states and 806 transitions. Second operand 3 states. [2020-07-17 22:26:09,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:09,692 INFO L93 Difference]: Finished difference Result 744 states and 1204 transitions. [2020-07-17 22:26:09,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:09,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-17 22:26:09,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:09,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:09,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 177 transitions. [2020-07-17 22:26:09,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:09,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 177 transitions. [2020-07-17 22:26:09,702 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 177 transitions. [2020-07-17 22:26:09,926 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:09,953 INFO L225 Difference]: With dead ends: 744 [2020-07-17 22:26:09,953 INFO L226 Difference]: Without dead ends: 506 [2020-07-17 22:26:09,955 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-17 22:26:09,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2020-07-17 22:26:10,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 504. [2020-07-17 22:26:10,056 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:10,056 INFO L82 GeneralOperation]: Start isEquivalent. First operand 506 states. Second operand 504 states. [2020-07-17 22:26:10,056 INFO L74 IsIncluded]: Start isIncluded. First operand 506 states. Second operand 504 states. [2020-07-17 22:26:10,057 INFO L87 Difference]: Start difference. First operand 506 states. Second operand 504 states. [2020-07-17 22:26:10,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:10,091 INFO L93 Difference]: Finished difference Result 506 states and 807 transitions. [2020-07-17 22:26:10,091 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 807 transitions. [2020-07-17 22:26:10,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:10,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:10,093 INFO L74 IsIncluded]: Start isIncluded. First operand 504 states. Second operand 506 states. [2020-07-17 22:26:10,094 INFO L87 Difference]: Start difference. First operand 504 states. Second operand 506 states. [2020-07-17 22:26:10,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:10,120 INFO L93 Difference]: Finished difference Result 506 states and 807 transitions. [2020-07-17 22:26:10,121 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 807 transitions. [2020-07-17 22:26:10,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:10,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:10,123 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:10,123 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:10,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2020-07-17 22:26:10,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 806 transitions. [2020-07-17 22:26:10,154 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 806 transitions. Word has length 24 [2020-07-17 22:26:10,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:10,154 INFO L479 AbstractCegarLoop]: Abstraction has 504 states and 806 transitions. [2020-07-17 22:26:10,154 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:10,155 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 806 transitions. [2020-07-17 22:26:10,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-17 22:26:10,156 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:10,157 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] [2020-07-17 22:26:10,158 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-17 22:26:10,158 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:10,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:10,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1004987715, now seen corresponding path program 1 times [2020-07-17 22:26:10,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:10,161 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12903346] [2020-07-17 22:26:10,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:10,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:10,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:10,213 INFO L280 TraceCheckUtils]: 0: Hoare triple {12867#true} assume true; {12867#true} is VALID [2020-07-17 22:26:10,213 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {12867#true} {12867#true} #197#return; {12867#true} is VALID [2020-07-17 22:26:10,214 INFO L263 TraceCheckUtils]: 0: Hoare triple {12867#true} call ULTIMATE.init(); {12867#true} is VALID [2020-07-17 22:26:10,214 INFO L280 TraceCheckUtils]: 1: Hoare triple {12867#true} assume true; {12867#true} is VALID [2020-07-17 22:26:10,214 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {12867#true} {12867#true} #197#return; {12867#true} is VALID [2020-07-17 22:26:10,215 INFO L263 TraceCheckUtils]: 3: Hoare triple {12867#true} call #t~ret11 := main(); {12867#true} is VALID [2020-07-17 22:26:10,215 INFO L280 TraceCheckUtils]: 4: Hoare triple {12867#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {12867#true} is VALID [2020-07-17 22:26:10,215 INFO L280 TraceCheckUtils]: 5: Hoare triple {12867#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {12867#true} is VALID [2020-07-17 22:26:10,216 INFO L280 TraceCheckUtils]: 6: Hoare triple {12867#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {12867#true} is VALID [2020-07-17 22:26:10,216 INFO L280 TraceCheckUtils]: 7: Hoare triple {12867#true} assume !(0 != ~p1~0); {12867#true} is VALID [2020-07-17 22:26:10,216 INFO L280 TraceCheckUtils]: 8: Hoare triple {12867#true} assume !(0 != ~p2~0); {12867#true} is VALID [2020-07-17 22:26:10,217 INFO L280 TraceCheckUtils]: 9: Hoare triple {12867#true} assume !(0 != ~p3~0); {12867#true} is VALID [2020-07-17 22:26:10,217 INFO L280 TraceCheckUtils]: 10: Hoare triple {12867#true} assume !(0 != ~p4~0); {12867#true} is VALID [2020-07-17 22:26:10,218 INFO L280 TraceCheckUtils]: 11: Hoare triple {12867#true} assume 0 != ~p5~0;~lk5~0 := 1; {12871#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:10,219 INFO L280 TraceCheckUtils]: 12: Hoare triple {12871#(= 1 main_~lk5~0)} assume 0 != ~p6~0;~lk6~0 := 1; {12871#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:10,220 INFO L280 TraceCheckUtils]: 13: Hoare triple {12871#(= 1 main_~lk5~0)} assume 0 != ~p7~0;~lk7~0 := 1; {12871#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:10,221 INFO L280 TraceCheckUtils]: 14: Hoare triple {12871#(= 1 main_~lk5~0)} assume !(0 != ~p8~0); {12871#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:10,222 INFO L280 TraceCheckUtils]: 15: Hoare triple {12871#(= 1 main_~lk5~0)} assume 0 != ~p9~0;~lk9~0 := 1; {12871#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:10,223 INFO L280 TraceCheckUtils]: 16: Hoare triple {12871#(= 1 main_~lk5~0)} assume 0 != ~p10~0;~lk10~0 := 1; {12871#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:10,224 INFO L280 TraceCheckUtils]: 17: Hoare triple {12871#(= 1 main_~lk5~0)} assume !(0 != ~p1~0); {12871#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:10,224 INFO L280 TraceCheckUtils]: 18: Hoare triple {12871#(= 1 main_~lk5~0)} assume !(0 != ~p2~0); {12871#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:10,225 INFO L280 TraceCheckUtils]: 19: Hoare triple {12871#(= 1 main_~lk5~0)} assume !(0 != ~p3~0); {12871#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:10,228 INFO L280 TraceCheckUtils]: 20: Hoare triple {12871#(= 1 main_~lk5~0)} assume !(0 != ~p4~0); {12871#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:10,229 INFO L280 TraceCheckUtils]: 21: Hoare triple {12871#(= 1 main_~lk5~0)} assume 0 != ~p5~0; {12871#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:10,230 INFO L280 TraceCheckUtils]: 22: Hoare triple {12871#(= 1 main_~lk5~0)} assume 1 != ~lk5~0; {12868#false} is VALID [2020-07-17 22:26:10,230 INFO L280 TraceCheckUtils]: 23: Hoare triple {12868#false} assume !false; {12868#false} is VALID [2020-07-17 22:26:10,231 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-17 22:26:10,232 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12903346] [2020-07-17 22:26:10,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:10,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:10,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626397628] [2020-07-17 22:26:10,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-17 22:26:10,234 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:10,234 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:10,264 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:10,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:10,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:10,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:10,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:10,266 INFO L87 Difference]: Start difference. First operand 504 states and 806 transitions. Second operand 3 states. [2020-07-17 22:26:10,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:10,604 INFO L93 Difference]: Finished difference Result 908 states and 1480 transitions. [2020-07-17 22:26:10,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:10,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-17 22:26:10,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:10,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:10,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2020-07-17 22:26:10,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:10,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2020-07-17 22:26:10,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 114 transitions. [2020-07-17 22:26:10,736 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:10,811 INFO L225 Difference]: With dead ends: 908 [2020-07-17 22:26:10,812 INFO L226 Difference]: Without dead ends: 906 [2020-07-17 22:26:10,813 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-17 22:26:10,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2020-07-17 22:26:10,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 712. [2020-07-17 22:26:10,918 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:10,918 INFO L82 GeneralOperation]: Start isEquivalent. First operand 906 states. Second operand 712 states. [2020-07-17 22:26:10,918 INFO L74 IsIncluded]: Start isIncluded. First operand 906 states. Second operand 712 states. [2020-07-17 22:26:10,918 INFO L87 Difference]: Start difference. First operand 906 states. Second operand 712 states. [2020-07-17 22:26:10,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:10,993 INFO L93 Difference]: Finished difference Result 906 states and 1463 transitions. [2020-07-17 22:26:10,994 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1463 transitions. [2020-07-17 22:26:10,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:10,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:10,997 INFO L74 IsIncluded]: Start isIncluded. First operand 712 states. Second operand 906 states. [2020-07-17 22:26:10,997 INFO L87 Difference]: Start difference. First operand 712 states. Second operand 906 states. [2020-07-17 22:26:11,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:11,059 INFO L93 Difference]: Finished difference Result 906 states and 1463 transitions. [2020-07-17 22:26:11,059 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1463 transitions. [2020-07-17 22:26:11,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:11,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:11,063 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:11,063 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:11,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2020-07-17 22:26:11,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1110 transitions. [2020-07-17 22:26:11,096 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1110 transitions. Word has length 24 [2020-07-17 22:26:11,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:11,096 INFO L479 AbstractCegarLoop]: Abstraction has 712 states and 1110 transitions. [2020-07-17 22:26:11,096 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:11,096 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1110 transitions. [2020-07-17 22:26:11,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-17 22:26:11,098 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:11,098 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] [2020-07-17 22:26:11,099 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-17 22:26:11,099 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:11,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:11,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1591793729, now seen corresponding path program 1 times [2020-07-17 22:26:11,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:11,100 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551934604] [2020-07-17 22:26:11,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:11,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:11,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:11,136 INFO L280 TraceCheckUtils]: 0: Hoare triple {16368#true} assume true; {16368#true} is VALID [2020-07-17 22:26:11,136 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {16368#true} {16368#true} #197#return; {16368#true} is VALID [2020-07-17 22:26:11,136 INFO L263 TraceCheckUtils]: 0: Hoare triple {16368#true} call ULTIMATE.init(); {16368#true} is VALID [2020-07-17 22:26:11,137 INFO L280 TraceCheckUtils]: 1: Hoare triple {16368#true} assume true; {16368#true} is VALID [2020-07-17 22:26:11,137 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {16368#true} {16368#true} #197#return; {16368#true} is VALID [2020-07-17 22:26:11,137 INFO L263 TraceCheckUtils]: 3: Hoare triple {16368#true} call #t~ret11 := main(); {16368#true} is VALID [2020-07-17 22:26:11,137 INFO L280 TraceCheckUtils]: 4: Hoare triple {16368#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {16368#true} is VALID [2020-07-17 22:26:11,138 INFO L280 TraceCheckUtils]: 5: Hoare triple {16368#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {16368#true} is VALID [2020-07-17 22:26:11,138 INFO L280 TraceCheckUtils]: 6: Hoare triple {16368#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {16368#true} is VALID [2020-07-17 22:26:11,138 INFO L280 TraceCheckUtils]: 7: Hoare triple {16368#true} assume !(0 != ~p1~0); {16368#true} is VALID [2020-07-17 22:26:11,138 INFO L280 TraceCheckUtils]: 8: Hoare triple {16368#true} assume !(0 != ~p2~0); {16368#true} is VALID [2020-07-17 22:26:11,138 INFO L280 TraceCheckUtils]: 9: Hoare triple {16368#true} assume !(0 != ~p3~0); {16368#true} is VALID [2020-07-17 22:26:11,139 INFO L280 TraceCheckUtils]: 10: Hoare triple {16368#true} assume !(0 != ~p4~0); {16368#true} is VALID [2020-07-17 22:26:11,139 INFO L280 TraceCheckUtils]: 11: Hoare triple {16368#true} assume !(0 != ~p5~0); {16372#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:11,140 INFO L280 TraceCheckUtils]: 12: Hoare triple {16372#(= 0 main_~p5~0)} assume 0 != ~p6~0;~lk6~0 := 1; {16372#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:11,140 INFO L280 TraceCheckUtils]: 13: Hoare triple {16372#(= 0 main_~p5~0)} assume 0 != ~p7~0;~lk7~0 := 1; {16372#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:11,141 INFO L280 TraceCheckUtils]: 14: Hoare triple {16372#(= 0 main_~p5~0)} assume !(0 != ~p8~0); {16372#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:11,142 INFO L280 TraceCheckUtils]: 15: Hoare triple {16372#(= 0 main_~p5~0)} assume 0 != ~p9~0;~lk9~0 := 1; {16372#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:11,142 INFO L280 TraceCheckUtils]: 16: Hoare triple {16372#(= 0 main_~p5~0)} assume 0 != ~p10~0;~lk10~0 := 1; {16372#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:11,143 INFO L280 TraceCheckUtils]: 17: Hoare triple {16372#(= 0 main_~p5~0)} assume !(0 != ~p1~0); {16372#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:11,143 INFO L280 TraceCheckUtils]: 18: Hoare triple {16372#(= 0 main_~p5~0)} assume !(0 != ~p2~0); {16372#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:11,144 INFO L280 TraceCheckUtils]: 19: Hoare triple {16372#(= 0 main_~p5~0)} assume !(0 != ~p3~0); {16372#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:11,144 INFO L280 TraceCheckUtils]: 20: Hoare triple {16372#(= 0 main_~p5~0)} assume !(0 != ~p4~0); {16372#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:11,145 INFO L280 TraceCheckUtils]: 21: Hoare triple {16372#(= 0 main_~p5~0)} assume 0 != ~p5~0; {16369#false} is VALID [2020-07-17 22:26:11,145 INFO L280 TraceCheckUtils]: 22: Hoare triple {16369#false} assume 1 != ~lk5~0; {16369#false} is VALID [2020-07-17 22:26:11,145 INFO L280 TraceCheckUtils]: 23: Hoare triple {16369#false} assume !false; {16369#false} is VALID [2020-07-17 22:26:11,146 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-17 22:26:11,146 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551934604] [2020-07-17 22:26:11,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:11,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:11,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197506816] [2020-07-17 22:26:11,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-17 22:26:11,147 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:11,148 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:11,178 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:11,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:11,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:11,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:11,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:11,179 INFO L87 Difference]: Start difference. First operand 712 states and 1110 transitions. Second operand 3 states. [2020-07-17 22:26:11,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:11,810 INFO L93 Difference]: Finished difference Result 1660 states and 2600 transitions. [2020-07-17 22:26:11,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:11,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-17 22:26:11,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:11,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:11,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 179 transitions. [2020-07-17 22:26:11,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:11,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 179 transitions. [2020-07-17 22:26:11,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 179 transitions. [2020-07-17 22:26:12,020 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:12,090 INFO L225 Difference]: With dead ends: 1660 [2020-07-17 22:26:12,090 INFO L226 Difference]: Without dead ends: 970 [2020-07-17 22:26:12,093 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-17 22:26:12,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2020-07-17 22:26:12,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 968. [2020-07-17 22:26:12,278 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:12,278 INFO L82 GeneralOperation]: Start isEquivalent. First operand 970 states. Second operand 968 states. [2020-07-17 22:26:12,278 INFO L74 IsIncluded]: Start isIncluded. First operand 970 states. Second operand 968 states. [2020-07-17 22:26:12,278 INFO L87 Difference]: Start difference. First operand 970 states. Second operand 968 states. [2020-07-17 22:26:12,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:12,339 INFO L93 Difference]: Finished difference Result 970 states and 1495 transitions. [2020-07-17 22:26:12,339 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1495 transitions. [2020-07-17 22:26:12,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:12,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:12,342 INFO L74 IsIncluded]: Start isIncluded. First operand 968 states. Second operand 970 states. [2020-07-17 22:26:12,343 INFO L87 Difference]: Start difference. First operand 968 states. Second operand 970 states. [2020-07-17 22:26:12,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:12,419 INFO L93 Difference]: Finished difference Result 970 states and 1495 transitions. [2020-07-17 22:26:12,419 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1495 transitions. [2020-07-17 22:26:12,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:12,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:12,422 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:12,423 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:12,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2020-07-17 22:26:12,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1494 transitions. [2020-07-17 22:26:12,477 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1494 transitions. Word has length 24 [2020-07-17 22:26:12,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:12,478 INFO L479 AbstractCegarLoop]: Abstraction has 968 states and 1494 transitions. [2020-07-17 22:26:12,478 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:12,478 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1494 transitions. [2020-07-17 22:26:12,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-17 22:26:12,480 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:12,480 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] [2020-07-17 22:26:12,480 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-17 22:26:12,480 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:12,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:12,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1089633349, now seen corresponding path program 1 times [2020-07-17 22:26:12,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:12,481 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466947206] [2020-07-17 22:26:12,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:12,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:12,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:12,509 INFO L280 TraceCheckUtils]: 0: Hoare triple {21037#true} assume true; {21037#true} is VALID [2020-07-17 22:26:12,510 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {21037#true} {21037#true} #197#return; {21037#true} is VALID [2020-07-17 22:26:12,510 INFO L263 TraceCheckUtils]: 0: Hoare triple {21037#true} call ULTIMATE.init(); {21037#true} is VALID [2020-07-17 22:26:12,510 INFO L280 TraceCheckUtils]: 1: Hoare triple {21037#true} assume true; {21037#true} is VALID [2020-07-17 22:26:12,511 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {21037#true} {21037#true} #197#return; {21037#true} is VALID [2020-07-17 22:26:12,511 INFO L263 TraceCheckUtils]: 3: Hoare triple {21037#true} call #t~ret11 := main(); {21037#true} is VALID [2020-07-17 22:26:12,511 INFO L280 TraceCheckUtils]: 4: Hoare triple {21037#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {21037#true} is VALID [2020-07-17 22:26:12,511 INFO L280 TraceCheckUtils]: 5: Hoare triple {21037#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {21037#true} is VALID [2020-07-17 22:26:12,511 INFO L280 TraceCheckUtils]: 6: Hoare triple {21037#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {21037#true} is VALID [2020-07-17 22:26:12,512 INFO L280 TraceCheckUtils]: 7: Hoare triple {21037#true} assume !(0 != ~p1~0); {21037#true} is VALID [2020-07-17 22:26:12,512 INFO L280 TraceCheckUtils]: 8: Hoare triple {21037#true} assume !(0 != ~p2~0); {21037#true} is VALID [2020-07-17 22:26:12,512 INFO L280 TraceCheckUtils]: 9: Hoare triple {21037#true} assume !(0 != ~p3~0); {21037#true} is VALID [2020-07-17 22:26:12,512 INFO L280 TraceCheckUtils]: 10: Hoare triple {21037#true} assume !(0 != ~p4~0); {21037#true} is VALID [2020-07-17 22:26:12,513 INFO L280 TraceCheckUtils]: 11: Hoare triple {21037#true} assume 0 != ~p5~0;~lk5~0 := 1; {21041#(not (= 0 main_~p5~0))} is VALID [2020-07-17 22:26:12,514 INFO L280 TraceCheckUtils]: 12: Hoare triple {21041#(not (= 0 main_~p5~0))} assume 0 != ~p6~0;~lk6~0 := 1; {21041#(not (= 0 main_~p5~0))} is VALID [2020-07-17 22:26:12,515 INFO L280 TraceCheckUtils]: 13: Hoare triple {21041#(not (= 0 main_~p5~0))} assume 0 != ~p7~0;~lk7~0 := 1; {21041#(not (= 0 main_~p5~0))} is VALID [2020-07-17 22:26:12,515 INFO L280 TraceCheckUtils]: 14: Hoare triple {21041#(not (= 0 main_~p5~0))} assume !(0 != ~p8~0); {21041#(not (= 0 main_~p5~0))} is VALID [2020-07-17 22:26:12,516 INFO L280 TraceCheckUtils]: 15: Hoare triple {21041#(not (= 0 main_~p5~0))} assume 0 != ~p9~0;~lk9~0 := 1; {21041#(not (= 0 main_~p5~0))} is VALID [2020-07-17 22:26:12,517 INFO L280 TraceCheckUtils]: 16: Hoare triple {21041#(not (= 0 main_~p5~0))} assume 0 != ~p10~0;~lk10~0 := 1; {21041#(not (= 0 main_~p5~0))} is VALID [2020-07-17 22:26:12,517 INFO L280 TraceCheckUtils]: 17: Hoare triple {21041#(not (= 0 main_~p5~0))} assume !(0 != ~p1~0); {21041#(not (= 0 main_~p5~0))} is VALID [2020-07-17 22:26:12,518 INFO L280 TraceCheckUtils]: 18: Hoare triple {21041#(not (= 0 main_~p5~0))} assume !(0 != ~p2~0); {21041#(not (= 0 main_~p5~0))} is VALID [2020-07-17 22:26:12,518 INFO L280 TraceCheckUtils]: 19: Hoare triple {21041#(not (= 0 main_~p5~0))} assume !(0 != ~p3~0); {21041#(not (= 0 main_~p5~0))} is VALID [2020-07-17 22:26:12,519 INFO L280 TraceCheckUtils]: 20: Hoare triple {21041#(not (= 0 main_~p5~0))} assume !(0 != ~p4~0); {21041#(not (= 0 main_~p5~0))} is VALID [2020-07-17 22:26:12,520 INFO L280 TraceCheckUtils]: 21: Hoare triple {21041#(not (= 0 main_~p5~0))} assume !(0 != ~p5~0); {21038#false} is VALID [2020-07-17 22:26:12,520 INFO L280 TraceCheckUtils]: 22: Hoare triple {21038#false} assume 0 != ~p6~0; {21038#false} is VALID [2020-07-17 22:26:12,520 INFO L280 TraceCheckUtils]: 23: Hoare triple {21038#false} assume 1 != ~lk6~0; {21038#false} is VALID [2020-07-17 22:26:12,521 INFO L280 TraceCheckUtils]: 24: Hoare triple {21038#false} assume !false; {21038#false} is VALID [2020-07-17 22:26:12,521 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-17 22:26:12,522 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466947206] [2020-07-17 22:26:12,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:12,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:12,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137160899] [2020-07-17 22:26:12,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-17 22:26:12,523 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:12,524 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:12,550 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:12,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:12,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:12,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:12,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:12,551 INFO L87 Difference]: Start difference. First operand 968 states and 1494 transitions. Second operand 3 states. [2020-07-17 22:26:12,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:12,952 INFO L93 Difference]: Finished difference Result 1452 states and 2232 transitions. [2020-07-17 22:26:12,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:12,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-17 22:26:12,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:12,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:12,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2020-07-17 22:26:12,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:12,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2020-07-17 22:26:12,957 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 174 transitions. [2020-07-17 22:26:13,180 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:13,249 INFO L225 Difference]: With dead ends: 1452 [2020-07-17 22:26:13,249 INFO L226 Difference]: Without dead ends: 986 [2020-07-17 22:26:13,251 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-17 22:26:13,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2020-07-17 22:26:13,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 984. [2020-07-17 22:26:13,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:13,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 986 states. Second operand 984 states. [2020-07-17 22:26:13,464 INFO L74 IsIncluded]: Start isIncluded. First operand 986 states. Second operand 984 states. [2020-07-17 22:26:13,464 INFO L87 Difference]: Start difference. First operand 986 states. Second operand 984 states. [2020-07-17 22:26:13,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:13,531 INFO L93 Difference]: Finished difference Result 986 states and 1495 transitions. [2020-07-17 22:26:13,531 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1495 transitions. [2020-07-17 22:26:13,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:13,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:13,534 INFO L74 IsIncluded]: Start isIncluded. First operand 984 states. Second operand 986 states. [2020-07-17 22:26:13,535 INFO L87 Difference]: Start difference. First operand 984 states. Second operand 986 states. [2020-07-17 22:26:13,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:13,602 INFO L93 Difference]: Finished difference Result 986 states and 1495 transitions. [2020-07-17 22:26:13,602 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1495 transitions. [2020-07-17 22:26:13,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:13,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:13,605 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:13,606 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:13,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2020-07-17 22:26:13,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1494 transitions. [2020-07-17 22:26:13,670 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1494 transitions. Word has length 25 [2020-07-17 22:26:13,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:13,670 INFO L479 AbstractCegarLoop]: Abstraction has 984 states and 1494 transitions. [2020-07-17 22:26:13,671 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:13,673 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1494 transitions. [2020-07-17 22:26:13,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-17 22:26:13,674 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:13,675 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] [2020-07-17 22:26:13,675 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-17 22:26:13,675 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:13,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:13,676 INFO L82 PathProgramCache]: Analyzing trace with hash -2100750599, now seen corresponding path program 1 times [2020-07-17 22:26:13,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:13,676 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914927773] [2020-07-17 22:26:13,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:13,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:13,723 INFO L280 TraceCheckUtils]: 0: Hoare triple {25546#true} assume true; {25546#true} is VALID [2020-07-17 22:26:13,724 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {25546#true} {25546#true} #197#return; {25546#true} is VALID [2020-07-17 22:26:13,724 INFO L263 TraceCheckUtils]: 0: Hoare triple {25546#true} call ULTIMATE.init(); {25546#true} is VALID [2020-07-17 22:26:13,724 INFO L280 TraceCheckUtils]: 1: Hoare triple {25546#true} assume true; {25546#true} is VALID [2020-07-17 22:26:13,725 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {25546#true} {25546#true} #197#return; {25546#true} is VALID [2020-07-17 22:26:13,725 INFO L263 TraceCheckUtils]: 3: Hoare triple {25546#true} call #t~ret11 := main(); {25546#true} is VALID [2020-07-17 22:26:13,725 INFO L280 TraceCheckUtils]: 4: Hoare triple {25546#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {25546#true} is VALID [2020-07-17 22:26:13,725 INFO L280 TraceCheckUtils]: 5: Hoare triple {25546#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {25546#true} is VALID [2020-07-17 22:26:13,726 INFO L280 TraceCheckUtils]: 6: Hoare triple {25546#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {25546#true} is VALID [2020-07-17 22:26:13,726 INFO L280 TraceCheckUtils]: 7: Hoare triple {25546#true} assume !(0 != ~p1~0); {25546#true} is VALID [2020-07-17 22:26:13,726 INFO L280 TraceCheckUtils]: 8: Hoare triple {25546#true} assume !(0 != ~p2~0); {25546#true} is VALID [2020-07-17 22:26:13,726 INFO L280 TraceCheckUtils]: 9: Hoare triple {25546#true} assume !(0 != ~p3~0); {25546#true} is VALID [2020-07-17 22:26:13,726 INFO L280 TraceCheckUtils]: 10: Hoare triple {25546#true} assume !(0 != ~p4~0); {25546#true} is VALID [2020-07-17 22:26:13,727 INFO L280 TraceCheckUtils]: 11: Hoare triple {25546#true} assume !(0 != ~p5~0); {25546#true} is VALID [2020-07-17 22:26:13,728 INFO L280 TraceCheckUtils]: 12: Hoare triple {25546#true} assume 0 != ~p6~0;~lk6~0 := 1; {25550#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:13,728 INFO L280 TraceCheckUtils]: 13: Hoare triple {25550#(= 1 main_~lk6~0)} assume 0 != ~p7~0;~lk7~0 := 1; {25550#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:13,731 INFO L280 TraceCheckUtils]: 14: Hoare triple {25550#(= 1 main_~lk6~0)} assume !(0 != ~p8~0); {25550#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:13,735 INFO L280 TraceCheckUtils]: 15: Hoare triple {25550#(= 1 main_~lk6~0)} assume 0 != ~p9~0;~lk9~0 := 1; {25550#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:13,736 INFO L280 TraceCheckUtils]: 16: Hoare triple {25550#(= 1 main_~lk6~0)} assume 0 != ~p10~0;~lk10~0 := 1; {25550#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:13,739 INFO L280 TraceCheckUtils]: 17: Hoare triple {25550#(= 1 main_~lk6~0)} assume !(0 != ~p1~0); {25550#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:13,740 INFO L280 TraceCheckUtils]: 18: Hoare triple {25550#(= 1 main_~lk6~0)} assume !(0 != ~p2~0); {25550#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:13,740 INFO L280 TraceCheckUtils]: 19: Hoare triple {25550#(= 1 main_~lk6~0)} assume !(0 != ~p3~0); {25550#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:13,741 INFO L280 TraceCheckUtils]: 20: Hoare triple {25550#(= 1 main_~lk6~0)} assume !(0 != ~p4~0); {25550#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:13,741 INFO L280 TraceCheckUtils]: 21: Hoare triple {25550#(= 1 main_~lk6~0)} assume !(0 != ~p5~0); {25550#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:13,742 INFO L280 TraceCheckUtils]: 22: Hoare triple {25550#(= 1 main_~lk6~0)} assume 0 != ~p6~0; {25550#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:13,743 INFO L280 TraceCheckUtils]: 23: Hoare triple {25550#(= 1 main_~lk6~0)} assume 1 != ~lk6~0; {25547#false} is VALID [2020-07-17 22:26:13,743 INFO L280 TraceCheckUtils]: 24: Hoare triple {25547#false} assume !false; {25547#false} is VALID [2020-07-17 22:26:13,744 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-17 22:26:13,744 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914927773] [2020-07-17 22:26:13,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:13,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:13,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367533365] [2020-07-17 22:26:13,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-17 22:26:13,745 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:13,745 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:13,779 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:13,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:13,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:13,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:13,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:13,781 INFO L87 Difference]: Start difference. First operand 984 states and 1494 transitions. Second operand 3 states. [2020-07-17 22:26:14,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:14,396 INFO L93 Difference]: Finished difference Result 1740 states and 2696 transitions. [2020-07-17 22:26:14,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:14,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-17 22:26:14,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:14,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:14,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2020-07-17 22:26:14,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:14,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2020-07-17 22:26:14,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 110 transitions. [2020-07-17 22:26:14,526 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:14,643 INFO L225 Difference]: With dead ends: 1740 [2020-07-17 22:26:14,643 INFO L226 Difference]: Without dead ends: 1738 [2020-07-17 22:26:14,645 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-17 22:26:14,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2020-07-17 22:26:14,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1416. [2020-07-17 22:26:14,902 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:14,902 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1738 states. Second operand 1416 states. [2020-07-17 22:26:14,902 INFO L74 IsIncluded]: Start isIncluded. First operand 1738 states. Second operand 1416 states. [2020-07-17 22:26:14,902 INFO L87 Difference]: Start difference. First operand 1738 states. Second operand 1416 states. [2020-07-17 22:26:15,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:15,013 INFO L93 Difference]: Finished difference Result 1738 states and 2663 transitions. [2020-07-17 22:26:15,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2663 transitions. [2020-07-17 22:26:15,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:15,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:15,018 INFO L74 IsIncluded]: Start isIncluded. First operand 1416 states. Second operand 1738 states. [2020-07-17 22:26:15,018 INFO L87 Difference]: Start difference. First operand 1416 states. Second operand 1738 states. [2020-07-17 22:26:15,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:15,118 INFO L93 Difference]: Finished difference Result 1738 states and 2663 transitions. [2020-07-17 22:26:15,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2663 transitions. [2020-07-17 22:26:15,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:15,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:15,122 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:15,123 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:15,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1416 states. [2020-07-17 22:26:15,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 2086 transitions. [2020-07-17 22:26:15,220 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 2086 transitions. Word has length 25 [2020-07-17 22:26:15,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:15,220 INFO L479 AbstractCegarLoop]: Abstraction has 1416 states and 2086 transitions. [2020-07-17 22:26:15,220 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:15,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 2086 transitions. [2020-07-17 22:26:15,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-17 22:26:15,223 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:15,223 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] [2020-07-17 22:26:15,223 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-17 22:26:15,223 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:15,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:15,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1607410683, now seen corresponding path program 1 times [2020-07-17 22:26:15,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:15,224 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361036679] [2020-07-17 22:26:15,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:15,259 INFO L280 TraceCheckUtils]: 0: Hoare triple {32295#true} assume true; {32295#true} is VALID [2020-07-17 22:26:15,259 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {32295#true} {32295#true} #197#return; {32295#true} is VALID [2020-07-17 22:26:15,259 INFO L263 TraceCheckUtils]: 0: Hoare triple {32295#true} call ULTIMATE.init(); {32295#true} is VALID [2020-07-17 22:26:15,259 INFO L280 TraceCheckUtils]: 1: Hoare triple {32295#true} assume true; {32295#true} is VALID [2020-07-17 22:26:15,260 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {32295#true} {32295#true} #197#return; {32295#true} is VALID [2020-07-17 22:26:15,260 INFO L263 TraceCheckUtils]: 3: Hoare triple {32295#true} call #t~ret11 := main(); {32295#true} is VALID [2020-07-17 22:26:15,260 INFO L280 TraceCheckUtils]: 4: Hoare triple {32295#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {32295#true} is VALID [2020-07-17 22:26:15,260 INFO L280 TraceCheckUtils]: 5: Hoare triple {32295#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {32295#true} is VALID [2020-07-17 22:26:15,261 INFO L280 TraceCheckUtils]: 6: Hoare triple {32295#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {32295#true} is VALID [2020-07-17 22:26:15,261 INFO L280 TraceCheckUtils]: 7: Hoare triple {32295#true} assume !(0 != ~p1~0); {32295#true} is VALID [2020-07-17 22:26:15,261 INFO L280 TraceCheckUtils]: 8: Hoare triple {32295#true} assume !(0 != ~p2~0); {32295#true} is VALID [2020-07-17 22:26:15,261 INFO L280 TraceCheckUtils]: 9: Hoare triple {32295#true} assume !(0 != ~p3~0); {32295#true} is VALID [2020-07-17 22:26:15,261 INFO L280 TraceCheckUtils]: 10: Hoare triple {32295#true} assume !(0 != ~p4~0); {32295#true} is VALID [2020-07-17 22:26:15,262 INFO L280 TraceCheckUtils]: 11: Hoare triple {32295#true} assume !(0 != ~p5~0); {32295#true} is VALID [2020-07-17 22:26:15,262 INFO L280 TraceCheckUtils]: 12: Hoare triple {32295#true} assume !(0 != ~p6~0); {32299#(= 0 main_~p6~0)} is VALID [2020-07-17 22:26:15,263 INFO L280 TraceCheckUtils]: 13: Hoare triple {32299#(= 0 main_~p6~0)} assume 0 != ~p7~0;~lk7~0 := 1; {32299#(= 0 main_~p6~0)} is VALID [2020-07-17 22:26:15,264 INFO L280 TraceCheckUtils]: 14: Hoare triple {32299#(= 0 main_~p6~0)} assume !(0 != ~p8~0); {32299#(= 0 main_~p6~0)} is VALID [2020-07-17 22:26:15,264 INFO L280 TraceCheckUtils]: 15: Hoare triple {32299#(= 0 main_~p6~0)} assume 0 != ~p9~0;~lk9~0 := 1; {32299#(= 0 main_~p6~0)} is VALID [2020-07-17 22:26:15,265 INFO L280 TraceCheckUtils]: 16: Hoare triple {32299#(= 0 main_~p6~0)} assume 0 != ~p10~0;~lk10~0 := 1; {32299#(= 0 main_~p6~0)} is VALID [2020-07-17 22:26:15,265 INFO L280 TraceCheckUtils]: 17: Hoare triple {32299#(= 0 main_~p6~0)} assume !(0 != ~p1~0); {32299#(= 0 main_~p6~0)} is VALID [2020-07-17 22:26:15,266 INFO L280 TraceCheckUtils]: 18: Hoare triple {32299#(= 0 main_~p6~0)} assume !(0 != ~p2~0); {32299#(= 0 main_~p6~0)} is VALID [2020-07-17 22:26:15,266 INFO L280 TraceCheckUtils]: 19: Hoare triple {32299#(= 0 main_~p6~0)} assume !(0 != ~p3~0); {32299#(= 0 main_~p6~0)} is VALID [2020-07-17 22:26:15,267 INFO L280 TraceCheckUtils]: 20: Hoare triple {32299#(= 0 main_~p6~0)} assume !(0 != ~p4~0); {32299#(= 0 main_~p6~0)} is VALID [2020-07-17 22:26:15,267 INFO L280 TraceCheckUtils]: 21: Hoare triple {32299#(= 0 main_~p6~0)} assume !(0 != ~p5~0); {32299#(= 0 main_~p6~0)} is VALID [2020-07-17 22:26:15,268 INFO L280 TraceCheckUtils]: 22: Hoare triple {32299#(= 0 main_~p6~0)} assume 0 != ~p6~0; {32296#false} is VALID [2020-07-17 22:26:15,268 INFO L280 TraceCheckUtils]: 23: Hoare triple {32296#false} assume 1 != ~lk6~0; {32296#false} is VALID [2020-07-17 22:26:15,268 INFO L280 TraceCheckUtils]: 24: Hoare triple {32296#false} assume !false; {32296#false} is VALID [2020-07-17 22:26:15,269 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-17 22:26:15,270 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361036679] [2020-07-17 22:26:15,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:15,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:15,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535698148] [2020-07-17 22:26:15,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-17 22:26:15,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:15,271 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:15,294 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:15,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:15,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:15,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:15,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:15,295 INFO L87 Difference]: Start difference. First operand 1416 states and 2086 transitions. Second operand 3 states. [2020-07-17 22:26:16,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:16,170 INFO L93 Difference]: Finished difference Result 3276 states and 4840 transitions. [2020-07-17 22:26:16,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:16,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-17 22:26:16,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:16,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:16,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2020-07-17 22:26:16,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:16,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2020-07-17 22:26:16,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 176 transitions. [2020-07-17 22:26:16,351 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:16,506 INFO L225 Difference]: With dead ends: 3276 [2020-07-17 22:26:16,506 INFO L226 Difference]: Without dead ends: 1898 [2020-07-17 22:26:16,510 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-17 22:26:16,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2020-07-17 22:26:17,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1896. [2020-07-17 22:26:17,026 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:17,027 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1898 states. Second operand 1896 states. [2020-07-17 22:26:17,027 INFO L74 IsIncluded]: Start isIncluded. First operand 1898 states. Second operand 1896 states. [2020-07-17 22:26:17,027 INFO L87 Difference]: Start difference. First operand 1898 states. Second operand 1896 states. [2020-07-17 22:26:17,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:17,201 INFO L93 Difference]: Finished difference Result 1898 states and 2759 transitions. [2020-07-17 22:26:17,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 2759 transitions. [2020-07-17 22:26:17,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:17,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:17,204 INFO L74 IsIncluded]: Start isIncluded. First operand 1896 states. Second operand 1898 states. [2020-07-17 22:26:17,204 INFO L87 Difference]: Start difference. First operand 1896 states. Second operand 1898 states. [2020-07-17 22:26:17,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:17,319 INFO L93 Difference]: Finished difference Result 1898 states and 2759 transitions. [2020-07-17 22:26:17,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 2759 transitions. [2020-07-17 22:26:17,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:17,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:17,322 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:17,322 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:17,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1896 states. [2020-07-17 22:26:17,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2758 transitions. [2020-07-17 22:26:17,451 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2758 transitions. Word has length 25 [2020-07-17 22:26:17,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:17,451 INFO L479 AbstractCegarLoop]: Abstraction has 1896 states and 2758 transitions. [2020-07-17 22:26:17,451 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:17,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2758 transitions. [2020-07-17 22:26:17,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-17 22:26:17,452 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:17,452 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] [2020-07-17 22:26:17,453 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-17 22:26:17,453 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:17,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:17,453 INFO L82 PathProgramCache]: Analyzing trace with hash -698544044, now seen corresponding path program 1 times [2020-07-17 22:26:17,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:17,453 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600600312] [2020-07-17 22:26:17,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:17,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:17,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:17,485 INFO L280 TraceCheckUtils]: 0: Hoare triple {41444#true} assume true; {41444#true} is VALID [2020-07-17 22:26:17,485 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {41444#true} {41444#true} #197#return; {41444#true} is VALID [2020-07-17 22:26:17,486 INFO L263 TraceCheckUtils]: 0: Hoare triple {41444#true} call ULTIMATE.init(); {41444#true} is VALID [2020-07-17 22:26:17,486 INFO L280 TraceCheckUtils]: 1: Hoare triple {41444#true} assume true; {41444#true} is VALID [2020-07-17 22:26:17,486 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {41444#true} {41444#true} #197#return; {41444#true} is VALID [2020-07-17 22:26:17,487 INFO L263 TraceCheckUtils]: 3: Hoare triple {41444#true} call #t~ret11 := main(); {41444#true} is VALID [2020-07-17 22:26:17,487 INFO L280 TraceCheckUtils]: 4: Hoare triple {41444#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {41444#true} is VALID [2020-07-17 22:26:17,487 INFO L280 TraceCheckUtils]: 5: Hoare triple {41444#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {41444#true} is VALID [2020-07-17 22:26:17,487 INFO L280 TraceCheckUtils]: 6: Hoare triple {41444#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {41444#true} is VALID [2020-07-17 22:26:17,487 INFO L280 TraceCheckUtils]: 7: Hoare triple {41444#true} assume !(0 != ~p1~0); {41444#true} is VALID [2020-07-17 22:26:17,488 INFO L280 TraceCheckUtils]: 8: Hoare triple {41444#true} assume !(0 != ~p2~0); {41444#true} is VALID [2020-07-17 22:26:17,488 INFO L280 TraceCheckUtils]: 9: Hoare triple {41444#true} assume !(0 != ~p3~0); {41444#true} is VALID [2020-07-17 22:26:17,488 INFO L280 TraceCheckUtils]: 10: Hoare triple {41444#true} assume !(0 != ~p4~0); {41444#true} is VALID [2020-07-17 22:26:17,488 INFO L280 TraceCheckUtils]: 11: Hoare triple {41444#true} assume !(0 != ~p5~0); {41444#true} is VALID [2020-07-17 22:26:17,489 INFO L280 TraceCheckUtils]: 12: Hoare triple {41444#true} assume 0 != ~p6~0;~lk6~0 := 1; {41448#(not (= 0 main_~p6~0))} is VALID [2020-07-17 22:26:17,490 INFO L280 TraceCheckUtils]: 13: Hoare triple {41448#(not (= 0 main_~p6~0))} assume 0 != ~p7~0;~lk7~0 := 1; {41448#(not (= 0 main_~p6~0))} is VALID [2020-07-17 22:26:17,490 INFO L280 TraceCheckUtils]: 14: Hoare triple {41448#(not (= 0 main_~p6~0))} assume !(0 != ~p8~0); {41448#(not (= 0 main_~p6~0))} is VALID [2020-07-17 22:26:17,491 INFO L280 TraceCheckUtils]: 15: Hoare triple {41448#(not (= 0 main_~p6~0))} assume 0 != ~p9~0;~lk9~0 := 1; {41448#(not (= 0 main_~p6~0))} is VALID [2020-07-17 22:26:17,492 INFO L280 TraceCheckUtils]: 16: Hoare triple {41448#(not (= 0 main_~p6~0))} assume 0 != ~p10~0;~lk10~0 := 1; {41448#(not (= 0 main_~p6~0))} is VALID [2020-07-17 22:26:17,492 INFO L280 TraceCheckUtils]: 17: Hoare triple {41448#(not (= 0 main_~p6~0))} assume !(0 != ~p1~0); {41448#(not (= 0 main_~p6~0))} is VALID [2020-07-17 22:26:17,493 INFO L280 TraceCheckUtils]: 18: Hoare triple {41448#(not (= 0 main_~p6~0))} assume !(0 != ~p2~0); {41448#(not (= 0 main_~p6~0))} is VALID [2020-07-17 22:26:17,493 INFO L280 TraceCheckUtils]: 19: Hoare triple {41448#(not (= 0 main_~p6~0))} assume !(0 != ~p3~0); {41448#(not (= 0 main_~p6~0))} is VALID [2020-07-17 22:26:17,494 INFO L280 TraceCheckUtils]: 20: Hoare triple {41448#(not (= 0 main_~p6~0))} assume !(0 != ~p4~0); {41448#(not (= 0 main_~p6~0))} is VALID [2020-07-17 22:26:17,495 INFO L280 TraceCheckUtils]: 21: Hoare triple {41448#(not (= 0 main_~p6~0))} assume !(0 != ~p5~0); {41448#(not (= 0 main_~p6~0))} is VALID [2020-07-17 22:26:17,495 INFO L280 TraceCheckUtils]: 22: Hoare triple {41448#(not (= 0 main_~p6~0))} assume !(0 != ~p6~0); {41445#false} is VALID [2020-07-17 22:26:17,496 INFO L280 TraceCheckUtils]: 23: Hoare triple {41445#false} assume 0 != ~p7~0; {41445#false} is VALID [2020-07-17 22:26:17,496 INFO L280 TraceCheckUtils]: 24: Hoare triple {41445#false} assume 1 != ~lk7~0; {41445#false} is VALID [2020-07-17 22:26:17,496 INFO L280 TraceCheckUtils]: 25: Hoare triple {41445#false} assume !false; {41445#false} is VALID [2020-07-17 22:26:17,497 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-17 22:26:17,497 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600600312] [2020-07-17 22:26:17,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:17,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:17,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463828666] [2020-07-17 22:26:17,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-17 22:26:17,499 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:17,499 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:17,534 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:17,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:17,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:17,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:17,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:17,536 INFO L87 Difference]: Start difference. First operand 1896 states and 2758 transitions. Second operand 3 states. [2020-07-17 22:26:18,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:18,436 INFO L93 Difference]: Finished difference Result 2844 states and 4120 transitions. [2020-07-17 22:26:18,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:18,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-17 22:26:18,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:18,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:18,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2020-07-17 22:26:18,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:18,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2020-07-17 22:26:18,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 171 transitions. [2020-07-17 22:26:18,627 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:18,769 INFO L225 Difference]: With dead ends: 2844 [2020-07-17 22:26:18,770 INFO L226 Difference]: Without dead ends: 1930 [2020-07-17 22:26:18,772 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-17 22:26:18,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2020-07-17 22:26:19,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1928. [2020-07-17 22:26:19,190 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:19,190 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1930 states. Second operand 1928 states. [2020-07-17 22:26:19,190 INFO L74 IsIncluded]: Start isIncluded. First operand 1930 states. Second operand 1928 states. [2020-07-17 22:26:19,190 INFO L87 Difference]: Start difference. First operand 1930 states. Second operand 1928 states. [2020-07-17 22:26:19,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:19,329 INFO L93 Difference]: Finished difference Result 1930 states and 2759 transitions. [2020-07-17 22:26:19,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 2759 transitions. [2020-07-17 22:26:19,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:19,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:19,332 INFO L74 IsIncluded]: Start isIncluded. First operand 1928 states. Second operand 1930 states. [2020-07-17 22:26:19,332 INFO L87 Difference]: Start difference. First operand 1928 states. Second operand 1930 states. [2020-07-17 22:26:19,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:19,447 INFO L93 Difference]: Finished difference Result 1930 states and 2759 transitions. [2020-07-17 22:26:19,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 2759 transitions. [2020-07-17 22:26:19,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:19,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:19,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:19,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:19,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2020-07-17 22:26:19,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2758 transitions. [2020-07-17 22:26:19,597 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2758 transitions. Word has length 26 [2020-07-17 22:26:19,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:19,597 INFO L479 AbstractCegarLoop]: Abstraction has 1928 states and 2758 transitions. [2020-07-17 22:26:19,598 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:19,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2758 transitions. [2020-07-17 22:26:19,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-17 22:26:19,599 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:19,599 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] [2020-07-17 22:26:19,600 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-07-17 22:26:19,600 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:19,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:19,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1709661294, now seen corresponding path program 1 times [2020-07-17 22:26:19,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:19,601 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109187238] [2020-07-17 22:26:19,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:19,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:19,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:19,638 INFO L280 TraceCheckUtils]: 0: Hoare triple {50257#true} assume true; {50257#true} is VALID [2020-07-17 22:26:19,638 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {50257#true} {50257#true} #197#return; {50257#true} is VALID [2020-07-17 22:26:19,639 INFO L263 TraceCheckUtils]: 0: Hoare triple {50257#true} call ULTIMATE.init(); {50257#true} is VALID [2020-07-17 22:26:19,639 INFO L280 TraceCheckUtils]: 1: Hoare triple {50257#true} assume true; {50257#true} is VALID [2020-07-17 22:26:19,639 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {50257#true} {50257#true} #197#return; {50257#true} is VALID [2020-07-17 22:26:19,640 INFO L263 TraceCheckUtils]: 3: Hoare triple {50257#true} call #t~ret11 := main(); {50257#true} is VALID [2020-07-17 22:26:19,640 INFO L280 TraceCheckUtils]: 4: Hoare triple {50257#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {50257#true} is VALID [2020-07-17 22:26:19,640 INFO L280 TraceCheckUtils]: 5: Hoare triple {50257#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {50257#true} is VALID [2020-07-17 22:26:19,640 INFO L280 TraceCheckUtils]: 6: Hoare triple {50257#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {50257#true} is VALID [2020-07-17 22:26:19,640 INFO L280 TraceCheckUtils]: 7: Hoare triple {50257#true} assume !(0 != ~p1~0); {50257#true} is VALID [2020-07-17 22:26:19,641 INFO L280 TraceCheckUtils]: 8: Hoare triple {50257#true} assume !(0 != ~p2~0); {50257#true} is VALID [2020-07-17 22:26:19,641 INFO L280 TraceCheckUtils]: 9: Hoare triple {50257#true} assume !(0 != ~p3~0); {50257#true} is VALID [2020-07-17 22:26:19,641 INFO L280 TraceCheckUtils]: 10: Hoare triple {50257#true} assume !(0 != ~p4~0); {50257#true} is VALID [2020-07-17 22:26:19,641 INFO L280 TraceCheckUtils]: 11: Hoare triple {50257#true} assume !(0 != ~p5~0); {50257#true} is VALID [2020-07-17 22:26:19,642 INFO L280 TraceCheckUtils]: 12: Hoare triple {50257#true} assume !(0 != ~p6~0); {50257#true} is VALID [2020-07-17 22:26:19,645 INFO L280 TraceCheckUtils]: 13: Hoare triple {50257#true} assume 0 != ~p7~0;~lk7~0 := 1; {50261#(= main_~lk7~0 1)} is VALID [2020-07-17 22:26:19,646 INFO L280 TraceCheckUtils]: 14: Hoare triple {50261#(= main_~lk7~0 1)} assume !(0 != ~p8~0); {50261#(= main_~lk7~0 1)} is VALID [2020-07-17 22:26:19,646 INFO L280 TraceCheckUtils]: 15: Hoare triple {50261#(= main_~lk7~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {50261#(= main_~lk7~0 1)} is VALID [2020-07-17 22:26:19,647 INFO L280 TraceCheckUtils]: 16: Hoare triple {50261#(= main_~lk7~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {50261#(= main_~lk7~0 1)} is VALID [2020-07-17 22:26:19,647 INFO L280 TraceCheckUtils]: 17: Hoare triple {50261#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {50261#(= main_~lk7~0 1)} is VALID [2020-07-17 22:26:19,648 INFO L280 TraceCheckUtils]: 18: Hoare triple {50261#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {50261#(= main_~lk7~0 1)} is VALID [2020-07-17 22:26:19,649 INFO L280 TraceCheckUtils]: 19: Hoare triple {50261#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {50261#(= main_~lk7~0 1)} is VALID [2020-07-17 22:26:19,649 INFO L280 TraceCheckUtils]: 20: Hoare triple {50261#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {50261#(= main_~lk7~0 1)} is VALID [2020-07-17 22:26:19,650 INFO L280 TraceCheckUtils]: 21: Hoare triple {50261#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {50261#(= main_~lk7~0 1)} is VALID [2020-07-17 22:26:19,650 INFO L280 TraceCheckUtils]: 22: Hoare triple {50261#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {50261#(= main_~lk7~0 1)} is VALID [2020-07-17 22:26:19,651 INFO L280 TraceCheckUtils]: 23: Hoare triple {50261#(= main_~lk7~0 1)} assume 0 != ~p7~0; {50261#(= main_~lk7~0 1)} is VALID [2020-07-17 22:26:19,651 INFO L280 TraceCheckUtils]: 24: Hoare triple {50261#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {50258#false} is VALID [2020-07-17 22:26:19,652 INFO L280 TraceCheckUtils]: 25: Hoare triple {50258#false} assume !false; {50258#false} is VALID [2020-07-17 22:26:19,652 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-17 22:26:19,653 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109187238] [2020-07-17 22:26:19,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:19,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:19,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926611679] [2020-07-17 22:26:19,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-17 22:26:19,655 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:19,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:19,683 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:19,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:19,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:19,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:19,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:19,684 INFO L87 Difference]: Start difference. First operand 1928 states and 2758 transitions. Second operand 3 states. [2020-07-17 22:26:20,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:20,934 INFO L93 Difference]: Finished difference Result 3340 states and 4872 transitions. [2020-07-17 22:26:20,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:20,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-17 22:26:20,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:20,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:20,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2020-07-17 22:26:20,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:20,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2020-07-17 22:26:20,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 106 transitions. [2020-07-17 22:26:21,057 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:21,506 INFO L225 Difference]: With dead ends: 3340 [2020-07-17 22:26:21,506 INFO L226 Difference]: Without dead ends: 3338 [2020-07-17 22:26:21,507 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-17 22:26:21,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2020-07-17 22:26:21,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 2824. [2020-07-17 22:26:21,928 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:21,928 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3338 states. Second operand 2824 states. [2020-07-17 22:26:21,929 INFO L74 IsIncluded]: Start isIncluded. First operand 3338 states. Second operand 2824 states. [2020-07-17 22:26:21,929 INFO L87 Difference]: Start difference. First operand 3338 states. Second operand 2824 states. [2020-07-17 22:26:22,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:22,283 INFO L93 Difference]: Finished difference Result 3338 states and 4807 transitions. [2020-07-17 22:26:22,283 INFO L276 IsEmpty]: Start isEmpty. Operand 3338 states and 4807 transitions. [2020-07-17 22:26:22,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:22,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:22,287 INFO L74 IsIncluded]: Start isIncluded. First operand 2824 states. Second operand 3338 states. [2020-07-17 22:26:22,287 INFO L87 Difference]: Start difference. First operand 2824 states. Second operand 3338 states. [2020-07-17 22:26:22,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:22,646 INFO L93 Difference]: Finished difference Result 3338 states and 4807 transitions. [2020-07-17 22:26:22,646 INFO L276 IsEmpty]: Start isEmpty. Operand 3338 states and 4807 transitions. [2020-07-17 22:26:22,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:22,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:22,650 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:22,650 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:22,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2824 states. [2020-07-17 22:26:22,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2824 states to 2824 states and 3910 transitions. [2020-07-17 22:26:22,928 INFO L78 Accepts]: Start accepts. Automaton has 2824 states and 3910 transitions. Word has length 26 [2020-07-17 22:26:22,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:22,929 INFO L479 AbstractCegarLoop]: Abstraction has 2824 states and 3910 transitions. [2020-07-17 22:26:22,929 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:22,929 INFO L276 IsEmpty]: Start isEmpty. Operand 2824 states and 3910 transitions. [2020-07-17 22:26:22,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-17 22:26:22,931 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:22,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] [2020-07-17 22:26:22,931 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-07-17 22:26:22,932 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:22,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:22,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1998499988, now seen corresponding path program 1 times [2020-07-17 22:26:22,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:22,933 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495723787] [2020-07-17 22:26:22,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:22,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:22,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:22,964 INFO L280 TraceCheckUtils]: 0: Hoare triple {63310#true} assume true; {63310#true} is VALID [2020-07-17 22:26:22,965 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {63310#true} {63310#true} #197#return; {63310#true} is VALID [2020-07-17 22:26:22,965 INFO L263 TraceCheckUtils]: 0: Hoare triple {63310#true} call ULTIMATE.init(); {63310#true} is VALID [2020-07-17 22:26:22,965 INFO L280 TraceCheckUtils]: 1: Hoare triple {63310#true} assume true; {63310#true} is VALID [2020-07-17 22:26:22,965 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {63310#true} {63310#true} #197#return; {63310#true} is VALID [2020-07-17 22:26:22,966 INFO L263 TraceCheckUtils]: 3: Hoare triple {63310#true} call #t~ret11 := main(); {63310#true} is VALID [2020-07-17 22:26:22,966 INFO L280 TraceCheckUtils]: 4: Hoare triple {63310#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {63310#true} is VALID [2020-07-17 22:26:22,966 INFO L280 TraceCheckUtils]: 5: Hoare triple {63310#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {63310#true} is VALID [2020-07-17 22:26:22,966 INFO L280 TraceCheckUtils]: 6: Hoare triple {63310#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {63310#true} is VALID [2020-07-17 22:26:22,966 INFO L280 TraceCheckUtils]: 7: Hoare triple {63310#true} assume !(0 != ~p1~0); {63310#true} is VALID [2020-07-17 22:26:22,967 INFO L280 TraceCheckUtils]: 8: Hoare triple {63310#true} assume !(0 != ~p2~0); {63310#true} is VALID [2020-07-17 22:26:22,967 INFO L280 TraceCheckUtils]: 9: Hoare triple {63310#true} assume !(0 != ~p3~0); {63310#true} is VALID [2020-07-17 22:26:22,967 INFO L280 TraceCheckUtils]: 10: Hoare triple {63310#true} assume !(0 != ~p4~0); {63310#true} is VALID [2020-07-17 22:26:22,967 INFO L280 TraceCheckUtils]: 11: Hoare triple {63310#true} assume !(0 != ~p5~0); {63310#true} is VALID [2020-07-17 22:26:22,968 INFO L280 TraceCheckUtils]: 12: Hoare triple {63310#true} assume !(0 != ~p6~0); {63310#true} is VALID [2020-07-17 22:26:22,969 INFO L280 TraceCheckUtils]: 13: Hoare triple {63310#true} assume !(0 != ~p7~0); {63314#(= 0 main_~p7~0)} is VALID [2020-07-17 22:26:22,969 INFO L280 TraceCheckUtils]: 14: Hoare triple {63314#(= 0 main_~p7~0)} assume !(0 != ~p8~0); {63314#(= 0 main_~p7~0)} is VALID [2020-07-17 22:26:22,970 INFO L280 TraceCheckUtils]: 15: Hoare triple {63314#(= 0 main_~p7~0)} assume 0 != ~p9~0;~lk9~0 := 1; {63314#(= 0 main_~p7~0)} is VALID [2020-07-17 22:26:22,970 INFO L280 TraceCheckUtils]: 16: Hoare triple {63314#(= 0 main_~p7~0)} assume 0 != ~p10~0;~lk10~0 := 1; {63314#(= 0 main_~p7~0)} is VALID [2020-07-17 22:26:22,971 INFO L280 TraceCheckUtils]: 17: Hoare triple {63314#(= 0 main_~p7~0)} assume !(0 != ~p1~0); {63314#(= 0 main_~p7~0)} is VALID [2020-07-17 22:26:22,971 INFO L280 TraceCheckUtils]: 18: Hoare triple {63314#(= 0 main_~p7~0)} assume !(0 != ~p2~0); {63314#(= 0 main_~p7~0)} is VALID [2020-07-17 22:26:22,972 INFO L280 TraceCheckUtils]: 19: Hoare triple {63314#(= 0 main_~p7~0)} assume !(0 != ~p3~0); {63314#(= 0 main_~p7~0)} is VALID [2020-07-17 22:26:22,973 INFO L280 TraceCheckUtils]: 20: Hoare triple {63314#(= 0 main_~p7~0)} assume !(0 != ~p4~0); {63314#(= 0 main_~p7~0)} is VALID [2020-07-17 22:26:22,973 INFO L280 TraceCheckUtils]: 21: Hoare triple {63314#(= 0 main_~p7~0)} assume !(0 != ~p5~0); {63314#(= 0 main_~p7~0)} is VALID [2020-07-17 22:26:22,974 INFO L280 TraceCheckUtils]: 22: Hoare triple {63314#(= 0 main_~p7~0)} assume !(0 != ~p6~0); {63314#(= 0 main_~p7~0)} is VALID [2020-07-17 22:26:22,974 INFO L280 TraceCheckUtils]: 23: Hoare triple {63314#(= 0 main_~p7~0)} assume 0 != ~p7~0; {63311#false} is VALID [2020-07-17 22:26:22,974 INFO L280 TraceCheckUtils]: 24: Hoare triple {63311#false} assume 1 != ~lk7~0; {63311#false} is VALID [2020-07-17 22:26:22,975 INFO L280 TraceCheckUtils]: 25: Hoare triple {63311#false} assume !false; {63311#false} is VALID [2020-07-17 22:26:22,975 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-17 22:26:22,976 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495723787] [2020-07-17 22:26:22,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:22,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:22,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477508186] [2020-07-17 22:26:22,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-17 22:26:22,977 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:22,977 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:23,001 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:23,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:23,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:23,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:23,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:23,003 INFO L87 Difference]: Start difference. First operand 2824 states and 3910 transitions. Second operand 3 states. [2020-07-17 22:26:25,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:25,323 INFO L93 Difference]: Finished difference Result 6476 states and 8968 transitions. [2020-07-17 22:26:25,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:25,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-17 22:26:25,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:25,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:25,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 173 transitions. [2020-07-17 22:26:25,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:25,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 173 transitions. [2020-07-17 22:26:25,327 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 173 transitions. [2020-07-17 22:26:25,515 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:26,047 INFO L225 Difference]: With dead ends: 6476 [2020-07-17 22:26:26,048 INFO L226 Difference]: Without dead ends: 3722 [2020-07-17 22:26:26,054 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-17 22:26:26,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2020-07-17 22:26:26,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3720. [2020-07-17 22:26:26,916 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:26,917 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3722 states. Second operand 3720 states. [2020-07-17 22:26:26,917 INFO L74 IsIncluded]: Start isIncluded. First operand 3722 states. Second operand 3720 states. [2020-07-17 22:26:26,917 INFO L87 Difference]: Start difference. First operand 3722 states. Second operand 3720 states. [2020-07-17 22:26:27,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:27,357 INFO L93 Difference]: Finished difference Result 3722 states and 5063 transitions. [2020-07-17 22:26:27,357 INFO L276 IsEmpty]: Start isEmpty. Operand 3722 states and 5063 transitions. [2020-07-17 22:26:27,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:27,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:27,361 INFO L74 IsIncluded]: Start isIncluded. First operand 3720 states. Second operand 3722 states. [2020-07-17 22:26:27,361 INFO L87 Difference]: Start difference. First operand 3720 states. Second operand 3722 states. [2020-07-17 22:26:27,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:27,837 INFO L93 Difference]: Finished difference Result 3722 states and 5063 transitions. [2020-07-17 22:26:27,838 INFO L276 IsEmpty]: Start isEmpty. Operand 3722 states and 5063 transitions. [2020-07-17 22:26:27,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:27,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:27,842 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:27,842 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:27,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3720 states. [2020-07-17 22:26:28,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3720 states to 3720 states and 5062 transitions. [2020-07-17 22:26:28,290 INFO L78 Accepts]: Start accepts. Automaton has 3720 states and 5062 transitions. Word has length 26 [2020-07-17 22:26:28,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:28,290 INFO L479 AbstractCegarLoop]: Abstraction has 3720 states and 5062 transitions. [2020-07-17 22:26:28,290 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:28,290 INFO L276 IsEmpty]: Start isEmpty. Operand 3720 states and 5062 transitions. [2020-07-17 22:26:28,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-17 22:26:28,293 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:28,294 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] [2020-07-17 22:26:28,294 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-07-17 22:26:28,294 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:28,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:28,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1459677136, now seen corresponding path program 1 times [2020-07-17 22:26:28,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:28,295 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382824614] [2020-07-17 22:26:28,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:28,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:28,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:28,324 INFO L280 TraceCheckUtils]: 0: Hoare triple {81291#true} assume true; {81291#true} is VALID [2020-07-17 22:26:28,324 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {81291#true} {81291#true} #197#return; {81291#true} is VALID [2020-07-17 22:26:28,325 INFO L263 TraceCheckUtils]: 0: Hoare triple {81291#true} call ULTIMATE.init(); {81291#true} is VALID [2020-07-17 22:26:28,325 INFO L280 TraceCheckUtils]: 1: Hoare triple {81291#true} assume true; {81291#true} is VALID [2020-07-17 22:26:28,325 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {81291#true} {81291#true} #197#return; {81291#true} is VALID [2020-07-17 22:26:28,325 INFO L263 TraceCheckUtils]: 3: Hoare triple {81291#true} call #t~ret11 := main(); {81291#true} is VALID [2020-07-17 22:26:28,325 INFO L280 TraceCheckUtils]: 4: Hoare triple {81291#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {81291#true} is VALID [2020-07-17 22:26:28,325 INFO L280 TraceCheckUtils]: 5: Hoare triple {81291#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {81291#true} is VALID [2020-07-17 22:26:28,326 INFO L280 TraceCheckUtils]: 6: Hoare triple {81291#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {81291#true} is VALID [2020-07-17 22:26:28,326 INFO L280 TraceCheckUtils]: 7: Hoare triple {81291#true} assume !(0 != ~p1~0); {81291#true} is VALID [2020-07-17 22:26:28,326 INFO L280 TraceCheckUtils]: 8: Hoare triple {81291#true} assume !(0 != ~p2~0); {81291#true} is VALID [2020-07-17 22:26:28,326 INFO L280 TraceCheckUtils]: 9: Hoare triple {81291#true} assume !(0 != ~p3~0); {81291#true} is VALID [2020-07-17 22:26:28,327 INFO L280 TraceCheckUtils]: 10: Hoare triple {81291#true} assume !(0 != ~p4~0); {81291#true} is VALID [2020-07-17 22:26:28,327 INFO L280 TraceCheckUtils]: 11: Hoare triple {81291#true} assume !(0 != ~p5~0); {81291#true} is VALID [2020-07-17 22:26:28,327 INFO L280 TraceCheckUtils]: 12: Hoare triple {81291#true} assume !(0 != ~p6~0); {81291#true} is VALID [2020-07-17 22:26:28,333 INFO L280 TraceCheckUtils]: 13: Hoare triple {81291#true} assume 0 != ~p7~0;~lk7~0 := 1; {81295#(not (= 0 main_~p7~0))} is VALID [2020-07-17 22:26:28,334 INFO L280 TraceCheckUtils]: 14: Hoare triple {81295#(not (= 0 main_~p7~0))} assume !(0 != ~p8~0); {81295#(not (= 0 main_~p7~0))} is VALID [2020-07-17 22:26:28,334 INFO L280 TraceCheckUtils]: 15: Hoare triple {81295#(not (= 0 main_~p7~0))} assume 0 != ~p9~0;~lk9~0 := 1; {81295#(not (= 0 main_~p7~0))} is VALID [2020-07-17 22:26:28,335 INFO L280 TraceCheckUtils]: 16: Hoare triple {81295#(not (= 0 main_~p7~0))} assume 0 != ~p10~0;~lk10~0 := 1; {81295#(not (= 0 main_~p7~0))} is VALID [2020-07-17 22:26:28,335 INFO L280 TraceCheckUtils]: 17: Hoare triple {81295#(not (= 0 main_~p7~0))} assume !(0 != ~p1~0); {81295#(not (= 0 main_~p7~0))} is VALID [2020-07-17 22:26:28,336 INFO L280 TraceCheckUtils]: 18: Hoare triple {81295#(not (= 0 main_~p7~0))} assume !(0 != ~p2~0); {81295#(not (= 0 main_~p7~0))} is VALID [2020-07-17 22:26:28,336 INFO L280 TraceCheckUtils]: 19: Hoare triple {81295#(not (= 0 main_~p7~0))} assume !(0 != ~p3~0); {81295#(not (= 0 main_~p7~0))} is VALID [2020-07-17 22:26:28,337 INFO L280 TraceCheckUtils]: 20: Hoare triple {81295#(not (= 0 main_~p7~0))} assume !(0 != ~p4~0); {81295#(not (= 0 main_~p7~0))} is VALID [2020-07-17 22:26:28,337 INFO L280 TraceCheckUtils]: 21: Hoare triple {81295#(not (= 0 main_~p7~0))} assume !(0 != ~p5~0); {81295#(not (= 0 main_~p7~0))} is VALID [2020-07-17 22:26:28,338 INFO L280 TraceCheckUtils]: 22: Hoare triple {81295#(not (= 0 main_~p7~0))} assume !(0 != ~p6~0); {81295#(not (= 0 main_~p7~0))} is VALID [2020-07-17 22:26:28,338 INFO L280 TraceCheckUtils]: 23: Hoare triple {81295#(not (= 0 main_~p7~0))} assume !(0 != ~p7~0); {81292#false} is VALID [2020-07-17 22:26:28,339 INFO L280 TraceCheckUtils]: 24: Hoare triple {81292#false} assume 0 != ~p8~0; {81292#false} is VALID [2020-07-17 22:26:28,339 INFO L280 TraceCheckUtils]: 25: Hoare triple {81292#false} assume 1 != ~lk8~0; {81292#false} is VALID [2020-07-17 22:26:28,339 INFO L280 TraceCheckUtils]: 26: Hoare triple {81292#false} assume !false; {81292#false} is VALID [2020-07-17 22:26:28,340 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-17 22:26:28,340 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382824614] [2020-07-17 22:26:28,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:28,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:28,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819555863] [2020-07-17 22:26:28,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-07-17 22:26:28,342 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:28,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:28,369 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:28,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:28,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:28,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:28,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:28,370 INFO L87 Difference]: Start difference. First operand 3720 states and 5062 transitions. Second operand 3 states. [2020-07-17 22:26:30,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:30,423 INFO L93 Difference]: Finished difference Result 5580 states and 7560 transitions. [2020-07-17 22:26:30,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:30,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-07-17 22:26:30,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:30,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:30,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2020-07-17 22:26:30,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:30,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2020-07-17 22:26:30,427 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 168 transitions. [2020-07-17 22:26:30,668 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:31,256 INFO L225 Difference]: With dead ends: 5580 [2020-07-17 22:26:31,256 INFO L226 Difference]: Without dead ends: 3786 [2020-07-17 22:26:31,261 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-17 22:26:31,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3786 states. [2020-07-17 22:26:32,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3786 to 3784. [2020-07-17 22:26:32,083 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:32,083 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3786 states. Second operand 3784 states. [2020-07-17 22:26:32,083 INFO L74 IsIncluded]: Start isIncluded. First operand 3786 states. Second operand 3784 states. [2020-07-17 22:26:32,083 INFO L87 Difference]: Start difference. First operand 3786 states. Second operand 3784 states. [2020-07-17 22:26:32,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:32,533 INFO L93 Difference]: Finished difference Result 3786 states and 5063 transitions. [2020-07-17 22:26:32,533 INFO L276 IsEmpty]: Start isEmpty. Operand 3786 states and 5063 transitions. [2020-07-17 22:26:32,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:32,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:32,537 INFO L74 IsIncluded]: Start isIncluded. First operand 3784 states. Second operand 3786 states. [2020-07-17 22:26:32,537 INFO L87 Difference]: Start difference. First operand 3784 states. Second operand 3786 states. [2020-07-17 22:26:33,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:33,001 INFO L93 Difference]: Finished difference Result 3786 states and 5063 transitions. [2020-07-17 22:26:33,001 INFO L276 IsEmpty]: Start isEmpty. Operand 3786 states and 5063 transitions. [2020-07-17 22:26:33,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:33,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:33,006 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:33,006 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:33,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2020-07-17 22:26:33,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5062 transitions. [2020-07-17 22:26:33,529 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5062 transitions. Word has length 27 [2020-07-17 22:26:33,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:33,529 INFO L479 AbstractCegarLoop]: Abstraction has 3784 states and 5062 transitions. [2020-07-17 22:26:33,529 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:33,529 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5062 transitions. [2020-07-17 22:26:33,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-17 22:26:33,532 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:33,532 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] [2020-07-17 22:26:33,532 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-07-17 22:26:33,533 INFO L427 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:33,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:33,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1824172910, now seen corresponding path program 1 times [2020-07-17 22:26:33,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:33,534 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211618410] [2020-07-17 22:26:33,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:33,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:33,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:33,591 INFO L280 TraceCheckUtils]: 0: Hoare triple {98568#true} assume true; {98568#true} is VALID [2020-07-17 22:26:33,592 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {98568#true} {98568#true} #197#return; {98568#true} is VALID [2020-07-17 22:26:33,592 INFO L263 TraceCheckUtils]: 0: Hoare triple {98568#true} call ULTIMATE.init(); {98568#true} is VALID [2020-07-17 22:26:33,592 INFO L280 TraceCheckUtils]: 1: Hoare triple {98568#true} assume true; {98568#true} is VALID [2020-07-17 22:26:33,593 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {98568#true} {98568#true} #197#return; {98568#true} is VALID [2020-07-17 22:26:33,593 INFO L263 TraceCheckUtils]: 3: Hoare triple {98568#true} call #t~ret11 := main(); {98568#true} is VALID [2020-07-17 22:26:33,593 INFO L280 TraceCheckUtils]: 4: Hoare triple {98568#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {98568#true} is VALID [2020-07-17 22:26:33,594 INFO L280 TraceCheckUtils]: 5: Hoare triple {98568#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {98568#true} is VALID [2020-07-17 22:26:33,594 INFO L280 TraceCheckUtils]: 6: Hoare triple {98568#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {98568#true} is VALID [2020-07-17 22:26:33,594 INFO L280 TraceCheckUtils]: 7: Hoare triple {98568#true} assume !(0 != ~p1~0); {98568#true} is VALID [2020-07-17 22:26:33,594 INFO L280 TraceCheckUtils]: 8: Hoare triple {98568#true} assume !(0 != ~p2~0); {98568#true} is VALID [2020-07-17 22:26:33,595 INFO L280 TraceCheckUtils]: 9: Hoare triple {98568#true} assume !(0 != ~p3~0); {98568#true} is VALID [2020-07-17 22:26:33,595 INFO L280 TraceCheckUtils]: 10: Hoare triple {98568#true} assume !(0 != ~p4~0); {98568#true} is VALID [2020-07-17 22:26:33,595 INFO L280 TraceCheckUtils]: 11: Hoare triple {98568#true} assume !(0 != ~p5~0); {98568#true} is VALID [2020-07-17 22:26:33,595 INFO L280 TraceCheckUtils]: 12: Hoare triple {98568#true} assume !(0 != ~p6~0); {98568#true} is VALID [2020-07-17 22:26:33,596 INFO L280 TraceCheckUtils]: 13: Hoare triple {98568#true} assume !(0 != ~p7~0); {98568#true} is VALID [2020-07-17 22:26:33,597 INFO L280 TraceCheckUtils]: 14: Hoare triple {98568#true} assume !(0 != ~p8~0); {98572#(= 0 main_~p8~0)} is VALID [2020-07-17 22:26:33,598 INFO L280 TraceCheckUtils]: 15: Hoare triple {98572#(= 0 main_~p8~0)} assume 0 != ~p9~0;~lk9~0 := 1; {98572#(= 0 main_~p8~0)} is VALID [2020-07-17 22:26:33,598 INFO L280 TraceCheckUtils]: 16: Hoare triple {98572#(= 0 main_~p8~0)} assume 0 != ~p10~0;~lk10~0 := 1; {98572#(= 0 main_~p8~0)} is VALID [2020-07-17 22:26:33,599 INFO L280 TraceCheckUtils]: 17: Hoare triple {98572#(= 0 main_~p8~0)} assume !(0 != ~p1~0); {98572#(= 0 main_~p8~0)} is VALID [2020-07-17 22:26:33,600 INFO L280 TraceCheckUtils]: 18: Hoare triple {98572#(= 0 main_~p8~0)} assume !(0 != ~p2~0); {98572#(= 0 main_~p8~0)} is VALID [2020-07-17 22:26:33,601 INFO L280 TraceCheckUtils]: 19: Hoare triple {98572#(= 0 main_~p8~0)} assume !(0 != ~p3~0); {98572#(= 0 main_~p8~0)} is VALID [2020-07-17 22:26:33,601 INFO L280 TraceCheckUtils]: 20: Hoare triple {98572#(= 0 main_~p8~0)} assume !(0 != ~p4~0); {98572#(= 0 main_~p8~0)} is VALID [2020-07-17 22:26:33,602 INFO L280 TraceCheckUtils]: 21: Hoare triple {98572#(= 0 main_~p8~0)} assume !(0 != ~p5~0); {98572#(= 0 main_~p8~0)} is VALID [2020-07-17 22:26:33,602 INFO L280 TraceCheckUtils]: 22: Hoare triple {98572#(= 0 main_~p8~0)} assume !(0 != ~p6~0); {98572#(= 0 main_~p8~0)} is VALID [2020-07-17 22:26:33,603 INFO L280 TraceCheckUtils]: 23: Hoare triple {98572#(= 0 main_~p8~0)} assume !(0 != ~p7~0); {98572#(= 0 main_~p8~0)} is VALID [2020-07-17 22:26:33,603 INFO L280 TraceCheckUtils]: 24: Hoare triple {98572#(= 0 main_~p8~0)} assume 0 != ~p8~0; {98569#false} is VALID [2020-07-17 22:26:33,604 INFO L280 TraceCheckUtils]: 25: Hoare triple {98569#false} assume 1 != ~lk8~0; {98569#false} is VALID [2020-07-17 22:26:33,604 INFO L280 TraceCheckUtils]: 26: Hoare triple {98569#false} assume !false; {98569#false} is VALID [2020-07-17 22:26:33,605 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-17 22:26:33,606 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211618410] [2020-07-17 22:26:33,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:33,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:33,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920626607] [2020-07-17 22:26:33,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-07-17 22:26:33,607 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:33,608 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:33,639 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:33,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:33,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:33,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:33,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:33,640 INFO L87 Difference]: Start difference. First operand 3784 states and 5062 transitions. Second operand 3 states. [2020-07-17 22:26:39,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:39,066 INFO L93 Difference]: Finished difference Result 10956 states and 14408 transitions. [2020-07-17 22:26:39,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:39,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-07-17 22:26:39,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:39,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:39,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2020-07-17 22:26:39,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:39,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2020-07-17 22:26:39,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 171 transitions. [2020-07-17 22:26:39,263 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:41,292 INFO L225 Difference]: With dead ends: 10956 [2020-07-17 22:26:41,293 INFO L226 Difference]: Without dead ends: 7306 [2020-07-17 22:26:41,298 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-17 22:26:41,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7306 states. [2020-07-17 22:26:43,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7306 to 7304. [2020-07-17 22:26:43,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:43,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7306 states. Second operand 7304 states. [2020-07-17 22:26:43,099 INFO L74 IsIncluded]: Start isIncluded. First operand 7306 states. Second operand 7304 states. [2020-07-17 22:26:43,100 INFO L87 Difference]: Start difference. First operand 7306 states. Second operand 7304 states. [2020-07-17 22:26:44,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:44,975 INFO L93 Difference]: Finished difference Result 7306 states and 9351 transitions. [2020-07-17 22:26:44,975 INFO L276 IsEmpty]: Start isEmpty. Operand 7306 states and 9351 transitions. [2020-07-17 22:26:44,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:44,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:44,985 INFO L74 IsIncluded]: Start isIncluded. First operand 7304 states. Second operand 7306 states. [2020-07-17 22:26:44,985 INFO L87 Difference]: Start difference. First operand 7304 states. Second operand 7306 states. [2020-07-17 22:26:46,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:46,858 INFO L93 Difference]: Finished difference Result 7306 states and 9351 transitions. [2020-07-17 22:26:46,858 INFO L276 IsEmpty]: Start isEmpty. Operand 7306 states and 9351 transitions. [2020-07-17 22:26:46,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:46,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:46,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:46,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:46,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7304 states. [2020-07-17 22:26:48,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7304 states to 7304 states and 9350 transitions. [2020-07-17 22:26:48,652 INFO L78 Accepts]: Start accepts. Automaton has 7304 states and 9350 transitions. Word has length 27 [2020-07-17 22:26:48,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:48,652 INFO L479 AbstractCegarLoop]: Abstraction has 7304 states and 9350 transitions. [2020-07-17 22:26:48,652 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:48,653 INFO L276 IsEmpty]: Start isEmpty. Operand 7304 states and 9350 transitions. [2020-07-17 22:26:48,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-17 22:26:48,657 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:48,657 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] [2020-07-17 22:26:48,657 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-07-17 22:26:48,657 INFO L427 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:48,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:48,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1883988372, now seen corresponding path program 1 times [2020-07-17 22:26:48,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:48,658 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545326458] [2020-07-17 22:26:48,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:48,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:48,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:48,688 INFO L280 TraceCheckUtils]: 0: Hoare triple {132101#true} assume true; {132101#true} is VALID [2020-07-17 22:26:48,688 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {132101#true} {132101#true} #197#return; {132101#true} is VALID [2020-07-17 22:26:48,688 INFO L263 TraceCheckUtils]: 0: Hoare triple {132101#true} call ULTIMATE.init(); {132101#true} is VALID [2020-07-17 22:26:48,688 INFO L280 TraceCheckUtils]: 1: Hoare triple {132101#true} assume true; {132101#true} is VALID [2020-07-17 22:26:48,689 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {132101#true} {132101#true} #197#return; {132101#true} is VALID [2020-07-17 22:26:48,689 INFO L263 TraceCheckUtils]: 3: Hoare triple {132101#true} call #t~ret11 := main(); {132101#true} is VALID [2020-07-17 22:26:48,689 INFO L280 TraceCheckUtils]: 4: Hoare triple {132101#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {132101#true} is VALID [2020-07-17 22:26:48,689 INFO L280 TraceCheckUtils]: 5: Hoare triple {132101#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {132101#true} is VALID [2020-07-17 22:26:48,689 INFO L280 TraceCheckUtils]: 6: Hoare triple {132101#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {132101#true} is VALID [2020-07-17 22:26:48,690 INFO L280 TraceCheckUtils]: 7: Hoare triple {132101#true} assume !(0 != ~p1~0); {132101#true} is VALID [2020-07-17 22:26:48,690 INFO L280 TraceCheckUtils]: 8: Hoare triple {132101#true} assume !(0 != ~p2~0); {132101#true} is VALID [2020-07-17 22:26:48,690 INFO L280 TraceCheckUtils]: 9: Hoare triple {132101#true} assume !(0 != ~p3~0); {132101#true} is VALID [2020-07-17 22:26:48,690 INFO L280 TraceCheckUtils]: 10: Hoare triple {132101#true} assume !(0 != ~p4~0); {132101#true} is VALID [2020-07-17 22:26:48,690 INFO L280 TraceCheckUtils]: 11: Hoare triple {132101#true} assume !(0 != ~p5~0); {132101#true} is VALID [2020-07-17 22:26:48,691 INFO L280 TraceCheckUtils]: 12: Hoare triple {132101#true} assume !(0 != ~p6~0); {132101#true} is VALID [2020-07-17 22:26:48,691 INFO L280 TraceCheckUtils]: 13: Hoare triple {132101#true} assume !(0 != ~p7~0); {132101#true} is VALID [2020-07-17 22:26:48,691 INFO L280 TraceCheckUtils]: 14: Hoare triple {132101#true} assume 0 != ~p8~0;~lk8~0 := 1; {132105#(= 1 main_~lk8~0)} is VALID [2020-07-17 22:26:48,692 INFO L280 TraceCheckUtils]: 15: Hoare triple {132105#(= 1 main_~lk8~0)} assume 0 != ~p9~0;~lk9~0 := 1; {132105#(= 1 main_~lk8~0)} is VALID [2020-07-17 22:26:48,693 INFO L280 TraceCheckUtils]: 16: Hoare triple {132105#(= 1 main_~lk8~0)} assume 0 != ~p10~0;~lk10~0 := 1; {132105#(= 1 main_~lk8~0)} is VALID [2020-07-17 22:26:48,693 INFO L280 TraceCheckUtils]: 17: Hoare triple {132105#(= 1 main_~lk8~0)} assume !(0 != ~p1~0); {132105#(= 1 main_~lk8~0)} is VALID [2020-07-17 22:26:48,694 INFO L280 TraceCheckUtils]: 18: Hoare triple {132105#(= 1 main_~lk8~0)} assume !(0 != ~p2~0); {132105#(= 1 main_~lk8~0)} is VALID [2020-07-17 22:26:48,694 INFO L280 TraceCheckUtils]: 19: Hoare triple {132105#(= 1 main_~lk8~0)} assume !(0 != ~p3~0); {132105#(= 1 main_~lk8~0)} is VALID [2020-07-17 22:26:48,695 INFO L280 TraceCheckUtils]: 20: Hoare triple {132105#(= 1 main_~lk8~0)} assume !(0 != ~p4~0); {132105#(= 1 main_~lk8~0)} is VALID [2020-07-17 22:26:48,695 INFO L280 TraceCheckUtils]: 21: Hoare triple {132105#(= 1 main_~lk8~0)} assume !(0 != ~p5~0); {132105#(= 1 main_~lk8~0)} is VALID [2020-07-17 22:26:48,696 INFO L280 TraceCheckUtils]: 22: Hoare triple {132105#(= 1 main_~lk8~0)} assume !(0 != ~p6~0); {132105#(= 1 main_~lk8~0)} is VALID [2020-07-17 22:26:48,696 INFO L280 TraceCheckUtils]: 23: Hoare triple {132105#(= 1 main_~lk8~0)} assume !(0 != ~p7~0); {132105#(= 1 main_~lk8~0)} is VALID [2020-07-17 22:26:48,697 INFO L280 TraceCheckUtils]: 24: Hoare triple {132105#(= 1 main_~lk8~0)} assume 0 != ~p8~0; {132105#(= 1 main_~lk8~0)} is VALID [2020-07-17 22:26:48,697 INFO L280 TraceCheckUtils]: 25: Hoare triple {132105#(= 1 main_~lk8~0)} assume 1 != ~lk8~0; {132102#false} is VALID [2020-07-17 22:26:48,697 INFO L280 TraceCheckUtils]: 26: Hoare triple {132102#false} assume !false; {132102#false} is VALID [2020-07-17 22:26:48,698 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-17 22:26:48,699 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545326458] [2020-07-17 22:26:48,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:48,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:48,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350668403] [2020-07-17 22:26:48,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-07-17 22:26:48,700 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:48,700 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:48,730 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:48,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:48,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:48,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:48,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:48,732 INFO L87 Difference]: Start difference. First operand 7304 states and 9350 transitions. Second operand 3 states. [2020-07-17 22:26:53,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:53,756 INFO L93 Difference]: Finished difference Result 8076 states and 10632 transitions. [2020-07-17 22:26:53,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:53,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-07-17 22:26:53,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:53,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:53,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2020-07-17 22:26:53,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:53,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2020-07-17 22:26:53,759 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 99 transitions. [2020-07-17 22:26:53,865 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:56,538 INFO L225 Difference]: With dead ends: 8076 [2020-07-17 22:26:56,538 INFO L226 Difference]: Without dead ends: 8074 [2020-07-17 22:26:56,542 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-17 22:26:56,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8074 states. [2020-07-17 22:26:58,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8074 to 7304. [2020-07-17 22:26:58,415 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:58,415 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8074 states. Second operand 7304 states. [2020-07-17 22:26:58,416 INFO L74 IsIncluded]: Start isIncluded. First operand 8074 states. Second operand 7304 states. [2020-07-17 22:26:58,416 INFO L87 Difference]: Start difference. First operand 8074 states. Second operand 7304 states. [2020-07-17 22:27:00,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:00,860 INFO L93 Difference]: Finished difference Result 8074 states and 10503 transitions. [2020-07-17 22:27:00,861 INFO L276 IsEmpty]: Start isEmpty. Operand 8074 states and 10503 transitions. [2020-07-17 22:27:00,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:27:00,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:27:00,868 INFO L74 IsIncluded]: Start isIncluded. First operand 7304 states. Second operand 8074 states. [2020-07-17 22:27:00,868 INFO L87 Difference]: Start difference. First operand 7304 states. Second operand 8074 states. [2020-07-17 22:27:03,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:03,238 INFO L93 Difference]: Finished difference Result 8074 states and 10503 transitions. [2020-07-17 22:27:03,238 INFO L276 IsEmpty]: Start isEmpty. Operand 8074 states and 10503 transitions. [2020-07-17 22:27:03,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:27:03,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:27:03,246 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:27:03,246 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:27:03,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7304 states. [2020-07-17 22:27:05,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7304 states to 7304 states and 9222 transitions. [2020-07-17 22:27:05,160 INFO L78 Accepts]: Start accepts. Automaton has 7304 states and 9222 transitions. Word has length 27 [2020-07-17 22:27:05,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:27:05,161 INFO L479 AbstractCegarLoop]: Abstraction has 7304 states and 9222 transitions. [2020-07-17 22:27:05,161 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:27:05,161 INFO L276 IsEmpty]: Start isEmpty. Operand 7304 states and 9222 transitions. [2020-07-17 22:27:05,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-17 22:27:05,165 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:27:05,165 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] [2020-07-17 22:27:05,165 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-07-17 22:27:05,165 INFO L427 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:27:05,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:27:05,166 INFO L82 PathProgramCache]: Analyzing trace with hash 715001129, now seen corresponding path program 1 times [2020-07-17 22:27:05,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:27:05,166 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999815945] [2020-07-17 22:27:05,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:27:05,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:05,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:05,199 INFO L280 TraceCheckUtils]: 0: Hoare triple {164290#true} assume true; {164290#true} is VALID [2020-07-17 22:27:05,199 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {164290#true} {164290#true} #197#return; {164290#true} is VALID [2020-07-17 22:27:05,199 INFO L263 TraceCheckUtils]: 0: Hoare triple {164290#true} call ULTIMATE.init(); {164290#true} is VALID [2020-07-17 22:27:05,199 INFO L280 TraceCheckUtils]: 1: Hoare triple {164290#true} assume true; {164290#true} is VALID [2020-07-17 22:27:05,200 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {164290#true} {164290#true} #197#return; {164290#true} is VALID [2020-07-17 22:27:05,200 INFO L263 TraceCheckUtils]: 3: Hoare triple {164290#true} call #t~ret11 := main(); {164290#true} is VALID [2020-07-17 22:27:05,200 INFO L280 TraceCheckUtils]: 4: Hoare triple {164290#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {164290#true} is VALID [2020-07-17 22:27:05,200 INFO L280 TraceCheckUtils]: 5: Hoare triple {164290#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {164290#true} is VALID [2020-07-17 22:27:05,200 INFO L280 TraceCheckUtils]: 6: Hoare triple {164290#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {164290#true} is VALID [2020-07-17 22:27:05,200 INFO L280 TraceCheckUtils]: 7: Hoare triple {164290#true} assume !(0 != ~p1~0); {164290#true} is VALID [2020-07-17 22:27:05,200 INFO L280 TraceCheckUtils]: 8: Hoare triple {164290#true} assume !(0 != ~p2~0); {164290#true} is VALID [2020-07-17 22:27:05,201 INFO L280 TraceCheckUtils]: 9: Hoare triple {164290#true} assume !(0 != ~p3~0); {164290#true} is VALID [2020-07-17 22:27:05,201 INFO L280 TraceCheckUtils]: 10: Hoare triple {164290#true} assume !(0 != ~p4~0); {164290#true} is VALID [2020-07-17 22:27:05,201 INFO L280 TraceCheckUtils]: 11: Hoare triple {164290#true} assume !(0 != ~p5~0); {164290#true} is VALID [2020-07-17 22:27:05,201 INFO L280 TraceCheckUtils]: 12: Hoare triple {164290#true} assume !(0 != ~p6~0); {164290#true} is VALID [2020-07-17 22:27:05,201 INFO L280 TraceCheckUtils]: 13: Hoare triple {164290#true} assume !(0 != ~p7~0); {164290#true} is VALID [2020-07-17 22:27:05,201 INFO L280 TraceCheckUtils]: 14: Hoare triple {164290#true} assume !(0 != ~p8~0); {164290#true} is VALID [2020-07-17 22:27:05,202 INFO L280 TraceCheckUtils]: 15: Hoare triple {164290#true} assume 0 != ~p9~0;~lk9~0 := 1; {164294#(= 1 main_~lk9~0)} is VALID [2020-07-17 22:27:05,202 INFO L280 TraceCheckUtils]: 16: Hoare triple {164294#(= 1 main_~lk9~0)} assume 0 != ~p10~0;~lk10~0 := 1; {164294#(= 1 main_~lk9~0)} is VALID [2020-07-17 22:27:05,203 INFO L280 TraceCheckUtils]: 17: Hoare triple {164294#(= 1 main_~lk9~0)} assume !(0 != ~p1~0); {164294#(= 1 main_~lk9~0)} is VALID [2020-07-17 22:27:05,203 INFO L280 TraceCheckUtils]: 18: Hoare triple {164294#(= 1 main_~lk9~0)} assume !(0 != ~p2~0); {164294#(= 1 main_~lk9~0)} is VALID [2020-07-17 22:27:05,204 INFO L280 TraceCheckUtils]: 19: Hoare triple {164294#(= 1 main_~lk9~0)} assume !(0 != ~p3~0); {164294#(= 1 main_~lk9~0)} is VALID [2020-07-17 22:27:05,204 INFO L280 TraceCheckUtils]: 20: Hoare triple {164294#(= 1 main_~lk9~0)} assume !(0 != ~p4~0); {164294#(= 1 main_~lk9~0)} is VALID [2020-07-17 22:27:05,204 INFO L280 TraceCheckUtils]: 21: Hoare triple {164294#(= 1 main_~lk9~0)} assume !(0 != ~p5~0); {164294#(= 1 main_~lk9~0)} is VALID [2020-07-17 22:27:05,205 INFO L280 TraceCheckUtils]: 22: Hoare triple {164294#(= 1 main_~lk9~0)} assume !(0 != ~p6~0); {164294#(= 1 main_~lk9~0)} is VALID [2020-07-17 22:27:05,205 INFO L280 TraceCheckUtils]: 23: Hoare triple {164294#(= 1 main_~lk9~0)} assume !(0 != ~p7~0); {164294#(= 1 main_~lk9~0)} is VALID [2020-07-17 22:27:05,206 INFO L280 TraceCheckUtils]: 24: Hoare triple {164294#(= 1 main_~lk9~0)} assume !(0 != ~p8~0); {164294#(= 1 main_~lk9~0)} is VALID [2020-07-17 22:27:05,211 INFO L280 TraceCheckUtils]: 25: Hoare triple {164294#(= 1 main_~lk9~0)} assume 0 != ~p9~0; {164294#(= 1 main_~lk9~0)} is VALID [2020-07-17 22:27:05,213 INFO L280 TraceCheckUtils]: 26: Hoare triple {164294#(= 1 main_~lk9~0)} assume 1 != ~lk9~0; {164291#false} is VALID [2020-07-17 22:27:05,213 INFO L280 TraceCheckUtils]: 27: Hoare triple {164291#false} assume !false; {164291#false} is VALID [2020-07-17 22:27:05,214 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-17 22:27:05,214 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999815945] [2020-07-17 22:27:05,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:27:05,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:27:05,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375705096] [2020-07-17 22:27:05,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-07-17 22:27:05,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:27:05,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:27:05,245 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:27:05,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:27:05,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:27:05,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:27:05,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:27:05,246 INFO L87 Difference]: Start difference. First operand 7304 states and 9222 transitions. Second operand 3 states. [2020-07-17 22:27:13,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:13,396 INFO L93 Difference]: Finished difference Result 12172 states and 15496 transitions. [2020-07-17 22:27:13,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:27:13,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-07-17 22:27:13,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:27:13,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:27:13,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2020-07-17 22:27:13,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:27:13,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2020-07-17 22:27:13,399 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 98 transitions. [2020-07-17 22:27:13,506 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:27:19,544 INFO L225 Difference]: With dead ends: 12172 [2020-07-17 22:27:19,545 INFO L226 Difference]: Without dead ends: 12170 [2020-07-17 22:27:19,547 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-17 22:27:19,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12170 states. [2020-07-17 22:27:21,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12170 to 11144. [2020-07-17 22:27:21,601 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:27:21,601 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12170 states. Second operand 11144 states. [2020-07-17 22:27:21,601 INFO L74 IsIncluded]: Start isIncluded. First operand 12170 states. Second operand 11144 states. [2020-07-17 22:27:21,601 INFO L87 Difference]: Start difference. First operand 12170 states. Second operand 11144 states. [2020-07-17 22:27:27,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:27,284 INFO L93 Difference]: Finished difference Result 12170 states and 15239 transitions. [2020-07-17 22:27:27,284 INFO L276 IsEmpty]: Start isEmpty. Operand 12170 states and 15239 transitions. [2020-07-17 22:27:27,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:27:27,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:27:27,295 INFO L74 IsIncluded]: Start isIncluded. First operand 11144 states. Second operand 12170 states. [2020-07-17 22:27:27,296 INFO L87 Difference]: Start difference. First operand 11144 states. Second operand 12170 states. [2020-07-17 22:27:32,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:32,639 INFO L93 Difference]: Finished difference Result 12170 states and 15239 transitions. [2020-07-17 22:27:32,639 INFO L276 IsEmpty]: Start isEmpty. Operand 12170 states and 15239 transitions. [2020-07-17 22:27:32,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:27:32,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:27:32,652 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:27:32,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:27:32,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11144 states. [2020-07-17 22:27:37,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11144 states to 11144 states and 13702 transitions. [2020-07-17 22:27:37,543 INFO L78 Accepts]: Start accepts. Automaton has 11144 states and 13702 transitions. Word has length 28 [2020-07-17 22:27:37,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:27:37,543 INFO L479 AbstractCegarLoop]: Abstraction has 11144 states and 13702 transitions. [2020-07-17 22:27:37,543 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:27:37,543 INFO L276 IsEmpty]: Start isEmpty. Operand 11144 states and 13702 transitions. [2020-07-17 22:27:37,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-17 22:27:37,552 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:27:37,552 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] [2020-07-17 22:27:37,552 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-07-17 22:27:37,552 INFO L427 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:27:37,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:27:37,553 INFO L82 PathProgramCache]: Analyzing trace with hash 128195115, now seen corresponding path program 1 times [2020-07-17 22:27:37,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:27:37,553 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073275035] [2020-07-17 22:27:37,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:27:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:37,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:37,596 INFO L280 TraceCheckUtils]: 0: Hoare triple {212735#true} assume true; {212735#true} is VALID [2020-07-17 22:27:37,596 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {212735#true} {212735#true} #197#return; {212735#true} is VALID [2020-07-17 22:27:37,596 INFO L263 TraceCheckUtils]: 0: Hoare triple {212735#true} call ULTIMATE.init(); {212735#true} is VALID [2020-07-17 22:27:37,597 INFO L280 TraceCheckUtils]: 1: Hoare triple {212735#true} assume true; {212735#true} is VALID [2020-07-17 22:27:37,597 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {212735#true} {212735#true} #197#return; {212735#true} is VALID [2020-07-17 22:27:37,597 INFO L263 TraceCheckUtils]: 3: Hoare triple {212735#true} call #t~ret11 := main(); {212735#true} is VALID [2020-07-17 22:27:37,597 INFO L280 TraceCheckUtils]: 4: Hoare triple {212735#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {212735#true} is VALID [2020-07-17 22:27:37,598 INFO L280 TraceCheckUtils]: 5: Hoare triple {212735#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {212735#true} is VALID [2020-07-17 22:27:37,598 INFO L280 TraceCheckUtils]: 6: Hoare triple {212735#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {212735#true} is VALID [2020-07-17 22:27:37,598 INFO L280 TraceCheckUtils]: 7: Hoare triple {212735#true} assume !(0 != ~p1~0); {212735#true} is VALID [2020-07-17 22:27:37,598 INFO L280 TraceCheckUtils]: 8: Hoare triple {212735#true} assume !(0 != ~p2~0); {212735#true} is VALID [2020-07-17 22:27:37,598 INFO L280 TraceCheckUtils]: 9: Hoare triple {212735#true} assume !(0 != ~p3~0); {212735#true} is VALID [2020-07-17 22:27:37,599 INFO L280 TraceCheckUtils]: 10: Hoare triple {212735#true} assume !(0 != ~p4~0); {212735#true} is VALID [2020-07-17 22:27:37,599 INFO L280 TraceCheckUtils]: 11: Hoare triple {212735#true} assume !(0 != ~p5~0); {212735#true} is VALID [2020-07-17 22:27:37,599 INFO L280 TraceCheckUtils]: 12: Hoare triple {212735#true} assume !(0 != ~p6~0); {212735#true} is VALID [2020-07-17 22:27:37,599 INFO L280 TraceCheckUtils]: 13: Hoare triple {212735#true} assume !(0 != ~p7~0); {212735#true} is VALID [2020-07-17 22:27:37,599 INFO L280 TraceCheckUtils]: 14: Hoare triple {212735#true} assume !(0 != ~p8~0); {212735#true} is VALID [2020-07-17 22:27:37,600 INFO L280 TraceCheckUtils]: 15: Hoare triple {212735#true} assume !(0 != ~p9~0); {212739#(= 0 main_~p9~0)} is VALID [2020-07-17 22:27:37,601 INFO L280 TraceCheckUtils]: 16: Hoare triple {212739#(= 0 main_~p9~0)} assume 0 != ~p10~0;~lk10~0 := 1; {212739#(= 0 main_~p9~0)} is VALID [2020-07-17 22:27:37,602 INFO L280 TraceCheckUtils]: 17: Hoare triple {212739#(= 0 main_~p9~0)} assume !(0 != ~p1~0); {212739#(= 0 main_~p9~0)} is VALID [2020-07-17 22:27:37,602 INFO L280 TraceCheckUtils]: 18: Hoare triple {212739#(= 0 main_~p9~0)} assume !(0 != ~p2~0); {212739#(= 0 main_~p9~0)} is VALID [2020-07-17 22:27:37,603 INFO L280 TraceCheckUtils]: 19: Hoare triple {212739#(= 0 main_~p9~0)} assume !(0 != ~p3~0); {212739#(= 0 main_~p9~0)} is VALID [2020-07-17 22:27:37,603 INFO L280 TraceCheckUtils]: 20: Hoare triple {212739#(= 0 main_~p9~0)} assume !(0 != ~p4~0); {212739#(= 0 main_~p9~0)} is VALID [2020-07-17 22:27:37,604 INFO L280 TraceCheckUtils]: 21: Hoare triple {212739#(= 0 main_~p9~0)} assume !(0 != ~p5~0); {212739#(= 0 main_~p9~0)} is VALID [2020-07-17 22:27:37,604 INFO L280 TraceCheckUtils]: 22: Hoare triple {212739#(= 0 main_~p9~0)} assume !(0 != ~p6~0); {212739#(= 0 main_~p9~0)} is VALID [2020-07-17 22:27:37,605 INFO L280 TraceCheckUtils]: 23: Hoare triple {212739#(= 0 main_~p9~0)} assume !(0 != ~p7~0); {212739#(= 0 main_~p9~0)} is VALID [2020-07-17 22:27:37,605 INFO L280 TraceCheckUtils]: 24: Hoare triple {212739#(= 0 main_~p9~0)} assume !(0 != ~p8~0); {212739#(= 0 main_~p9~0)} is VALID [2020-07-17 22:27:37,606 INFO L280 TraceCheckUtils]: 25: Hoare triple {212739#(= 0 main_~p9~0)} assume 0 != ~p9~0; {212736#false} is VALID [2020-07-17 22:27:37,606 INFO L280 TraceCheckUtils]: 26: Hoare triple {212736#false} assume 1 != ~lk9~0; {212736#false} is VALID [2020-07-17 22:27:37,606 INFO L280 TraceCheckUtils]: 27: Hoare triple {212736#false} assume !false; {212736#false} is VALID [2020-07-17 22:27:37,607 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-17 22:27:37,607 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073275035] [2020-07-17 22:27:37,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:27:37,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:27:37,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789676962] [2020-07-17 22:27:37,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-07-17 22:27:37,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:27:37,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:27:37,640 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:27:37,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:27:37,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:27:37,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:27:37,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:27:37,641 INFO L87 Difference]: Start difference. First operand 11144 states and 13702 transitions. Second operand 3 states. [2020-07-17 22:28:15,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:28:15,001 INFO L93 Difference]: Finished difference Result 25228 states and 30856 transitions. [2020-07-17 22:28:15,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:28:15,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-07-17 22:28:15,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:28:15,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:28:15,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 167 transitions. [2020-07-17 22:28:15,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:28:15,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 167 transitions. [2020-07-17 22:28:15,004 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 167 transitions. [2020-07-17 22:28:15,171 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:28:23,266 INFO L225 Difference]: With dead ends: 25228 [2020-07-17 22:28:23,266 INFO L226 Difference]: Without dead ends: 14218 [2020-07-17 22:28:23,279 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-17 22:28:23,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14218 states. [2020-07-17 22:28:27,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14218 to 14216. [2020-07-17 22:28:27,152 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:28:27,152 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14218 states. Second operand 14216 states. [2020-07-17 22:28:27,152 INFO L74 IsIncluded]: Start isIncluded. First operand 14218 states. Second operand 14216 states. [2020-07-17 22:28:27,152 INFO L87 Difference]: Start difference. First operand 14218 states. Second operand 14216 states. [2020-07-17 22:28:33,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:28:33,910 INFO L93 Difference]: Finished difference Result 14218 states and 16903 transitions. [2020-07-17 22:28:33,910 INFO L276 IsEmpty]: Start isEmpty. Operand 14218 states and 16903 transitions. [2020-07-17 22:28:33,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:28:33,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:28:33,918 INFO L74 IsIncluded]: Start isIncluded. First operand 14216 states. Second operand 14218 states. [2020-07-17 22:28:33,919 INFO L87 Difference]: Start difference. First operand 14216 states. Second operand 14218 states. [2020-07-17 22:28:40,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:28:40,450 INFO L93 Difference]: Finished difference Result 14218 states and 16903 transitions. [2020-07-17 22:28:40,451 INFO L276 IsEmpty]: Start isEmpty. Operand 14218 states and 16903 transitions. [2020-07-17 22:28:40,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:28:40,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:28:40,459 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:28:40,459 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:28:40,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14216 states. [2020-07-17 22:28:48,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14216 states to 14216 states and 16902 transitions. [2020-07-17 22:28:48,742 INFO L78 Accepts]: Start accepts. Automaton has 14216 states and 16902 transitions. Word has length 28 [2020-07-17 22:28:48,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:28:48,743 INFO L479 AbstractCegarLoop]: Abstraction has 14216 states and 16902 transitions. [2020-07-17 22:28:48,743 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:28:48,743 INFO L276 IsEmpty]: Start isEmpty. Operand 14216 states and 16902 transitions. [2020-07-17 22:28:48,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-17 22:28:48,749 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:28:48,749 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] [2020-07-17 22:28:48,749 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-07-17 22:28:48,750 INFO L427 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:28:48,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:28:48,750 INFO L82 PathProgramCache]: Analyzing trace with hash 690414627, now seen corresponding path program 1 times [2020-07-17 22:28:48,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:28:48,750 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344876259] [2020-07-17 22:28:48,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:28:48,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:28:48,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:28:48,778 INFO L280 TraceCheckUtils]: 0: Hoare triple {281916#true} assume true; {281916#true} is VALID [2020-07-17 22:28:48,778 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {281916#true} {281916#true} #197#return; {281916#true} is VALID [2020-07-17 22:28:48,778 INFO L263 TraceCheckUtils]: 0: Hoare triple {281916#true} call ULTIMATE.init(); {281916#true} is VALID [2020-07-17 22:28:48,779 INFO L280 TraceCheckUtils]: 1: Hoare triple {281916#true} assume true; {281916#true} is VALID [2020-07-17 22:28:48,779 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {281916#true} {281916#true} #197#return; {281916#true} is VALID [2020-07-17 22:28:48,779 INFO L263 TraceCheckUtils]: 3: Hoare triple {281916#true} call #t~ret11 := main(); {281916#true} is VALID [2020-07-17 22:28:48,779 INFO L280 TraceCheckUtils]: 4: Hoare triple {281916#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {281916#true} is VALID [2020-07-17 22:28:48,779 INFO L280 TraceCheckUtils]: 5: Hoare triple {281916#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {281916#true} is VALID [2020-07-17 22:28:48,779 INFO L280 TraceCheckUtils]: 6: Hoare triple {281916#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {281916#true} is VALID [2020-07-17 22:28:48,779 INFO L280 TraceCheckUtils]: 7: Hoare triple {281916#true} assume !(0 != ~p1~0); {281916#true} is VALID [2020-07-17 22:28:48,780 INFO L280 TraceCheckUtils]: 8: Hoare triple {281916#true} assume !(0 != ~p2~0); {281916#true} is VALID [2020-07-17 22:28:48,780 INFO L280 TraceCheckUtils]: 9: Hoare triple {281916#true} assume !(0 != ~p3~0); {281916#true} is VALID [2020-07-17 22:28:48,780 INFO L280 TraceCheckUtils]: 10: Hoare triple {281916#true} assume !(0 != ~p4~0); {281916#true} is VALID [2020-07-17 22:28:48,780 INFO L280 TraceCheckUtils]: 11: Hoare triple {281916#true} assume !(0 != ~p5~0); {281916#true} is VALID [2020-07-17 22:28:48,780 INFO L280 TraceCheckUtils]: 12: Hoare triple {281916#true} assume !(0 != ~p6~0); {281916#true} is VALID [2020-07-17 22:28:48,780 INFO L280 TraceCheckUtils]: 13: Hoare triple {281916#true} assume !(0 != ~p7~0); {281916#true} is VALID [2020-07-17 22:28:48,780 INFO L280 TraceCheckUtils]: 14: Hoare triple {281916#true} assume !(0 != ~p8~0); {281916#true} is VALID [2020-07-17 22:28:48,781 INFO L280 TraceCheckUtils]: 15: Hoare triple {281916#true} assume 0 != ~p9~0;~lk9~0 := 1; {281920#(not (= 0 main_~p9~0))} is VALID [2020-07-17 22:28:48,781 INFO L280 TraceCheckUtils]: 16: Hoare triple {281920#(not (= 0 main_~p9~0))} assume 0 != ~p10~0;~lk10~0 := 1; {281920#(not (= 0 main_~p9~0))} is VALID [2020-07-17 22:28:48,782 INFO L280 TraceCheckUtils]: 17: Hoare triple {281920#(not (= 0 main_~p9~0))} assume !(0 != ~p1~0); {281920#(not (= 0 main_~p9~0))} is VALID [2020-07-17 22:28:48,782 INFO L280 TraceCheckUtils]: 18: Hoare triple {281920#(not (= 0 main_~p9~0))} assume !(0 != ~p2~0); {281920#(not (= 0 main_~p9~0))} is VALID [2020-07-17 22:28:48,782 INFO L280 TraceCheckUtils]: 19: Hoare triple {281920#(not (= 0 main_~p9~0))} assume !(0 != ~p3~0); {281920#(not (= 0 main_~p9~0))} is VALID [2020-07-17 22:28:48,783 INFO L280 TraceCheckUtils]: 20: Hoare triple {281920#(not (= 0 main_~p9~0))} assume !(0 != ~p4~0); {281920#(not (= 0 main_~p9~0))} is VALID [2020-07-17 22:28:48,783 INFO L280 TraceCheckUtils]: 21: Hoare triple {281920#(not (= 0 main_~p9~0))} assume !(0 != ~p5~0); {281920#(not (= 0 main_~p9~0))} is VALID [2020-07-17 22:28:48,783 INFO L280 TraceCheckUtils]: 22: Hoare triple {281920#(not (= 0 main_~p9~0))} assume !(0 != ~p6~0); {281920#(not (= 0 main_~p9~0))} is VALID [2020-07-17 22:28:48,784 INFO L280 TraceCheckUtils]: 23: Hoare triple {281920#(not (= 0 main_~p9~0))} assume !(0 != ~p7~0); {281920#(not (= 0 main_~p9~0))} is VALID [2020-07-17 22:28:48,784 INFO L280 TraceCheckUtils]: 24: Hoare triple {281920#(not (= 0 main_~p9~0))} assume !(0 != ~p8~0); {281920#(not (= 0 main_~p9~0))} is VALID [2020-07-17 22:28:48,785 INFO L280 TraceCheckUtils]: 25: Hoare triple {281920#(not (= 0 main_~p9~0))} assume !(0 != ~p9~0); {281917#false} is VALID [2020-07-17 22:28:48,785 INFO L280 TraceCheckUtils]: 26: Hoare triple {281917#false} assume 0 != ~p10~0; {281917#false} is VALID [2020-07-17 22:28:48,785 INFO L280 TraceCheckUtils]: 27: Hoare triple {281917#false} assume 1 != ~lk10~0; {281917#false} is VALID [2020-07-17 22:28:48,785 INFO L280 TraceCheckUtils]: 28: Hoare triple {281917#false} assume !false; {281917#false} is VALID [2020-07-17 22:28:48,787 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-17 22:28:48,787 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344876259] [2020-07-17 22:28:48,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:28:48,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:28:48,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176650994] [2020-07-17 22:28:48,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-07-17 22:28:48,788 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:28:48,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:28:48,817 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:28:48,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:28:48,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:28:48,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:28:48,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:28:48,818 INFO L87 Difference]: Start difference. First operand 14216 states and 16902 transitions. Second operand 3 states. [2020-07-17 22:29:08,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:29:08,368 INFO L93 Difference]: Finished difference Result 21516 states and 25608 transitions. [2020-07-17 22:29:08,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:29:08,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-07-17 22:29:08,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:29:08,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:29:08,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2020-07-17 22:29:08,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:29:08,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2020-07-17 22:29:08,371 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 162 transitions. [2020-07-17 22:29:08,532 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:29:17,526 INFO L225 Difference]: With dead ends: 21516 [2020-07-17 22:29:17,526 INFO L226 Difference]: Without dead ends: 14602 [2020-07-17 22:29:17,534 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-17 22:29:17,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14602 states. [2020-07-17 22:29:21,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14602 to 14600. [2020-07-17 22:29:21,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:29:21,648 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14602 states. Second operand 14600 states. [2020-07-17 22:29:21,648 INFO L74 IsIncluded]: Start isIncluded. First operand 14602 states. Second operand 14600 states. [2020-07-17 22:29:21,649 INFO L87 Difference]: Start difference. First operand 14602 states. Second operand 14600 states. [2020-07-17 22:29:28,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:29:28,476 INFO L93 Difference]: Finished difference Result 14602 states and 17159 transitions. [2020-07-17 22:29:28,476 INFO L276 IsEmpty]: Start isEmpty. Operand 14602 states and 17159 transitions. [2020-07-17 22:29:28,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:29:28,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:29:28,484 INFO L74 IsIncluded]: Start isIncluded. First operand 14600 states. Second operand 14602 states. [2020-07-17 22:29:28,484 INFO L87 Difference]: Start difference. First operand 14600 states. Second operand 14602 states. [2020-07-17 22:29:35,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:29:35,943 INFO L93 Difference]: Finished difference Result 14602 states and 17159 transitions. [2020-07-17 22:29:35,943 INFO L276 IsEmpty]: Start isEmpty. Operand 14602 states and 17159 transitions. [2020-07-17 22:29:35,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:29:35,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:29:35,951 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:29:35,951 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:29:35,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14600 states. [2020-07-17 22:29:43,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14600 states to 14600 states and 17158 transitions. [2020-07-17 22:29:43,901 INFO L78 Accepts]: Start accepts. Automaton has 14600 states and 17158 transitions. Word has length 29 [2020-07-17 22:29:43,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:29:43,901 INFO L479 AbstractCegarLoop]: Abstraction has 14600 states and 17158 transitions. [2020-07-17 22:29:43,901 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:29:43,901 INFO L276 IsEmpty]: Start isEmpty. Operand 14600 states and 17158 transitions. [2020-07-17 22:29:43,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-17 22:29:43,907 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:29:43,907 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] [2020-07-17 22:29:43,907 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-07-17 22:29:43,907 INFO L427 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:29:43,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:29:43,907 INFO L82 PathProgramCache]: Analyzing trace with hash -320702623, now seen corresponding path program 1 times [2020-07-17 22:29:43,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:29:43,908 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528070228] [2020-07-17 22:29:43,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:29:43,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:29:43,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:29:43,930 INFO L280 TraceCheckUtils]: 0: Hoare triple {348537#true} assume true; {348537#true} is VALID [2020-07-17 22:29:43,930 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {348537#true} {348537#true} #197#return; {348537#true} is VALID [2020-07-17 22:29:43,931 INFO L263 TraceCheckUtils]: 0: Hoare triple {348537#true} call ULTIMATE.init(); {348537#true} is VALID [2020-07-17 22:29:43,931 INFO L280 TraceCheckUtils]: 1: Hoare triple {348537#true} assume true; {348537#true} is VALID [2020-07-17 22:29:43,931 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {348537#true} {348537#true} #197#return; {348537#true} is VALID [2020-07-17 22:29:43,931 INFO L263 TraceCheckUtils]: 3: Hoare triple {348537#true} call #t~ret11 := main(); {348537#true} is VALID [2020-07-17 22:29:43,931 INFO L280 TraceCheckUtils]: 4: Hoare triple {348537#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {348537#true} is VALID [2020-07-17 22:29:43,931 INFO L280 TraceCheckUtils]: 5: Hoare triple {348537#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {348537#true} is VALID [2020-07-17 22:29:43,931 INFO L280 TraceCheckUtils]: 6: Hoare triple {348537#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {348537#true} is VALID [2020-07-17 22:29:43,932 INFO L280 TraceCheckUtils]: 7: Hoare triple {348537#true} assume !(0 != ~p1~0); {348537#true} is VALID [2020-07-17 22:29:43,932 INFO L280 TraceCheckUtils]: 8: Hoare triple {348537#true} assume !(0 != ~p2~0); {348537#true} is VALID [2020-07-17 22:29:43,932 INFO L280 TraceCheckUtils]: 9: Hoare triple {348537#true} assume !(0 != ~p3~0); {348537#true} is VALID [2020-07-17 22:29:43,932 INFO L280 TraceCheckUtils]: 10: Hoare triple {348537#true} assume !(0 != ~p4~0); {348537#true} is VALID [2020-07-17 22:29:43,932 INFO L280 TraceCheckUtils]: 11: Hoare triple {348537#true} assume !(0 != ~p5~0); {348537#true} is VALID [2020-07-17 22:29:43,932 INFO L280 TraceCheckUtils]: 12: Hoare triple {348537#true} assume !(0 != ~p6~0); {348537#true} is VALID [2020-07-17 22:29:43,932 INFO L280 TraceCheckUtils]: 13: Hoare triple {348537#true} assume !(0 != ~p7~0); {348537#true} is VALID [2020-07-17 22:29:43,932 INFO L280 TraceCheckUtils]: 14: Hoare triple {348537#true} assume !(0 != ~p8~0); {348537#true} is VALID [2020-07-17 22:29:43,933 INFO L280 TraceCheckUtils]: 15: Hoare triple {348537#true} assume !(0 != ~p9~0); {348537#true} is VALID [2020-07-17 22:29:43,933 INFO L280 TraceCheckUtils]: 16: Hoare triple {348537#true} assume 0 != ~p10~0;~lk10~0 := 1; {348541#(= main_~lk10~0 1)} is VALID [2020-07-17 22:29:43,933 INFO L280 TraceCheckUtils]: 17: Hoare triple {348541#(= main_~lk10~0 1)} assume !(0 != ~p1~0); {348541#(= main_~lk10~0 1)} is VALID [2020-07-17 22:29:43,934 INFO L280 TraceCheckUtils]: 18: Hoare triple {348541#(= main_~lk10~0 1)} assume !(0 != ~p2~0); {348541#(= main_~lk10~0 1)} is VALID [2020-07-17 22:29:43,934 INFO L280 TraceCheckUtils]: 19: Hoare triple {348541#(= main_~lk10~0 1)} assume !(0 != ~p3~0); {348541#(= main_~lk10~0 1)} is VALID [2020-07-17 22:29:43,934 INFO L280 TraceCheckUtils]: 20: Hoare triple {348541#(= main_~lk10~0 1)} assume !(0 != ~p4~0); {348541#(= main_~lk10~0 1)} is VALID [2020-07-17 22:29:43,935 INFO L280 TraceCheckUtils]: 21: Hoare triple {348541#(= main_~lk10~0 1)} assume !(0 != ~p5~0); {348541#(= main_~lk10~0 1)} is VALID [2020-07-17 22:29:43,935 INFO L280 TraceCheckUtils]: 22: Hoare triple {348541#(= main_~lk10~0 1)} assume !(0 != ~p6~0); {348541#(= main_~lk10~0 1)} is VALID [2020-07-17 22:29:43,935 INFO L280 TraceCheckUtils]: 23: Hoare triple {348541#(= main_~lk10~0 1)} assume !(0 != ~p7~0); {348541#(= main_~lk10~0 1)} is VALID [2020-07-17 22:29:43,936 INFO L280 TraceCheckUtils]: 24: Hoare triple {348541#(= main_~lk10~0 1)} assume !(0 != ~p8~0); {348541#(= main_~lk10~0 1)} is VALID [2020-07-17 22:29:43,936 INFO L280 TraceCheckUtils]: 25: Hoare triple {348541#(= main_~lk10~0 1)} assume !(0 != ~p9~0); {348541#(= main_~lk10~0 1)} is VALID [2020-07-17 22:29:43,936 INFO L280 TraceCheckUtils]: 26: Hoare triple {348541#(= main_~lk10~0 1)} assume 0 != ~p10~0; {348541#(= main_~lk10~0 1)} is VALID [2020-07-17 22:29:43,937 INFO L280 TraceCheckUtils]: 27: Hoare triple {348541#(= main_~lk10~0 1)} assume 1 != ~lk10~0; {348538#false} is VALID [2020-07-17 22:29:43,937 INFO L280 TraceCheckUtils]: 28: Hoare triple {348538#false} assume !false; {348538#false} is VALID [2020-07-17 22:29:43,938 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-17 22:29:43,938 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528070228] [2020-07-17 22:29:43,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:29:43,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:29:43,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067598545] [2020-07-17 22:29:43,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-07-17 22:29:43,939 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:29:43,939 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:29:43,967 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:29:43,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:29:43,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:29:43,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:29:43,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:29:43,968 INFO L87 Difference]: Start difference. First operand 14600 states and 17158 transitions. Second operand 3 states. [2020-07-17 22:30:11,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:11,444 INFO L93 Difference]: Finished difference Result 23562 states and 27399 transitions. [2020-07-17 22:30:11,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:30:11,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-07-17 22:30:11,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:30:11,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:30:11,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2020-07-17 22:30:11,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:30:11,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2020-07-17 22:30:11,446 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 93 transitions. [2020-07-17 22:30:11,538 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:30:33,686 INFO L225 Difference]: With dead ends: 23562 [2020-07-17 22:30:33,686 INFO L226 Difference]: Without dead ends: 23560 [2020-07-17 22:30:33,690 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-17 22:30:33,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23560 states. [2020-07-17 22:30:37,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23560 to 22536. [2020-07-17 22:30:37,851 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:30:37,851 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23560 states. Second operand 22536 states. [2020-07-17 22:30:37,851 INFO L74 IsIncluded]: Start isIncluded. First operand 23560 states. Second operand 22536 states. [2020-07-17 22:30:37,851 INFO L87 Difference]: Start difference. First operand 23560 states. Second operand 22536 states. [2020-07-17 22:31:10,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:31:10,232 INFO L93 Difference]: Finished difference Result 23560 states and 26886 transitions. [2020-07-17 22:31:10,232 INFO L276 IsEmpty]: Start isEmpty. Operand 23560 states and 26886 transitions. [2020-07-17 22:31:10,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:31:10,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:31:10,244 INFO L74 IsIncluded]: Start isIncluded. First operand 22536 states. Second operand 23560 states. [2020-07-17 22:31:10,244 INFO L87 Difference]: Start difference. First operand 22536 states. Second operand 23560 states. [2020-07-17 22:31:55,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:31:55,365 INFO L93 Difference]: Finished difference Result 23560 states and 26886 transitions. [2020-07-17 22:31:55,365 INFO L276 IsEmpty]: Start isEmpty. Operand 23560 states and 26886 transitions. [2020-07-17 22:31:55,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:31:55,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:31:55,378 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:31:55,378 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:31:55,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22536 states. [2020-07-17 22:32:13,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22536 states to 22536 states and 25862 transitions. [2020-07-17 22:32:13,816 INFO L78 Accepts]: Start accepts. Automaton has 22536 states and 25862 transitions. Word has length 29 [2020-07-17 22:32:13,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:32:13,816 INFO L479 AbstractCegarLoop]: Abstraction has 22536 states and 25862 transitions. [2020-07-17 22:32:13,816 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:32:13,816 INFO L276 IsEmpty]: Start isEmpty. Operand 22536 states and 25862 transitions. [2020-07-17 22:32:13,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-17 22:32:13,828 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:32:13,828 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] [2020-07-17 22:32:13,828 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-07-17 22:32:13,828 INFO L427 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:32:13,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:32:13,829 INFO L82 PathProgramCache]: Analyzing trace with hash -907508637, now seen corresponding path program 1 times [2020-07-17 22:32:13,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:32:13,829 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285646807] [2020-07-17 22:32:13,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:32:13,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:32:13,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:32:13,894 INFO L280 TraceCheckUtils]: 0: Hoare triple {443311#true} assume true; {443311#true} is VALID [2020-07-17 22:32:13,894 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {443311#true} {443311#true} #197#return; {443311#true} is VALID [2020-07-17 22:32:13,894 INFO L263 TraceCheckUtils]: 0: Hoare triple {443311#true} call ULTIMATE.init(); {443311#true} is VALID [2020-07-17 22:32:13,894 INFO L280 TraceCheckUtils]: 1: Hoare triple {443311#true} assume true; {443311#true} is VALID [2020-07-17 22:32:13,894 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {443311#true} {443311#true} #197#return; {443311#true} is VALID [2020-07-17 22:32:13,895 INFO L263 TraceCheckUtils]: 3: Hoare triple {443311#true} call #t~ret11 := main(); {443311#true} is VALID [2020-07-17 22:32:13,895 INFO L280 TraceCheckUtils]: 4: Hoare triple {443311#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;havoc ~cond~0; {443311#true} is VALID [2020-07-17 22:32:13,895 INFO L280 TraceCheckUtils]: 5: Hoare triple {443311#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {443311#true} is VALID [2020-07-17 22:32:13,895 INFO L280 TraceCheckUtils]: 6: Hoare triple {443311#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {443311#true} is VALID [2020-07-17 22:32:13,895 INFO L280 TraceCheckUtils]: 7: Hoare triple {443311#true} assume !(0 != ~p1~0); {443311#true} is VALID [2020-07-17 22:32:13,896 INFO L280 TraceCheckUtils]: 8: Hoare triple {443311#true} assume !(0 != ~p2~0); {443311#true} is VALID [2020-07-17 22:32:13,896 INFO L280 TraceCheckUtils]: 9: Hoare triple {443311#true} assume !(0 != ~p3~0); {443311#true} is VALID [2020-07-17 22:32:13,896 INFO L280 TraceCheckUtils]: 10: Hoare triple {443311#true} assume !(0 != ~p4~0); {443311#true} is VALID [2020-07-17 22:32:13,896 INFO L280 TraceCheckUtils]: 11: Hoare triple {443311#true} assume !(0 != ~p5~0); {443311#true} is VALID [2020-07-17 22:32:13,896 INFO L280 TraceCheckUtils]: 12: Hoare triple {443311#true} assume !(0 != ~p6~0); {443311#true} is VALID [2020-07-17 22:32:13,896 INFO L280 TraceCheckUtils]: 13: Hoare triple {443311#true} assume !(0 != ~p7~0); {443311#true} is VALID [2020-07-17 22:32:13,897 INFO L280 TraceCheckUtils]: 14: Hoare triple {443311#true} assume !(0 != ~p8~0); {443311#true} is VALID [2020-07-17 22:32:13,897 INFO L280 TraceCheckUtils]: 15: Hoare triple {443311#true} assume !(0 != ~p9~0); {443311#true} is VALID [2020-07-17 22:32:13,897 INFO L280 TraceCheckUtils]: 16: Hoare triple {443311#true} assume !(0 != ~p10~0); {443315#(= 0 main_~p10~0)} is VALID [2020-07-17 22:32:13,898 INFO L280 TraceCheckUtils]: 17: Hoare triple {443315#(= 0 main_~p10~0)} assume !(0 != ~p1~0); {443315#(= 0 main_~p10~0)} is VALID [2020-07-17 22:32:13,898 INFO L280 TraceCheckUtils]: 18: Hoare triple {443315#(= 0 main_~p10~0)} assume !(0 != ~p2~0); {443315#(= 0 main_~p10~0)} is VALID [2020-07-17 22:32:13,899 INFO L280 TraceCheckUtils]: 19: Hoare triple {443315#(= 0 main_~p10~0)} assume !(0 != ~p3~0); {443315#(= 0 main_~p10~0)} is VALID [2020-07-17 22:32:13,899 INFO L280 TraceCheckUtils]: 20: Hoare triple {443315#(= 0 main_~p10~0)} assume !(0 != ~p4~0); {443315#(= 0 main_~p10~0)} is VALID [2020-07-17 22:32:13,900 INFO L280 TraceCheckUtils]: 21: Hoare triple {443315#(= 0 main_~p10~0)} assume !(0 != ~p5~0); {443315#(= 0 main_~p10~0)} is VALID [2020-07-17 22:32:13,900 INFO L280 TraceCheckUtils]: 22: Hoare triple {443315#(= 0 main_~p10~0)} assume !(0 != ~p6~0); {443315#(= 0 main_~p10~0)} is VALID [2020-07-17 22:32:13,901 INFO L280 TraceCheckUtils]: 23: Hoare triple {443315#(= 0 main_~p10~0)} assume !(0 != ~p7~0); {443315#(= 0 main_~p10~0)} is VALID [2020-07-17 22:32:13,902 INFO L280 TraceCheckUtils]: 24: Hoare triple {443315#(= 0 main_~p10~0)} assume !(0 != ~p8~0); {443315#(= 0 main_~p10~0)} is VALID [2020-07-17 22:32:13,902 INFO L280 TraceCheckUtils]: 25: Hoare triple {443315#(= 0 main_~p10~0)} assume !(0 != ~p9~0); {443315#(= 0 main_~p10~0)} is VALID [2020-07-17 22:32:13,903 INFO L280 TraceCheckUtils]: 26: Hoare triple {443315#(= 0 main_~p10~0)} assume 0 != ~p10~0; {443312#false} is VALID [2020-07-17 22:32:13,903 INFO L280 TraceCheckUtils]: 27: Hoare triple {443312#false} assume 1 != ~lk10~0; {443312#false} is VALID [2020-07-17 22:32:13,903 INFO L280 TraceCheckUtils]: 28: Hoare triple {443312#false} assume !false; {443312#false} is VALID [2020-07-17 22:32:13,904 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-17 22:32:13,904 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285646807] [2020-07-17 22:32:13,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:32:13,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:32:13,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667757005] [2020-07-17 22:32:13,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-07-17 22:32:13,906 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:32:13,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:32:13,932 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:32:13,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:32:13,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:32:13,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:32:13,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:32:13,933 INFO L87 Difference]: Start difference. First operand 22536 states and 25862 transitions. Second operand 3 states. [2020-07-17 22:36:09,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:36:09,321 INFO L93 Difference]: Finished difference Result 50184 states and 56582 transitions. [2020-07-17 22:36:09,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:36:09,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-07-17 22:36:09,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:36:09,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:36:09,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2020-07-17 22:36:09,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:36:09,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2020-07-17 22:36:09,323 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 162 transitions. [2020-07-17 22:36:09,473 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:36:09,473 INFO L225 Difference]: With dead ends: 50184 [2020-07-17 22:36:09,473 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 22:36:09,541 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-17 22:36:09,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 22:36:09,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 22:36:09,541 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:36:09,542 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-17 22:36:09,542 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:36:09,542 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:36:09,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:36:09,542 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:36:09,542 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:36:09,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:36:09,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:36:09,543 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:36:09,543 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:36:09,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:36:09,543 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:36:09,543 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:36:09,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:36:09,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:36:09,544 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:36:09,544 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:36:09,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 22:36:09,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 22:36:09,544 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2020-07-17 22:36:09,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:36:09,545 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 22:36:09,545 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:36:09,545 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:36:09,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:36:09,545 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-07-17 22:36:09,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 22:36:09,586 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-17 22:36:09,586 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:36:09,587 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:36:09,587 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 22:36:09,587 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 22:36:09,587 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-17 22:36:09,587 INFO L271 CegarLoopResult]: At program point L159(lines 5 163) the Hoare annotation is: true [2020-07-17 22:36:09,587 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 4 163) no Hoare annotation was computed. [2020-07-17 22:36:09,587 INFO L268 CegarLoopResult]: For program point L118-1(lines 39 158) no Hoare annotation was computed. [2020-07-17 22:36:09,587 INFO L268 CegarLoopResult]: For program point L143-1(lines 39 158) no Hoare annotation was computed. [2020-07-17 22:36:09,588 INFO L268 CegarLoopResult]: For program point L102-1(lines 39 158) no Hoare annotation was computed. [2020-07-17 22:36:09,588 INFO L268 CegarLoopResult]: For program point L94-1(lines 39 158) no Hoare annotation was computed. [2020-07-17 22:36:09,588 INFO L268 CegarLoopResult]: For program point L119(line 119) no Hoare annotation was computed. [2020-07-17 22:36:09,588 INFO L268 CegarLoopResult]: For program point L86-1(lines 39 158) no Hoare annotation was computed. [2020-07-17 22:36:09,588 INFO L268 CegarLoopResult]: For program point L144(line 144) no Hoare annotation was computed. [2020-07-17 22:36:09,588 INFO L268 CegarLoopResult]: For program point L78-1(lines 39 158) no Hoare annotation was computed. [2020-07-17 22:36:09,588 INFO L268 CegarLoopResult]: For program point L70-1(lines 39 158) no Hoare annotation was computed. [2020-07-17 22:36:09,588 INFO L268 CegarLoopResult]: For program point L128-1(lines 39 158) no Hoare annotation was computed. [2020-07-17 22:36:09,588 INFO L271 CegarLoopResult]: At program point L153-1(lines 39 158) the Hoare annotation is: true [2020-07-17 22:36:09,588 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 4 163) no Hoare annotation was computed. [2020-07-17 22:36:09,589 INFO L268 CegarLoopResult]: For program point L129(line 129) no Hoare annotation was computed. [2020-07-17 22:36:09,589 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 161) no Hoare annotation was computed. [2020-07-17 22:36:09,589 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 163) the Hoare annotation is: true [2020-07-17 22:36:09,589 INFO L268 CegarLoopResult]: For program point L154(line 154) no Hoare annotation was computed. [2020-07-17 22:36:09,589 INFO L264 CegarLoopResult]: At program point L154-1(lines 5 163) the Hoare annotation is: false [2020-07-17 22:36:09,589 INFO L268 CegarLoopResult]: For program point L113-1(lines 39 158) no Hoare annotation was computed. [2020-07-17 22:36:09,589 INFO L268 CegarLoopResult]: For program point L138-1(lines 39 158) no Hoare annotation was computed. [2020-07-17 22:36:09,589 INFO L268 CegarLoopResult]: For program point L114(line 114) no Hoare annotation was computed. [2020-07-17 22:36:09,590 INFO L268 CegarLoopResult]: For program point L139(line 139) no Hoare annotation was computed. [2020-07-17 22:36:09,590 INFO L268 CegarLoopResult]: For program point L98-1(lines 39 158) no Hoare annotation was computed. [2020-07-17 22:36:09,590 INFO L268 CegarLoopResult]: For program point L123-1(lines 39 158) no Hoare annotation was computed. [2020-07-17 22:36:09,590 INFO L268 CegarLoopResult]: For program point L90-1(lines 39 158) no Hoare annotation was computed. [2020-07-17 22:36:09,590 INFO L268 CegarLoopResult]: For program point L148-1(lines 39 158) no Hoare annotation was computed. [2020-07-17 22:36:09,590 INFO L268 CegarLoopResult]: For program point L82-1(lines 39 158) no Hoare annotation was computed. [2020-07-17 22:36:09,591 INFO L268 CegarLoopResult]: For program point L41(lines 41 43) no Hoare annotation was computed. [2020-07-17 22:36:09,591 INFO L268 CegarLoopResult]: For program point L74-1(lines 39 158) no Hoare annotation was computed. [2020-07-17 22:36:09,591 INFO L268 CegarLoopResult]: For program point L66(lines 66 68) no Hoare annotation was computed. [2020-07-17 22:36:09,591 INFO L268 CegarLoopResult]: For program point L66-2(lines 39 158) no Hoare annotation was computed. [2020-07-17 22:36:09,592 INFO L268 CegarLoopResult]: For program point L124(line 124) no Hoare annotation was computed. [2020-07-17 22:36:09,592 INFO L268 CegarLoopResult]: For program point L149(line 149) no Hoare annotation was computed. [2020-07-17 22:36:09,592 INFO L268 CegarLoopResult]: For program point L108-1(lines 39 158) no Hoare annotation was computed. [2020-07-17 22:36:09,592 INFO L268 CegarLoopResult]: For program point L133-1(lines 39 158) no Hoare annotation was computed. [2020-07-17 22:36:09,592 INFO L268 CegarLoopResult]: For program point L109(line 109) no Hoare annotation was computed. [2020-07-17 22:36:09,592 INFO L268 CegarLoopResult]: For program point L134(line 134) no Hoare annotation was computed. [2020-07-17 22:36:09,596 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:36:09,597 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:36:09,597 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:36:09,597 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-17 22:36:09,597 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:36:09,597 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:36:09,597 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-17 22:36:09,598 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-17 22:36:09,598 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:36:09,598 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2020-07-17 22:36:09,598 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2020-07-17 22:36:09,598 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:36:09,598 WARN L170 areAnnotationChecker]: L66-2 has no Hoare annotation [2020-07-17 22:36:09,598 WARN L170 areAnnotationChecker]: L66-2 has no Hoare annotation [2020-07-17 22:36:09,598 WARN L170 areAnnotationChecker]: L70-1 has no Hoare annotation [2020-07-17 22:36:09,598 WARN L170 areAnnotationChecker]: L70-1 has no Hoare annotation [2020-07-17 22:36:09,598 WARN L170 areAnnotationChecker]: L74-1 has no Hoare annotation [2020-07-17 22:36:09,598 WARN L170 areAnnotationChecker]: L74-1 has no Hoare annotation [2020-07-17 22:36:09,599 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2020-07-17 22:36:09,599 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2020-07-17 22:36:09,599 WARN L170 areAnnotationChecker]: L82-1 has no Hoare annotation [2020-07-17 22:36:09,600 WARN L170 areAnnotationChecker]: L82-1 has no Hoare annotation [2020-07-17 22:36:09,600 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2020-07-17 22:36:09,600 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2020-07-17 22:36:09,600 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2020-07-17 22:36:09,600 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2020-07-17 22:36:09,600 WARN L170 areAnnotationChecker]: L94-1 has no Hoare annotation [2020-07-17 22:36:09,600 WARN L170 areAnnotationChecker]: L94-1 has no Hoare annotation [2020-07-17 22:36:09,601 WARN L170 areAnnotationChecker]: L98-1 has no Hoare annotation [2020-07-17 22:36:09,601 WARN L170 areAnnotationChecker]: L98-1 has no Hoare annotation [2020-07-17 22:36:09,601 WARN L170 areAnnotationChecker]: L102-1 has no Hoare annotation [2020-07-17 22:36:09,601 WARN L170 areAnnotationChecker]: L102-1 has no Hoare annotation [2020-07-17 22:36:09,601 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2020-07-17 22:36:09,601 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2020-07-17 22:36:09,601 WARN L170 areAnnotationChecker]: L108-1 has no Hoare annotation [2020-07-17 22:36:09,601 WARN L170 areAnnotationChecker]: L108-1 has no Hoare annotation [2020-07-17 22:36:09,601 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2020-07-17 22:36:09,602 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:36:09,602 WARN L170 areAnnotationChecker]: L114 has no Hoare annotation [2020-07-17 22:36:09,602 WARN L170 areAnnotationChecker]: L114 has no Hoare annotation [2020-07-17 22:36:09,602 WARN L170 areAnnotationChecker]: L113-1 has no Hoare annotation [2020-07-17 22:36:09,602 WARN L170 areAnnotationChecker]: L113-1 has no Hoare annotation [2020-07-17 22:36:09,602 WARN L170 areAnnotationChecker]: L119 has no Hoare annotation [2020-07-17 22:36:09,602 WARN L170 areAnnotationChecker]: L119 has no Hoare annotation [2020-07-17 22:36:09,602 WARN L170 areAnnotationChecker]: L118-1 has no Hoare annotation [2020-07-17 22:36:09,602 WARN L170 areAnnotationChecker]: L118-1 has no Hoare annotation [2020-07-17 22:36:09,602 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2020-07-17 22:36:09,603 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2020-07-17 22:36:09,603 WARN L170 areAnnotationChecker]: L123-1 has no Hoare annotation [2020-07-17 22:36:09,603 WARN L170 areAnnotationChecker]: L123-1 has no Hoare annotation [2020-07-17 22:36:09,603 WARN L170 areAnnotationChecker]: L129 has no Hoare annotation [2020-07-17 22:36:09,603 WARN L170 areAnnotationChecker]: L129 has no Hoare annotation [2020-07-17 22:36:09,603 WARN L170 areAnnotationChecker]: L128-1 has no Hoare annotation [2020-07-17 22:36:09,603 WARN L170 areAnnotationChecker]: L128-1 has no Hoare annotation [2020-07-17 22:36:09,603 WARN L170 areAnnotationChecker]: L134 has no Hoare annotation [2020-07-17 22:36:09,603 WARN L170 areAnnotationChecker]: L134 has no Hoare annotation [2020-07-17 22:36:09,603 WARN L170 areAnnotationChecker]: L133-1 has no Hoare annotation [2020-07-17 22:36:09,604 WARN L170 areAnnotationChecker]: L133-1 has no Hoare annotation [2020-07-17 22:36:09,604 WARN L170 areAnnotationChecker]: L139 has no Hoare annotation [2020-07-17 22:36:09,604 WARN L170 areAnnotationChecker]: L139 has no Hoare annotation [2020-07-17 22:36:09,604 WARN L170 areAnnotationChecker]: L138-1 has no Hoare annotation [2020-07-17 22:36:09,604 WARN L170 areAnnotationChecker]: L138-1 has no Hoare annotation [2020-07-17 22:36:09,604 WARN L170 areAnnotationChecker]: L144 has no Hoare annotation [2020-07-17 22:36:09,604 WARN L170 areAnnotationChecker]: L144 has no Hoare annotation [2020-07-17 22:36:09,604 WARN L170 areAnnotationChecker]: L143-1 has no Hoare annotation [2020-07-17 22:36:09,604 WARN L170 areAnnotationChecker]: L143-1 has no Hoare annotation [2020-07-17 22:36:09,605 WARN L170 areAnnotationChecker]: L149 has no Hoare annotation [2020-07-17 22:36:09,605 WARN L170 areAnnotationChecker]: L149 has no Hoare annotation [2020-07-17 22:36:09,605 WARN L170 areAnnotationChecker]: L148-1 has no Hoare annotation [2020-07-17 22:36:09,605 WARN L170 areAnnotationChecker]: L148-1 has no Hoare annotation [2020-07-17 22:36:09,605 WARN L170 areAnnotationChecker]: L154 has no Hoare annotation [2020-07-17 22:36:09,605 WARN L170 areAnnotationChecker]: L154 has no Hoare annotation [2020-07-17 22:36:09,605 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-17 22:36:09,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:36:09 BoogieIcfgContainer [2020-07-17 22:36:09,623 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:36:09,625 INFO L168 Benchmark]: Toolchain (without parser) took 608578.74 ms. Allocated memory was 144.2 MB in the beginning and 966.8 MB in the end (delta: 822.6 MB). Free memory was 102.0 MB in the beginning and 95.0 MB in the end (delta: 7.0 MB). Peak memory consumption was 829.6 MB. Max. memory is 7.1 GB. [2020-07-17 22:36:09,628 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 144.2 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-17 22:36:09,629 INFO L168 Benchmark]: CACSL2BoogieTranslator took 334.12 ms. Allocated memory is still 144.2 MB. Free memory was 101.6 MB in the beginning and 90.7 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. [2020-07-17 22:36:09,630 INFO L168 Benchmark]: Boogie Preprocessor took 186.48 ms. Allocated memory was 144.2 MB in the beginning and 202.4 MB in the end (delta: 58.2 MB). Free memory was 90.5 MB in the beginning and 180.0 MB in the end (delta: -89.5 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:36:09,630 INFO L168 Benchmark]: RCFGBuilder took 662.29 ms. Allocated memory is still 202.4 MB. Free memory was 180.0 MB in the beginning and 149.2 MB in the end (delta: 30.7 MB). Peak memory consumption was 30.7 MB. Max. memory is 7.1 GB. [2020-07-17 22:36:09,631 INFO L168 Benchmark]: TraceAbstraction took 607388.38 ms. Allocated memory was 202.4 MB in the beginning and 966.8 MB in the end (delta: 764.4 MB). Free memory was 149.2 MB in the beginning and 95.0 MB in the end (delta: 54.2 MB). Peak memory consumption was 818.6 MB. Max. memory is 7.1 GB. [2020-07-17 22:36:09,632 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.22 ms. Allocated memory is still 144.2 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 334.12 ms. Allocated memory is still 144.2 MB. Free memory was 101.6 MB in the beginning and 90.7 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 186.48 ms. Allocated memory was 144.2 MB in the beginning and 202.4 MB in the end (delta: 58.2 MB). Free memory was 90.5 MB in the beginning and 180.0 MB in the end (delta: -89.5 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 662.29 ms. Allocated memory is still 202.4 MB. Free memory was 180.0 MB in the beginning and 149.2 MB in the end (delta: 30.7 MB). Peak memory consumption was 30.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 607388.38 ms. Allocated memory was 202.4 MB in the beginning and 966.8 MB in the end (delta: 764.4 MB). Free memory was 149.2 MB in the beginning and 95.0 MB in the end (delta: 54.2 MB). Peak memory consumption was 818.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 161]: 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: 39]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 607.2s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 407.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2384 SDtfs, 1153 SDslu, 1624 SDs, 0 SdLazy, 149 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22536occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 196.3s AutomataMinimizationTime, 28 MinimizatonAttempts, 4124 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 1034 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 687 NumberOfCodeBlocks, 687 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 659 ConstructedInterpolants, 0 QuantifiedInterpolants, 31265 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...