/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-8fc6572 [2020-07-10 15:03:26,583 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:03:26,587 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:03:26,606 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:03:26,607 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:03:26,611 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:03:26,614 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:03:26,624 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:03:26,634 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:03:26,635 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:03:26,643 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:03:26,645 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:03:26,646 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:03:26,652 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:03:26,657 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:03:26,661 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:03:26,664 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:03:26,666 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:03:26,672 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:03:26,679 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:03:26,683 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:03:26,689 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:03:26,691 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:03:26,692 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:03:26,698 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:03:26,698 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:03:26,699 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:03:26,703 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:03:26,704 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:03:26,705 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:03:26,705 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:03:26,707 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:03:26,710 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:03:26,712 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:03:26,718 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:03:26,719 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:03:26,723 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:03:26,724 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:03:26,724 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:03:26,726 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:03:26,729 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:03:26,731 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-10 15:03:26,763 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:03:26,764 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:03:26,766 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:03:26,767 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:03:26,767 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:03:26,768 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:03:26,768 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:03:26,768 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:03:26,768 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:03:26,769 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:03:26,769 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:03:26,769 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:03:26,769 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:03:26,770 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:03:26,770 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:03:26,770 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:03:26,770 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:03:26,771 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:03:26,771 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:03:26,771 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:03:26,771 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:03:26,771 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:03:26,772 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:03:26,772 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:03:26,772 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:03:26,772 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:03:26,772 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:03:26,773 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:03:26,773 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:03:26,773 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:03:27,231 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:03:27,265 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:03:27,269 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:03:27,272 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:03:27,273 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:03:27,274 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-10 15:03:27,372 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d6f9f1ed/20f6ab9bcbd345cc8683535157506643/FLAGfd933be23 [2020-07-10 15:03:28,144 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:03:28,146 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_10.c [2020-07-10 15:03:28,159 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d6f9f1ed/20f6ab9bcbd345cc8683535157506643/FLAGfd933be23 [2020-07-10 15:03:28,432 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d6f9f1ed/20f6ab9bcbd345cc8683535157506643 [2020-07-10 15:03:28,452 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:03:28,457 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:03:28,462 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:03:28,463 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:03:28,468 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:03:28,471 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:03:28" (1/1) ... [2020-07-10 15:03:28,477 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@252aaefd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:28, skipping insertion in model container [2020-07-10 15:03:28,478 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:03:28" (1/1) ... [2020-07-10 15:03:28,494 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:03:28,549 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:03:28,891 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:03:28,900 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:03:28,938 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:03:28,961 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:03:28,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:28 WrapperNode [2020-07-10 15:03:28,963 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:03:28,965 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:03:28,965 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:03:28,965 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:03:29,099 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:28" (1/1) ... [2020-07-10 15:03:29,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:28" (1/1) ... [2020-07-10 15:03:29,110 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:28" (1/1) ... [2020-07-10 15:03:29,111 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:28" (1/1) ... [2020-07-10 15:03:29,122 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:28" (1/1) ... [2020-07-10 15:03:29,135 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:28" (1/1) ... [2020-07-10 15:03:29,137 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:28" (1/1) ... [2020-07-10 15:03:29,141 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:03:29,141 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:03:29,142 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:03:29,142 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:03:29,143 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:03:29,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:03:29,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:03:29,239 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:03:29,239 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:03:29,239 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:03:29,239 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:03:29,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:03:29,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:03:30,084 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:03:30,084 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 15:03:30,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:03:30 BoogieIcfgContainer [2020-07-10 15:03:30,092 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:03:30,093 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:03:30,094 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:03:30,097 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:03:30,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:03:28" (1/3) ... [2020-07-10 15:03:30,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5db9d044 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:03:30, skipping insertion in model container [2020-07-10 15:03:30,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:28" (2/3) ... [2020-07-10 15:03:30,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5db9d044 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:03:30, skipping insertion in model container [2020-07-10 15:03:30,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:03:30" (3/3) ... [2020-07-10 15:03:30,101 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_10.c [2020-07-10 15:03:30,111 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:03:30,118 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:03:30,134 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:03:30,173 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:03:30,173 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:03:30,173 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:03:30,174 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:03:30,174 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:03:30,174 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:03:30,175 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:03:30,175 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:03:30,203 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-07-10 15:03:30,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-10 15:03:30,214 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:30,216 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-10 15:03:30,217 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:30,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:30,228 INFO L82 PathProgramCache]: Analyzing trace with hash -917347053, now seen corresponding path program 1 times [2020-07-10 15:03:30,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:30,246 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109277028] [2020-07-10 15:03:30,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:30,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:30,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:30,581 INFO L280 TraceCheckUtils]: 0: Hoare triple {47#true} assume true; {47#true} is VALID [2020-07-10 15:03:30,582 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {47#true} {47#true} #197#return; {47#true} is VALID [2020-07-10 15:03:30,586 INFO L263 TraceCheckUtils]: 0: Hoare triple {47#true} call ULTIMATE.init(); {47#true} is VALID [2020-07-10 15:03:30,587 INFO L280 TraceCheckUtils]: 1: Hoare triple {47#true} assume true; {47#true} is VALID [2020-07-10 15:03:30,588 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {47#true} {47#true} #197#return; {47#true} is VALID [2020-07-10 15:03:30,588 INFO L263 TraceCheckUtils]: 3: Hoare triple {47#true} call #t~ret11 := main(); {47#true} is VALID [2020-07-10 15:03:30,589 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-10 15:03:30,590 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-10 15:03:30,591 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-10 15:03:30,595 INFO L280 TraceCheckUtils]: 7: Hoare triple {47#true} assume 0 != ~p1~0;~lk1~0 := 1; {51#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:30,598 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-10 15:03:30,601 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-10 15:03:30,604 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-10 15:03:30,606 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-10 15:03:30,609 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-10 15:03:30,610 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-10 15:03:30,613 INFO L280 TraceCheckUtils]: 14: Hoare triple {51#(= 1 main_~lk1~0)} assume !(0 != ~p8~0); {51#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:30,615 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-10 15:03:30,618 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-10 15:03:30,621 INFO L280 TraceCheckUtils]: 17: Hoare triple {51#(= 1 main_~lk1~0)} assume 0 != ~p1~0; {51#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:30,624 INFO L280 TraceCheckUtils]: 18: Hoare triple {51#(= 1 main_~lk1~0)} assume 1 != ~lk1~0; {48#false} is VALID [2020-07-10 15:03:30,625 INFO L280 TraceCheckUtils]: 19: Hoare triple {48#false} assume !false; {48#false} is VALID [2020-07-10 15:03:30,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:30,630 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109277028] [2020-07-10 15:03:30,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:30,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:30,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788723115] [2020-07-10 15:03:30,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-10 15:03:30,650 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:30,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:30,726 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-10 15:03:30,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:30,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:30,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:30,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:30,743 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2020-07-10 15:03:31,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:31,248 INFO L93 Difference]: Finished difference Result 87 states and 150 transitions. [2020-07-10 15:03:31,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:31,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-10 15:03:31,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:31,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:31,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2020-07-10 15:03:31,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:31,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2020-07-10 15:03:31,287 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 150 transitions. [2020-07-10 15:03:31,621 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-10 15:03:31,646 INFO L225 Difference]: With dead ends: 87 [2020-07-10 15:03:31,647 INFO L226 Difference]: Without dead ends: 72 [2020-07-10 15:03:31,654 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:31,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-07-10 15:03:31,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2020-07-10 15:03:31,737 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:31,738 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 50 states. [2020-07-10 15:03:31,739 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 50 states. [2020-07-10 15:03:31,740 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 50 states. [2020-07-10 15:03:31,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:31,754 INFO L93 Difference]: Finished difference Result 72 states and 128 transitions. [2020-07-10 15:03:31,754 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 128 transitions. [2020-07-10 15:03:31,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:31,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:31,757 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 72 states. [2020-07-10 15:03:31,757 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 72 states. [2020-07-10 15:03:31,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:31,769 INFO L93 Difference]: Finished difference Result 72 states and 128 transitions. [2020-07-10 15:03:31,770 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 128 transitions. [2020-07-10 15:03:31,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:31,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:31,773 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:31,773 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:31,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-10 15:03:31,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 89 transitions. [2020-07-10 15:03:31,783 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 89 transitions. Word has length 20 [2020-07-10 15:03:31,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:31,783 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 89 transitions. [2020-07-10 15:03:31,783 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:31,784 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 89 transitions. [2020-07-10 15:03:31,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-10 15:03:31,786 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:31,786 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-10 15:03:31,786 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:03:31,787 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:31,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:31,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1504153067, now seen corresponding path program 1 times [2020-07-10 15:03:31,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:31,788 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181650451] [2020-07-10 15:03:31,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:31,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:31,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:31,998 INFO L280 TraceCheckUtils]: 0: Hoare triple {353#true} assume true; {353#true} is VALID [2020-07-10 15:03:31,999 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {353#true} {353#true} #197#return; {353#true} is VALID [2020-07-10 15:03:32,000 INFO L263 TraceCheckUtils]: 0: Hoare triple {353#true} call ULTIMATE.init(); {353#true} is VALID [2020-07-10 15:03:32,000 INFO L280 TraceCheckUtils]: 1: Hoare triple {353#true} assume true; {353#true} is VALID [2020-07-10 15:03:32,001 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {353#true} {353#true} #197#return; {353#true} is VALID [2020-07-10 15:03:32,001 INFO L263 TraceCheckUtils]: 3: Hoare triple {353#true} call #t~ret11 := main(); {353#true} is VALID [2020-07-10 15:03:32,004 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-10 15:03:32,005 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-10 15:03:32,005 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-10 15:03:32,011 INFO L280 TraceCheckUtils]: 7: Hoare triple {353#true} assume !(0 != ~p1~0); {357#(= 0 main_~p1~0)} is VALID [2020-07-10 15:03:32,016 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-10 15:03:32,019 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-10 15:03:32,021 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-10 15:03:32,022 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-10 15:03:32,023 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-10 15:03:32,024 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-10 15:03:32,025 INFO L280 TraceCheckUtils]: 14: Hoare triple {357#(= 0 main_~p1~0)} assume !(0 != ~p8~0); {357#(= 0 main_~p1~0)} is VALID [2020-07-10 15:03:32,027 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-10 15:03:32,029 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-10 15:03:32,030 INFO L280 TraceCheckUtils]: 17: Hoare triple {357#(= 0 main_~p1~0)} assume 0 != ~p1~0; {354#false} is VALID [2020-07-10 15:03:32,030 INFO L280 TraceCheckUtils]: 18: Hoare triple {354#false} assume 1 != ~lk1~0; {354#false} is VALID [2020-07-10 15:03:32,030 INFO L280 TraceCheckUtils]: 19: Hoare triple {354#false} assume !false; {354#false} is VALID [2020-07-10 15:03:32,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:32,038 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181650451] [2020-07-10 15:03:32,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:32,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:32,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818873050] [2020-07-10 15:03:32,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-10 15:03:32,047 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:32,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:32,084 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-10 15:03:32,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:32,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:32,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:32,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:32,086 INFO L87 Difference]: Start difference. First operand 50 states and 89 transitions. Second operand 3 states. [2020-07-10 15:03:32,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:32,441 INFO L93 Difference]: Finished difference Result 117 states and 212 transitions. [2020-07-10 15:03:32,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:32,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-10 15:03:32,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:32,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:32,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2020-07-10 15:03:32,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:32,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2020-07-10 15:03:32,470 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 191 transitions. [2020-07-10 15:03:32,790 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-10 15:03:32,796 INFO L225 Difference]: With dead ends: 117 [2020-07-10 15:03:32,801 INFO L226 Difference]: Without dead ends: 72 [2020-07-10 15:03:32,804 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:32,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-07-10 15:03:32,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2020-07-10 15:03:32,850 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:32,850 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 70 states. [2020-07-10 15:03:32,850 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 70 states. [2020-07-10 15:03:32,851 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 70 states. [2020-07-10 15:03:32,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:32,861 INFO L93 Difference]: Finished difference Result 72 states and 126 transitions. [2020-07-10 15:03:32,861 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 126 transitions. [2020-07-10 15:03:32,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:32,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:32,868 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 72 states. [2020-07-10 15:03:32,868 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 72 states. [2020-07-10 15:03:32,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:32,884 INFO L93 Difference]: Finished difference Result 72 states and 126 transitions. [2020-07-10 15:03:32,884 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 126 transitions. [2020-07-10 15:03:32,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:32,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:32,887 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:32,888 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:32,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-10 15:03:32,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 125 transitions. [2020-07-10 15:03:32,898 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 125 transitions. Word has length 20 [2020-07-10 15:03:32,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:32,902 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 125 transitions. [2020-07-10 15:03:32,902 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:32,902 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 125 transitions. [2020-07-10 15:03:32,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-10 15:03:32,909 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:32,909 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-10 15:03:32,910 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:03:32,910 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:32,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:32,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1627225809, now seen corresponding path program 1 times [2020-07-10 15:03:32,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:32,913 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261910383] [2020-07-10 15:03:32,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:32,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:33,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:33,048 INFO L280 TraceCheckUtils]: 0: Hoare triple {708#true} assume true; {708#true} is VALID [2020-07-10 15:03:33,049 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {708#true} {708#true} #197#return; {708#true} is VALID [2020-07-10 15:03:33,050 INFO L263 TraceCheckUtils]: 0: Hoare triple {708#true} call ULTIMATE.init(); {708#true} is VALID [2020-07-10 15:03:33,051 INFO L280 TraceCheckUtils]: 1: Hoare triple {708#true} assume true; {708#true} is VALID [2020-07-10 15:03:33,051 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {708#true} {708#true} #197#return; {708#true} is VALID [2020-07-10 15:03:33,052 INFO L263 TraceCheckUtils]: 3: Hoare triple {708#true} call #t~ret11 := main(); {708#true} is VALID [2020-07-10 15:03:33,052 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-10 15:03:33,053 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-10 15:03:33,053 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-10 15:03:33,055 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-10 15:03:33,057 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-10 15:03:33,059 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-10 15:03:33,062 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-10 15:03:33,064 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-10 15:03:33,066 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-10 15:03:33,068 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-10 15:03:33,069 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-10 15:03:33,070 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-10 15:03:33,071 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-10 15:03:33,072 INFO L280 TraceCheckUtils]: 17: Hoare triple {712#(not (= 0 main_~p1~0))} assume !(0 != ~p1~0); {709#false} is VALID [2020-07-10 15:03:33,072 INFO L280 TraceCheckUtils]: 18: Hoare triple {709#false} assume 0 != ~p2~0; {709#false} is VALID [2020-07-10 15:03:33,073 INFO L280 TraceCheckUtils]: 19: Hoare triple {709#false} assume 1 != ~lk2~0; {709#false} is VALID [2020-07-10 15:03:33,073 INFO L280 TraceCheckUtils]: 20: Hoare triple {709#false} assume !false; {709#false} is VALID [2020-07-10 15:03:33,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:33,077 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261910383] [2020-07-10 15:03:33,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:33,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:33,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027845285] [2020-07-10 15:03:33,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-10 15:03:33,080 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:33,081 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:33,123 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-10 15:03:33,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:33,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:33,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:33,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:33,125 INFO L87 Difference]: Start difference. First operand 70 states and 125 transitions. Second operand 3 states. [2020-07-10 15:03:33,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:33,411 INFO L93 Difference]: Finished difference Result 108 states and 189 transitions. [2020-07-10 15:03:33,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:33,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-10 15:03:33,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:33,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:33,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2020-07-10 15:03:33,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:33,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2020-07-10 15:03:33,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 186 transitions. [2020-07-10 15:03:33,688 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-10 15:03:33,694 INFO L225 Difference]: With dead ends: 108 [2020-07-10 15:03:33,694 INFO L226 Difference]: Without dead ends: 75 [2020-07-10 15:03:33,696 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:33,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-07-10 15:03:33,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2020-07-10 15:03:33,716 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:33,716 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 73 states. [2020-07-10 15:03:33,716 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 73 states. [2020-07-10 15:03:33,717 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 73 states. [2020-07-10 15:03:33,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:33,722 INFO L93 Difference]: Finished difference Result 75 states and 128 transitions. [2020-07-10 15:03:33,723 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 128 transitions. [2020-07-10 15:03:33,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:33,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:33,724 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 75 states. [2020-07-10 15:03:33,725 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 75 states. [2020-07-10 15:03:33,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:33,730 INFO L93 Difference]: Finished difference Result 75 states and 128 transitions. [2020-07-10 15:03:33,731 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 128 transitions. [2020-07-10 15:03:33,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:33,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:33,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:33,732 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:33,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-07-10 15:03:33,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 127 transitions. [2020-07-10 15:03:33,738 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 127 transitions. Word has length 21 [2020-07-10 15:03:33,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:33,739 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 127 transitions. [2020-07-10 15:03:33,739 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:33,739 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 127 transitions. [2020-07-10 15:03:33,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-10 15:03:33,740 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:33,740 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-10 15:03:33,741 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 15:03:33,741 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:33,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:33,742 INFO L82 PathProgramCache]: Analyzing trace with hash 616108559, now seen corresponding path program 1 times [2020-07-10 15:03:33,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:33,743 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277799252] [2020-07-10 15:03:33,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:33,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:33,861 INFO L280 TraceCheckUtils]: 0: Hoare triple {1065#true} assume true; {1065#true} is VALID [2020-07-10 15:03:33,861 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1065#true} {1065#true} #197#return; {1065#true} is VALID [2020-07-10 15:03:33,862 INFO L263 TraceCheckUtils]: 0: Hoare triple {1065#true} call ULTIMATE.init(); {1065#true} is VALID [2020-07-10 15:03:33,862 INFO L280 TraceCheckUtils]: 1: Hoare triple {1065#true} assume true; {1065#true} is VALID [2020-07-10 15:03:33,863 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1065#true} {1065#true} #197#return; {1065#true} is VALID [2020-07-10 15:03:33,863 INFO L263 TraceCheckUtils]: 3: Hoare triple {1065#true} call #t~ret11 := main(); {1065#true} is VALID [2020-07-10 15:03:33,864 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-10 15:03:33,864 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-10 15:03:33,864 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-10 15:03:33,865 INFO L280 TraceCheckUtils]: 7: Hoare triple {1065#true} assume !(0 != ~p1~0); {1065#true} is VALID [2020-07-10 15:03:33,866 INFO L280 TraceCheckUtils]: 8: Hoare triple {1065#true} assume 0 != ~p2~0;~lk2~0 := 1; {1069#(= 1 main_~lk2~0)} is VALID [2020-07-10 15:03:33,868 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-10 15:03:33,869 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-10 15:03:33,871 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-10 15:03:33,873 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-10 15:03:33,874 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-10 15:03:33,876 INFO L280 TraceCheckUtils]: 14: Hoare triple {1069#(= 1 main_~lk2~0)} assume !(0 != ~p8~0); {1069#(= 1 main_~lk2~0)} is VALID [2020-07-10 15:03:33,877 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-10 15:03:33,879 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-10 15:03:33,881 INFO L280 TraceCheckUtils]: 17: Hoare triple {1069#(= 1 main_~lk2~0)} assume !(0 != ~p1~0); {1069#(= 1 main_~lk2~0)} is VALID [2020-07-10 15:03:33,882 INFO L280 TraceCheckUtils]: 18: Hoare triple {1069#(= 1 main_~lk2~0)} assume 0 != ~p2~0; {1069#(= 1 main_~lk2~0)} is VALID [2020-07-10 15:03:33,884 INFO L280 TraceCheckUtils]: 19: Hoare triple {1069#(= 1 main_~lk2~0)} assume 1 != ~lk2~0; {1066#false} is VALID [2020-07-10 15:03:33,884 INFO L280 TraceCheckUtils]: 20: Hoare triple {1066#false} assume !false; {1066#false} is VALID [2020-07-10 15:03:33,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:33,886 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277799252] [2020-07-10 15:03:33,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:33,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:33,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060445281] [2020-07-10 15:03:33,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-10 15:03:33,888 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:33,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:33,925 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-10 15:03:33,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:33,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:33,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:33,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:33,928 INFO L87 Difference]: Start difference. First operand 73 states and 127 transitions. Second operand 3 states. [2020-07-10 15:03:34,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:34,108 INFO L93 Difference]: Finished difference Result 136 states and 240 transitions. [2020-07-10 15:03:34,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:34,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-10 15:03:34,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:34,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:34,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2020-07-10 15:03:34,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:34,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2020-07-10 15:03:34,116 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 126 transitions. [2020-07-10 15:03:34,264 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-10 15:03:34,270 INFO L225 Difference]: With dead ends: 136 [2020-07-10 15:03:34,270 INFO L226 Difference]: Without dead ends: 134 [2020-07-10 15:03:34,271 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:34,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-07-10 15:03:34,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 96. [2020-07-10 15:03:34,312 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:34,313 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand 96 states. [2020-07-10 15:03:34,313 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 96 states. [2020-07-10 15:03:34,314 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 96 states. [2020-07-10 15:03:34,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:34,328 INFO L93 Difference]: Finished difference Result 134 states and 237 transitions. [2020-07-10 15:03:34,329 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 237 transitions. [2020-07-10 15:03:34,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:34,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:34,330 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 134 states. [2020-07-10 15:03:34,330 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 134 states. [2020-07-10 15:03:34,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:34,343 INFO L93 Difference]: Finished difference Result 134 states and 237 transitions. [2020-07-10 15:03:34,343 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 237 transitions. [2020-07-10 15:03:34,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:34,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:34,344 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:34,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:34,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-07-10 15:03:34,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 168 transitions. [2020-07-10 15:03:34,355 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 168 transitions. Word has length 21 [2020-07-10 15:03:34,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:34,356 INFO L479 AbstractCegarLoop]: Abstraction has 96 states and 168 transitions. [2020-07-10 15:03:34,357 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:34,357 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 168 transitions. [2020-07-10 15:03:34,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-10 15:03:34,359 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:34,359 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-10 15:03:34,361 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 15:03:34,366 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:34,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:34,367 INFO L82 PathProgramCache]: Analyzing trace with hash 29302545, now seen corresponding path program 1 times [2020-07-10 15:03:34,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:34,367 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176296442] [2020-07-10 15:03:34,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:34,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:34,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:34,434 INFO L280 TraceCheckUtils]: 0: Hoare triple {1592#true} assume true; {1592#true} is VALID [2020-07-10 15:03:34,435 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1592#true} {1592#true} #197#return; {1592#true} is VALID [2020-07-10 15:03:34,436 INFO L263 TraceCheckUtils]: 0: Hoare triple {1592#true} call ULTIMATE.init(); {1592#true} is VALID [2020-07-10 15:03:34,436 INFO L280 TraceCheckUtils]: 1: Hoare triple {1592#true} assume true; {1592#true} is VALID [2020-07-10 15:03:34,436 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1592#true} {1592#true} #197#return; {1592#true} is VALID [2020-07-10 15:03:34,437 INFO L263 TraceCheckUtils]: 3: Hoare triple {1592#true} call #t~ret11 := main(); {1592#true} is VALID [2020-07-10 15:03:34,437 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-10 15:03:34,437 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-10 15:03:34,438 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-10 15:03:34,438 INFO L280 TraceCheckUtils]: 7: Hoare triple {1592#true} assume !(0 != ~p1~0); {1592#true} is VALID [2020-07-10 15:03:34,439 INFO L280 TraceCheckUtils]: 8: Hoare triple {1592#true} assume !(0 != ~p2~0); {1596#(= 0 main_~p2~0)} is VALID [2020-07-10 15:03:34,440 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-10 15:03:34,441 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-10 15:03:34,442 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-10 15:03:34,448 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-10 15:03:34,449 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-10 15:03:34,450 INFO L280 TraceCheckUtils]: 14: Hoare triple {1596#(= 0 main_~p2~0)} assume !(0 != ~p8~0); {1596#(= 0 main_~p2~0)} is VALID [2020-07-10 15:03:34,450 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-10 15:03:34,451 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-10 15:03:34,451 INFO L280 TraceCheckUtils]: 17: Hoare triple {1596#(= 0 main_~p2~0)} assume !(0 != ~p1~0); {1596#(= 0 main_~p2~0)} is VALID [2020-07-10 15:03:34,452 INFO L280 TraceCheckUtils]: 18: Hoare triple {1596#(= 0 main_~p2~0)} assume 0 != ~p2~0; {1593#false} is VALID [2020-07-10 15:03:34,453 INFO L280 TraceCheckUtils]: 19: Hoare triple {1593#false} assume 1 != ~lk2~0; {1593#false} is VALID [2020-07-10 15:03:34,453 INFO L280 TraceCheckUtils]: 20: Hoare triple {1593#false} assume !false; {1593#false} is VALID [2020-07-10 15:03:34,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:34,454 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176296442] [2020-07-10 15:03:34,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:34,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:34,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325068215] [2020-07-10 15:03:34,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-10 15:03:34,456 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:34,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:34,487 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-10 15:03:34,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:34,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:34,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:34,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:34,490 INFO L87 Difference]: Start difference. First operand 96 states and 168 transitions. Second operand 3 states. [2020-07-10 15:03:34,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:34,697 INFO L93 Difference]: Finished difference Result 224 states and 398 transitions. [2020-07-10 15:03:34,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:34,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-10 15:03:34,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:34,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:34,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 188 transitions. [2020-07-10 15:03:34,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:34,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 188 transitions. [2020-07-10 15:03:34,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 188 transitions. [2020-07-10 15:03:34,978 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-10 15:03:34,983 INFO L225 Difference]: With dead ends: 224 [2020-07-10 15:03:34,983 INFO L226 Difference]: Without dead ends: 136 [2020-07-10 15:03:34,986 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:34,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-07-10 15:03:35,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2020-07-10 15:03:35,063 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:35,063 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand 134 states. [2020-07-10 15:03:35,063 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 134 states. [2020-07-10 15:03:35,063 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 134 states. [2020-07-10 15:03:35,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:35,075 INFO L93 Difference]: Finished difference Result 136 states and 235 transitions. [2020-07-10 15:03:35,075 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 235 transitions. [2020-07-10 15:03:35,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:35,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:35,077 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 136 states. [2020-07-10 15:03:35,077 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 136 states. [2020-07-10 15:03:35,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:35,086 INFO L93 Difference]: Finished difference Result 136 states and 235 transitions. [2020-07-10 15:03:35,086 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 235 transitions. [2020-07-10 15:03:35,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:35,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:35,088 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:35,088 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:35,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-07-10 15:03:35,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 234 transitions. [2020-07-10 15:03:35,097 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 234 transitions. Word has length 21 [2020-07-10 15:03:35,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:35,098 INFO L479 AbstractCegarLoop]: Abstraction has 134 states and 234 transitions. [2020-07-10 15:03:35,098 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:35,098 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 234 transitions. [2020-07-10 15:03:35,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-10 15:03:35,099 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:35,100 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-10 15:03:35,100 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 15:03:35,100 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:35,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:35,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1919709866, now seen corresponding path program 1 times [2020-07-10 15:03:35,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:35,108 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214859923] [2020-07-10 15:03:35,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:35,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:35,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:35,240 INFO L280 TraceCheckUtils]: 0: Hoare triple {2253#true} assume true; {2253#true} is VALID [2020-07-10 15:03:35,240 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2253#true} {2253#true} #197#return; {2253#true} is VALID [2020-07-10 15:03:35,241 INFO L263 TraceCheckUtils]: 0: Hoare triple {2253#true} call ULTIMATE.init(); {2253#true} is VALID [2020-07-10 15:03:35,241 INFO L280 TraceCheckUtils]: 1: Hoare triple {2253#true} assume true; {2253#true} is VALID [2020-07-10 15:03:35,242 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2253#true} {2253#true} #197#return; {2253#true} is VALID [2020-07-10 15:03:35,242 INFO L263 TraceCheckUtils]: 3: Hoare triple {2253#true} call #t~ret11 := main(); {2253#true} is VALID [2020-07-10 15:03:35,242 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-10 15:03:35,243 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-10 15:03:35,243 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-10 15:03:35,243 INFO L280 TraceCheckUtils]: 7: Hoare triple {2253#true} assume !(0 != ~p1~0); {2253#true} is VALID [2020-07-10 15:03:35,245 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-10 15:03:35,247 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-10 15:03:35,249 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-10 15:03:35,250 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-10 15:03:35,252 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-10 15:03:35,253 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-10 15:03:35,254 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-10 15:03:35,254 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-10 15:03:35,255 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-10 15:03:35,256 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-10 15:03:35,256 INFO L280 TraceCheckUtils]: 18: Hoare triple {2257#(not (= 0 main_~p2~0))} assume !(0 != ~p2~0); {2254#false} is VALID [2020-07-10 15:03:35,257 INFO L280 TraceCheckUtils]: 19: Hoare triple {2254#false} assume 0 != ~p3~0; {2254#false} is VALID [2020-07-10 15:03:35,257 INFO L280 TraceCheckUtils]: 20: Hoare triple {2254#false} assume 1 != ~lk3~0; {2254#false} is VALID [2020-07-10 15:03:35,258 INFO L280 TraceCheckUtils]: 21: Hoare triple {2254#false} assume !false; {2254#false} is VALID [2020-07-10 15:03:35,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:35,260 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214859923] [2020-07-10 15:03:35,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:35,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:35,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306583852] [2020-07-10 15:03:35,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-10 15:03:35,262 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:35,263 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:35,299 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-10 15:03:35,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:35,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:35,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:35,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:35,301 INFO L87 Difference]: Start difference. First operand 134 states and 234 transitions. Second operand 3 states. [2020-07-10 15:03:35,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:35,516 INFO L93 Difference]: Finished difference Result 201 states and 349 transitions. [2020-07-10 15:03:35,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:35,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-10 15:03:35,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:35,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:35,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 183 transitions. [2020-07-10 15:03:35,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:35,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 183 transitions. [2020-07-10 15:03:35,524 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 183 transitions. [2020-07-10 15:03:35,774 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-10 15:03:35,779 INFO L225 Difference]: With dead ends: 201 [2020-07-10 15:03:35,780 INFO L226 Difference]: Without dead ends: 138 [2020-07-10 15:03:35,782 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:35,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-07-10 15:03:35,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2020-07-10 15:03:35,838 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:35,838 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand 136 states. [2020-07-10 15:03:35,838 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 136 states. [2020-07-10 15:03:35,838 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 136 states. [2020-07-10 15:03:35,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:35,846 INFO L93 Difference]: Finished difference Result 138 states and 235 transitions. [2020-07-10 15:03:35,847 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 235 transitions. [2020-07-10 15:03:35,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:35,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:35,848 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 138 states. [2020-07-10 15:03:35,848 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 138 states. [2020-07-10 15:03:35,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:35,863 INFO L93 Difference]: Finished difference Result 138 states and 235 transitions. [2020-07-10 15:03:35,864 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 235 transitions. [2020-07-10 15:03:35,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:35,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:35,865 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:35,865 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:35,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2020-07-10 15:03:35,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 234 transitions. [2020-07-10 15:03:35,872 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 234 transitions. Word has length 22 [2020-07-10 15:03:35,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:35,872 INFO L479 AbstractCegarLoop]: Abstraction has 136 states and 234 transitions. [2020-07-10 15:03:35,872 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:35,873 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 234 transitions. [2020-07-10 15:03:35,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-10 15:03:35,874 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:35,874 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-10 15:03:35,874 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-10 15:03:35,875 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:35,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:35,875 INFO L82 PathProgramCache]: Analyzing trace with hash 908592616, now seen corresponding path program 1 times [2020-07-10 15:03:35,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:35,877 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310719152] [2020-07-10 15:03:35,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:35,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:35,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:35,974 INFO L280 TraceCheckUtils]: 0: Hoare triple {2897#true} assume true; {2897#true} is VALID [2020-07-10 15:03:35,975 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2897#true} {2897#true} #197#return; {2897#true} is VALID [2020-07-10 15:03:35,975 INFO L263 TraceCheckUtils]: 0: Hoare triple {2897#true} call ULTIMATE.init(); {2897#true} is VALID [2020-07-10 15:03:35,975 INFO L280 TraceCheckUtils]: 1: Hoare triple {2897#true} assume true; {2897#true} is VALID [2020-07-10 15:03:35,975 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2897#true} {2897#true} #197#return; {2897#true} is VALID [2020-07-10 15:03:35,976 INFO L263 TraceCheckUtils]: 3: Hoare triple {2897#true} call #t~ret11 := main(); {2897#true} is VALID [2020-07-10 15:03:35,976 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-10 15:03:35,976 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-10 15:03:35,977 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-10 15:03:35,977 INFO L280 TraceCheckUtils]: 7: Hoare triple {2897#true} assume !(0 != ~p1~0); {2897#true} is VALID [2020-07-10 15:03:35,977 INFO L280 TraceCheckUtils]: 8: Hoare triple {2897#true} assume !(0 != ~p2~0); {2897#true} is VALID [2020-07-10 15:03:35,979 INFO L280 TraceCheckUtils]: 9: Hoare triple {2897#true} assume 0 != ~p3~0;~lk3~0 := 1; {2901#(= 1 main_~lk3~0)} is VALID [2020-07-10 15:03:35,981 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-10 15:03:35,982 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-10 15:03:35,984 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-10 15:03:35,986 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-10 15:03:35,988 INFO L280 TraceCheckUtils]: 14: Hoare triple {2901#(= 1 main_~lk3~0)} assume !(0 != ~p8~0); {2901#(= 1 main_~lk3~0)} is VALID [2020-07-10 15:03:35,990 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-10 15:03:35,992 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-10 15:03:35,993 INFO L280 TraceCheckUtils]: 17: Hoare triple {2901#(= 1 main_~lk3~0)} assume !(0 != ~p1~0); {2901#(= 1 main_~lk3~0)} is VALID [2020-07-10 15:03:35,995 INFO L280 TraceCheckUtils]: 18: Hoare triple {2901#(= 1 main_~lk3~0)} assume !(0 != ~p2~0); {2901#(= 1 main_~lk3~0)} is VALID [2020-07-10 15:03:35,997 INFO L280 TraceCheckUtils]: 19: Hoare triple {2901#(= 1 main_~lk3~0)} assume 0 != ~p3~0; {2901#(= 1 main_~lk3~0)} is VALID [2020-07-10 15:03:35,999 INFO L280 TraceCheckUtils]: 20: Hoare triple {2901#(= 1 main_~lk3~0)} assume 1 != ~lk3~0; {2898#false} is VALID [2020-07-10 15:03:36,000 INFO L280 TraceCheckUtils]: 21: Hoare triple {2898#false} assume !false; {2898#false} is VALID [2020-07-10 15:03:36,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:36,004 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310719152] [2020-07-10 15:03:36,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:36,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:36,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592005329] [2020-07-10 15:03:36,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-10 15:03:36,006 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:36,006 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:36,041 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-10 15:03:36,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:36,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:36,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:36,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:36,044 INFO L87 Difference]: Start difference. First operand 136 states and 234 transitions. Second operand 3 states. [2020-07-10 15:03:36,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:36,271 INFO L93 Difference]: Finished difference Result 252 states and 440 transitions. [2020-07-10 15:03:36,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:36,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-10 15:03:36,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:36,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:36,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2020-07-10 15:03:36,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:36,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2020-07-10 15:03:36,289 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 122 transitions. [2020-07-10 15:03:36,445 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-10 15:03:36,453 INFO L225 Difference]: With dead ends: 252 [2020-07-10 15:03:36,454 INFO L226 Difference]: Without dead ends: 250 [2020-07-10 15:03:36,455 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:36,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2020-07-10 15:03:36,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 184. [2020-07-10 15:03:36,482 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:36,482 INFO L82 GeneralOperation]: Start isEquivalent. First operand 250 states. Second operand 184 states. [2020-07-10 15:03:36,482 INFO L74 IsIncluded]: Start isIncluded. First operand 250 states. Second operand 184 states. [2020-07-10 15:03:36,483 INFO L87 Difference]: Start difference. First operand 250 states. Second operand 184 states. [2020-07-10 15:03:36,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:36,497 INFO L93 Difference]: Finished difference Result 250 states and 435 transitions. [2020-07-10 15:03:36,497 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 435 transitions. [2020-07-10 15:03:36,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:36,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:36,499 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand 250 states. [2020-07-10 15:03:36,499 INFO L87 Difference]: Start difference. First operand 184 states. Second operand 250 states. [2020-07-10 15:03:36,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:36,512 INFO L93 Difference]: Finished difference Result 250 states and 435 transitions. [2020-07-10 15:03:36,512 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 435 transitions. [2020-07-10 15:03:36,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:36,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:36,513 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:36,514 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:36,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-07-10 15:03:36,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 314 transitions. [2020-07-10 15:03:36,522 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 314 transitions. Word has length 22 [2020-07-10 15:03:36,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:36,523 INFO L479 AbstractCegarLoop]: Abstraction has 184 states and 314 transitions. [2020-07-10 15:03:36,523 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:36,523 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 314 transitions. [2020-07-10 15:03:36,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-10 15:03:36,525 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:36,525 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-10 15:03:36,525 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-10 15:03:36,526 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:36,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:36,526 INFO L82 PathProgramCache]: Analyzing trace with hash 321786602, now seen corresponding path program 1 times [2020-07-10 15:03:36,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:36,527 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438975535] [2020-07-10 15:03:36,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:36,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:36,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:36,601 INFO L280 TraceCheckUtils]: 0: Hoare triple {3866#true} assume true; {3866#true} is VALID [2020-07-10 15:03:36,602 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3866#true} {3866#true} #197#return; {3866#true} is VALID [2020-07-10 15:03:36,602 INFO L263 TraceCheckUtils]: 0: Hoare triple {3866#true} call ULTIMATE.init(); {3866#true} is VALID [2020-07-10 15:03:36,603 INFO L280 TraceCheckUtils]: 1: Hoare triple {3866#true} assume true; {3866#true} is VALID [2020-07-10 15:03:36,603 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3866#true} {3866#true} #197#return; {3866#true} is VALID [2020-07-10 15:03:36,603 INFO L263 TraceCheckUtils]: 3: Hoare triple {3866#true} call #t~ret11 := main(); {3866#true} is VALID [2020-07-10 15:03:36,604 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-10 15:03:36,604 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-10 15:03:36,606 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-10 15:03:36,606 INFO L280 TraceCheckUtils]: 7: Hoare triple {3866#true} assume !(0 != ~p1~0); {3866#true} is VALID [2020-07-10 15:03:36,607 INFO L280 TraceCheckUtils]: 8: Hoare triple {3866#true} assume !(0 != ~p2~0); {3866#true} is VALID [2020-07-10 15:03:36,608 INFO L280 TraceCheckUtils]: 9: Hoare triple {3866#true} assume !(0 != ~p3~0); {3870#(= 0 main_~p3~0)} is VALID [2020-07-10 15:03:36,608 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-10 15:03:36,610 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-10 15:03:36,610 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-10 15:03:36,611 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-10 15:03:36,612 INFO L280 TraceCheckUtils]: 14: Hoare triple {3870#(= 0 main_~p3~0)} assume !(0 != ~p8~0); {3870#(= 0 main_~p3~0)} is VALID [2020-07-10 15:03:36,613 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-10 15:03:36,614 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-10 15:03:36,615 INFO L280 TraceCheckUtils]: 17: Hoare triple {3870#(= 0 main_~p3~0)} assume !(0 != ~p1~0); {3870#(= 0 main_~p3~0)} is VALID [2020-07-10 15:03:36,616 INFO L280 TraceCheckUtils]: 18: Hoare triple {3870#(= 0 main_~p3~0)} assume !(0 != ~p2~0); {3870#(= 0 main_~p3~0)} is VALID [2020-07-10 15:03:36,617 INFO L280 TraceCheckUtils]: 19: Hoare triple {3870#(= 0 main_~p3~0)} assume 0 != ~p3~0; {3867#false} is VALID [2020-07-10 15:03:36,618 INFO L280 TraceCheckUtils]: 20: Hoare triple {3867#false} assume 1 != ~lk3~0; {3867#false} is VALID [2020-07-10 15:03:36,618 INFO L280 TraceCheckUtils]: 21: Hoare triple {3867#false} assume !false; {3867#false} is VALID [2020-07-10 15:03:36,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:36,620 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438975535] [2020-07-10 15:03:36,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:36,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:36,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044736146] [2020-07-10 15:03:36,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-10 15:03:36,622 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:36,622 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:36,648 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-10 15:03:36,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:36,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:36,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:36,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:36,651 INFO L87 Difference]: Start difference. First operand 184 states and 314 transitions. Second operand 3 states. [2020-07-10 15:03:36,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:36,899 INFO L93 Difference]: Finished difference Result 432 states and 744 transitions. [2020-07-10 15:03:36,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:36,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-10 15:03:36,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:36,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:36,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 185 transitions. [2020-07-10 15:03:36,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:36,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 185 transitions. [2020-07-10 15:03:36,907 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 185 transitions. [2020-07-10 15:03:37,147 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-10 15:03:37,157 INFO L225 Difference]: With dead ends: 432 [2020-07-10 15:03:37,157 INFO L226 Difference]: Without dead ends: 258 [2020-07-10 15:03:37,160 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:37,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2020-07-10 15:03:37,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2020-07-10 15:03:37,232 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:37,232 INFO L82 GeneralOperation]: Start isEquivalent. First operand 258 states. Second operand 256 states. [2020-07-10 15:03:37,233 INFO L74 IsIncluded]: Start isIncluded. First operand 258 states. Second operand 256 states. [2020-07-10 15:03:37,233 INFO L87 Difference]: Start difference. First operand 258 states. Second operand 256 states. [2020-07-10 15:03:37,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:37,253 INFO L93 Difference]: Finished difference Result 258 states and 435 transitions. [2020-07-10 15:03:37,253 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 435 transitions. [2020-07-10 15:03:37,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:37,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:37,257 INFO L74 IsIncluded]: Start isIncluded. First operand 256 states. Second operand 258 states. [2020-07-10 15:03:37,258 INFO L87 Difference]: Start difference. First operand 256 states. Second operand 258 states. [2020-07-10 15:03:37,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:37,288 INFO L93 Difference]: Finished difference Result 258 states and 435 transitions. [2020-07-10 15:03:37,288 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 435 transitions. [2020-07-10 15:03:37,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:37,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:37,290 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:37,290 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:37,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2020-07-10 15:03:37,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 434 transitions. [2020-07-10 15:03:37,305 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 434 transitions. Word has length 22 [2020-07-10 15:03:37,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:37,306 INFO L479 AbstractCegarLoop]: Abstraction has 256 states and 434 transitions. [2020-07-10 15:03:37,306 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:37,306 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 434 transitions. [2020-07-10 15:03:37,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-10 15:03:37,308 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:37,308 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:03:37,309 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-10 15:03:37,309 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:37,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:37,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1898185914, now seen corresponding path program 1 times [2020-07-10 15:03:37,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:37,312 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192504704] [2020-07-10 15:03:37,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:37,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:37,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:37,406 INFO L280 TraceCheckUtils]: 0: Hoare triple {5111#true} assume true; {5111#true} is VALID [2020-07-10 15:03:37,406 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {5111#true} {5111#true} #197#return; {5111#true} is VALID [2020-07-10 15:03:37,407 INFO L263 TraceCheckUtils]: 0: Hoare triple {5111#true} call ULTIMATE.init(); {5111#true} is VALID [2020-07-10 15:03:37,408 INFO L280 TraceCheckUtils]: 1: Hoare triple {5111#true} assume true; {5111#true} is VALID [2020-07-10 15:03:37,408 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5111#true} {5111#true} #197#return; {5111#true} is VALID [2020-07-10 15:03:37,410 INFO L263 TraceCheckUtils]: 3: Hoare triple {5111#true} call #t~ret11 := main(); {5111#true} is VALID [2020-07-10 15:03:37,412 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-10 15:03:37,413 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-10 15:03:37,419 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-10 15:03:37,420 INFO L280 TraceCheckUtils]: 7: Hoare triple {5111#true} assume !(0 != ~p1~0); {5111#true} is VALID [2020-07-10 15:03:37,420 INFO L280 TraceCheckUtils]: 8: Hoare triple {5111#true} assume !(0 != ~p2~0); {5111#true} is VALID [2020-07-10 15:03:37,426 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-10 15:03:37,428 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-10 15:03:37,430 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-10 15:03:37,431 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-10 15:03:37,432 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-10 15:03:37,433 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-10 15:03:37,449 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-10 15:03:37,451 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-10 15:03:37,452 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-10 15:03:37,454 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-10 15:03:37,455 INFO L280 TraceCheckUtils]: 19: Hoare triple {5115#(not (= 0 main_~p3~0))} assume !(0 != ~p3~0); {5112#false} is VALID [2020-07-10 15:03:37,455 INFO L280 TraceCheckUtils]: 20: Hoare triple {5112#false} assume 0 != ~p4~0; {5112#false} is VALID [2020-07-10 15:03:37,455 INFO L280 TraceCheckUtils]: 21: Hoare triple {5112#false} assume 1 != ~lk4~0; {5112#false} is VALID [2020-07-10 15:03:37,456 INFO L280 TraceCheckUtils]: 22: Hoare triple {5112#false} assume !false; {5112#false} is VALID [2020-07-10 15:03:37,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:37,457 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192504704] [2020-07-10 15:03:37,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:37,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:37,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939832946] [2020-07-10 15:03:37,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-10 15:03:37,459 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:37,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:37,497 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-10 15:03:37,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:37,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:37,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:37,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:37,500 INFO L87 Difference]: Start difference. First operand 256 states and 434 transitions. Second operand 3 states. [2020-07-10 15:03:37,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:37,759 INFO L93 Difference]: Finished difference Result 384 states and 648 transitions. [2020-07-10 15:03:37,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:37,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-10 15:03:37,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:37,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:37,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2020-07-10 15:03:37,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:37,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2020-07-10 15:03:37,769 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 180 transitions. [2020-07-10 15:03:38,037 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-10 15:03:38,054 INFO L225 Difference]: With dead ends: 384 [2020-07-10 15:03:38,054 INFO L226 Difference]: Without dead ends: 262 [2020-07-10 15:03:38,058 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:38,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2020-07-10 15:03:38,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2020-07-10 15:03:38,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:38,121 INFO L82 GeneralOperation]: Start isEquivalent. First operand 262 states. Second operand 260 states. [2020-07-10 15:03:38,121 INFO L74 IsIncluded]: Start isIncluded. First operand 262 states. Second operand 260 states. [2020-07-10 15:03:38,122 INFO L87 Difference]: Start difference. First operand 262 states. Second operand 260 states. [2020-07-10 15:03:38,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:38,139 INFO L93 Difference]: Finished difference Result 262 states and 435 transitions. [2020-07-10 15:03:38,139 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 435 transitions. [2020-07-10 15:03:38,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:38,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:38,141 INFO L74 IsIncluded]: Start isIncluded. First operand 260 states. Second operand 262 states. [2020-07-10 15:03:38,141 INFO L87 Difference]: Start difference. First operand 260 states. Second operand 262 states. [2020-07-10 15:03:38,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:38,155 INFO L93 Difference]: Finished difference Result 262 states and 435 transitions. [2020-07-10 15:03:38,156 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 435 transitions. [2020-07-10 15:03:38,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:38,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:38,158 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:38,158 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:38,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2020-07-10 15:03:38,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 434 transitions. [2020-07-10 15:03:38,169 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 434 transitions. Word has length 23 [2020-07-10 15:03:38,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:38,169 INFO L479 AbstractCegarLoop]: Abstraction has 260 states and 434 transitions. [2020-07-10 15:03:38,170 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:38,170 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 434 transitions. [2020-07-10 15:03:38,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-10 15:03:38,176 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:38,177 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-10 15:03:38,177 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-10 15:03:38,177 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:38,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:38,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1385664132, now seen corresponding path program 1 times [2020-07-10 15:03:38,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:38,179 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737994256] [2020-07-10 15:03:38,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:38,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:38,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:38,226 INFO L280 TraceCheckUtils]: 0: Hoare triple {6320#true} assume true; {6320#true} is VALID [2020-07-10 15:03:38,227 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {6320#true} {6320#true} #197#return; {6320#true} is VALID [2020-07-10 15:03:38,227 INFO L263 TraceCheckUtils]: 0: Hoare triple {6320#true} call ULTIMATE.init(); {6320#true} is VALID [2020-07-10 15:03:38,228 INFO L280 TraceCheckUtils]: 1: Hoare triple {6320#true} assume true; {6320#true} is VALID [2020-07-10 15:03:38,228 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {6320#true} {6320#true} #197#return; {6320#true} is VALID [2020-07-10 15:03:38,229 INFO L263 TraceCheckUtils]: 3: Hoare triple {6320#true} call #t~ret11 := main(); {6320#true} is VALID [2020-07-10 15:03:38,229 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-10 15:03:38,229 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-10 15:03:38,229 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-10 15:03:38,231 INFO L280 TraceCheckUtils]: 7: Hoare triple {6320#true} assume !(0 != ~p1~0); {6320#true} is VALID [2020-07-10 15:03:38,231 INFO L280 TraceCheckUtils]: 8: Hoare triple {6320#true} assume !(0 != ~p2~0); {6320#true} is VALID [2020-07-10 15:03:38,232 INFO L280 TraceCheckUtils]: 9: Hoare triple {6320#true} assume !(0 != ~p3~0); {6320#true} is VALID [2020-07-10 15:03:38,233 INFO L280 TraceCheckUtils]: 10: Hoare triple {6320#true} assume 0 != ~p4~0;~lk4~0 := 1; {6324#(= 1 main_~lk4~0)} is VALID [2020-07-10 15:03:38,234 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-10 15:03:38,235 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-10 15:03:38,237 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-10 15:03:38,238 INFO L280 TraceCheckUtils]: 14: Hoare triple {6324#(= 1 main_~lk4~0)} assume !(0 != ~p8~0); {6324#(= 1 main_~lk4~0)} is VALID [2020-07-10 15:03:38,240 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-10 15:03:38,241 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-10 15:03:38,241 INFO L280 TraceCheckUtils]: 17: Hoare triple {6324#(= 1 main_~lk4~0)} assume !(0 != ~p1~0); {6324#(= 1 main_~lk4~0)} is VALID [2020-07-10 15:03:38,242 INFO L280 TraceCheckUtils]: 18: Hoare triple {6324#(= 1 main_~lk4~0)} assume !(0 != ~p2~0); {6324#(= 1 main_~lk4~0)} is VALID [2020-07-10 15:03:38,245 INFO L280 TraceCheckUtils]: 19: Hoare triple {6324#(= 1 main_~lk4~0)} assume !(0 != ~p3~0); {6324#(= 1 main_~lk4~0)} is VALID [2020-07-10 15:03:38,246 INFO L280 TraceCheckUtils]: 20: Hoare triple {6324#(= 1 main_~lk4~0)} assume 0 != ~p4~0; {6324#(= 1 main_~lk4~0)} is VALID [2020-07-10 15:03:38,248 INFO L280 TraceCheckUtils]: 21: Hoare triple {6324#(= 1 main_~lk4~0)} assume 1 != ~lk4~0; {6321#false} is VALID [2020-07-10 15:03:38,248 INFO L280 TraceCheckUtils]: 22: Hoare triple {6321#false} assume !false; {6321#false} is VALID [2020-07-10 15:03:38,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:38,250 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737994256] [2020-07-10 15:03:38,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:38,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:38,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784850283] [2020-07-10 15:03:38,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-10 15:03:38,253 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:38,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:38,291 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-10 15:03:38,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:38,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:38,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:38,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:38,293 INFO L87 Difference]: Start difference. First operand 260 states and 434 transitions. Second operand 3 states. [2020-07-10 15:03:38,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:38,589 INFO L93 Difference]: Finished difference Result 476 states and 808 transitions. [2020-07-10 15:03:38,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:38,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-10 15:03:38,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:38,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:38,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2020-07-10 15:03:38,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:38,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2020-07-10 15:03:38,604 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 118 transitions. [2020-07-10 15:03:38,779 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-10 15:03:38,814 INFO L225 Difference]: With dead ends: 476 [2020-07-10 15:03:38,815 INFO L226 Difference]: Without dead ends: 474 [2020-07-10 15:03:38,816 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:38,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2020-07-10 15:03:38,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 360. [2020-07-10 15:03:38,896 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:38,896 INFO L82 GeneralOperation]: Start isEquivalent. First operand 474 states. Second operand 360 states. [2020-07-10 15:03:38,896 INFO L74 IsIncluded]: Start isIncluded. First operand 474 states. Second operand 360 states. [2020-07-10 15:03:38,897 INFO L87 Difference]: Start difference. First operand 474 states. Second operand 360 states. [2020-07-10 15:03:38,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:38,934 INFO L93 Difference]: Finished difference Result 474 states and 799 transitions. [2020-07-10 15:03:38,934 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 799 transitions. [2020-07-10 15:03:38,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:38,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:38,938 INFO L74 IsIncluded]: Start isIncluded. First operand 360 states. Second operand 474 states. [2020-07-10 15:03:38,938 INFO L87 Difference]: Start difference. First operand 360 states. Second operand 474 states. [2020-07-10 15:03:38,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:38,972 INFO L93 Difference]: Finished difference Result 474 states and 799 transitions. [2020-07-10 15:03:38,973 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 799 transitions. [2020-07-10 15:03:38,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:38,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:38,975 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:38,976 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:38,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2020-07-10 15:03:38,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 590 transitions. [2020-07-10 15:03:38,991 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 590 transitions. Word has length 23 [2020-07-10 15:03:38,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:38,991 INFO L479 AbstractCegarLoop]: Abstraction has 360 states and 590 transitions. [2020-07-10 15:03:38,991 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:38,991 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 590 transitions. [2020-07-10 15:03:38,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-10 15:03:38,993 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:38,993 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-10 15:03:38,993 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-10 15:03:38,994 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:38,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:38,994 INFO L82 PathProgramCache]: Analyzing trace with hash 798858118, now seen corresponding path program 1 times [2020-07-10 15:03:38,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:38,995 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007133610] [2020-07-10 15:03:38,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:39,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:39,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:39,060 INFO L280 TraceCheckUtils]: 0: Hoare triple {8149#true} assume true; {8149#true} is VALID [2020-07-10 15:03:39,061 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {8149#true} {8149#true} #197#return; {8149#true} is VALID [2020-07-10 15:03:39,062 INFO L263 TraceCheckUtils]: 0: Hoare triple {8149#true} call ULTIMATE.init(); {8149#true} is VALID [2020-07-10 15:03:39,063 INFO L280 TraceCheckUtils]: 1: Hoare triple {8149#true} assume true; {8149#true} is VALID [2020-07-10 15:03:39,063 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {8149#true} {8149#true} #197#return; {8149#true} is VALID [2020-07-10 15:03:39,063 INFO L263 TraceCheckUtils]: 3: Hoare triple {8149#true} call #t~ret11 := main(); {8149#true} is VALID [2020-07-10 15:03:39,064 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-10 15:03:39,064 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-10 15:03:39,065 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-10 15:03:39,065 INFO L280 TraceCheckUtils]: 7: Hoare triple {8149#true} assume !(0 != ~p1~0); {8149#true} is VALID [2020-07-10 15:03:39,065 INFO L280 TraceCheckUtils]: 8: Hoare triple {8149#true} assume !(0 != ~p2~0); {8149#true} is VALID [2020-07-10 15:03:39,066 INFO L280 TraceCheckUtils]: 9: Hoare triple {8149#true} assume !(0 != ~p3~0); {8149#true} is VALID [2020-07-10 15:03:39,068 INFO L280 TraceCheckUtils]: 10: Hoare triple {8149#true} assume !(0 != ~p4~0); {8153#(= 0 main_~p4~0)} is VALID [2020-07-10 15:03:39,070 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-10 15:03:39,071 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-10 15:03:39,073 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-10 15:03:39,074 INFO L280 TraceCheckUtils]: 14: Hoare triple {8153#(= 0 main_~p4~0)} assume !(0 != ~p8~0); {8153#(= 0 main_~p4~0)} is VALID [2020-07-10 15:03:39,078 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-10 15:03:39,080 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-10 15:03:39,086 INFO L280 TraceCheckUtils]: 17: Hoare triple {8153#(= 0 main_~p4~0)} assume !(0 != ~p1~0); {8153#(= 0 main_~p4~0)} is VALID [2020-07-10 15:03:39,092 INFO L280 TraceCheckUtils]: 18: Hoare triple {8153#(= 0 main_~p4~0)} assume !(0 != ~p2~0); {8153#(= 0 main_~p4~0)} is VALID [2020-07-10 15:03:39,095 INFO L280 TraceCheckUtils]: 19: Hoare triple {8153#(= 0 main_~p4~0)} assume !(0 != ~p3~0); {8153#(= 0 main_~p4~0)} is VALID [2020-07-10 15:03:39,096 INFO L280 TraceCheckUtils]: 20: Hoare triple {8153#(= 0 main_~p4~0)} assume 0 != ~p4~0; {8150#false} is VALID [2020-07-10 15:03:39,096 INFO L280 TraceCheckUtils]: 21: Hoare triple {8150#false} assume 1 != ~lk4~0; {8150#false} is VALID [2020-07-10 15:03:39,096 INFO L280 TraceCheckUtils]: 22: Hoare triple {8150#false} assume !false; {8150#false} is VALID [2020-07-10 15:03:39,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:39,097 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007133610] [2020-07-10 15:03:39,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:39,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:39,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101563382] [2020-07-10 15:03:39,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-10 15:03:39,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:39,106 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:39,154 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-10 15:03:39,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:39,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:39,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:39,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:39,156 INFO L87 Difference]: Start difference. First operand 360 states and 590 transitions. Second operand 3 states. [2020-07-10 15:03:39,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:39,513 INFO L93 Difference]: Finished difference Result 844 states and 1392 transitions. [2020-07-10 15:03:39,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:39,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-10 15:03:39,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:39,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:39,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2020-07-10 15:03:39,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:39,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2020-07-10 15:03:39,526 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 182 transitions. [2020-07-10 15:03:39,755 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-10 15:03:39,784 INFO L225 Difference]: With dead ends: 844 [2020-07-10 15:03:39,785 INFO L226 Difference]: Without dead ends: 498 [2020-07-10 15:03:39,786 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:39,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2020-07-10 15:03:39,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 496. [2020-07-10 15:03:39,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:39,890 INFO L82 GeneralOperation]: Start isEquivalent. First operand 498 states. Second operand 496 states. [2020-07-10 15:03:39,891 INFO L74 IsIncluded]: Start isIncluded. First operand 498 states. Second operand 496 states. [2020-07-10 15:03:39,891 INFO L87 Difference]: Start difference. First operand 498 states. Second operand 496 states. [2020-07-10 15:03:39,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:39,926 INFO L93 Difference]: Finished difference Result 498 states and 807 transitions. [2020-07-10 15:03:39,926 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 807 transitions. [2020-07-10 15:03:39,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:39,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:39,928 INFO L74 IsIncluded]: Start isIncluded. First operand 496 states. Second operand 498 states. [2020-07-10 15:03:39,928 INFO L87 Difference]: Start difference. First operand 496 states. Second operand 498 states. [2020-07-10 15:03:39,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:39,953 INFO L93 Difference]: Finished difference Result 498 states and 807 transitions. [2020-07-10 15:03:39,954 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 807 transitions. [2020-07-10 15:03:39,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:39,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:39,957 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:39,957 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:39,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2020-07-10 15:03:39,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 806 transitions. [2020-07-10 15:03:39,991 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 806 transitions. Word has length 23 [2020-07-10 15:03:39,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:39,991 INFO L479 AbstractCegarLoop]: Abstraction has 496 states and 806 transitions. [2020-07-10 15:03:39,991 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:39,992 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 806 transitions. [2020-07-10 15:03:39,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 15:03:39,994 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:39,994 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-10 15:03:39,995 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-10 15:03:39,995 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:39,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:39,996 INFO L82 PathProgramCache]: Analyzing trace with hash 6129535, now seen corresponding path program 1 times [2020-07-10 15:03:39,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:39,997 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369202491] [2020-07-10 15:03:39,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:40,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:40,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:40,039 INFO L280 TraceCheckUtils]: 0: Hoare triple {10546#true} assume true; {10546#true} is VALID [2020-07-10 15:03:40,040 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {10546#true} {10546#true} #197#return; {10546#true} is VALID [2020-07-10 15:03:40,041 INFO L263 TraceCheckUtils]: 0: Hoare triple {10546#true} call ULTIMATE.init(); {10546#true} is VALID [2020-07-10 15:03:40,041 INFO L280 TraceCheckUtils]: 1: Hoare triple {10546#true} assume true; {10546#true} is VALID [2020-07-10 15:03:40,041 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {10546#true} {10546#true} #197#return; {10546#true} is VALID [2020-07-10 15:03:40,042 INFO L263 TraceCheckUtils]: 3: Hoare triple {10546#true} call #t~ret11 := main(); {10546#true} is VALID [2020-07-10 15:03:40,042 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-10 15:03:40,042 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-10 15:03:40,042 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-10 15:03:40,043 INFO L280 TraceCheckUtils]: 7: Hoare triple {10546#true} assume !(0 != ~p1~0); {10546#true} is VALID [2020-07-10 15:03:40,043 INFO L280 TraceCheckUtils]: 8: Hoare triple {10546#true} assume !(0 != ~p2~0); {10546#true} is VALID [2020-07-10 15:03:40,043 INFO L280 TraceCheckUtils]: 9: Hoare triple {10546#true} assume !(0 != ~p3~0); {10546#true} is VALID [2020-07-10 15:03:40,045 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-10 15:03:40,047 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-10 15:03:40,049 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-10 15:03:40,050 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-10 15:03:40,051 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-10 15:03:40,052 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-10 15:03:40,054 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-10 15:03:40,056 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-10 15:03:40,057 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-10 15:03:40,058 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-10 15:03:40,059 INFO L280 TraceCheckUtils]: 20: Hoare triple {10550#(not (= 0 main_~p4~0))} assume !(0 != ~p4~0); {10547#false} is VALID [2020-07-10 15:03:40,059 INFO L280 TraceCheckUtils]: 21: Hoare triple {10547#false} assume 0 != ~p5~0; {10547#false} is VALID [2020-07-10 15:03:40,059 INFO L280 TraceCheckUtils]: 22: Hoare triple {10547#false} assume 1 != ~lk5~0; {10547#false} is VALID [2020-07-10 15:03:40,060 INFO L280 TraceCheckUtils]: 23: Hoare triple {10547#false} assume !false; {10547#false} is VALID [2020-07-10 15:03:40,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:40,061 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369202491] [2020-07-10 15:03:40,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:40,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:40,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4398345] [2020-07-10 15:03:40,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-10 15:03:40,063 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:40,063 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:40,102 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-10 15:03:40,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:40,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:40,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:40,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:40,105 INFO L87 Difference]: Start difference. First operand 496 states and 806 transitions. Second operand 3 states. [2020-07-10 15:03:40,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:40,441 INFO L93 Difference]: Finished difference Result 744 states and 1204 transitions. [2020-07-10 15:03:40,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:40,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-10 15:03:40,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:40,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:40,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 177 transitions. [2020-07-10 15:03:40,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:40,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 177 transitions. [2020-07-10 15:03:40,449 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 177 transitions. [2020-07-10 15:03:40,719 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-10 15:03:40,747 INFO L225 Difference]: With dead ends: 744 [2020-07-10 15:03:40,747 INFO L226 Difference]: Without dead ends: 506 [2020-07-10 15:03:40,749 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:40,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2020-07-10 15:03:40,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 504. [2020-07-10 15:03:40,845 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:40,846 INFO L82 GeneralOperation]: Start isEquivalent. First operand 506 states. Second operand 504 states. [2020-07-10 15:03:40,846 INFO L74 IsIncluded]: Start isIncluded. First operand 506 states. Second operand 504 states. [2020-07-10 15:03:40,846 INFO L87 Difference]: Start difference. First operand 506 states. Second operand 504 states. [2020-07-10 15:03:40,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:40,884 INFO L93 Difference]: Finished difference Result 506 states and 807 transitions. [2020-07-10 15:03:40,885 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 807 transitions. [2020-07-10 15:03:40,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:40,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:40,887 INFO L74 IsIncluded]: Start isIncluded. First operand 504 states. Second operand 506 states. [2020-07-10 15:03:40,887 INFO L87 Difference]: Start difference. First operand 504 states. Second operand 506 states. [2020-07-10 15:03:40,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:40,913 INFO L93 Difference]: Finished difference Result 506 states and 807 transitions. [2020-07-10 15:03:40,913 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 807 transitions. [2020-07-10 15:03:40,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:40,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:40,916 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:40,916 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:40,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2020-07-10 15:03:40,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 806 transitions. [2020-07-10 15:03:40,943 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 806 transitions. Word has length 24 [2020-07-10 15:03:40,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:40,943 INFO L479 AbstractCegarLoop]: Abstraction has 504 states and 806 transitions. [2020-07-10 15:03:40,944 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:40,944 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 806 transitions. [2020-07-10 15:03:40,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 15:03:40,946 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:40,946 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-10 15:03:40,946 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-10 15:03:40,947 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:40,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:40,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1004987715, now seen corresponding path program 1 times [2020-07-10 15:03:40,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:40,948 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747906491] [2020-07-10 15:03:40,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:40,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:40,989 INFO L280 TraceCheckUtils]: 0: Hoare triple {12867#true} assume true; {12867#true} is VALID [2020-07-10 15:03:40,990 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {12867#true} {12867#true} #197#return; {12867#true} is VALID [2020-07-10 15:03:40,990 INFO L263 TraceCheckUtils]: 0: Hoare triple {12867#true} call ULTIMATE.init(); {12867#true} is VALID [2020-07-10 15:03:40,991 INFO L280 TraceCheckUtils]: 1: Hoare triple {12867#true} assume true; {12867#true} is VALID [2020-07-10 15:03:40,991 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {12867#true} {12867#true} #197#return; {12867#true} is VALID [2020-07-10 15:03:40,991 INFO L263 TraceCheckUtils]: 3: Hoare triple {12867#true} call #t~ret11 := main(); {12867#true} is VALID [2020-07-10 15:03:40,991 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-10 15:03:40,992 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-10 15:03:40,992 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-10 15:03:40,992 INFO L280 TraceCheckUtils]: 7: Hoare triple {12867#true} assume !(0 != ~p1~0); {12867#true} is VALID [2020-07-10 15:03:40,993 INFO L280 TraceCheckUtils]: 8: Hoare triple {12867#true} assume !(0 != ~p2~0); {12867#true} is VALID [2020-07-10 15:03:40,993 INFO L280 TraceCheckUtils]: 9: Hoare triple {12867#true} assume !(0 != ~p3~0); {12867#true} is VALID [2020-07-10 15:03:40,994 INFO L280 TraceCheckUtils]: 10: Hoare triple {12867#true} assume !(0 != ~p4~0); {12867#true} is VALID [2020-07-10 15:03:40,995 INFO L280 TraceCheckUtils]: 11: Hoare triple {12867#true} assume 0 != ~p5~0;~lk5~0 := 1; {12871#(= 1 main_~lk5~0)} is VALID [2020-07-10 15:03:40,997 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-10 15:03:40,998 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-10 15:03:41,000 INFO L280 TraceCheckUtils]: 14: Hoare triple {12871#(= 1 main_~lk5~0)} assume !(0 != ~p8~0); {12871#(= 1 main_~lk5~0)} is VALID [2020-07-10 15:03:41,001 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-10 15:03:41,002 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-10 15:03:41,003 INFO L280 TraceCheckUtils]: 17: Hoare triple {12871#(= 1 main_~lk5~0)} assume !(0 != ~p1~0); {12871#(= 1 main_~lk5~0)} is VALID [2020-07-10 15:03:41,003 INFO L280 TraceCheckUtils]: 18: Hoare triple {12871#(= 1 main_~lk5~0)} assume !(0 != ~p2~0); {12871#(= 1 main_~lk5~0)} is VALID [2020-07-10 15:03:41,004 INFO L280 TraceCheckUtils]: 19: Hoare triple {12871#(= 1 main_~lk5~0)} assume !(0 != ~p3~0); {12871#(= 1 main_~lk5~0)} is VALID [2020-07-10 15:03:41,005 INFO L280 TraceCheckUtils]: 20: Hoare triple {12871#(= 1 main_~lk5~0)} assume !(0 != ~p4~0); {12871#(= 1 main_~lk5~0)} is VALID [2020-07-10 15:03:41,007 INFO L280 TraceCheckUtils]: 21: Hoare triple {12871#(= 1 main_~lk5~0)} assume 0 != ~p5~0; {12871#(= 1 main_~lk5~0)} is VALID [2020-07-10 15:03:41,009 INFO L280 TraceCheckUtils]: 22: Hoare triple {12871#(= 1 main_~lk5~0)} assume 1 != ~lk5~0; {12868#false} is VALID [2020-07-10 15:03:41,009 INFO L280 TraceCheckUtils]: 23: Hoare triple {12868#false} assume !false; {12868#false} is VALID [2020-07-10 15:03:41,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:41,012 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747906491] [2020-07-10 15:03:41,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:41,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:41,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328798068] [2020-07-10 15:03:41,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-10 15:03:41,015 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:41,015 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:41,056 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-10 15:03:41,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:41,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:41,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:41,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:41,059 INFO L87 Difference]: Start difference. First operand 504 states and 806 transitions. Second operand 3 states. [2020-07-10 15:03:41,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:41,476 INFO L93 Difference]: Finished difference Result 908 states and 1480 transitions. [2020-07-10 15:03:41,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:41,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-10 15:03:41,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:41,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:41,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2020-07-10 15:03:41,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:41,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2020-07-10 15:03:41,486 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 114 transitions. [2020-07-10 15:03:41,627 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-10 15:03:41,704 INFO L225 Difference]: With dead ends: 908 [2020-07-10 15:03:41,704 INFO L226 Difference]: Without dead ends: 906 [2020-07-10 15:03:41,708 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:41,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2020-07-10 15:03:41,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 712. [2020-07-10 15:03:41,825 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:41,825 INFO L82 GeneralOperation]: Start isEquivalent. First operand 906 states. Second operand 712 states. [2020-07-10 15:03:41,825 INFO L74 IsIncluded]: Start isIncluded. First operand 906 states. Second operand 712 states. [2020-07-10 15:03:41,826 INFO L87 Difference]: Start difference. First operand 906 states. Second operand 712 states. [2020-07-10 15:03:41,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:41,899 INFO L93 Difference]: Finished difference Result 906 states and 1463 transitions. [2020-07-10 15:03:41,900 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1463 transitions. [2020-07-10 15:03:41,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:41,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:41,904 INFO L74 IsIncluded]: Start isIncluded. First operand 712 states. Second operand 906 states. [2020-07-10 15:03:41,905 INFO L87 Difference]: Start difference. First operand 712 states. Second operand 906 states. [2020-07-10 15:03:41,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:41,985 INFO L93 Difference]: Finished difference Result 906 states and 1463 transitions. [2020-07-10 15:03:41,985 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1463 transitions. [2020-07-10 15:03:41,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:41,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:41,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:41,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:41,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2020-07-10 15:03:42,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1110 transitions. [2020-07-10 15:03:42,028 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1110 transitions. Word has length 24 [2020-07-10 15:03:42,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:42,028 INFO L479 AbstractCegarLoop]: Abstraction has 712 states and 1110 transitions. [2020-07-10 15:03:42,028 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:42,029 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1110 transitions. [2020-07-10 15:03:42,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 15:03:42,031 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:42,031 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-10 15:03:42,031 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-10 15:03:42,032 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:42,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:42,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1591793729, now seen corresponding path program 1 times [2020-07-10 15:03:42,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:42,039 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017751421] [2020-07-10 15:03:42,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:42,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:42,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:42,092 INFO L280 TraceCheckUtils]: 0: Hoare triple {16368#true} assume true; {16368#true} is VALID [2020-07-10 15:03:42,093 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {16368#true} {16368#true} #197#return; {16368#true} is VALID [2020-07-10 15:03:42,093 INFO L263 TraceCheckUtils]: 0: Hoare triple {16368#true} call ULTIMATE.init(); {16368#true} is VALID [2020-07-10 15:03:42,094 INFO L280 TraceCheckUtils]: 1: Hoare triple {16368#true} assume true; {16368#true} is VALID [2020-07-10 15:03:42,094 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {16368#true} {16368#true} #197#return; {16368#true} is VALID [2020-07-10 15:03:42,094 INFO L263 TraceCheckUtils]: 3: Hoare triple {16368#true} call #t~ret11 := main(); {16368#true} is VALID [2020-07-10 15:03:42,095 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-10 15:03:42,095 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-10 15:03:42,095 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-10 15:03:42,096 INFO L280 TraceCheckUtils]: 7: Hoare triple {16368#true} assume !(0 != ~p1~0); {16368#true} is VALID [2020-07-10 15:03:42,096 INFO L280 TraceCheckUtils]: 8: Hoare triple {16368#true} assume !(0 != ~p2~0); {16368#true} is VALID [2020-07-10 15:03:42,096 INFO L280 TraceCheckUtils]: 9: Hoare triple {16368#true} assume !(0 != ~p3~0); {16368#true} is VALID [2020-07-10 15:03:42,097 INFO L280 TraceCheckUtils]: 10: Hoare triple {16368#true} assume !(0 != ~p4~0); {16368#true} is VALID [2020-07-10 15:03:42,099 INFO L280 TraceCheckUtils]: 11: Hoare triple {16368#true} assume !(0 != ~p5~0); {16372#(= 0 main_~p5~0)} is VALID [2020-07-10 15:03:42,101 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-10 15:03:42,102 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-10 15:03:42,104 INFO L280 TraceCheckUtils]: 14: Hoare triple {16372#(= 0 main_~p5~0)} assume !(0 != ~p8~0); {16372#(= 0 main_~p5~0)} is VALID [2020-07-10 15:03:42,105 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-10 15:03:42,107 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-10 15:03:42,109 INFO L280 TraceCheckUtils]: 17: Hoare triple {16372#(= 0 main_~p5~0)} assume !(0 != ~p1~0); {16372#(= 0 main_~p5~0)} is VALID [2020-07-10 15:03:42,110 INFO L280 TraceCheckUtils]: 18: Hoare triple {16372#(= 0 main_~p5~0)} assume !(0 != ~p2~0); {16372#(= 0 main_~p5~0)} is VALID [2020-07-10 15:03:42,111 INFO L280 TraceCheckUtils]: 19: Hoare triple {16372#(= 0 main_~p5~0)} assume !(0 != ~p3~0); {16372#(= 0 main_~p5~0)} is VALID [2020-07-10 15:03:42,112 INFO L280 TraceCheckUtils]: 20: Hoare triple {16372#(= 0 main_~p5~0)} assume !(0 != ~p4~0); {16372#(= 0 main_~p5~0)} is VALID [2020-07-10 15:03:42,113 INFO L280 TraceCheckUtils]: 21: Hoare triple {16372#(= 0 main_~p5~0)} assume 0 != ~p5~0; {16369#false} is VALID [2020-07-10 15:03:42,113 INFO L280 TraceCheckUtils]: 22: Hoare triple {16369#false} assume 1 != ~lk5~0; {16369#false} is VALID [2020-07-10 15:03:42,113 INFO L280 TraceCheckUtils]: 23: Hoare triple {16369#false} assume !false; {16369#false} is VALID [2020-07-10 15:03:42,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:42,114 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017751421] [2020-07-10 15:03:42,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:42,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:42,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721459082] [2020-07-10 15:03:42,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-10 15:03:42,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:42,116 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:42,150 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-10 15:03:42,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:42,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:42,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:42,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:42,152 INFO L87 Difference]: Start difference. First operand 712 states and 1110 transitions. Second operand 3 states. [2020-07-10 15:03:42,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:42,814 INFO L93 Difference]: Finished difference Result 1660 states and 2600 transitions. [2020-07-10 15:03:42,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:42,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-10 15:03:42,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:42,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:42,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 179 transitions. [2020-07-10 15:03:42,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:42,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 179 transitions. [2020-07-10 15:03:42,828 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 179 transitions. [2020-07-10 15:03:43,056 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-10 15:03:43,160 INFO L225 Difference]: With dead ends: 1660 [2020-07-10 15:03:43,160 INFO L226 Difference]: Without dead ends: 970 [2020-07-10 15:03:43,167 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:43,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2020-07-10 15:03:43,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 968. [2020-07-10 15:03:43,387 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:43,387 INFO L82 GeneralOperation]: Start isEquivalent. First operand 970 states. Second operand 968 states. [2020-07-10 15:03:43,388 INFO L74 IsIncluded]: Start isIncluded. First operand 970 states. Second operand 968 states. [2020-07-10 15:03:43,388 INFO L87 Difference]: Start difference. First operand 970 states. Second operand 968 states. [2020-07-10 15:03:43,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:43,466 INFO L93 Difference]: Finished difference Result 970 states and 1495 transitions. [2020-07-10 15:03:43,467 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1495 transitions. [2020-07-10 15:03:43,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:43,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:43,471 INFO L74 IsIncluded]: Start isIncluded. First operand 968 states. Second operand 970 states. [2020-07-10 15:03:43,471 INFO L87 Difference]: Start difference. First operand 968 states. Second operand 970 states. [2020-07-10 15:03:43,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:43,551 INFO L93 Difference]: Finished difference Result 970 states and 1495 transitions. [2020-07-10 15:03:43,552 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1495 transitions. [2020-07-10 15:03:43,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:43,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:43,556 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:43,556 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:43,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2020-07-10 15:03:43,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1494 transitions. [2020-07-10 15:03:43,635 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1494 transitions. Word has length 24 [2020-07-10 15:03:43,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:43,635 INFO L479 AbstractCegarLoop]: Abstraction has 968 states and 1494 transitions. [2020-07-10 15:03:43,636 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:43,636 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1494 transitions. [2020-07-10 15:03:43,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-10 15:03:43,639 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:43,640 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-10 15:03:43,640 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-10 15:03:43,640 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:43,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:43,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1089633349, now seen corresponding path program 1 times [2020-07-10 15:03:43,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:43,642 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231386334] [2020-07-10 15:03:43,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:43,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:43,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:43,688 INFO L280 TraceCheckUtils]: 0: Hoare triple {21037#true} assume true; {21037#true} is VALID [2020-07-10 15:03:43,689 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {21037#true} {21037#true} #197#return; {21037#true} is VALID [2020-07-10 15:03:43,689 INFO L263 TraceCheckUtils]: 0: Hoare triple {21037#true} call ULTIMATE.init(); {21037#true} is VALID [2020-07-10 15:03:43,690 INFO L280 TraceCheckUtils]: 1: Hoare triple {21037#true} assume true; {21037#true} is VALID [2020-07-10 15:03:43,690 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {21037#true} {21037#true} #197#return; {21037#true} is VALID [2020-07-10 15:03:43,690 INFO L263 TraceCheckUtils]: 3: Hoare triple {21037#true} call #t~ret11 := main(); {21037#true} is VALID [2020-07-10 15:03:43,690 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-10 15:03:43,691 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-10 15:03:43,691 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-10 15:03:43,691 INFO L280 TraceCheckUtils]: 7: Hoare triple {21037#true} assume !(0 != ~p1~0); {21037#true} is VALID [2020-07-10 15:03:43,691 INFO L280 TraceCheckUtils]: 8: Hoare triple {21037#true} assume !(0 != ~p2~0); {21037#true} is VALID [2020-07-10 15:03:43,692 INFO L280 TraceCheckUtils]: 9: Hoare triple {21037#true} assume !(0 != ~p3~0); {21037#true} is VALID [2020-07-10 15:03:43,692 INFO L280 TraceCheckUtils]: 10: Hoare triple {21037#true} assume !(0 != ~p4~0); {21037#true} is VALID [2020-07-10 15:03:43,693 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-10 15:03:43,695 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-10 15:03:43,696 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-10 15:03:43,697 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-10 15:03:43,699 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-10 15:03:43,701 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-10 15:03:43,702 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-10 15:03:43,704 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-10 15:03:43,705 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-10 15:03:43,706 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-10 15:03:43,707 INFO L280 TraceCheckUtils]: 21: Hoare triple {21041#(not (= 0 main_~p5~0))} assume !(0 != ~p5~0); {21038#false} is VALID [2020-07-10 15:03:43,707 INFO L280 TraceCheckUtils]: 22: Hoare triple {21038#false} assume 0 != ~p6~0; {21038#false} is VALID [2020-07-10 15:03:43,707 INFO L280 TraceCheckUtils]: 23: Hoare triple {21038#false} assume 1 != ~lk6~0; {21038#false} is VALID [2020-07-10 15:03:43,708 INFO L280 TraceCheckUtils]: 24: Hoare triple {21038#false} assume !false; {21038#false} is VALID [2020-07-10 15:03:43,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:43,709 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231386334] [2020-07-10 15:03:43,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:43,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:43,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596140242] [2020-07-10 15:03:43,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-10 15:03:43,711 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:43,711 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:43,748 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-10 15:03:43,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:43,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:43,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:43,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:43,750 INFO L87 Difference]: Start difference. First operand 968 states and 1494 transitions. Second operand 3 states. [2020-07-10 15:03:44,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:44,445 INFO L93 Difference]: Finished difference Result 1452 states and 2232 transitions. [2020-07-10 15:03:44,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:44,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-10 15:03:44,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:44,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:44,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2020-07-10 15:03:44,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:44,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2020-07-10 15:03:44,455 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 174 transitions. [2020-07-10 15:03:44,708 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-10 15:03:44,813 INFO L225 Difference]: With dead ends: 1452 [2020-07-10 15:03:44,813 INFO L226 Difference]: Without dead ends: 986 [2020-07-10 15:03:44,818 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:44,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2020-07-10 15:03:45,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 984. [2020-07-10 15:03:45,043 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:45,043 INFO L82 GeneralOperation]: Start isEquivalent. First operand 986 states. Second operand 984 states. [2020-07-10 15:03:45,043 INFO L74 IsIncluded]: Start isIncluded. First operand 986 states. Second operand 984 states. [2020-07-10 15:03:45,044 INFO L87 Difference]: Start difference. First operand 986 states. Second operand 984 states. [2020-07-10 15:03:45,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:45,124 INFO L93 Difference]: Finished difference Result 986 states and 1495 transitions. [2020-07-10 15:03:45,124 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1495 transitions. [2020-07-10 15:03:45,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:45,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:45,129 INFO L74 IsIncluded]: Start isIncluded. First operand 984 states. Second operand 986 states. [2020-07-10 15:03:45,129 INFO L87 Difference]: Start difference. First operand 984 states. Second operand 986 states. [2020-07-10 15:03:45,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:45,202 INFO L93 Difference]: Finished difference Result 986 states and 1495 transitions. [2020-07-10 15:03:45,202 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1495 transitions. [2020-07-10 15:03:45,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:45,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:45,206 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:45,207 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:45,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2020-07-10 15:03:45,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1494 transitions. [2020-07-10 15:03:45,325 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1494 transitions. Word has length 25 [2020-07-10 15:03:45,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:45,326 INFO L479 AbstractCegarLoop]: Abstraction has 984 states and 1494 transitions. [2020-07-10 15:03:45,326 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:45,327 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1494 transitions. [2020-07-10 15:03:45,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-10 15:03:45,331 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:45,331 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-10 15:03:45,332 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-10 15:03:45,332 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:45,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:45,333 INFO L82 PathProgramCache]: Analyzing trace with hash -2100750599, now seen corresponding path program 1 times [2020-07-10 15:03:45,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:45,333 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442466333] [2020-07-10 15:03:45,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:45,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:45,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:45,408 INFO L280 TraceCheckUtils]: 0: Hoare triple {25546#true} assume true; {25546#true} is VALID [2020-07-10 15:03:45,408 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {25546#true} {25546#true} #197#return; {25546#true} is VALID [2020-07-10 15:03:45,409 INFO L263 TraceCheckUtils]: 0: Hoare triple {25546#true} call ULTIMATE.init(); {25546#true} is VALID [2020-07-10 15:03:45,409 INFO L280 TraceCheckUtils]: 1: Hoare triple {25546#true} assume true; {25546#true} is VALID [2020-07-10 15:03:45,410 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {25546#true} {25546#true} #197#return; {25546#true} is VALID [2020-07-10 15:03:45,410 INFO L263 TraceCheckUtils]: 3: Hoare triple {25546#true} call #t~ret11 := main(); {25546#true} is VALID [2020-07-10 15:03:45,411 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-10 15:03:45,411 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-10 15:03:45,412 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-10 15:03:45,412 INFO L280 TraceCheckUtils]: 7: Hoare triple {25546#true} assume !(0 != ~p1~0); {25546#true} is VALID [2020-07-10 15:03:45,413 INFO L280 TraceCheckUtils]: 8: Hoare triple {25546#true} assume !(0 != ~p2~0); {25546#true} is VALID [2020-07-10 15:03:45,413 INFO L280 TraceCheckUtils]: 9: Hoare triple {25546#true} assume !(0 != ~p3~0); {25546#true} is VALID [2020-07-10 15:03:45,413 INFO L280 TraceCheckUtils]: 10: Hoare triple {25546#true} assume !(0 != ~p4~0); {25546#true} is VALID [2020-07-10 15:03:45,414 INFO L280 TraceCheckUtils]: 11: Hoare triple {25546#true} assume !(0 != ~p5~0); {25546#true} is VALID [2020-07-10 15:03:45,415 INFO L280 TraceCheckUtils]: 12: Hoare triple {25546#true} assume 0 != ~p6~0;~lk6~0 := 1; {25550#(= 1 main_~lk6~0)} is VALID [2020-07-10 15:03:45,419 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-10 15:03:45,422 INFO L280 TraceCheckUtils]: 14: Hoare triple {25550#(= 1 main_~lk6~0)} assume !(0 != ~p8~0); {25550#(= 1 main_~lk6~0)} is VALID [2020-07-10 15:03:45,423 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-10 15:03:45,424 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-10 15:03:45,427 INFO L280 TraceCheckUtils]: 17: Hoare triple {25550#(= 1 main_~lk6~0)} assume !(0 != ~p1~0); {25550#(= 1 main_~lk6~0)} is VALID [2020-07-10 15:03:45,428 INFO L280 TraceCheckUtils]: 18: Hoare triple {25550#(= 1 main_~lk6~0)} assume !(0 != ~p2~0); {25550#(= 1 main_~lk6~0)} is VALID [2020-07-10 15:03:45,430 INFO L280 TraceCheckUtils]: 19: Hoare triple {25550#(= 1 main_~lk6~0)} assume !(0 != ~p3~0); {25550#(= 1 main_~lk6~0)} is VALID [2020-07-10 15:03:45,431 INFO L280 TraceCheckUtils]: 20: Hoare triple {25550#(= 1 main_~lk6~0)} assume !(0 != ~p4~0); {25550#(= 1 main_~lk6~0)} is VALID [2020-07-10 15:03:45,432 INFO L280 TraceCheckUtils]: 21: Hoare triple {25550#(= 1 main_~lk6~0)} assume !(0 != ~p5~0); {25550#(= 1 main_~lk6~0)} is VALID [2020-07-10 15:03:45,433 INFO L280 TraceCheckUtils]: 22: Hoare triple {25550#(= 1 main_~lk6~0)} assume 0 != ~p6~0; {25550#(= 1 main_~lk6~0)} is VALID [2020-07-10 15:03:45,435 INFO L280 TraceCheckUtils]: 23: Hoare triple {25550#(= 1 main_~lk6~0)} assume 1 != ~lk6~0; {25547#false} is VALID [2020-07-10 15:03:45,435 INFO L280 TraceCheckUtils]: 24: Hoare triple {25547#false} assume !false; {25547#false} is VALID [2020-07-10 15:03:45,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:45,438 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442466333] [2020-07-10 15:03:45,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:45,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:45,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019170298] [2020-07-10 15:03:45,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-10 15:03:45,445 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:45,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:45,484 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-10 15:03:45,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:45,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:45,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:45,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:45,486 INFO L87 Difference]: Start difference. First operand 984 states and 1494 transitions. Second operand 3 states. [2020-07-10 15:03:46,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:46,329 INFO L93 Difference]: Finished difference Result 1740 states and 2696 transitions. [2020-07-10 15:03:46,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:46,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-10 15:03:46,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:46,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:46,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2020-07-10 15:03:46,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:46,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2020-07-10 15:03:46,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 110 transitions. [2020-07-10 15:03:46,493 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-10 15:03:46,642 INFO L225 Difference]: With dead ends: 1740 [2020-07-10 15:03:46,642 INFO L226 Difference]: Without dead ends: 1738 [2020-07-10 15:03:46,644 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:46,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2020-07-10 15:03:46,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1416. [2020-07-10 15:03:46,958 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:46,958 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1738 states. Second operand 1416 states. [2020-07-10 15:03:46,958 INFO L74 IsIncluded]: Start isIncluded. First operand 1738 states. Second operand 1416 states. [2020-07-10 15:03:46,959 INFO L87 Difference]: Start difference. First operand 1738 states. Second operand 1416 states. [2020-07-10 15:03:47,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:47,210 INFO L93 Difference]: Finished difference Result 1738 states and 2663 transitions. [2020-07-10 15:03:47,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2663 transitions. [2020-07-10 15:03:47,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:47,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:47,215 INFO L74 IsIncluded]: Start isIncluded. First operand 1416 states. Second operand 1738 states. [2020-07-10 15:03:47,216 INFO L87 Difference]: Start difference. First operand 1416 states. Second operand 1738 states. [2020-07-10 15:03:47,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:47,343 INFO L93 Difference]: Finished difference Result 1738 states and 2663 transitions. [2020-07-10 15:03:47,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2663 transitions. [2020-07-10 15:03:47,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:47,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:47,348 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:47,348 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:47,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1416 states. [2020-07-10 15:03:47,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 2086 transitions. [2020-07-10 15:03:47,466 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 2086 transitions. Word has length 25 [2020-07-10 15:03:47,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:47,466 INFO L479 AbstractCegarLoop]: Abstraction has 1416 states and 2086 transitions. [2020-07-10 15:03:47,466 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:47,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 2086 transitions. [2020-07-10 15:03:47,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-10 15:03:47,470 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:47,470 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-10 15:03:47,470 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-10 15:03:47,471 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:47,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:47,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1607410683, now seen corresponding path program 1 times [2020-07-10 15:03:47,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:47,472 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636519202] [2020-07-10 15:03:47,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:47,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:47,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:47,515 INFO L280 TraceCheckUtils]: 0: Hoare triple {32295#true} assume true; {32295#true} is VALID [2020-07-10 15:03:47,515 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {32295#true} {32295#true} #197#return; {32295#true} is VALID [2020-07-10 15:03:47,516 INFO L263 TraceCheckUtils]: 0: Hoare triple {32295#true} call ULTIMATE.init(); {32295#true} is VALID [2020-07-10 15:03:47,516 INFO L280 TraceCheckUtils]: 1: Hoare triple {32295#true} assume true; {32295#true} is VALID [2020-07-10 15:03:47,516 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {32295#true} {32295#true} #197#return; {32295#true} is VALID [2020-07-10 15:03:47,517 INFO L263 TraceCheckUtils]: 3: Hoare triple {32295#true} call #t~ret11 := main(); {32295#true} is VALID [2020-07-10 15:03:47,517 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-10 15:03:47,517 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-10 15:03:47,517 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-10 15:03:47,518 INFO L280 TraceCheckUtils]: 7: Hoare triple {32295#true} assume !(0 != ~p1~0); {32295#true} is VALID [2020-07-10 15:03:47,518 INFO L280 TraceCheckUtils]: 8: Hoare triple {32295#true} assume !(0 != ~p2~0); {32295#true} is VALID [2020-07-10 15:03:47,518 INFO L280 TraceCheckUtils]: 9: Hoare triple {32295#true} assume !(0 != ~p3~0); {32295#true} is VALID [2020-07-10 15:03:47,518 INFO L280 TraceCheckUtils]: 10: Hoare triple {32295#true} assume !(0 != ~p4~0); {32295#true} is VALID [2020-07-10 15:03:47,518 INFO L280 TraceCheckUtils]: 11: Hoare triple {32295#true} assume !(0 != ~p5~0); {32295#true} is VALID [2020-07-10 15:03:47,519 INFO L280 TraceCheckUtils]: 12: Hoare triple {32295#true} assume !(0 != ~p6~0); {32299#(= 0 main_~p6~0)} is VALID [2020-07-10 15:03:47,520 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-10 15:03:47,520 INFO L280 TraceCheckUtils]: 14: Hoare triple {32299#(= 0 main_~p6~0)} assume !(0 != ~p8~0); {32299#(= 0 main_~p6~0)} is VALID [2020-07-10 15:03:47,521 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-10 15:03:47,522 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-10 15:03:47,522 INFO L280 TraceCheckUtils]: 17: Hoare triple {32299#(= 0 main_~p6~0)} assume !(0 != ~p1~0); {32299#(= 0 main_~p6~0)} is VALID [2020-07-10 15:03:47,523 INFO L280 TraceCheckUtils]: 18: Hoare triple {32299#(= 0 main_~p6~0)} assume !(0 != ~p2~0); {32299#(= 0 main_~p6~0)} is VALID [2020-07-10 15:03:47,524 INFO L280 TraceCheckUtils]: 19: Hoare triple {32299#(= 0 main_~p6~0)} assume !(0 != ~p3~0); {32299#(= 0 main_~p6~0)} is VALID [2020-07-10 15:03:47,525 INFO L280 TraceCheckUtils]: 20: Hoare triple {32299#(= 0 main_~p6~0)} assume !(0 != ~p4~0); {32299#(= 0 main_~p6~0)} is VALID [2020-07-10 15:03:47,526 INFO L280 TraceCheckUtils]: 21: Hoare triple {32299#(= 0 main_~p6~0)} assume !(0 != ~p5~0); {32299#(= 0 main_~p6~0)} is VALID [2020-07-10 15:03:47,527 INFO L280 TraceCheckUtils]: 22: Hoare triple {32299#(= 0 main_~p6~0)} assume 0 != ~p6~0; {32296#false} is VALID [2020-07-10 15:03:47,527 INFO L280 TraceCheckUtils]: 23: Hoare triple {32296#false} assume 1 != ~lk6~0; {32296#false} is VALID [2020-07-10 15:03:47,527 INFO L280 TraceCheckUtils]: 24: Hoare triple {32296#false} assume !false; {32296#false} is VALID [2020-07-10 15:03:47,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:47,529 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636519202] [2020-07-10 15:03:47,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:47,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:47,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751661357] [2020-07-10 15:03:47,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-10 15:03:47,531 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:47,531 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:47,567 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-10 15:03:47,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:47,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:47,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:47,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:47,569 INFO L87 Difference]: Start difference. First operand 1416 states and 2086 transitions. Second operand 3 states. [2020-07-10 15:03:49,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:49,181 INFO L93 Difference]: Finished difference Result 3276 states and 4840 transitions. [2020-07-10 15:03:49,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:49,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-10 15:03:49,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:49,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:49,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2020-07-10 15:03:49,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:49,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2020-07-10 15:03:49,183 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 176 transitions. [2020-07-10 15:03:49,394 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-10 15:03:49,543 INFO L225 Difference]: With dead ends: 3276 [2020-07-10 15:03:49,543 INFO L226 Difference]: Without dead ends: 1898 [2020-07-10 15:03:49,546 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:49,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2020-07-10 15:03:50,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1896. [2020-07-10 15:03:50,092 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:50,093 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1898 states. Second operand 1896 states. [2020-07-10 15:03:50,093 INFO L74 IsIncluded]: Start isIncluded. First operand 1898 states. Second operand 1896 states. [2020-07-10 15:03:50,093 INFO L87 Difference]: Start difference. First operand 1898 states. Second operand 1896 states. [2020-07-10 15:03:50,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:50,226 INFO L93 Difference]: Finished difference Result 1898 states and 2759 transitions. [2020-07-10 15:03:50,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 2759 transitions. [2020-07-10 15:03:50,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:50,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:50,231 INFO L74 IsIncluded]: Start isIncluded. First operand 1896 states. Second operand 1898 states. [2020-07-10 15:03:50,231 INFO L87 Difference]: Start difference. First operand 1896 states. Second operand 1898 states. [2020-07-10 15:03:50,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:50,378 INFO L93 Difference]: Finished difference Result 1898 states and 2759 transitions. [2020-07-10 15:03:50,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 2759 transitions. [2020-07-10 15:03:50,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:50,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:50,383 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:50,383 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:50,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1896 states. [2020-07-10 15:03:50,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2758 transitions. [2020-07-10 15:03:50,583 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2758 transitions. Word has length 25 [2020-07-10 15:03:50,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:50,583 INFO L479 AbstractCegarLoop]: Abstraction has 1896 states and 2758 transitions. [2020-07-10 15:03:50,583 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:50,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2758 transitions. [2020-07-10 15:03:50,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 15:03:50,586 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:50,586 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-10 15:03:50,586 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-10 15:03:50,586 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:50,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:50,587 INFO L82 PathProgramCache]: Analyzing trace with hash -698544044, now seen corresponding path program 1 times [2020-07-10 15:03:50,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:50,587 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365489854] [2020-07-10 15:03:50,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:50,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:50,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:50,626 INFO L280 TraceCheckUtils]: 0: Hoare triple {41444#true} assume true; {41444#true} is VALID [2020-07-10 15:03:50,627 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {41444#true} {41444#true} #197#return; {41444#true} is VALID [2020-07-10 15:03:50,627 INFO L263 TraceCheckUtils]: 0: Hoare triple {41444#true} call ULTIMATE.init(); {41444#true} is VALID [2020-07-10 15:03:50,627 INFO L280 TraceCheckUtils]: 1: Hoare triple {41444#true} assume true; {41444#true} is VALID [2020-07-10 15:03:50,627 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {41444#true} {41444#true} #197#return; {41444#true} is VALID [2020-07-10 15:03:50,627 INFO L263 TraceCheckUtils]: 3: Hoare triple {41444#true} call #t~ret11 := main(); {41444#true} is VALID [2020-07-10 15:03:50,627 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-10 15:03:50,628 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-10 15:03:50,628 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-10 15:03:50,628 INFO L280 TraceCheckUtils]: 7: Hoare triple {41444#true} assume !(0 != ~p1~0); {41444#true} is VALID [2020-07-10 15:03:50,628 INFO L280 TraceCheckUtils]: 8: Hoare triple {41444#true} assume !(0 != ~p2~0); {41444#true} is VALID [2020-07-10 15:03:50,628 INFO L280 TraceCheckUtils]: 9: Hoare triple {41444#true} assume !(0 != ~p3~0); {41444#true} is VALID [2020-07-10 15:03:50,628 INFO L280 TraceCheckUtils]: 10: Hoare triple {41444#true} assume !(0 != ~p4~0); {41444#true} is VALID [2020-07-10 15:03:50,629 INFO L280 TraceCheckUtils]: 11: Hoare triple {41444#true} assume !(0 != ~p5~0); {41444#true} is VALID [2020-07-10 15:03:50,629 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-10 15:03:50,637 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-10 15:03:50,637 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-10 15:03:50,638 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-10 15:03:50,639 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-10 15:03:50,639 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-10 15:03:50,639 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-10 15:03:50,640 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-10 15:03:50,640 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-10 15:03:50,641 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-10 15:03:50,641 INFO L280 TraceCheckUtils]: 22: Hoare triple {41448#(not (= 0 main_~p6~0))} assume !(0 != ~p6~0); {41445#false} is VALID [2020-07-10 15:03:50,642 INFO L280 TraceCheckUtils]: 23: Hoare triple {41445#false} assume 0 != ~p7~0; {41445#false} is VALID [2020-07-10 15:03:50,642 INFO L280 TraceCheckUtils]: 24: Hoare triple {41445#false} assume 1 != ~lk7~0; {41445#false} is VALID [2020-07-10 15:03:50,642 INFO L280 TraceCheckUtils]: 25: Hoare triple {41445#false} assume !false; {41445#false} is VALID [2020-07-10 15:03:50,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:50,644 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365489854] [2020-07-10 15:03:50,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:50,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:50,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017240227] [2020-07-10 15:03:50,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-10 15:03:50,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:50,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:50,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-10 15:03:50,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:50,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:50,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:50,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:50,685 INFO L87 Difference]: Start difference. First operand 1896 states and 2758 transitions. Second operand 3 states. [2020-07-10 15:03:51,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:51,624 INFO L93 Difference]: Finished difference Result 2844 states and 4120 transitions. [2020-07-10 15:03:51,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:51,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-10 15:03:51,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:51,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:51,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2020-07-10 15:03:51,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:51,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2020-07-10 15:03:51,628 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 171 transitions. [2020-07-10 15:03:51,835 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-10 15:03:51,981 INFO L225 Difference]: With dead ends: 2844 [2020-07-10 15:03:51,982 INFO L226 Difference]: Without dead ends: 1930 [2020-07-10 15:03:51,985 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:51,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2020-07-10 15:03:52,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1928. [2020-07-10 15:03:52,534 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:52,534 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1930 states. Second operand 1928 states. [2020-07-10 15:03:52,535 INFO L74 IsIncluded]: Start isIncluded. First operand 1930 states. Second operand 1928 states. [2020-07-10 15:03:52,535 INFO L87 Difference]: Start difference. First operand 1930 states. Second operand 1928 states. [2020-07-10 15:03:52,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:52,812 INFO L93 Difference]: Finished difference Result 1930 states and 2759 transitions. [2020-07-10 15:03:52,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 2759 transitions. [2020-07-10 15:03:52,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:52,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:52,819 INFO L74 IsIncluded]: Start isIncluded. First operand 1928 states. Second operand 1930 states. [2020-07-10 15:03:52,819 INFO L87 Difference]: Start difference. First operand 1928 states. Second operand 1930 states. [2020-07-10 15:03:52,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:52,984 INFO L93 Difference]: Finished difference Result 1930 states and 2759 transitions. [2020-07-10 15:03:52,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 2759 transitions. [2020-07-10 15:03:52,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:52,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:52,988 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:52,988 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:52,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2020-07-10 15:03:53,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2758 transitions. [2020-07-10 15:03:53,114 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2758 transitions. Word has length 26 [2020-07-10 15:03:53,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:53,115 INFO L479 AbstractCegarLoop]: Abstraction has 1928 states and 2758 transitions. [2020-07-10 15:03:53,115 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:53,115 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2758 transitions. [2020-07-10 15:03:53,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 15:03:53,117 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:53,117 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-10 15:03:53,118 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-07-10 15:03:53,118 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:53,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:53,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1709661294, now seen corresponding path program 1 times [2020-07-10 15:03:53,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:53,119 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308255241] [2020-07-10 15:03:53,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:53,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:53,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:53,162 INFO L280 TraceCheckUtils]: 0: Hoare triple {50257#true} assume true; {50257#true} is VALID [2020-07-10 15:03:53,162 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {50257#true} {50257#true} #197#return; {50257#true} is VALID [2020-07-10 15:03:53,163 INFO L263 TraceCheckUtils]: 0: Hoare triple {50257#true} call ULTIMATE.init(); {50257#true} is VALID [2020-07-10 15:03:53,163 INFO L280 TraceCheckUtils]: 1: Hoare triple {50257#true} assume true; {50257#true} is VALID [2020-07-10 15:03:53,163 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {50257#true} {50257#true} #197#return; {50257#true} is VALID [2020-07-10 15:03:53,163 INFO L263 TraceCheckUtils]: 3: Hoare triple {50257#true} call #t~ret11 := main(); {50257#true} is VALID [2020-07-10 15:03:53,163 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-10 15:03:53,164 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-10 15:03:53,164 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-10 15:03:53,164 INFO L280 TraceCheckUtils]: 7: Hoare triple {50257#true} assume !(0 != ~p1~0); {50257#true} is VALID [2020-07-10 15:03:53,164 INFO L280 TraceCheckUtils]: 8: Hoare triple {50257#true} assume !(0 != ~p2~0); {50257#true} is VALID [2020-07-10 15:03:53,165 INFO L280 TraceCheckUtils]: 9: Hoare triple {50257#true} assume !(0 != ~p3~0); {50257#true} is VALID [2020-07-10 15:03:53,165 INFO L280 TraceCheckUtils]: 10: Hoare triple {50257#true} assume !(0 != ~p4~0); {50257#true} is VALID [2020-07-10 15:03:53,165 INFO L280 TraceCheckUtils]: 11: Hoare triple {50257#true} assume !(0 != ~p5~0); {50257#true} is VALID [2020-07-10 15:03:53,165 INFO L280 TraceCheckUtils]: 12: Hoare triple {50257#true} assume !(0 != ~p6~0); {50257#true} is VALID [2020-07-10 15:03:53,169 INFO L280 TraceCheckUtils]: 13: Hoare triple {50257#true} assume 0 != ~p7~0;~lk7~0 := 1; {50261#(= main_~lk7~0 1)} is VALID [2020-07-10 15:03:53,170 INFO L280 TraceCheckUtils]: 14: Hoare triple {50261#(= main_~lk7~0 1)} assume !(0 != ~p8~0); {50261#(= main_~lk7~0 1)} is VALID [2020-07-10 15:03:53,172 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-10 15:03:53,173 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-10 15:03:53,175 INFO L280 TraceCheckUtils]: 17: Hoare triple {50261#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {50261#(= main_~lk7~0 1)} is VALID [2020-07-10 15:03:53,176 INFO L280 TraceCheckUtils]: 18: Hoare triple {50261#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {50261#(= main_~lk7~0 1)} is VALID [2020-07-10 15:03:53,177 INFO L280 TraceCheckUtils]: 19: Hoare triple {50261#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {50261#(= main_~lk7~0 1)} is VALID [2020-07-10 15:03:53,178 INFO L280 TraceCheckUtils]: 20: Hoare triple {50261#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {50261#(= main_~lk7~0 1)} is VALID [2020-07-10 15:03:53,180 INFO L280 TraceCheckUtils]: 21: Hoare triple {50261#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {50261#(= main_~lk7~0 1)} is VALID [2020-07-10 15:03:53,182 INFO L280 TraceCheckUtils]: 22: Hoare triple {50261#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {50261#(= main_~lk7~0 1)} is VALID [2020-07-10 15:03:53,190 INFO L280 TraceCheckUtils]: 23: Hoare triple {50261#(= main_~lk7~0 1)} assume 0 != ~p7~0; {50261#(= main_~lk7~0 1)} is VALID [2020-07-10 15:03:53,192 INFO L280 TraceCheckUtils]: 24: Hoare triple {50261#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {50258#false} is VALID [2020-07-10 15:03:53,192 INFO L280 TraceCheckUtils]: 25: Hoare triple {50258#false} assume !false; {50258#false} is VALID [2020-07-10 15:03:53,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:53,194 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308255241] [2020-07-10 15:03:53,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:53,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:53,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112983949] [2020-07-10 15:03:53,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-10 15:03:53,196 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:53,196 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:53,242 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-10 15:03:53,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:53,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:53,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:53,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:53,244 INFO L87 Difference]: Start difference. First operand 1928 states and 2758 transitions. Second operand 3 states. [2020-07-10 15:03:54,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:54,991 INFO L93 Difference]: Finished difference Result 3340 states and 4872 transitions. [2020-07-10 15:03:54,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:54,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-10 15:03:54,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:54,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:54,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2020-07-10 15:03:54,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:54,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2020-07-10 15:03:54,994 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 106 transitions. [2020-07-10 15:03:55,118 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-10 15:03:55,541 INFO L225 Difference]: With dead ends: 3340 [2020-07-10 15:03:55,542 INFO L226 Difference]: Without dead ends: 3338 [2020-07-10 15:03:55,543 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:55,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2020-07-10 15:03:56,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 2824. [2020-07-10 15:03:56,054 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:56,054 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3338 states. Second operand 2824 states. [2020-07-10 15:03:56,054 INFO L74 IsIncluded]: Start isIncluded. First operand 3338 states. Second operand 2824 states. [2020-07-10 15:03:56,054 INFO L87 Difference]: Start difference. First operand 3338 states. Second operand 2824 states. [2020-07-10 15:03:56,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:56,538 INFO L93 Difference]: Finished difference Result 3338 states and 4807 transitions. [2020-07-10 15:03:56,538 INFO L276 IsEmpty]: Start isEmpty. Operand 3338 states and 4807 transitions. [2020-07-10 15:03:56,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:56,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:56,544 INFO L74 IsIncluded]: Start isIncluded. First operand 2824 states. Second operand 3338 states. [2020-07-10 15:03:56,544 INFO L87 Difference]: Start difference. First operand 2824 states. Second operand 3338 states. [2020-07-10 15:03:56,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:56,933 INFO L93 Difference]: Finished difference Result 3338 states and 4807 transitions. [2020-07-10 15:03:56,933 INFO L276 IsEmpty]: Start isEmpty. Operand 3338 states and 4807 transitions. [2020-07-10 15:03:56,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:56,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:56,938 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:56,938 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:56,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2824 states. [2020-07-10 15:03:57,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2824 states to 2824 states and 3910 transitions. [2020-07-10 15:03:57,212 INFO L78 Accepts]: Start accepts. Automaton has 2824 states and 3910 transitions. Word has length 26 [2020-07-10 15:03:57,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:57,212 INFO L479 AbstractCegarLoop]: Abstraction has 2824 states and 3910 transitions. [2020-07-10 15:03:57,212 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:57,212 INFO L276 IsEmpty]: Start isEmpty. Operand 2824 states and 3910 transitions. [2020-07-10 15:03:57,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 15:03:57,218 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:57,218 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-10 15:03:57,219 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-07-10 15:03:57,219 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:57,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:57,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1998499988, now seen corresponding path program 1 times [2020-07-10 15:03:57,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:57,220 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997274246] [2020-07-10 15:03:57,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:57,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:57,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:57,270 INFO L280 TraceCheckUtils]: 0: Hoare triple {63310#true} assume true; {63310#true} is VALID [2020-07-10 15:03:57,270 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {63310#true} {63310#true} #197#return; {63310#true} is VALID [2020-07-10 15:03:57,270 INFO L263 TraceCheckUtils]: 0: Hoare triple {63310#true} call ULTIMATE.init(); {63310#true} is VALID [2020-07-10 15:03:57,271 INFO L280 TraceCheckUtils]: 1: Hoare triple {63310#true} assume true; {63310#true} is VALID [2020-07-10 15:03:57,271 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {63310#true} {63310#true} #197#return; {63310#true} is VALID [2020-07-10 15:03:57,271 INFO L263 TraceCheckUtils]: 3: Hoare triple {63310#true} call #t~ret11 := main(); {63310#true} is VALID [2020-07-10 15:03:57,271 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-10 15:03:57,271 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-10 15:03:57,272 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-10 15:03:57,272 INFO L280 TraceCheckUtils]: 7: Hoare triple {63310#true} assume !(0 != ~p1~0); {63310#true} is VALID [2020-07-10 15:03:57,272 INFO L280 TraceCheckUtils]: 8: Hoare triple {63310#true} assume !(0 != ~p2~0); {63310#true} is VALID [2020-07-10 15:03:57,272 INFO L280 TraceCheckUtils]: 9: Hoare triple {63310#true} assume !(0 != ~p3~0); {63310#true} is VALID [2020-07-10 15:03:57,273 INFO L280 TraceCheckUtils]: 10: Hoare triple {63310#true} assume !(0 != ~p4~0); {63310#true} is VALID [2020-07-10 15:03:57,273 INFO L280 TraceCheckUtils]: 11: Hoare triple {63310#true} assume !(0 != ~p5~0); {63310#true} is VALID [2020-07-10 15:03:57,273 INFO L280 TraceCheckUtils]: 12: Hoare triple {63310#true} assume !(0 != ~p6~0); {63310#true} is VALID [2020-07-10 15:03:57,275 INFO L280 TraceCheckUtils]: 13: Hoare triple {63310#true} assume !(0 != ~p7~0); {63314#(= 0 main_~p7~0)} is VALID [2020-07-10 15:03:57,276 INFO L280 TraceCheckUtils]: 14: Hoare triple {63314#(= 0 main_~p7~0)} assume !(0 != ~p8~0); {63314#(= 0 main_~p7~0)} is VALID [2020-07-10 15:03:57,277 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-10 15:03:57,278 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-10 15:03:57,279 INFO L280 TraceCheckUtils]: 17: Hoare triple {63314#(= 0 main_~p7~0)} assume !(0 != ~p1~0); {63314#(= 0 main_~p7~0)} is VALID [2020-07-10 15:03:57,281 INFO L280 TraceCheckUtils]: 18: Hoare triple {63314#(= 0 main_~p7~0)} assume !(0 != ~p2~0); {63314#(= 0 main_~p7~0)} is VALID [2020-07-10 15:03:57,282 INFO L280 TraceCheckUtils]: 19: Hoare triple {63314#(= 0 main_~p7~0)} assume !(0 != ~p3~0); {63314#(= 0 main_~p7~0)} is VALID [2020-07-10 15:03:57,284 INFO L280 TraceCheckUtils]: 20: Hoare triple {63314#(= 0 main_~p7~0)} assume !(0 != ~p4~0); {63314#(= 0 main_~p7~0)} is VALID [2020-07-10 15:03:57,285 INFO L280 TraceCheckUtils]: 21: Hoare triple {63314#(= 0 main_~p7~0)} assume !(0 != ~p5~0); {63314#(= 0 main_~p7~0)} is VALID [2020-07-10 15:03:57,287 INFO L280 TraceCheckUtils]: 22: Hoare triple {63314#(= 0 main_~p7~0)} assume !(0 != ~p6~0); {63314#(= 0 main_~p7~0)} is VALID [2020-07-10 15:03:57,288 INFO L280 TraceCheckUtils]: 23: Hoare triple {63314#(= 0 main_~p7~0)} assume 0 != ~p7~0; {63311#false} is VALID [2020-07-10 15:03:57,289 INFO L280 TraceCheckUtils]: 24: Hoare triple {63311#false} assume 1 != ~lk7~0; {63311#false} is VALID [2020-07-10 15:03:57,289 INFO L280 TraceCheckUtils]: 25: Hoare triple {63311#false} assume !false; {63311#false} is VALID [2020-07-10 15:03:57,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:57,291 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997274246] [2020-07-10 15:03:57,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:57,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:57,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733963104] [2020-07-10 15:03:57,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-10 15:03:57,293 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:57,293 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:57,333 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-10 15:03:57,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:57,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:57,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:57,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:57,335 INFO L87 Difference]: Start difference. First operand 2824 states and 3910 transitions. Second operand 3 states. [2020-07-10 15:04:00,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:00,200 INFO L93 Difference]: Finished difference Result 6476 states and 8968 transitions. [2020-07-10 15:04:00,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:00,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-10 15:04:00,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:00,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:00,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 173 transitions. [2020-07-10 15:04:00,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:00,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 173 transitions. [2020-07-10 15:04:00,207 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 173 transitions. [2020-07-10 15:04:00,408 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-10 15:04:00,951 INFO L225 Difference]: With dead ends: 6476 [2020-07-10 15:04:00,952 INFO L226 Difference]: Without dead ends: 3722 [2020-07-10 15:04:00,960 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:00,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2020-07-10 15:04:02,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3720. [2020-07-10 15:04:02,047 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:02,048 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3722 states. Second operand 3720 states. [2020-07-10 15:04:02,048 INFO L74 IsIncluded]: Start isIncluded. First operand 3722 states. Second operand 3720 states. [2020-07-10 15:04:02,048 INFO L87 Difference]: Start difference. First operand 3722 states. Second operand 3720 states. [2020-07-10 15:04:02,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:02,524 INFO L93 Difference]: Finished difference Result 3722 states and 5063 transitions. [2020-07-10 15:04:02,524 INFO L276 IsEmpty]: Start isEmpty. Operand 3722 states and 5063 transitions. [2020-07-10 15:04:02,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:02,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:02,530 INFO L74 IsIncluded]: Start isIncluded. First operand 3720 states. Second operand 3722 states. [2020-07-10 15:04:02,530 INFO L87 Difference]: Start difference. First operand 3720 states. Second operand 3722 states. [2020-07-10 15:04:03,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:03,062 INFO L93 Difference]: Finished difference Result 3722 states and 5063 transitions. [2020-07-10 15:04:03,062 INFO L276 IsEmpty]: Start isEmpty. Operand 3722 states and 5063 transitions. [2020-07-10 15:04:03,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:03,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:03,068 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:03,068 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:03,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3720 states. [2020-07-10 15:04:03,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3720 states to 3720 states and 5062 transitions. [2020-07-10 15:04:03,674 INFO L78 Accepts]: Start accepts. Automaton has 3720 states and 5062 transitions. Word has length 26 [2020-07-10 15:04:03,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:03,674 INFO L479 AbstractCegarLoop]: Abstraction has 3720 states and 5062 transitions. [2020-07-10 15:04:03,674 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:03,674 INFO L276 IsEmpty]: Start isEmpty. Operand 3720 states and 5062 transitions. [2020-07-10 15:04:03,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 15:04:03,679 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:03,680 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-10 15:04:03,680 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-07-10 15:04:03,680 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:03,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:03,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1459677136, now seen corresponding path program 1 times [2020-07-10 15:04:03,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:03,681 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616494802] [2020-07-10 15:04:03,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:03,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:03,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:03,718 INFO L280 TraceCheckUtils]: 0: Hoare triple {81291#true} assume true; {81291#true} is VALID [2020-07-10 15:04:03,718 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {81291#true} {81291#true} #197#return; {81291#true} is VALID [2020-07-10 15:04:03,719 INFO L263 TraceCheckUtils]: 0: Hoare triple {81291#true} call ULTIMATE.init(); {81291#true} is VALID [2020-07-10 15:04:03,719 INFO L280 TraceCheckUtils]: 1: Hoare triple {81291#true} assume true; {81291#true} is VALID [2020-07-10 15:04:03,719 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {81291#true} {81291#true} #197#return; {81291#true} is VALID [2020-07-10 15:04:03,720 INFO L263 TraceCheckUtils]: 3: Hoare triple {81291#true} call #t~ret11 := main(); {81291#true} is VALID [2020-07-10 15:04:03,720 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-10 15:04:03,720 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-10 15:04:03,721 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-10 15:04:03,721 INFO L280 TraceCheckUtils]: 7: Hoare triple {81291#true} assume !(0 != ~p1~0); {81291#true} is VALID [2020-07-10 15:04:03,721 INFO L280 TraceCheckUtils]: 8: Hoare triple {81291#true} assume !(0 != ~p2~0); {81291#true} is VALID [2020-07-10 15:04:03,721 INFO L280 TraceCheckUtils]: 9: Hoare triple {81291#true} assume !(0 != ~p3~0); {81291#true} is VALID [2020-07-10 15:04:03,722 INFO L280 TraceCheckUtils]: 10: Hoare triple {81291#true} assume !(0 != ~p4~0); {81291#true} is VALID [2020-07-10 15:04:03,722 INFO L280 TraceCheckUtils]: 11: Hoare triple {81291#true} assume !(0 != ~p5~0); {81291#true} is VALID [2020-07-10 15:04:03,722 INFO L280 TraceCheckUtils]: 12: Hoare triple {81291#true} assume !(0 != ~p6~0); {81291#true} is VALID [2020-07-10 15:04:03,742 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-10 15:04:03,748 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-10 15:04:03,750 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-10 15:04:03,751 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-10 15:04:03,751 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-10 15:04:03,752 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-10 15:04:03,753 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-10 15:04:03,754 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-10 15:04:03,755 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-10 15:04:03,757 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-10 15:04:03,758 INFO L280 TraceCheckUtils]: 23: Hoare triple {81295#(not (= 0 main_~p7~0))} assume !(0 != ~p7~0); {81292#false} is VALID [2020-07-10 15:04:03,758 INFO L280 TraceCheckUtils]: 24: Hoare triple {81292#false} assume 0 != ~p8~0; {81292#false} is VALID [2020-07-10 15:04:03,759 INFO L280 TraceCheckUtils]: 25: Hoare triple {81292#false} assume 1 != ~lk8~0; {81292#false} is VALID [2020-07-10 15:04:03,759 INFO L280 TraceCheckUtils]: 26: Hoare triple {81292#false} assume !false; {81292#false} is VALID [2020-07-10 15:04:03,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:04:03,760 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616494802] [2020-07-10 15:04:03,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:03,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:03,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487007358] [2020-07-10 15:04:03,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-07-10 15:04:03,762 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:03,762 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:03,804 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-10 15:04:03,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:03,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:03,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:03,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:03,806 INFO L87 Difference]: Start difference. First operand 3720 states and 5062 transitions. Second operand 3 states. [2020-07-10 15:04:06,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:06,337 INFO L93 Difference]: Finished difference Result 5580 states and 7560 transitions. [2020-07-10 15:04:06,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:06,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-07-10 15:04:06,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:06,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:06,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2020-07-10 15:04:06,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:06,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2020-07-10 15:04:06,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 168 transitions. [2020-07-10 15:04:06,533 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-10 15:04:07,149 INFO L225 Difference]: With dead ends: 5580 [2020-07-10 15:04:07,149 INFO L226 Difference]: Without dead ends: 3786 [2020-07-10 15:04:07,155 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:07,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3786 states. [2020-07-10 15:04:08,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3786 to 3784. [2020-07-10 15:04:08,123 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:08,123 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3786 states. Second operand 3784 states. [2020-07-10 15:04:08,123 INFO L74 IsIncluded]: Start isIncluded. First operand 3786 states. Second operand 3784 states. [2020-07-10 15:04:08,123 INFO L87 Difference]: Start difference. First operand 3786 states. Second operand 3784 states. [2020-07-10 15:04:08,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:08,625 INFO L93 Difference]: Finished difference Result 3786 states and 5063 transitions. [2020-07-10 15:04:08,625 INFO L276 IsEmpty]: Start isEmpty. Operand 3786 states and 5063 transitions. [2020-07-10 15:04:08,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:08,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:08,631 INFO L74 IsIncluded]: Start isIncluded. First operand 3784 states. Second operand 3786 states. [2020-07-10 15:04:08,631 INFO L87 Difference]: Start difference. First operand 3784 states. Second operand 3786 states. [2020-07-10 15:04:09,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:09,144 INFO L93 Difference]: Finished difference Result 3786 states and 5063 transitions. [2020-07-10 15:04:09,144 INFO L276 IsEmpty]: Start isEmpty. Operand 3786 states and 5063 transitions. [2020-07-10 15:04:09,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:09,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:09,150 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:09,150 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:09,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2020-07-10 15:04:09,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5062 transitions. [2020-07-10 15:04:09,700 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5062 transitions. Word has length 27 [2020-07-10 15:04:09,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:09,701 INFO L479 AbstractCegarLoop]: Abstraction has 3784 states and 5062 transitions. [2020-07-10 15:04:09,701 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:09,701 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5062 transitions. [2020-07-10 15:04:09,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 15:04:09,704 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:09,704 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-10 15:04:09,705 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-07-10 15:04:09,705 INFO L427 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:09,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:09,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1824172910, now seen corresponding path program 1 times [2020-07-10 15:04:09,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:09,706 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758101196] [2020-07-10 15:04:09,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:09,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:09,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:09,751 INFO L280 TraceCheckUtils]: 0: Hoare triple {98568#true} assume true; {98568#true} is VALID [2020-07-10 15:04:09,751 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {98568#true} {98568#true} #197#return; {98568#true} is VALID [2020-07-10 15:04:09,752 INFO L263 TraceCheckUtils]: 0: Hoare triple {98568#true} call ULTIMATE.init(); {98568#true} is VALID [2020-07-10 15:04:09,752 INFO L280 TraceCheckUtils]: 1: Hoare triple {98568#true} assume true; {98568#true} is VALID [2020-07-10 15:04:09,752 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {98568#true} {98568#true} #197#return; {98568#true} is VALID [2020-07-10 15:04:09,753 INFO L263 TraceCheckUtils]: 3: Hoare triple {98568#true} call #t~ret11 := main(); {98568#true} is VALID [2020-07-10 15:04:09,753 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-10 15:04:09,753 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-10 15:04:09,753 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-10 15:04:09,753 INFO L280 TraceCheckUtils]: 7: Hoare triple {98568#true} assume !(0 != ~p1~0); {98568#true} is VALID [2020-07-10 15:04:09,753 INFO L280 TraceCheckUtils]: 8: Hoare triple {98568#true} assume !(0 != ~p2~0); {98568#true} is VALID [2020-07-10 15:04:09,754 INFO L280 TraceCheckUtils]: 9: Hoare triple {98568#true} assume !(0 != ~p3~0); {98568#true} is VALID [2020-07-10 15:04:09,754 INFO L280 TraceCheckUtils]: 10: Hoare triple {98568#true} assume !(0 != ~p4~0); {98568#true} is VALID [2020-07-10 15:04:09,754 INFO L280 TraceCheckUtils]: 11: Hoare triple {98568#true} assume !(0 != ~p5~0); {98568#true} is VALID [2020-07-10 15:04:09,755 INFO L280 TraceCheckUtils]: 12: Hoare triple {98568#true} assume !(0 != ~p6~0); {98568#true} is VALID [2020-07-10 15:04:09,755 INFO L280 TraceCheckUtils]: 13: Hoare triple {98568#true} assume !(0 != ~p7~0); {98568#true} is VALID [2020-07-10 15:04:09,756 INFO L280 TraceCheckUtils]: 14: Hoare triple {98568#true} assume !(0 != ~p8~0); {98572#(= 0 main_~p8~0)} is VALID [2020-07-10 15:04:09,757 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-10 15:04:09,758 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-10 15:04:09,758 INFO L280 TraceCheckUtils]: 17: Hoare triple {98572#(= 0 main_~p8~0)} assume !(0 != ~p1~0); {98572#(= 0 main_~p8~0)} is VALID [2020-07-10 15:04:09,759 INFO L280 TraceCheckUtils]: 18: Hoare triple {98572#(= 0 main_~p8~0)} assume !(0 != ~p2~0); {98572#(= 0 main_~p8~0)} is VALID [2020-07-10 15:04:09,760 INFO L280 TraceCheckUtils]: 19: Hoare triple {98572#(= 0 main_~p8~0)} assume !(0 != ~p3~0); {98572#(= 0 main_~p8~0)} is VALID [2020-07-10 15:04:09,761 INFO L280 TraceCheckUtils]: 20: Hoare triple {98572#(= 0 main_~p8~0)} assume !(0 != ~p4~0); {98572#(= 0 main_~p8~0)} is VALID [2020-07-10 15:04:09,761 INFO L280 TraceCheckUtils]: 21: Hoare triple {98572#(= 0 main_~p8~0)} assume !(0 != ~p5~0); {98572#(= 0 main_~p8~0)} is VALID [2020-07-10 15:04:09,762 INFO L280 TraceCheckUtils]: 22: Hoare triple {98572#(= 0 main_~p8~0)} assume !(0 != ~p6~0); {98572#(= 0 main_~p8~0)} is VALID [2020-07-10 15:04:09,762 INFO L280 TraceCheckUtils]: 23: Hoare triple {98572#(= 0 main_~p8~0)} assume !(0 != ~p7~0); {98572#(= 0 main_~p8~0)} is VALID [2020-07-10 15:04:09,763 INFO L280 TraceCheckUtils]: 24: Hoare triple {98572#(= 0 main_~p8~0)} assume 0 != ~p8~0; {98569#false} is VALID [2020-07-10 15:04:09,764 INFO L280 TraceCheckUtils]: 25: Hoare triple {98569#false} assume 1 != ~lk8~0; {98569#false} is VALID [2020-07-10 15:04:09,764 INFO L280 TraceCheckUtils]: 26: Hoare triple {98569#false} assume !false; {98569#false} is VALID [2020-07-10 15:04:09,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:04:09,765 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758101196] [2020-07-10 15:04:09,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:09,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:09,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013104689] [2020-07-10 15:04:09,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-07-10 15:04:09,766 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:09,766 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:09,794 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-10 15:04:09,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:09,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:09,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:09,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:09,795 INFO L87 Difference]: Start difference. First operand 3784 states and 5062 transitions. Second operand 3 states. [2020-07-10 15:04:16,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:16,874 INFO L93 Difference]: Finished difference Result 10956 states and 14408 transitions. [2020-07-10 15:04:16,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:16,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-07-10 15:04:16,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:16,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:16,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2020-07-10 15:04:16,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:16,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2020-07-10 15:04:16,879 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 171 transitions. [2020-07-10 15:04:17,081 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-10 15:04:19,467 INFO L225 Difference]: With dead ends: 10956 [2020-07-10 15:04:19,468 INFO L226 Difference]: Without dead ends: 7306 [2020-07-10 15:04:19,473 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:19,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7306 states. [2020-07-10 15:04:21,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7306 to 7304. [2020-07-10 15:04:21,494 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:21,494 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7306 states. Second operand 7304 states. [2020-07-10 15:04:21,494 INFO L74 IsIncluded]: Start isIncluded. First operand 7306 states. Second operand 7304 states. [2020-07-10 15:04:21,494 INFO L87 Difference]: Start difference. First operand 7306 states. Second operand 7304 states. [2020-07-10 15:04:23,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:23,670 INFO L93 Difference]: Finished difference Result 7306 states and 9351 transitions. [2020-07-10 15:04:23,670 INFO L276 IsEmpty]: Start isEmpty. Operand 7306 states and 9351 transitions. [2020-07-10 15:04:23,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:23,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:23,683 INFO L74 IsIncluded]: Start isIncluded. First operand 7304 states. Second operand 7306 states. [2020-07-10 15:04:23,683 INFO L87 Difference]: Start difference. First operand 7304 states. Second operand 7306 states. [2020-07-10 15:04:25,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:25,861 INFO L93 Difference]: Finished difference Result 7306 states and 9351 transitions. [2020-07-10 15:04:25,861 INFO L276 IsEmpty]: Start isEmpty. Operand 7306 states and 9351 transitions. [2020-07-10 15:04:25,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:25,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:25,869 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:25,869 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:25,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7304 states. [2020-07-10 15:04:28,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7304 states to 7304 states and 9350 transitions. [2020-07-10 15:04:28,070 INFO L78 Accepts]: Start accepts. Automaton has 7304 states and 9350 transitions. Word has length 27 [2020-07-10 15:04:28,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:28,070 INFO L479 AbstractCegarLoop]: Abstraction has 7304 states and 9350 transitions. [2020-07-10 15:04:28,070 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:28,071 INFO L276 IsEmpty]: Start isEmpty. Operand 7304 states and 9350 transitions. [2020-07-10 15:04:28,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 15:04:28,075 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:28,075 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-10 15:04:28,075 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-07-10 15:04:28,075 INFO L427 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:28,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:28,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1883988372, now seen corresponding path program 1 times [2020-07-10 15:04:28,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:28,076 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998991608] [2020-07-10 15:04:28,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:28,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:28,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:28,127 INFO L280 TraceCheckUtils]: 0: Hoare triple {132101#true} assume true; {132101#true} is VALID [2020-07-10 15:04:28,127 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {132101#true} {132101#true} #197#return; {132101#true} is VALID [2020-07-10 15:04:28,127 INFO L263 TraceCheckUtils]: 0: Hoare triple {132101#true} call ULTIMATE.init(); {132101#true} is VALID [2020-07-10 15:04:28,128 INFO L280 TraceCheckUtils]: 1: Hoare triple {132101#true} assume true; {132101#true} is VALID [2020-07-10 15:04:28,128 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {132101#true} {132101#true} #197#return; {132101#true} is VALID [2020-07-10 15:04:28,128 INFO L263 TraceCheckUtils]: 3: Hoare triple {132101#true} call #t~ret11 := main(); {132101#true} is VALID [2020-07-10 15:04:28,128 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-10 15:04:28,129 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-10 15:04:28,129 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-10 15:04:28,129 INFO L280 TraceCheckUtils]: 7: Hoare triple {132101#true} assume !(0 != ~p1~0); {132101#true} is VALID [2020-07-10 15:04:28,129 INFO L280 TraceCheckUtils]: 8: Hoare triple {132101#true} assume !(0 != ~p2~0); {132101#true} is VALID [2020-07-10 15:04:28,129 INFO L280 TraceCheckUtils]: 9: Hoare triple {132101#true} assume !(0 != ~p3~0); {132101#true} is VALID [2020-07-10 15:04:28,129 INFO L280 TraceCheckUtils]: 10: Hoare triple {132101#true} assume !(0 != ~p4~0); {132101#true} is VALID [2020-07-10 15:04:28,130 INFO L280 TraceCheckUtils]: 11: Hoare triple {132101#true} assume !(0 != ~p5~0); {132101#true} is VALID [2020-07-10 15:04:28,130 INFO L280 TraceCheckUtils]: 12: Hoare triple {132101#true} assume !(0 != ~p6~0); {132101#true} is VALID [2020-07-10 15:04:28,130 INFO L280 TraceCheckUtils]: 13: Hoare triple {132101#true} assume !(0 != ~p7~0); {132101#true} is VALID [2020-07-10 15:04:28,131 INFO L280 TraceCheckUtils]: 14: Hoare triple {132101#true} assume 0 != ~p8~0;~lk8~0 := 1; {132105#(= 1 main_~lk8~0)} is VALID [2020-07-10 15:04:28,131 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-10 15:04:28,132 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-10 15:04:28,133 INFO L280 TraceCheckUtils]: 17: Hoare triple {132105#(= 1 main_~lk8~0)} assume !(0 != ~p1~0); {132105#(= 1 main_~lk8~0)} is VALID [2020-07-10 15:04:28,134 INFO L280 TraceCheckUtils]: 18: Hoare triple {132105#(= 1 main_~lk8~0)} assume !(0 != ~p2~0); {132105#(= 1 main_~lk8~0)} is VALID [2020-07-10 15:04:28,134 INFO L280 TraceCheckUtils]: 19: Hoare triple {132105#(= 1 main_~lk8~0)} assume !(0 != ~p3~0); {132105#(= 1 main_~lk8~0)} is VALID [2020-07-10 15:04:28,135 INFO L280 TraceCheckUtils]: 20: Hoare triple {132105#(= 1 main_~lk8~0)} assume !(0 != ~p4~0); {132105#(= 1 main_~lk8~0)} is VALID [2020-07-10 15:04:28,136 INFO L280 TraceCheckUtils]: 21: Hoare triple {132105#(= 1 main_~lk8~0)} assume !(0 != ~p5~0); {132105#(= 1 main_~lk8~0)} is VALID [2020-07-10 15:04:28,136 INFO L280 TraceCheckUtils]: 22: Hoare triple {132105#(= 1 main_~lk8~0)} assume !(0 != ~p6~0); {132105#(= 1 main_~lk8~0)} is VALID [2020-07-10 15:04:28,137 INFO L280 TraceCheckUtils]: 23: Hoare triple {132105#(= 1 main_~lk8~0)} assume !(0 != ~p7~0); {132105#(= 1 main_~lk8~0)} is VALID [2020-07-10 15:04:28,138 INFO L280 TraceCheckUtils]: 24: Hoare triple {132105#(= 1 main_~lk8~0)} assume 0 != ~p8~0; {132105#(= 1 main_~lk8~0)} is VALID [2020-07-10 15:04:28,138 INFO L280 TraceCheckUtils]: 25: Hoare triple {132105#(= 1 main_~lk8~0)} assume 1 != ~lk8~0; {132102#false} is VALID [2020-07-10 15:04:28,138 INFO L280 TraceCheckUtils]: 26: Hoare triple {132102#false} assume !false; {132102#false} is VALID [2020-07-10 15:04:28,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:04:28,140 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998991608] [2020-07-10 15:04:28,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:28,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:28,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557710322] [2020-07-10 15:04:28,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-07-10 15:04:28,141 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:28,142 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:28,185 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-10 15:04:28,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:28,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:28,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:28,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:28,186 INFO L87 Difference]: Start difference. First operand 7304 states and 9350 transitions. Second operand 3 states. [2020-07-10 15:04:33,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:33,771 INFO L93 Difference]: Finished difference Result 8076 states and 10632 transitions. [2020-07-10 15:04:33,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:33,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-07-10 15:04:33,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:33,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:33,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2020-07-10 15:04:33,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:33,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2020-07-10 15:04:33,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 99 transitions. [2020-07-10 15:04:33,889 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-10 15:04:40,173 INFO L225 Difference]: With dead ends: 8076 [2020-07-10 15:04:40,174 INFO L226 Difference]: Without dead ends: 8074 [2020-07-10 15:04:40,176 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:40,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8074 states. [2020-07-10 15:04:42,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8074 to 7304. [2020-07-10 15:04:42,287 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:42,287 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8074 states. Second operand 7304 states. [2020-07-10 15:04:42,287 INFO L74 IsIncluded]: Start isIncluded. First operand 8074 states. Second operand 7304 states. [2020-07-10 15:04:42,288 INFO L87 Difference]: Start difference. First operand 8074 states. Second operand 7304 states. [2020-07-10 15:04:45,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:45,420 INFO L93 Difference]: Finished difference Result 8074 states and 10503 transitions. [2020-07-10 15:04:45,420 INFO L276 IsEmpty]: Start isEmpty. Operand 8074 states and 10503 transitions. [2020-07-10 15:04:45,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:45,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:45,429 INFO L74 IsIncluded]: Start isIncluded. First operand 7304 states. Second operand 8074 states. [2020-07-10 15:04:45,429 INFO L87 Difference]: Start difference. First operand 7304 states. Second operand 8074 states. [2020-07-10 15:04:48,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:48,291 INFO L93 Difference]: Finished difference Result 8074 states and 10503 transitions. [2020-07-10 15:04:48,291 INFO L276 IsEmpty]: Start isEmpty. Operand 8074 states and 10503 transitions. [2020-07-10 15:04:48,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:48,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:48,300 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:48,300 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:48,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7304 states. [2020-07-10 15:04:50,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7304 states to 7304 states and 9222 transitions. [2020-07-10 15:04:50,373 INFO L78 Accepts]: Start accepts. Automaton has 7304 states and 9222 transitions. Word has length 27 [2020-07-10 15:04:50,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:50,374 INFO L479 AbstractCegarLoop]: Abstraction has 7304 states and 9222 transitions. [2020-07-10 15:04:50,374 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:50,374 INFO L276 IsEmpty]: Start isEmpty. Operand 7304 states and 9222 transitions. [2020-07-10 15:04:50,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-10 15:04:50,379 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:50,380 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-10 15:04:50,380 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-07-10 15:04:50,380 INFO L427 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:50,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:50,381 INFO L82 PathProgramCache]: Analyzing trace with hash 715001129, now seen corresponding path program 1 times [2020-07-10 15:04:50,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:50,381 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536504100] [2020-07-10 15:04:50,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:50,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:50,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:50,447 INFO L280 TraceCheckUtils]: 0: Hoare triple {164290#true} assume true; {164290#true} is VALID [2020-07-10 15:04:50,448 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {164290#true} {164290#true} #197#return; {164290#true} is VALID [2020-07-10 15:04:50,448 INFO L263 TraceCheckUtils]: 0: Hoare triple {164290#true} call ULTIMATE.init(); {164290#true} is VALID [2020-07-10 15:04:50,448 INFO L280 TraceCheckUtils]: 1: Hoare triple {164290#true} assume true; {164290#true} is VALID [2020-07-10 15:04:50,449 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {164290#true} {164290#true} #197#return; {164290#true} is VALID [2020-07-10 15:04:50,449 INFO L263 TraceCheckUtils]: 3: Hoare triple {164290#true} call #t~ret11 := main(); {164290#true} is VALID [2020-07-10 15:04:50,449 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-10 15:04:50,449 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-10 15:04:50,449 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-10 15:04:50,449 INFO L280 TraceCheckUtils]: 7: Hoare triple {164290#true} assume !(0 != ~p1~0); {164290#true} is VALID [2020-07-10 15:04:50,450 INFO L280 TraceCheckUtils]: 8: Hoare triple {164290#true} assume !(0 != ~p2~0); {164290#true} is VALID [2020-07-10 15:04:50,450 INFO L280 TraceCheckUtils]: 9: Hoare triple {164290#true} assume !(0 != ~p3~0); {164290#true} is VALID [2020-07-10 15:04:50,450 INFO L280 TraceCheckUtils]: 10: Hoare triple {164290#true} assume !(0 != ~p4~0); {164290#true} is VALID [2020-07-10 15:04:50,450 INFO L280 TraceCheckUtils]: 11: Hoare triple {164290#true} assume !(0 != ~p5~0); {164290#true} is VALID [2020-07-10 15:04:50,451 INFO L280 TraceCheckUtils]: 12: Hoare triple {164290#true} assume !(0 != ~p6~0); {164290#true} is VALID [2020-07-10 15:04:50,451 INFO L280 TraceCheckUtils]: 13: Hoare triple {164290#true} assume !(0 != ~p7~0); {164290#true} is VALID [2020-07-10 15:04:50,451 INFO L280 TraceCheckUtils]: 14: Hoare triple {164290#true} assume !(0 != ~p8~0); {164290#true} is VALID [2020-07-10 15:04:50,452 INFO L280 TraceCheckUtils]: 15: Hoare triple {164290#true} assume 0 != ~p9~0;~lk9~0 := 1; {164294#(= 1 main_~lk9~0)} is VALID [2020-07-10 15:04:50,454 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-10 15:04:50,455 INFO L280 TraceCheckUtils]: 17: Hoare triple {164294#(= 1 main_~lk9~0)} assume !(0 != ~p1~0); {164294#(= 1 main_~lk9~0)} is VALID [2020-07-10 15:04:50,456 INFO L280 TraceCheckUtils]: 18: Hoare triple {164294#(= 1 main_~lk9~0)} assume !(0 != ~p2~0); {164294#(= 1 main_~lk9~0)} is VALID [2020-07-10 15:04:50,457 INFO L280 TraceCheckUtils]: 19: Hoare triple {164294#(= 1 main_~lk9~0)} assume !(0 != ~p3~0); {164294#(= 1 main_~lk9~0)} is VALID [2020-07-10 15:04:50,457 INFO L280 TraceCheckUtils]: 20: Hoare triple {164294#(= 1 main_~lk9~0)} assume !(0 != ~p4~0); {164294#(= 1 main_~lk9~0)} is VALID [2020-07-10 15:04:50,458 INFO L280 TraceCheckUtils]: 21: Hoare triple {164294#(= 1 main_~lk9~0)} assume !(0 != ~p5~0); {164294#(= 1 main_~lk9~0)} is VALID [2020-07-10 15:04:50,459 INFO L280 TraceCheckUtils]: 22: Hoare triple {164294#(= 1 main_~lk9~0)} assume !(0 != ~p6~0); {164294#(= 1 main_~lk9~0)} is VALID [2020-07-10 15:04:50,459 INFO L280 TraceCheckUtils]: 23: Hoare triple {164294#(= 1 main_~lk9~0)} assume !(0 != ~p7~0); {164294#(= 1 main_~lk9~0)} is VALID [2020-07-10 15:04:50,460 INFO L280 TraceCheckUtils]: 24: Hoare triple {164294#(= 1 main_~lk9~0)} assume !(0 != ~p8~0); {164294#(= 1 main_~lk9~0)} is VALID [2020-07-10 15:04:50,461 INFO L280 TraceCheckUtils]: 25: Hoare triple {164294#(= 1 main_~lk9~0)} assume 0 != ~p9~0; {164294#(= 1 main_~lk9~0)} is VALID [2020-07-10 15:04:50,462 INFO L280 TraceCheckUtils]: 26: Hoare triple {164294#(= 1 main_~lk9~0)} assume 1 != ~lk9~0; {164291#false} is VALID [2020-07-10 15:04:50,462 INFO L280 TraceCheckUtils]: 27: Hoare triple {164291#false} assume !false; {164291#false} is VALID [2020-07-10 15:04:50,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:04:50,464 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536504100] [2020-07-10 15:04:50,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:50,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:50,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424148666] [2020-07-10 15:04:50,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-07-10 15:04:50,466 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:50,466 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:50,507 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-10 15:04:50,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:50,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:50,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:50,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:50,509 INFO L87 Difference]: Start difference. First operand 7304 states and 9222 transitions. Second operand 3 states. [2020-07-10 15:04:59,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:59,869 INFO L93 Difference]: Finished difference Result 12172 states and 15496 transitions. [2020-07-10 15:04:59,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:59,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-07-10 15:04:59,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:59,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:59,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2020-07-10 15:04:59,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:59,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2020-07-10 15:04:59,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 98 transitions. [2020-07-10 15:04:59,983 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-10 15:05:12,537 INFO L225 Difference]: With dead ends: 12172 [2020-07-10 15:05:12,537 INFO L226 Difference]: Without dead ends: 12170 [2020-07-10 15:05:12,539 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:05:12,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12170 states. [2020-07-10 15:05:14,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12170 to 11144. [2020-07-10 15:05:14,406 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:05:14,407 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12170 states. Second operand 11144 states. [2020-07-10 15:05:14,407 INFO L74 IsIncluded]: Start isIncluded. First operand 12170 states. Second operand 11144 states. [2020-07-10 15:05:14,407 INFO L87 Difference]: Start difference. First operand 12170 states. Second operand 11144 states. [2020-07-10 15:05:19,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:19,201 INFO L93 Difference]: Finished difference Result 12170 states and 15239 transitions. [2020-07-10 15:05:19,201 INFO L276 IsEmpty]: Start isEmpty. Operand 12170 states and 15239 transitions. [2020-07-10 15:05:19,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:05:19,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:05:19,212 INFO L74 IsIncluded]: Start isIncluded. First operand 11144 states. Second operand 12170 states. [2020-07-10 15:05:19,212 INFO L87 Difference]: Start difference. First operand 11144 states. Second operand 12170 states. [2020-07-10 15:05:24,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:24,131 INFO L93 Difference]: Finished difference Result 12170 states and 15239 transitions. [2020-07-10 15:05:24,132 INFO L276 IsEmpty]: Start isEmpty. Operand 12170 states and 15239 transitions. [2020-07-10 15:05:24,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:05:24,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:05:24,144 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:05:24,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:05:24,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11144 states. [2020-07-10 15:05:28,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11144 states to 11144 states and 13702 transitions. [2020-07-10 15:05:28,204 INFO L78 Accepts]: Start accepts. Automaton has 11144 states and 13702 transitions. Word has length 28 [2020-07-10 15:05:28,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:05:28,204 INFO L479 AbstractCegarLoop]: Abstraction has 11144 states and 13702 transitions. [2020-07-10 15:05:28,204 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:05:28,204 INFO L276 IsEmpty]: Start isEmpty. Operand 11144 states and 13702 transitions. [2020-07-10 15:05:28,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-10 15:05:28,209 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:05:28,210 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-10 15:05:28,210 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-07-10 15:05:28,210 INFO L427 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:05:28,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:05:28,210 INFO L82 PathProgramCache]: Analyzing trace with hash 128195115, now seen corresponding path program 1 times [2020-07-10 15:05:28,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:05:28,210 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212929077] [2020-07-10 15:05:28,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:05:28,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:28,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:28,239 INFO L280 TraceCheckUtils]: 0: Hoare triple {212735#true} assume true; {212735#true} is VALID [2020-07-10 15:05:28,239 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {212735#true} {212735#true} #197#return; {212735#true} is VALID [2020-07-10 15:05:28,240 INFO L263 TraceCheckUtils]: 0: Hoare triple {212735#true} call ULTIMATE.init(); {212735#true} is VALID [2020-07-10 15:05:28,240 INFO L280 TraceCheckUtils]: 1: Hoare triple {212735#true} assume true; {212735#true} is VALID [2020-07-10 15:05:28,240 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {212735#true} {212735#true} #197#return; {212735#true} is VALID [2020-07-10 15:05:28,240 INFO L263 TraceCheckUtils]: 3: Hoare triple {212735#true} call #t~ret11 := main(); {212735#true} is VALID [2020-07-10 15:05:28,240 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-10 15:05:28,240 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-10 15:05:28,241 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-10 15:05:28,241 INFO L280 TraceCheckUtils]: 7: Hoare triple {212735#true} assume !(0 != ~p1~0); {212735#true} is VALID [2020-07-10 15:05:28,241 INFO L280 TraceCheckUtils]: 8: Hoare triple {212735#true} assume !(0 != ~p2~0); {212735#true} is VALID [2020-07-10 15:05:28,241 INFO L280 TraceCheckUtils]: 9: Hoare triple {212735#true} assume !(0 != ~p3~0); {212735#true} is VALID [2020-07-10 15:05:28,241 INFO L280 TraceCheckUtils]: 10: Hoare triple {212735#true} assume !(0 != ~p4~0); {212735#true} is VALID [2020-07-10 15:05:28,242 INFO L280 TraceCheckUtils]: 11: Hoare triple {212735#true} assume !(0 != ~p5~0); {212735#true} is VALID [2020-07-10 15:05:28,242 INFO L280 TraceCheckUtils]: 12: Hoare triple {212735#true} assume !(0 != ~p6~0); {212735#true} is VALID [2020-07-10 15:05:28,242 INFO L280 TraceCheckUtils]: 13: Hoare triple {212735#true} assume !(0 != ~p7~0); {212735#true} is VALID [2020-07-10 15:05:28,242 INFO L280 TraceCheckUtils]: 14: Hoare triple {212735#true} assume !(0 != ~p8~0); {212735#true} is VALID [2020-07-10 15:05:28,243 INFO L280 TraceCheckUtils]: 15: Hoare triple {212735#true} assume !(0 != ~p9~0); {212739#(= 0 main_~p9~0)} is VALID [2020-07-10 15:05:28,244 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-10 15:05:28,244 INFO L280 TraceCheckUtils]: 17: Hoare triple {212739#(= 0 main_~p9~0)} assume !(0 != ~p1~0); {212739#(= 0 main_~p9~0)} is VALID [2020-07-10 15:05:28,244 INFO L280 TraceCheckUtils]: 18: Hoare triple {212739#(= 0 main_~p9~0)} assume !(0 != ~p2~0); {212739#(= 0 main_~p9~0)} is VALID [2020-07-10 15:05:28,245 INFO L280 TraceCheckUtils]: 19: Hoare triple {212739#(= 0 main_~p9~0)} assume !(0 != ~p3~0); {212739#(= 0 main_~p9~0)} is VALID [2020-07-10 15:05:28,245 INFO L280 TraceCheckUtils]: 20: Hoare triple {212739#(= 0 main_~p9~0)} assume !(0 != ~p4~0); {212739#(= 0 main_~p9~0)} is VALID [2020-07-10 15:05:28,245 INFO L280 TraceCheckUtils]: 21: Hoare triple {212739#(= 0 main_~p9~0)} assume !(0 != ~p5~0); {212739#(= 0 main_~p9~0)} is VALID [2020-07-10 15:05:28,246 INFO L280 TraceCheckUtils]: 22: Hoare triple {212739#(= 0 main_~p9~0)} assume !(0 != ~p6~0); {212739#(= 0 main_~p9~0)} is VALID [2020-07-10 15:05:28,246 INFO L280 TraceCheckUtils]: 23: Hoare triple {212739#(= 0 main_~p9~0)} assume !(0 != ~p7~0); {212739#(= 0 main_~p9~0)} is VALID [2020-07-10 15:05:28,247 INFO L280 TraceCheckUtils]: 24: Hoare triple {212739#(= 0 main_~p9~0)} assume !(0 != ~p8~0); {212739#(= 0 main_~p9~0)} is VALID [2020-07-10 15:05:28,247 INFO L280 TraceCheckUtils]: 25: Hoare triple {212739#(= 0 main_~p9~0)} assume 0 != ~p9~0; {212736#false} is VALID [2020-07-10 15:05:28,247 INFO L280 TraceCheckUtils]: 26: Hoare triple {212736#false} assume 1 != ~lk9~0; {212736#false} is VALID [2020-07-10 15:05:28,247 INFO L280 TraceCheckUtils]: 27: Hoare triple {212736#false} assume !false; {212736#false} is VALID [2020-07-10 15:05:28,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:05:28,248 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212929077] [2020-07-10 15:05:28,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:05:28,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:05:28,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548507458] [2020-07-10 15:05:28,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-07-10 15:05:28,249 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:05:28,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:05:28,277 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-10 15:05:28,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:05:28,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:05:28,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:05:28,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:05:28,278 INFO L87 Difference]: Start difference. First operand 11144 states and 13702 transitions. Second operand 3 states. [2020-07-10 15:06:16,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:16,653 INFO L93 Difference]: Finished difference Result 25228 states and 30856 transitions. [2020-07-10 15:06:16,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:06:16,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-07-10 15:06:16,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:06:16,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:06:16,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 167 transitions. [2020-07-10 15:06:16,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:06:16,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 167 transitions. [2020-07-10 15:06:16,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 167 transitions. [2020-07-10 15:06:16,819 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-10 15:06:24,984 INFO L225 Difference]: With dead ends: 25228 [2020-07-10 15:06:24,985 INFO L226 Difference]: Without dead ends: 14218 [2020-07-10 15:06:24,996 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:06:25,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14218 states. [2020-07-10 15:06:28,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14218 to 14216. [2020-07-10 15:06:28,727 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:06:28,727 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14218 states. Second operand 14216 states. [2020-07-10 15:06:28,727 INFO L74 IsIncluded]: Start isIncluded. First operand 14218 states. Second operand 14216 states. [2020-07-10 15:06:28,727 INFO L87 Difference]: Start difference. First operand 14218 states. Second operand 14216 states. [2020-07-10 15:06:36,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:36,499 INFO L93 Difference]: Finished difference Result 14218 states and 16903 transitions. [2020-07-10 15:06:36,499 INFO L276 IsEmpty]: Start isEmpty. Operand 14218 states and 16903 transitions. [2020-07-10 15:06:36,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:36,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:06:36,664 INFO L74 IsIncluded]: Start isIncluded. First operand 14216 states. Second operand 14218 states. [2020-07-10 15:06:36,664 INFO L87 Difference]: Start difference. First operand 14216 states. Second operand 14218 states. [2020-07-10 15:06:43,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:43,748 INFO L93 Difference]: Finished difference Result 14218 states and 16903 transitions. [2020-07-10 15:06:43,748 INFO L276 IsEmpty]: Start isEmpty. Operand 14218 states and 16903 transitions. [2020-07-10 15:06:43,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:43,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:06:43,758 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:06:43,758 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:06:43,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14216 states. [2020-07-10 15:06:54,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14216 states to 14216 states and 16902 transitions. [2020-07-10 15:06:54,038 INFO L78 Accepts]: Start accepts. Automaton has 14216 states and 16902 transitions. Word has length 28 [2020-07-10 15:06:54,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:06:54,038 INFO L479 AbstractCegarLoop]: Abstraction has 14216 states and 16902 transitions. [2020-07-10 15:06:54,038 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:06:54,038 INFO L276 IsEmpty]: Start isEmpty. Operand 14216 states and 16902 transitions. [2020-07-10 15:06:54,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-10 15:06:54,045 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:06:54,045 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-10 15:06:54,045 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-07-10 15:06:54,046 INFO L427 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:06:54,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:06:54,047 INFO L82 PathProgramCache]: Analyzing trace with hash 690414627, now seen corresponding path program 1 times [2020-07-10 15:06:54,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:06:54,047 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478015686] [2020-07-10 15:06:54,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:06:54,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:54,077 INFO L280 TraceCheckUtils]: 0: Hoare triple {281916#true} assume true; {281916#true} is VALID [2020-07-10 15:06:54,078 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {281916#true} {281916#true} #197#return; {281916#true} is VALID [2020-07-10 15:06:54,078 INFO L263 TraceCheckUtils]: 0: Hoare triple {281916#true} call ULTIMATE.init(); {281916#true} is VALID [2020-07-10 15:06:54,078 INFO L280 TraceCheckUtils]: 1: Hoare triple {281916#true} assume true; {281916#true} is VALID [2020-07-10 15:06:54,078 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {281916#true} {281916#true} #197#return; {281916#true} is VALID [2020-07-10 15:06:54,078 INFO L263 TraceCheckUtils]: 3: Hoare triple {281916#true} call #t~ret11 := main(); {281916#true} is VALID [2020-07-10 15:06:54,079 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-10 15:06:54,079 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-10 15:06:54,079 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-10 15:06:54,079 INFO L280 TraceCheckUtils]: 7: Hoare triple {281916#true} assume !(0 != ~p1~0); {281916#true} is VALID [2020-07-10 15:06:54,079 INFO L280 TraceCheckUtils]: 8: Hoare triple {281916#true} assume !(0 != ~p2~0); {281916#true} is VALID [2020-07-10 15:06:54,079 INFO L280 TraceCheckUtils]: 9: Hoare triple {281916#true} assume !(0 != ~p3~0); {281916#true} is VALID [2020-07-10 15:06:54,080 INFO L280 TraceCheckUtils]: 10: Hoare triple {281916#true} assume !(0 != ~p4~0); {281916#true} is VALID [2020-07-10 15:06:54,080 INFO L280 TraceCheckUtils]: 11: Hoare triple {281916#true} assume !(0 != ~p5~0); {281916#true} is VALID [2020-07-10 15:06:54,080 INFO L280 TraceCheckUtils]: 12: Hoare triple {281916#true} assume !(0 != ~p6~0); {281916#true} is VALID [2020-07-10 15:06:54,080 INFO L280 TraceCheckUtils]: 13: Hoare triple {281916#true} assume !(0 != ~p7~0); {281916#true} is VALID [2020-07-10 15:06:54,080 INFO L280 TraceCheckUtils]: 14: Hoare triple {281916#true} assume !(0 != ~p8~0); {281916#true} is VALID [2020-07-10 15:06:54,081 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-10 15:06:54,082 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-10 15:06:54,083 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-10 15:06:54,083 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-10 15:06:54,084 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-10 15:06:54,084 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-10 15:06:54,085 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-10 15:06:54,085 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-10 15:06:54,086 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-10 15:06:54,087 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-10 15:06:54,087 INFO L280 TraceCheckUtils]: 25: Hoare triple {281920#(not (= 0 main_~p9~0))} assume !(0 != ~p9~0); {281917#false} is VALID [2020-07-10 15:06:54,088 INFO L280 TraceCheckUtils]: 26: Hoare triple {281917#false} assume 0 != ~p10~0; {281917#false} is VALID [2020-07-10 15:06:54,088 INFO L280 TraceCheckUtils]: 27: Hoare triple {281917#false} assume 1 != ~lk10~0; {281917#false} is VALID [2020-07-10 15:06:54,088 INFO L280 TraceCheckUtils]: 28: Hoare triple {281917#false} assume !false; {281917#false} is VALID [2020-07-10 15:06:54,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:06:54,090 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478015686] [2020-07-10 15:06:54,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:06:54,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:06:54,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678624644] [2020-07-10 15:06:54,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-07-10 15:06:54,091 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:06:54,091 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:06:54,120 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-10 15:06:54,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:06:54,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:06:54,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:06:54,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:06:54,121 INFO L87 Difference]: Start difference. First operand 14216 states and 16902 transitions. Second operand 3 states. [2020-07-10 15:07:17,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:17,755 INFO L93 Difference]: Finished difference Result 21516 states and 25608 transitions. [2020-07-10 15:07:17,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:07:17,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-07-10 15:07:17,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:07:17,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:07:17,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2020-07-10 15:07:17,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:07:17,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2020-07-10 15:07:17,758 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 162 transitions. [2020-07-10 15:07:17,917 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-10 15:07:27,574 INFO L225 Difference]: With dead ends: 21516 [2020-07-10 15:07:27,574 INFO L226 Difference]: Without dead ends: 14602 [2020-07-10 15:07:27,583 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:07:27,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14602 states. [2020-07-10 15:07:31,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14602 to 14600. [2020-07-10 15:07:31,669 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:07:31,669 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14602 states. Second operand 14600 states. [2020-07-10 15:07:31,669 INFO L74 IsIncluded]: Start isIncluded. First operand 14602 states. Second operand 14600 states. [2020-07-10 15:07:31,669 INFO L87 Difference]: Start difference. First operand 14602 states. Second operand 14600 states. [2020-07-10 15:07:38,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:38,909 INFO L93 Difference]: Finished difference Result 14602 states and 17159 transitions. [2020-07-10 15:07:38,910 INFO L276 IsEmpty]: Start isEmpty. Operand 14602 states and 17159 transitions. [2020-07-10 15:07:38,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:07:38,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:07:38,919 INFO L74 IsIncluded]: Start isIncluded. First operand 14600 states. Second operand 14602 states. [2020-07-10 15:07:38,919 INFO L87 Difference]: Start difference. First operand 14600 states. Second operand 14602 states. [2020-07-10 15:07:48,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:07:48,610 INFO L93 Difference]: Finished difference Result 14602 states and 17159 transitions. [2020-07-10 15:07:48,611 INFO L276 IsEmpty]: Start isEmpty. Operand 14602 states and 17159 transitions. [2020-07-10 15:07:48,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:07:48,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:07:48,620 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:07:48,620 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:07:48,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14600 states. [2020-07-10 15:07:59,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14600 states to 14600 states and 17158 transitions. [2020-07-10 15:07:59,220 INFO L78 Accepts]: Start accepts. Automaton has 14600 states and 17158 transitions. Word has length 29 [2020-07-10 15:07:59,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:07:59,220 INFO L479 AbstractCegarLoop]: Abstraction has 14600 states and 17158 transitions. [2020-07-10 15:07:59,220 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:07:59,220 INFO L276 IsEmpty]: Start isEmpty. Operand 14600 states and 17158 transitions. [2020-07-10 15:07:59,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-10 15:07:59,226 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:07:59,226 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-10 15:07:59,226 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-07-10 15:07:59,226 INFO L427 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:07:59,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:07:59,227 INFO L82 PathProgramCache]: Analyzing trace with hash -320702623, now seen corresponding path program 1 times [2020-07-10 15:07:59,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:07:59,227 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330916483] [2020-07-10 15:07:59,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:07:59,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:59,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:07:59,257 INFO L280 TraceCheckUtils]: 0: Hoare triple {348537#true} assume true; {348537#true} is VALID [2020-07-10 15:07:59,257 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {348537#true} {348537#true} #197#return; {348537#true} is VALID [2020-07-10 15:07:59,257 INFO L263 TraceCheckUtils]: 0: Hoare triple {348537#true} call ULTIMATE.init(); {348537#true} is VALID [2020-07-10 15:07:59,258 INFO L280 TraceCheckUtils]: 1: Hoare triple {348537#true} assume true; {348537#true} is VALID [2020-07-10 15:07:59,258 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {348537#true} {348537#true} #197#return; {348537#true} is VALID [2020-07-10 15:07:59,258 INFO L263 TraceCheckUtils]: 3: Hoare triple {348537#true} call #t~ret11 := main(); {348537#true} is VALID [2020-07-10 15:07:59,258 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-10 15:07:59,258 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-10 15:07:59,258 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-10 15:07:59,259 INFO L280 TraceCheckUtils]: 7: Hoare triple {348537#true} assume !(0 != ~p1~0); {348537#true} is VALID [2020-07-10 15:07:59,259 INFO L280 TraceCheckUtils]: 8: Hoare triple {348537#true} assume !(0 != ~p2~0); {348537#true} is VALID [2020-07-10 15:07:59,259 INFO L280 TraceCheckUtils]: 9: Hoare triple {348537#true} assume !(0 != ~p3~0); {348537#true} is VALID [2020-07-10 15:07:59,259 INFO L280 TraceCheckUtils]: 10: Hoare triple {348537#true} assume !(0 != ~p4~0); {348537#true} is VALID [2020-07-10 15:07:59,259 INFO L280 TraceCheckUtils]: 11: Hoare triple {348537#true} assume !(0 != ~p5~0); {348537#true} is VALID [2020-07-10 15:07:59,259 INFO L280 TraceCheckUtils]: 12: Hoare triple {348537#true} assume !(0 != ~p6~0); {348537#true} is VALID [2020-07-10 15:07:59,259 INFO L280 TraceCheckUtils]: 13: Hoare triple {348537#true} assume !(0 != ~p7~0); {348537#true} is VALID [2020-07-10 15:07:59,260 INFO L280 TraceCheckUtils]: 14: Hoare triple {348537#true} assume !(0 != ~p8~0); {348537#true} is VALID [2020-07-10 15:07:59,260 INFO L280 TraceCheckUtils]: 15: Hoare triple {348537#true} assume !(0 != ~p9~0); {348537#true} is VALID [2020-07-10 15:07:59,260 INFO L280 TraceCheckUtils]: 16: Hoare triple {348537#true} assume 0 != ~p10~0;~lk10~0 := 1; {348541#(= main_~lk10~0 1)} is VALID [2020-07-10 15:07:59,261 INFO L280 TraceCheckUtils]: 17: Hoare triple {348541#(= main_~lk10~0 1)} assume !(0 != ~p1~0); {348541#(= main_~lk10~0 1)} is VALID [2020-07-10 15:07:59,261 INFO L280 TraceCheckUtils]: 18: Hoare triple {348541#(= main_~lk10~0 1)} assume !(0 != ~p2~0); {348541#(= main_~lk10~0 1)} is VALID [2020-07-10 15:07:59,262 INFO L280 TraceCheckUtils]: 19: Hoare triple {348541#(= main_~lk10~0 1)} assume !(0 != ~p3~0); {348541#(= main_~lk10~0 1)} is VALID [2020-07-10 15:07:59,262 INFO L280 TraceCheckUtils]: 20: Hoare triple {348541#(= main_~lk10~0 1)} assume !(0 != ~p4~0); {348541#(= main_~lk10~0 1)} is VALID [2020-07-10 15:07:59,262 INFO L280 TraceCheckUtils]: 21: Hoare triple {348541#(= main_~lk10~0 1)} assume !(0 != ~p5~0); {348541#(= main_~lk10~0 1)} is VALID [2020-07-10 15:07:59,263 INFO L280 TraceCheckUtils]: 22: Hoare triple {348541#(= main_~lk10~0 1)} assume !(0 != ~p6~0); {348541#(= main_~lk10~0 1)} is VALID [2020-07-10 15:07:59,263 INFO L280 TraceCheckUtils]: 23: Hoare triple {348541#(= main_~lk10~0 1)} assume !(0 != ~p7~0); {348541#(= main_~lk10~0 1)} is VALID [2020-07-10 15:07:59,264 INFO L280 TraceCheckUtils]: 24: Hoare triple {348541#(= main_~lk10~0 1)} assume !(0 != ~p8~0); {348541#(= main_~lk10~0 1)} is VALID [2020-07-10 15:07:59,264 INFO L280 TraceCheckUtils]: 25: Hoare triple {348541#(= main_~lk10~0 1)} assume !(0 != ~p9~0); {348541#(= main_~lk10~0 1)} is VALID [2020-07-10 15:07:59,264 INFO L280 TraceCheckUtils]: 26: Hoare triple {348541#(= main_~lk10~0 1)} assume 0 != ~p10~0; {348541#(= main_~lk10~0 1)} is VALID [2020-07-10 15:07:59,265 INFO L280 TraceCheckUtils]: 27: Hoare triple {348541#(= main_~lk10~0 1)} assume 1 != ~lk10~0; {348538#false} is VALID [2020-07-10 15:07:59,265 INFO L280 TraceCheckUtils]: 28: Hoare triple {348538#false} assume !false; {348538#false} is VALID [2020-07-10 15:07:59,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:07:59,266 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330916483] [2020-07-10 15:07:59,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:07:59,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:07:59,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944945045] [2020-07-10 15:07:59,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-07-10 15:07:59,267 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:07:59,267 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:07:59,296 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-10 15:07:59,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:07:59,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:07:59,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:07:59,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:07:59,297 INFO L87 Difference]: Start difference. First operand 14600 states and 17158 transitions. Second operand 3 states. [2020-07-10 15:08:29,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:08:29,434 INFO L93 Difference]: Finished difference Result 23562 states and 27399 transitions. [2020-07-10 15:08:29,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:08:29,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-07-10 15:08:29,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:08:29,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:08:29,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2020-07-10 15:08:29,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:08:29,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2020-07-10 15:08:29,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 93 transitions. [2020-07-10 15:08:29,524 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-10 15:09:06,310 INFO L225 Difference]: With dead ends: 23562 [2020-07-10 15:09:06,310 INFO L226 Difference]: Without dead ends: 23560 [2020-07-10 15:09:06,314 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:09:06,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23560 states. [2020-07-10 15:09:10,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23560 to 22536. [2020-07-10 15:09:10,382 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:09:10,382 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23560 states. Second operand 22536 states. [2020-07-10 15:09:10,382 INFO L74 IsIncluded]: Start isIncluded. First operand 23560 states. Second operand 22536 states. [2020-07-10 15:09:10,382 INFO L87 Difference]: Start difference. First operand 23560 states. Second operand 22536 states. [2020-07-10 15:09:51,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:51,093 INFO L93 Difference]: Finished difference Result 23560 states and 26886 transitions. [2020-07-10 15:09:51,094 INFO L276 IsEmpty]: Start isEmpty. Operand 23560 states and 26886 transitions. [2020-07-10 15:09:51,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:09:51,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:09:51,111 INFO L74 IsIncluded]: Start isIncluded. First operand 22536 states. Second operand 23560 states. [2020-07-10 15:09:51,111 INFO L87 Difference]: Start difference. First operand 22536 states. Second operand 23560 states. [2020-07-10 15:10:38,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:10:38,775 INFO L93 Difference]: Finished difference Result 23560 states and 26886 transitions. [2020-07-10 15:10:38,775 INFO L276 IsEmpty]: Start isEmpty. Operand 23560 states and 26886 transitions. [2020-07-10 15:10:38,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:10:38,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:10:38,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:10:38,793 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:10:38,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22536 states. [2020-07-10 15:11:22,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22536 states to 22536 states and 25862 transitions. [2020-07-10 15:11:22,790 INFO L78 Accepts]: Start accepts. Automaton has 22536 states and 25862 transitions. Word has length 29 [2020-07-10 15:11:22,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:11:22,790 INFO L479 AbstractCegarLoop]: Abstraction has 22536 states and 25862 transitions. [2020-07-10 15:11:22,790 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:11:22,790 INFO L276 IsEmpty]: Start isEmpty. Operand 22536 states and 25862 transitions. [2020-07-10 15:11:22,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-10 15:11:22,802 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:11:22,802 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-10 15:11:22,802 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-07-10 15:11:22,803 INFO L427 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:11:22,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:11:22,804 INFO L82 PathProgramCache]: Analyzing trace with hash -907508637, now seen corresponding path program 1 times [2020-07-10 15:11:22,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:11:22,804 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756347362] [2020-07-10 15:11:22,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:11:22,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:11:22,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:11:22,831 INFO L280 TraceCheckUtils]: 0: Hoare triple {443311#true} assume true; {443311#true} is VALID [2020-07-10 15:11:22,831 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {443311#true} {443311#true} #197#return; {443311#true} is VALID [2020-07-10 15:11:22,832 INFO L263 TraceCheckUtils]: 0: Hoare triple {443311#true} call ULTIMATE.init(); {443311#true} is VALID [2020-07-10 15:11:22,832 INFO L280 TraceCheckUtils]: 1: Hoare triple {443311#true} assume true; {443311#true} is VALID [2020-07-10 15:11:22,832 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {443311#true} {443311#true} #197#return; {443311#true} is VALID [2020-07-10 15:11:22,832 INFO L263 TraceCheckUtils]: 3: Hoare triple {443311#true} call #t~ret11 := main(); {443311#true} is VALID [2020-07-10 15:11:22,832 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-10 15:11:22,832 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-10 15:11:22,832 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-10 15:11:22,832 INFO L280 TraceCheckUtils]: 7: Hoare triple {443311#true} assume !(0 != ~p1~0); {443311#true} is VALID [2020-07-10 15:11:22,833 INFO L280 TraceCheckUtils]: 8: Hoare triple {443311#true} assume !(0 != ~p2~0); {443311#true} is VALID [2020-07-10 15:11:22,833 INFO L280 TraceCheckUtils]: 9: Hoare triple {443311#true} assume !(0 != ~p3~0); {443311#true} is VALID [2020-07-10 15:11:22,833 INFO L280 TraceCheckUtils]: 10: Hoare triple {443311#true} assume !(0 != ~p4~0); {443311#true} is VALID [2020-07-10 15:11:22,833 INFO L280 TraceCheckUtils]: 11: Hoare triple {443311#true} assume !(0 != ~p5~0); {443311#true} is VALID [2020-07-10 15:11:22,833 INFO L280 TraceCheckUtils]: 12: Hoare triple {443311#true} assume !(0 != ~p6~0); {443311#true} is VALID [2020-07-10 15:11:22,833 INFO L280 TraceCheckUtils]: 13: Hoare triple {443311#true} assume !(0 != ~p7~0); {443311#true} is VALID [2020-07-10 15:11:22,833 INFO L280 TraceCheckUtils]: 14: Hoare triple {443311#true} assume !(0 != ~p8~0); {443311#true} is VALID [2020-07-10 15:11:22,834 INFO L280 TraceCheckUtils]: 15: Hoare triple {443311#true} assume !(0 != ~p9~0); {443311#true} is VALID [2020-07-10 15:11:22,834 INFO L280 TraceCheckUtils]: 16: Hoare triple {443311#true} assume !(0 != ~p10~0); {443315#(= 0 main_~p10~0)} is VALID [2020-07-10 15:11:22,836 INFO L280 TraceCheckUtils]: 17: Hoare triple {443315#(= 0 main_~p10~0)} assume !(0 != ~p1~0); {443315#(= 0 main_~p10~0)} is VALID [2020-07-10 15:11:22,836 INFO L280 TraceCheckUtils]: 18: Hoare triple {443315#(= 0 main_~p10~0)} assume !(0 != ~p2~0); {443315#(= 0 main_~p10~0)} is VALID [2020-07-10 15:11:22,837 INFO L280 TraceCheckUtils]: 19: Hoare triple {443315#(= 0 main_~p10~0)} assume !(0 != ~p3~0); {443315#(= 0 main_~p10~0)} is VALID [2020-07-10 15:11:22,837 INFO L280 TraceCheckUtils]: 20: Hoare triple {443315#(= 0 main_~p10~0)} assume !(0 != ~p4~0); {443315#(= 0 main_~p10~0)} is VALID [2020-07-10 15:11:22,837 INFO L280 TraceCheckUtils]: 21: Hoare triple {443315#(= 0 main_~p10~0)} assume !(0 != ~p5~0); {443315#(= 0 main_~p10~0)} is VALID [2020-07-10 15:11:22,838 INFO L280 TraceCheckUtils]: 22: Hoare triple {443315#(= 0 main_~p10~0)} assume !(0 != ~p6~0); {443315#(= 0 main_~p10~0)} is VALID [2020-07-10 15:11:22,838 INFO L280 TraceCheckUtils]: 23: Hoare triple {443315#(= 0 main_~p10~0)} assume !(0 != ~p7~0); {443315#(= 0 main_~p10~0)} is VALID [2020-07-10 15:11:22,838 INFO L280 TraceCheckUtils]: 24: Hoare triple {443315#(= 0 main_~p10~0)} assume !(0 != ~p8~0); {443315#(= 0 main_~p10~0)} is VALID [2020-07-10 15:11:22,839 INFO L280 TraceCheckUtils]: 25: Hoare triple {443315#(= 0 main_~p10~0)} assume !(0 != ~p9~0); {443315#(= 0 main_~p10~0)} is VALID [2020-07-10 15:11:22,839 INFO L280 TraceCheckUtils]: 26: Hoare triple {443315#(= 0 main_~p10~0)} assume 0 != ~p10~0; {443312#false} is VALID [2020-07-10 15:11:22,839 INFO L280 TraceCheckUtils]: 27: Hoare triple {443312#false} assume 1 != ~lk10~0; {443312#false} is VALID [2020-07-10 15:11:22,839 INFO L280 TraceCheckUtils]: 28: Hoare triple {443312#false} assume !false; {443312#false} is VALID [2020-07-10 15:11:22,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:11:22,840 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756347362] [2020-07-10 15:11:22,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:11:22,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:11:22,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948152342] [2020-07-10 15:11:22,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-07-10 15:11:22,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:11:22,841 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:11:22,869 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-10 15:11:22,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:11:22,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:11:22,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:11:22,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:11:22,871 INFO L87 Difference]: Start difference. First operand 22536 states and 25862 transitions. Second operand 3 states. [2020-07-10 15:15:24,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:15:24,668 INFO L93 Difference]: Finished difference Result 50184 states and 56582 transitions. [2020-07-10 15:15:24,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:15:24,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-07-10 15:15:24,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:15:24,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:15:24,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2020-07-10 15:15:24,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:15:24,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2020-07-10 15:15:24,670 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 162 transitions. [2020-07-10 15:15:24,827 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-10 15:15:24,827 INFO L225 Difference]: With dead ends: 50184 [2020-07-10 15:15:24,828 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 15:15:24,888 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:15:24,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 15:15:24,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 15:15:24,888 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:15:24,888 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 15:15:24,889 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:15:24,889 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:15:24,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:15:24,889 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:15:24,889 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:15:24,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:15:24,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:15:24,890 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:15:24,890 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:15:24,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:15:24,890 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:15:24,890 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:15:24,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:15:24,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:15:24,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:15:24,891 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:15:24,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 15:15:24,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 15:15:24,891 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2020-07-10 15:15:24,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:15:24,892 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 15:15:24,892 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:15:24,892 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:15:24,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:15:24,892 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-07-10 15:15:24,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 15:15:24,928 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 15:15:24,929 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:15:24,929 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:15:24,929 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 15:15:24,929 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 15:15:24,929 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:15:24,929 INFO L271 CegarLoopResult]: At program point L159(lines 5 163) the Hoare annotation is: true [2020-07-10 15:15:24,929 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 4 163) no Hoare annotation was computed. [2020-07-10 15:15:24,930 INFO L268 CegarLoopResult]: For program point L118-1(lines 39 158) no Hoare annotation was computed. [2020-07-10 15:15:24,930 INFO L268 CegarLoopResult]: For program point L143-1(lines 39 158) no Hoare annotation was computed. [2020-07-10 15:15:24,930 INFO L268 CegarLoopResult]: For program point L102-1(lines 39 158) no Hoare annotation was computed. [2020-07-10 15:15:24,930 INFO L268 CegarLoopResult]: For program point L94-1(lines 39 158) no Hoare annotation was computed. [2020-07-10 15:15:24,930 INFO L268 CegarLoopResult]: For program point L119(line 119) no Hoare annotation was computed. [2020-07-10 15:15:24,930 INFO L268 CegarLoopResult]: For program point L86-1(lines 39 158) no Hoare annotation was computed. [2020-07-10 15:15:24,930 INFO L268 CegarLoopResult]: For program point L144(line 144) no Hoare annotation was computed. [2020-07-10 15:15:24,930 INFO L268 CegarLoopResult]: For program point L78-1(lines 39 158) no Hoare annotation was computed. [2020-07-10 15:15:24,930 INFO L268 CegarLoopResult]: For program point L70-1(lines 39 158) no Hoare annotation was computed. [2020-07-10 15:15:24,930 INFO L268 CegarLoopResult]: For program point L128-1(lines 39 158) no Hoare annotation was computed. [2020-07-10 15:15:24,931 INFO L271 CegarLoopResult]: At program point L153-1(lines 39 158) the Hoare annotation is: true [2020-07-10 15:15:24,931 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 4 163) no Hoare annotation was computed. [2020-07-10 15:15:24,931 INFO L268 CegarLoopResult]: For program point L129(line 129) no Hoare annotation was computed. [2020-07-10 15:15:24,931 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 161) no Hoare annotation was computed. [2020-07-10 15:15:24,931 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 163) the Hoare annotation is: true [2020-07-10 15:15:24,932 INFO L268 CegarLoopResult]: For program point L154(line 154) no Hoare annotation was computed. [2020-07-10 15:15:24,932 INFO L264 CegarLoopResult]: At program point L154-1(lines 5 163) the Hoare annotation is: false [2020-07-10 15:15:24,932 INFO L268 CegarLoopResult]: For program point L113-1(lines 39 158) no Hoare annotation was computed. [2020-07-10 15:15:24,932 INFO L268 CegarLoopResult]: For program point L138-1(lines 39 158) no Hoare annotation was computed. [2020-07-10 15:15:24,933 INFO L268 CegarLoopResult]: For program point L114(line 114) no Hoare annotation was computed. [2020-07-10 15:15:24,933 INFO L268 CegarLoopResult]: For program point L139(line 139) no Hoare annotation was computed. [2020-07-10 15:15:24,933 INFO L268 CegarLoopResult]: For program point L98-1(lines 39 158) no Hoare annotation was computed. [2020-07-10 15:15:24,933 INFO L268 CegarLoopResult]: For program point L123-1(lines 39 158) no Hoare annotation was computed. [2020-07-10 15:15:24,933 INFO L268 CegarLoopResult]: For program point L90-1(lines 39 158) no Hoare annotation was computed. [2020-07-10 15:15:24,933 INFO L268 CegarLoopResult]: For program point L148-1(lines 39 158) no Hoare annotation was computed. [2020-07-10 15:15:24,933 INFO L268 CegarLoopResult]: For program point L82-1(lines 39 158) no Hoare annotation was computed. [2020-07-10 15:15:24,933 INFO L268 CegarLoopResult]: For program point L41(lines 41 43) no Hoare annotation was computed. [2020-07-10 15:15:24,933 INFO L268 CegarLoopResult]: For program point L74-1(lines 39 158) no Hoare annotation was computed. [2020-07-10 15:15:24,933 INFO L268 CegarLoopResult]: For program point L66(lines 66 68) no Hoare annotation was computed. [2020-07-10 15:15:24,934 INFO L268 CegarLoopResult]: For program point L66-2(lines 39 158) no Hoare annotation was computed. [2020-07-10 15:15:24,934 INFO L268 CegarLoopResult]: For program point L124(line 124) no Hoare annotation was computed. [2020-07-10 15:15:24,934 INFO L268 CegarLoopResult]: For program point L149(line 149) no Hoare annotation was computed. [2020-07-10 15:15:24,934 INFO L268 CegarLoopResult]: For program point L108-1(lines 39 158) no Hoare annotation was computed. [2020-07-10 15:15:24,934 INFO L268 CegarLoopResult]: For program point L133-1(lines 39 158) no Hoare annotation was computed. [2020-07-10 15:15:24,934 INFO L268 CegarLoopResult]: For program point L109(line 109) no Hoare annotation was computed. [2020-07-10 15:15:24,934 INFO L268 CegarLoopResult]: For program point L134(line 134) no Hoare annotation was computed. [2020-07-10 15:15:24,938 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:15:24,939 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:15:24,939 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:15:24,939 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-10 15:15:24,939 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:15:24,939 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:15:24,939 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-10 15:15:24,940 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-10 15:15:24,940 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:15:24,940 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2020-07-10 15:15:24,940 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2020-07-10 15:15:24,940 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:15:24,940 WARN L170 areAnnotationChecker]: L66-2 has no Hoare annotation [2020-07-10 15:15:24,940 WARN L170 areAnnotationChecker]: L66-2 has no Hoare annotation [2020-07-10 15:15:24,940 WARN L170 areAnnotationChecker]: L70-1 has no Hoare annotation [2020-07-10 15:15:24,940 WARN L170 areAnnotationChecker]: L70-1 has no Hoare annotation [2020-07-10 15:15:24,940 WARN L170 areAnnotationChecker]: L74-1 has no Hoare annotation [2020-07-10 15:15:24,941 WARN L170 areAnnotationChecker]: L74-1 has no Hoare annotation [2020-07-10 15:15:24,941 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2020-07-10 15:15:24,941 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2020-07-10 15:15:24,941 WARN L170 areAnnotationChecker]: L82-1 has no Hoare annotation [2020-07-10 15:15:24,942 WARN L170 areAnnotationChecker]: L82-1 has no Hoare annotation [2020-07-10 15:15:24,942 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2020-07-10 15:15:24,942 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2020-07-10 15:15:24,942 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2020-07-10 15:15:24,942 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2020-07-10 15:15:24,942 WARN L170 areAnnotationChecker]: L94-1 has no Hoare annotation [2020-07-10 15:15:24,943 WARN L170 areAnnotationChecker]: L94-1 has no Hoare annotation [2020-07-10 15:15:24,943 WARN L170 areAnnotationChecker]: L98-1 has no Hoare annotation [2020-07-10 15:15:24,943 WARN L170 areAnnotationChecker]: L98-1 has no Hoare annotation [2020-07-10 15:15:24,943 WARN L170 areAnnotationChecker]: L102-1 has no Hoare annotation [2020-07-10 15:15:24,943 WARN L170 areAnnotationChecker]: L102-1 has no Hoare annotation [2020-07-10 15:15:24,943 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2020-07-10 15:15:24,943 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2020-07-10 15:15:24,943 WARN L170 areAnnotationChecker]: L108-1 has no Hoare annotation [2020-07-10 15:15:24,943 WARN L170 areAnnotationChecker]: L108-1 has no Hoare annotation [2020-07-10 15:15:24,944 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2020-07-10 15:15:24,944 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:15:24,944 WARN L170 areAnnotationChecker]: L114 has no Hoare annotation [2020-07-10 15:15:24,944 WARN L170 areAnnotationChecker]: L114 has no Hoare annotation [2020-07-10 15:15:24,944 WARN L170 areAnnotationChecker]: L113-1 has no Hoare annotation [2020-07-10 15:15:24,944 WARN L170 areAnnotationChecker]: L113-1 has no Hoare annotation [2020-07-10 15:15:24,944 WARN L170 areAnnotationChecker]: L119 has no Hoare annotation [2020-07-10 15:15:24,944 WARN L170 areAnnotationChecker]: L119 has no Hoare annotation [2020-07-10 15:15:24,944 WARN L170 areAnnotationChecker]: L118-1 has no Hoare annotation [2020-07-10 15:15:24,944 WARN L170 areAnnotationChecker]: L118-1 has no Hoare annotation [2020-07-10 15:15:24,945 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2020-07-10 15:15:24,945 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2020-07-10 15:15:24,945 WARN L170 areAnnotationChecker]: L123-1 has no Hoare annotation [2020-07-10 15:15:24,945 WARN L170 areAnnotationChecker]: L123-1 has no Hoare annotation [2020-07-10 15:15:24,945 WARN L170 areAnnotationChecker]: L129 has no Hoare annotation [2020-07-10 15:15:24,945 WARN L170 areAnnotationChecker]: L129 has no Hoare annotation [2020-07-10 15:15:24,945 WARN L170 areAnnotationChecker]: L128-1 has no Hoare annotation [2020-07-10 15:15:24,945 WARN L170 areAnnotationChecker]: L128-1 has no Hoare annotation [2020-07-10 15:15:24,945 WARN L170 areAnnotationChecker]: L134 has no Hoare annotation [2020-07-10 15:15:24,946 WARN L170 areAnnotationChecker]: L134 has no Hoare annotation [2020-07-10 15:15:24,946 WARN L170 areAnnotationChecker]: L133-1 has no Hoare annotation [2020-07-10 15:15:24,946 WARN L170 areAnnotationChecker]: L133-1 has no Hoare annotation [2020-07-10 15:15:24,946 WARN L170 areAnnotationChecker]: L139 has no Hoare annotation [2020-07-10 15:15:24,946 WARN L170 areAnnotationChecker]: L139 has no Hoare annotation [2020-07-10 15:15:24,946 WARN L170 areAnnotationChecker]: L138-1 has no Hoare annotation [2020-07-10 15:15:24,946 WARN L170 areAnnotationChecker]: L138-1 has no Hoare annotation [2020-07-10 15:15:24,946 WARN L170 areAnnotationChecker]: L144 has no Hoare annotation [2020-07-10 15:15:24,946 WARN L170 areAnnotationChecker]: L144 has no Hoare annotation [2020-07-10 15:15:24,946 WARN L170 areAnnotationChecker]: L143-1 has no Hoare annotation [2020-07-10 15:15:24,946 WARN L170 areAnnotationChecker]: L143-1 has no Hoare annotation [2020-07-10 15:15:24,947 WARN L170 areAnnotationChecker]: L149 has no Hoare annotation [2020-07-10 15:15:24,947 WARN L170 areAnnotationChecker]: L149 has no Hoare annotation [2020-07-10 15:15:24,947 WARN L170 areAnnotationChecker]: L148-1 has no Hoare annotation [2020-07-10 15:15:24,947 WARN L170 areAnnotationChecker]: L148-1 has no Hoare annotation [2020-07-10 15:15:24,947 WARN L170 areAnnotationChecker]: L154 has no Hoare annotation [2020-07-10 15:15:24,947 WARN L170 areAnnotationChecker]: L154 has no Hoare annotation [2020-07-10 15:15:24,947 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-10 15:15:24,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:15:24 BoogieIcfgContainer [2020-07-10 15:15:24,957 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:15:24,960 INFO L168 Benchmark]: Toolchain (without parser) took 716505.31 ms. Allocated memory was 144.2 MB in the beginning and 1.1 GB in the end (delta: 986.2 MB). Free memory was 102.5 MB in the beginning and 428.8 MB in the end (delta: -326.3 MB). Peak memory consumption was 659.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:15:24,963 INFO L168 Benchmark]: CDTParser took 0.30 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-10 15:15:24,963 INFO L168 Benchmark]: CACSL2BoogieTranslator took 501.76 ms. Allocated memory is still 144.2 MB. Free memory was 102.3 MB in the beginning and 91.1 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:15:24,964 INFO L168 Benchmark]: Boogie Preprocessor took 176.30 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 91.1 MB in the beginning and 179.0 MB in the end (delta: -87.9 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-10 15:15:24,964 INFO L168 Benchmark]: RCFGBuilder took 950.56 ms. Allocated memory is still 201.9 MB. Free memory was 179.0 MB in the beginning and 148.8 MB in the end (delta: 30.2 MB). Peak memory consumption was 30.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:15:24,965 INFO L168 Benchmark]: TraceAbstraction took 714864.01 ms. Allocated memory was 201.9 MB in the beginning and 1.1 GB in the end (delta: 928.5 MB). Free memory was 148.8 MB in the beginning and 428.8 MB in the end (delta: -280.0 MB). Peak memory consumption was 648.5 MB. Max. memory is 7.1 GB. [2020-07-10 15:15:24,967 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.30 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 501.76 ms. Allocated memory is still 144.2 MB. Free memory was 102.3 MB in the beginning and 91.1 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 176.30 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 91.1 MB in the beginning and 179.0 MB in the end (delta: -87.9 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 950.56 ms. Allocated memory is still 201.9 MB. Free memory was 179.0 MB in the beginning and 148.8 MB in the end (delta: 30.2 MB). Peak memory consumption was 30.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 714864.01 ms. Allocated memory was 201.9 MB in the beginning and 1.1 GB in the end (delta: 928.5 MB). Free memory was 148.8 MB in the beginning and 428.8 MB in the end (delta: -280.0 MB). Peak memory consumption was 648.5 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: 714.7s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 466.1s, 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.2s 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: 244.2s 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.4s SatisfiabilityAnalysisTime, 2.0s 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...