/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_11.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:26:00,016 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:26:00,020 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:26:00,040 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:26:00,041 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:26:00,043 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:26:00,045 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:26:00,056 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:26:00,060 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:26:00,061 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:26:00,062 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:26:00,065 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:26:00,065 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:26:00,066 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:26:00,067 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:26:00,073 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:26:00,074 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:26:00,076 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:26:00,078 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:26:00,082 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:26:00,087 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:26:00,089 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:26:00,090 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:26:00,091 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:26:00,093 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:26:00,094 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:26:00,094 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:26:00,097 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:26:00,098 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:26:00,098 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:26:00,099 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:26:00,100 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:26:00,101 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:26:00,102 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:26:00,106 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:26:00,107 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:26:00,109 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:26:00,110 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:26:00,110 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:26:00,111 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:26:00,112 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:26:00,113 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:26:00,154 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:26:00,154 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:26:00,162 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:26:00,163 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:26:00,163 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:26:00,163 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:26:00,163 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:26:00,164 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:26:00,164 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:26:00,164 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:26:00,164 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:26:00,164 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:26:00,164 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:26:00,165 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:26:00,165 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:26:00,165 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:26:00,165 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:26:00,165 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:26:00,166 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:26:00,166 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:26:00,166 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:26:00,167 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:26:00,167 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:26:00,167 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:26:00,167 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:26:00,168 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:26:00,168 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:26:00,168 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:26:00,168 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:26:00,169 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:26:00,488 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:26:00,502 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:26:00,506 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:26:00,507 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:26:00,508 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:26:00,509 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_11.c [2020-07-17 22:26:00,595 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e722c826f/84f40cabc2734a2ca83e8c0e2bf6ef97/FLAGad7272211 [2020-07-17 22:26:01,190 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:26:01,190 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_11.c [2020-07-17 22:26:01,202 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e722c826f/84f40cabc2734a2ca83e8c0e2bf6ef97/FLAGad7272211 [2020-07-17 22:26:01,492 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e722c826f/84f40cabc2734a2ca83e8c0e2bf6ef97 [2020-07-17 22:26:01,502 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:26:01,505 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:26:01,506 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:26:01,506 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:26:01,510 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:26:01,511 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:26:01" (1/1) ... [2020-07-17 22:26:01,514 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42a2545f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:01, skipping insertion in model container [2020-07-17 22:26:01,515 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:26:01" (1/1) ... [2020-07-17 22:26:01,522 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:26:01,547 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:26:01,773 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:26:01,780 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:26:01,817 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:26:01,831 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:26:01,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:01 WrapperNode [2020-07-17 22:26:01,832 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:26:01,833 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:26:01,833 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:26:01,833 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:26:01,931 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:01" (1/1) ... [2020-07-17 22:26:01,933 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:01" (1/1) ... [2020-07-17 22:26:01,939 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:01" (1/1) ... [2020-07-17 22:26:01,939 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:01" (1/1) ... [2020-07-17 22:26:01,950 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:01" (1/1) ... [2020-07-17 22:26:01,960 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:01" (1/1) ... [2020-07-17 22:26:01,962 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:01" (1/1) ... [2020-07-17 22:26:01,965 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:26:01,965 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:26:01,965 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:26:01,966 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:26:01,967 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:26:02,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:26:02,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:26:02,025 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:26:02,025 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:26:02,025 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:26:02,025 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:26:02,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:26:02,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:26:02,540 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:26:02,541 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-17 22:26:02,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:26:02 BoogieIcfgContainer [2020-07-17 22:26:02,545 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:26:02,546 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:26:02,546 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:26:02,556 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:26:02,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:26:01" (1/3) ... [2020-07-17 22:26:02,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c58c49f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:26:02, skipping insertion in model container [2020-07-17 22:26:02,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:01" (2/3) ... [2020-07-17 22:26:02,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c58c49f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:26:02, skipping insertion in model container [2020-07-17 22:26:02,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:26:02" (3/3) ... [2020-07-17 22:26:02,561 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_11.c [2020-07-17 22:26:02,572 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:26:02,580 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:26:02,594 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:26:02,619 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:26:02,619 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:26:02,620 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:26:02,620 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:26:02,620 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:26:02,620 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:26:02,621 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:26:02,621 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:26:02,642 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2020-07-17 22:26:02,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-17 22:26:02,649 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:02,650 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:02,651 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:02,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:02,657 INFO L82 PathProgramCache]: Analyzing trace with hash -316470182, now seen corresponding path program 1 times [2020-07-17 22:26:02,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:02,666 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133846715] [2020-07-17 22:26:02,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:02,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:02,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:02,922 INFO L280 TraceCheckUtils]: 0: Hoare triple {50#true} assume true; {50#true} is VALID [2020-07-17 22:26:02,923 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {50#true} {50#true} #214#return; {50#true} is VALID [2020-07-17 22:26:02,925 INFO L263 TraceCheckUtils]: 0: Hoare triple {50#true} call ULTIMATE.init(); {50#true} is VALID [2020-07-17 22:26:02,926 INFO L280 TraceCheckUtils]: 1: Hoare triple {50#true} assume true; {50#true} is VALID [2020-07-17 22:26:02,928 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {50#true} {50#true} #214#return; {50#true} is VALID [2020-07-17 22:26:02,928 INFO L263 TraceCheckUtils]: 3: Hoare triple {50#true} call #t~ret12 := main(); {50#true} is VALID [2020-07-17 22:26:02,929 INFO L280 TraceCheckUtils]: 4: Hoare triple {50#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;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {50#true} is VALID [2020-07-17 22:26:02,929 INFO L280 TraceCheckUtils]: 5: Hoare triple {50#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {50#true} is VALID [2020-07-17 22:26:02,930 INFO L280 TraceCheckUtils]: 6: Hoare triple {50#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;~lk11~0 := 0; {50#true} is VALID [2020-07-17 22:26:02,934 INFO L280 TraceCheckUtils]: 7: Hoare triple {50#true} assume 0 != ~p1~0;~lk1~0 := 1; {54#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:02,939 INFO L280 TraceCheckUtils]: 8: Hoare triple {54#(= 1 main_~lk1~0)} assume 0 != ~p2~0;~lk2~0 := 1; {54#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:02,941 INFO L280 TraceCheckUtils]: 9: Hoare triple {54#(= 1 main_~lk1~0)} assume 0 != ~p3~0;~lk3~0 := 1; {54#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:02,942 INFO L280 TraceCheckUtils]: 10: Hoare triple {54#(= 1 main_~lk1~0)} assume 0 != ~p4~0;~lk4~0 := 1; {54#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:02,943 INFO L280 TraceCheckUtils]: 11: Hoare triple {54#(= 1 main_~lk1~0)} assume 0 != ~p5~0;~lk5~0 := 1; {54#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:02,944 INFO L280 TraceCheckUtils]: 12: Hoare triple {54#(= 1 main_~lk1~0)} assume 0 != ~p6~0;~lk6~0 := 1; {54#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:02,945 INFO L280 TraceCheckUtils]: 13: Hoare triple {54#(= 1 main_~lk1~0)} assume 0 != ~p7~0;~lk7~0 := 1; {54#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:02,946 INFO L280 TraceCheckUtils]: 14: Hoare triple {54#(= 1 main_~lk1~0)} assume !(0 != ~p8~0); {54#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:02,947 INFO L280 TraceCheckUtils]: 15: Hoare triple {54#(= 1 main_~lk1~0)} assume 0 != ~p9~0;~lk9~0 := 1; {54#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:02,948 INFO L280 TraceCheckUtils]: 16: Hoare triple {54#(= 1 main_~lk1~0)} assume 0 != ~p10~0;~lk10~0 := 1; {54#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:02,950 INFO L280 TraceCheckUtils]: 17: Hoare triple {54#(= 1 main_~lk1~0)} assume 0 != ~p11~0;~lk11~0 := 1; {54#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:02,953 INFO L280 TraceCheckUtils]: 18: Hoare triple {54#(= 1 main_~lk1~0)} assume 0 != ~p1~0; {54#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:02,954 INFO L280 TraceCheckUtils]: 19: Hoare triple {54#(= 1 main_~lk1~0)} assume 1 != ~lk1~0; {51#false} is VALID [2020-07-17 22:26:02,955 INFO L280 TraceCheckUtils]: 20: Hoare triple {51#false} assume !false; {51#false} is VALID [2020-07-17 22:26:02,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:02,959 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133846715] [2020-07-17 22:26:02,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:02,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:02,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999476776] [2020-07-17 22:26:02,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-17 22:26:02,970 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:02,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:03,018 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:03,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:03,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:03,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:03,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:03,030 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 3 states. [2020-07-17 22:26:03,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:03,271 INFO L93 Difference]: Finished difference Result 93 states and 162 transitions. [2020-07-17 22:26:03,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:03,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-17 22:26:03,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:03,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:03,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2020-07-17 22:26:03,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:03,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2020-07-17 22:26:03,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 162 transitions. [2020-07-17 22:26:03,567 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:03,599 INFO L225 Difference]: With dead ends: 93 [2020-07-17 22:26:03,599 INFO L226 Difference]: Without dead ends: 78 [2020-07-17 22:26:03,606 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:03,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-17 22:26:03,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 54. [2020-07-17 22:26:03,666 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:03,667 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 54 states. [2020-07-17 22:26:03,668 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 54 states. [2020-07-17 22:26:03,668 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 54 states. [2020-07-17 22:26:03,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:03,683 INFO L93 Difference]: Finished difference Result 78 states and 140 transitions. [2020-07-17 22:26:03,683 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 140 transitions. [2020-07-17 22:26:03,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:03,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:03,686 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 78 states. [2020-07-17 22:26:03,686 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 78 states. [2020-07-17 22:26:03,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:03,704 INFO L93 Difference]: Finished difference Result 78 states and 140 transitions. [2020-07-17 22:26:03,705 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 140 transitions. [2020-07-17 22:26:03,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:03,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:03,707 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:03,707 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:03,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-17 22:26:03,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 97 transitions. [2020-07-17 22:26:03,723 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 97 transitions. Word has length 21 [2020-07-17 22:26:03,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:03,728 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 97 transitions. [2020-07-17 22:26:03,728 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:03,728 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 97 transitions. [2020-07-17 22:26:03,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-17 22:26:03,729 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:03,730 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:03,730 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:26:03,730 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:03,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:03,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1327587432, now seen corresponding path program 1 times [2020-07-17 22:26:03,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:03,731 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532135261] [2020-07-17 22:26:03,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:03,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:03,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:03,797 INFO L280 TraceCheckUtils]: 0: Hoare triple {378#true} assume true; {378#true} is VALID [2020-07-17 22:26:03,798 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {378#true} {378#true} #214#return; {378#true} is VALID [2020-07-17 22:26:03,798 INFO L263 TraceCheckUtils]: 0: Hoare triple {378#true} call ULTIMATE.init(); {378#true} is VALID [2020-07-17 22:26:03,798 INFO L280 TraceCheckUtils]: 1: Hoare triple {378#true} assume true; {378#true} is VALID [2020-07-17 22:26:03,799 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {378#true} {378#true} #214#return; {378#true} is VALID [2020-07-17 22:26:03,799 INFO L263 TraceCheckUtils]: 3: Hoare triple {378#true} call #t~ret12 := main(); {378#true} is VALID [2020-07-17 22:26:03,799 INFO L280 TraceCheckUtils]: 4: Hoare triple {378#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;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {378#true} is VALID [2020-07-17 22:26:03,800 INFO L280 TraceCheckUtils]: 5: Hoare triple {378#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {378#true} is VALID [2020-07-17 22:26:03,800 INFO L280 TraceCheckUtils]: 6: Hoare triple {378#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;~lk11~0 := 0; {378#true} is VALID [2020-07-17 22:26:03,801 INFO L280 TraceCheckUtils]: 7: Hoare triple {378#true} assume !(0 != ~p1~0); {382#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:03,802 INFO L280 TraceCheckUtils]: 8: Hoare triple {382#(= 0 main_~p1~0)} assume 0 != ~p2~0;~lk2~0 := 1; {382#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:03,802 INFO L280 TraceCheckUtils]: 9: Hoare triple {382#(= 0 main_~p1~0)} assume 0 != ~p3~0;~lk3~0 := 1; {382#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:03,803 INFO L280 TraceCheckUtils]: 10: Hoare triple {382#(= 0 main_~p1~0)} assume 0 != ~p4~0;~lk4~0 := 1; {382#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:03,804 INFO L280 TraceCheckUtils]: 11: Hoare triple {382#(= 0 main_~p1~0)} assume 0 != ~p5~0;~lk5~0 := 1; {382#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:03,804 INFO L280 TraceCheckUtils]: 12: Hoare triple {382#(= 0 main_~p1~0)} assume 0 != ~p6~0;~lk6~0 := 1; {382#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:03,805 INFO L280 TraceCheckUtils]: 13: Hoare triple {382#(= 0 main_~p1~0)} assume 0 != ~p7~0;~lk7~0 := 1; {382#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:03,806 INFO L280 TraceCheckUtils]: 14: Hoare triple {382#(= 0 main_~p1~0)} assume !(0 != ~p8~0); {382#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:03,807 INFO L280 TraceCheckUtils]: 15: Hoare triple {382#(= 0 main_~p1~0)} assume 0 != ~p9~0;~lk9~0 := 1; {382#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:03,807 INFO L280 TraceCheckUtils]: 16: Hoare triple {382#(= 0 main_~p1~0)} assume 0 != ~p10~0;~lk10~0 := 1; {382#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:03,808 INFO L280 TraceCheckUtils]: 17: Hoare triple {382#(= 0 main_~p1~0)} assume 0 != ~p11~0;~lk11~0 := 1; {382#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:03,809 INFO L280 TraceCheckUtils]: 18: Hoare triple {382#(= 0 main_~p1~0)} assume 0 != ~p1~0; {379#false} is VALID [2020-07-17 22:26:03,809 INFO L280 TraceCheckUtils]: 19: Hoare triple {379#false} assume 1 != ~lk1~0; {379#false} is VALID [2020-07-17 22:26:03,810 INFO L280 TraceCheckUtils]: 20: Hoare triple {379#false} assume !false; {379#false} is VALID [2020-07-17 22:26:03,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:03,811 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532135261] [2020-07-17 22:26:03,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:03,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:03,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650304983] [2020-07-17 22:26:03,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-17 22:26:03,814 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:03,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:03,839 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:03,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:03,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:03,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:03,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:03,840 INFO L87 Difference]: Start difference. First operand 54 states and 97 transitions. Second operand 3 states. [2020-07-17 22:26:03,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:03,994 INFO L93 Difference]: Finished difference Result 127 states and 232 transitions. [2020-07-17 22:26:03,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:03,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-17 22:26:03,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:03,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:04,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 209 transitions. [2020-07-17 22:26:04,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:04,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 209 transitions. [2020-07-17 22:26:04,006 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 209 transitions. [2020-07-17 22:26:04,267 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 209 edges. 209 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:04,271 INFO L225 Difference]: With dead ends: 127 [2020-07-17 22:26:04,271 INFO L226 Difference]: Without dead ends: 78 [2020-07-17 22:26:04,272 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:04,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-17 22:26:04,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2020-07-17 22:26:04,287 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:04,287 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 76 states. [2020-07-17 22:26:04,287 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 76 states. [2020-07-17 22:26:04,287 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 76 states. [2020-07-17 22:26:04,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:04,293 INFO L93 Difference]: Finished difference Result 78 states and 138 transitions. [2020-07-17 22:26:04,293 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 138 transitions. [2020-07-17 22:26:04,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:04,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:04,295 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 78 states. [2020-07-17 22:26:04,295 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 78 states. [2020-07-17 22:26:04,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:04,301 INFO L93 Difference]: Finished difference Result 78 states and 138 transitions. [2020-07-17 22:26:04,301 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 138 transitions. [2020-07-17 22:26:04,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:04,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:04,302 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:04,303 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:04,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-17 22:26:04,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 137 transitions. [2020-07-17 22:26:04,308 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 137 transitions. Word has length 21 [2020-07-17 22:26:04,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:04,308 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 137 transitions. [2020-07-17 22:26:04,309 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:04,309 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 137 transitions. [2020-07-17 22:26:04,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-17 22:26:04,310 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:04,310 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:04,310 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:26:04,311 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:04,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:04,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1220427994, now seen corresponding path program 1 times [2020-07-17 22:26:04,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:04,312 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999859544] [2020-07-17 22:26:04,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:04,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:04,370 INFO L280 TraceCheckUtils]: 0: Hoare triple {761#true} assume true; {761#true} is VALID [2020-07-17 22:26:04,371 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {761#true} {761#true} #214#return; {761#true} is VALID [2020-07-17 22:26:04,371 INFO L263 TraceCheckUtils]: 0: Hoare triple {761#true} call ULTIMATE.init(); {761#true} is VALID [2020-07-17 22:26:04,371 INFO L280 TraceCheckUtils]: 1: Hoare triple {761#true} assume true; {761#true} is VALID [2020-07-17 22:26:04,372 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {761#true} {761#true} #214#return; {761#true} is VALID [2020-07-17 22:26:04,372 INFO L263 TraceCheckUtils]: 3: Hoare triple {761#true} call #t~ret12 := main(); {761#true} is VALID [2020-07-17 22:26:04,373 INFO L280 TraceCheckUtils]: 4: Hoare triple {761#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;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {761#true} is VALID [2020-07-17 22:26:04,373 INFO L280 TraceCheckUtils]: 5: Hoare triple {761#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {761#true} is VALID [2020-07-17 22:26:04,373 INFO L280 TraceCheckUtils]: 6: Hoare triple {761#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;~lk11~0 := 0; {761#true} is VALID [2020-07-17 22:26:04,374 INFO L280 TraceCheckUtils]: 7: Hoare triple {761#true} assume 0 != ~p1~0;~lk1~0 := 1; {765#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:04,375 INFO L280 TraceCheckUtils]: 8: Hoare triple {765#(not (= 0 main_~p1~0))} assume 0 != ~p2~0;~lk2~0 := 1; {765#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:04,376 INFO L280 TraceCheckUtils]: 9: Hoare triple {765#(not (= 0 main_~p1~0))} assume 0 != ~p3~0;~lk3~0 := 1; {765#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:04,377 INFO L280 TraceCheckUtils]: 10: Hoare triple {765#(not (= 0 main_~p1~0))} assume 0 != ~p4~0;~lk4~0 := 1; {765#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:04,377 INFO L280 TraceCheckUtils]: 11: Hoare triple {765#(not (= 0 main_~p1~0))} assume 0 != ~p5~0;~lk5~0 := 1; {765#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:04,378 INFO L280 TraceCheckUtils]: 12: Hoare triple {765#(not (= 0 main_~p1~0))} assume 0 != ~p6~0;~lk6~0 := 1; {765#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:04,379 INFO L280 TraceCheckUtils]: 13: Hoare triple {765#(not (= 0 main_~p1~0))} assume 0 != ~p7~0;~lk7~0 := 1; {765#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:04,380 INFO L280 TraceCheckUtils]: 14: Hoare triple {765#(not (= 0 main_~p1~0))} assume !(0 != ~p8~0); {765#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:04,381 INFO L280 TraceCheckUtils]: 15: Hoare triple {765#(not (= 0 main_~p1~0))} assume 0 != ~p9~0;~lk9~0 := 1; {765#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:04,382 INFO L280 TraceCheckUtils]: 16: Hoare triple {765#(not (= 0 main_~p1~0))} assume 0 != ~p10~0;~lk10~0 := 1; {765#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:04,384 INFO L280 TraceCheckUtils]: 17: Hoare triple {765#(not (= 0 main_~p1~0))} assume 0 != ~p11~0;~lk11~0 := 1; {765#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:04,387 INFO L280 TraceCheckUtils]: 18: Hoare triple {765#(not (= 0 main_~p1~0))} assume !(0 != ~p1~0); {762#false} is VALID [2020-07-17 22:26:04,387 INFO L280 TraceCheckUtils]: 19: Hoare triple {762#false} assume 0 != ~p2~0; {762#false} is VALID [2020-07-17 22:26:04,388 INFO L280 TraceCheckUtils]: 20: Hoare triple {762#false} assume 1 != ~lk2~0; {762#false} is VALID [2020-07-17 22:26:04,388 INFO L280 TraceCheckUtils]: 21: Hoare triple {762#false} assume !false; {762#false} is VALID [2020-07-17 22:26:04,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:04,390 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999859544] [2020-07-17 22:26:04,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:04,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:04,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253905020] [2020-07-17 22:26:04,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-17 22:26:04,392 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:04,392 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:04,427 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:04,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:04,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:04,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:04,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:04,428 INFO L87 Difference]: Start difference. First operand 76 states and 137 transitions. Second operand 3 states. [2020-07-17 22:26:04,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:04,567 INFO L93 Difference]: Finished difference Result 117 states and 207 transitions. [2020-07-17 22:26:04,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:04,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-17 22:26:04,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:04,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:04,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 204 transitions. [2020-07-17 22:26:04,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:04,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 204 transitions. [2020-07-17 22:26:04,578 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 204 transitions. [2020-07-17 22:26:04,781 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:04,784 INFO L225 Difference]: With dead ends: 117 [2020-07-17 22:26:04,784 INFO L226 Difference]: Without dead ends: 81 [2020-07-17 22:26:04,785 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:04,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-07-17 22:26:04,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2020-07-17 22:26:04,799 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:04,799 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 79 states. [2020-07-17 22:26:04,799 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 79 states. [2020-07-17 22:26:04,799 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 79 states. [2020-07-17 22:26:04,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:04,803 INFO L93 Difference]: Finished difference Result 81 states and 140 transitions. [2020-07-17 22:26:04,803 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 140 transitions. [2020-07-17 22:26:04,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:04,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:04,807 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 81 states. [2020-07-17 22:26:04,808 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 81 states. [2020-07-17 22:26:04,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:04,812 INFO L93 Difference]: Finished difference Result 81 states and 140 transitions. [2020-07-17 22:26:04,813 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 140 transitions. [2020-07-17 22:26:04,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:04,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:04,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:04,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:04,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-07-17 22:26:04,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 139 transitions. [2020-07-17 22:26:04,818 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 139 transitions. Word has length 22 [2020-07-17 22:26:04,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:04,819 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 139 transitions. [2020-07-17 22:26:04,819 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:04,819 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 139 transitions. [2020-07-17 22:26:04,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-17 22:26:04,820 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:04,820 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:04,820 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 22:26:04,821 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:04,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:04,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1794675624, now seen corresponding path program 1 times [2020-07-17 22:26:04,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:04,822 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783222693] [2020-07-17 22:26:04,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:04,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:04,875 INFO L280 TraceCheckUtils]: 0: Hoare triple {1145#true} assume true; {1145#true} is VALID [2020-07-17 22:26:04,875 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1145#true} {1145#true} #214#return; {1145#true} is VALID [2020-07-17 22:26:04,875 INFO L263 TraceCheckUtils]: 0: Hoare triple {1145#true} call ULTIMATE.init(); {1145#true} is VALID [2020-07-17 22:26:04,876 INFO L280 TraceCheckUtils]: 1: Hoare triple {1145#true} assume true; {1145#true} is VALID [2020-07-17 22:26:04,876 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1145#true} {1145#true} #214#return; {1145#true} is VALID [2020-07-17 22:26:04,876 INFO L263 TraceCheckUtils]: 3: Hoare triple {1145#true} call #t~ret12 := main(); {1145#true} is VALID [2020-07-17 22:26:04,877 INFO L280 TraceCheckUtils]: 4: Hoare triple {1145#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;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {1145#true} is VALID [2020-07-17 22:26:04,877 INFO L280 TraceCheckUtils]: 5: Hoare triple {1145#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {1145#true} is VALID [2020-07-17 22:26:04,877 INFO L280 TraceCheckUtils]: 6: Hoare triple {1145#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;~lk11~0 := 0; {1145#true} is VALID [2020-07-17 22:26:04,878 INFO L280 TraceCheckUtils]: 7: Hoare triple {1145#true} assume !(0 != ~p1~0); {1145#true} is VALID [2020-07-17 22:26:04,879 INFO L280 TraceCheckUtils]: 8: Hoare triple {1145#true} assume 0 != ~p2~0;~lk2~0 := 1; {1149#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:04,879 INFO L280 TraceCheckUtils]: 9: Hoare triple {1149#(= 1 main_~lk2~0)} assume 0 != ~p3~0;~lk3~0 := 1; {1149#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:04,880 INFO L280 TraceCheckUtils]: 10: Hoare triple {1149#(= 1 main_~lk2~0)} assume 0 != ~p4~0;~lk4~0 := 1; {1149#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:04,881 INFO L280 TraceCheckUtils]: 11: Hoare triple {1149#(= 1 main_~lk2~0)} assume 0 != ~p5~0;~lk5~0 := 1; {1149#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:04,882 INFO L280 TraceCheckUtils]: 12: Hoare triple {1149#(= 1 main_~lk2~0)} assume 0 != ~p6~0;~lk6~0 := 1; {1149#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:04,882 INFO L280 TraceCheckUtils]: 13: Hoare triple {1149#(= 1 main_~lk2~0)} assume 0 != ~p7~0;~lk7~0 := 1; {1149#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:04,883 INFO L280 TraceCheckUtils]: 14: Hoare triple {1149#(= 1 main_~lk2~0)} assume !(0 != ~p8~0); {1149#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:04,884 INFO L280 TraceCheckUtils]: 15: Hoare triple {1149#(= 1 main_~lk2~0)} assume 0 != ~p9~0;~lk9~0 := 1; {1149#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:04,884 INFO L280 TraceCheckUtils]: 16: Hoare triple {1149#(= 1 main_~lk2~0)} assume 0 != ~p10~0;~lk10~0 := 1; {1149#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:04,885 INFO L280 TraceCheckUtils]: 17: Hoare triple {1149#(= 1 main_~lk2~0)} assume 0 != ~p11~0;~lk11~0 := 1; {1149#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:04,885 INFO L280 TraceCheckUtils]: 18: Hoare triple {1149#(= 1 main_~lk2~0)} assume !(0 != ~p1~0); {1149#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:04,886 INFO L280 TraceCheckUtils]: 19: Hoare triple {1149#(= 1 main_~lk2~0)} assume 0 != ~p2~0; {1149#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:04,887 INFO L280 TraceCheckUtils]: 20: Hoare triple {1149#(= 1 main_~lk2~0)} assume 1 != ~lk2~0; {1146#false} is VALID [2020-07-17 22:26:04,887 INFO L280 TraceCheckUtils]: 21: Hoare triple {1146#false} assume !false; {1146#false} is VALID [2020-07-17 22:26:04,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:04,888 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783222693] [2020-07-17 22:26:04,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:04,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:04,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697048671] [2020-07-17 22:26:04,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-17 22:26:04,890 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:04,890 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:04,914 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:04,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:04,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:04,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:04,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:04,915 INFO L87 Difference]: Start difference. First operand 79 states and 139 transitions. Second operand 3 states. [2020-07-17 22:26:05,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:05,040 INFO L93 Difference]: Finished difference Result 148 states and 264 transitions. [2020-07-17 22:26:05,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:05,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-17 22:26:05,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:05,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:05,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2020-07-17 22:26:05,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:05,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2020-07-17 22:26:05,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 138 transitions. [2020-07-17 22:26:05,200 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:05,206 INFO L225 Difference]: With dead ends: 148 [2020-07-17 22:26:05,206 INFO L226 Difference]: Without dead ends: 146 [2020-07-17 22:26:05,207 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:05,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2020-07-17 22:26:05,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 104. [2020-07-17 22:26:05,236 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:05,236 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand 104 states. [2020-07-17 22:26:05,237 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 104 states. [2020-07-17 22:26:05,237 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 104 states. [2020-07-17 22:26:05,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:05,246 INFO L93 Difference]: Finished difference Result 146 states and 261 transitions. [2020-07-17 22:26:05,246 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 261 transitions. [2020-07-17 22:26:05,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:05,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:05,247 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 146 states. [2020-07-17 22:26:05,247 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 146 states. [2020-07-17 22:26:05,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:05,255 INFO L93 Difference]: Finished difference Result 146 states and 261 transitions. [2020-07-17 22:26:05,255 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 261 transitions. [2020-07-17 22:26:05,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:05,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:05,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:05,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:05,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-07-17 22:26:05,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 184 transitions. [2020-07-17 22:26:05,262 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 184 transitions. Word has length 22 [2020-07-17 22:26:05,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:05,263 INFO L479 AbstractCegarLoop]: Abstraction has 104 states and 184 transitions. [2020-07-17 22:26:05,263 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:05,263 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 184 transitions. [2020-07-17 22:26:05,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-17 22:26:05,266 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:05,270 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:05,270 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-17 22:26:05,271 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:05,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:05,277 INFO L82 PathProgramCache]: Analyzing trace with hash 783558374, now seen corresponding path program 1 times [2020-07-17 22:26:05,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:05,279 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195570642] [2020-07-17 22:26:05,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:05,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:05,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:05,332 INFO L280 TraceCheckUtils]: 0: Hoare triple {1716#true} assume true; {1716#true} is VALID [2020-07-17 22:26:05,333 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1716#true} {1716#true} #214#return; {1716#true} is VALID [2020-07-17 22:26:05,333 INFO L263 TraceCheckUtils]: 0: Hoare triple {1716#true} call ULTIMATE.init(); {1716#true} is VALID [2020-07-17 22:26:05,333 INFO L280 TraceCheckUtils]: 1: Hoare triple {1716#true} assume true; {1716#true} is VALID [2020-07-17 22:26:05,334 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1716#true} {1716#true} #214#return; {1716#true} is VALID [2020-07-17 22:26:05,334 INFO L263 TraceCheckUtils]: 3: Hoare triple {1716#true} call #t~ret12 := main(); {1716#true} is VALID [2020-07-17 22:26:05,334 INFO L280 TraceCheckUtils]: 4: Hoare triple {1716#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;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {1716#true} is VALID [2020-07-17 22:26:05,334 INFO L280 TraceCheckUtils]: 5: Hoare triple {1716#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {1716#true} is VALID [2020-07-17 22:26:05,335 INFO L280 TraceCheckUtils]: 6: Hoare triple {1716#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;~lk11~0 := 0; {1716#true} is VALID [2020-07-17 22:26:05,335 INFO L280 TraceCheckUtils]: 7: Hoare triple {1716#true} assume !(0 != ~p1~0); {1716#true} is VALID [2020-07-17 22:26:05,336 INFO L280 TraceCheckUtils]: 8: Hoare triple {1716#true} assume !(0 != ~p2~0); {1720#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:05,337 INFO L280 TraceCheckUtils]: 9: Hoare triple {1720#(= 0 main_~p2~0)} assume 0 != ~p3~0;~lk3~0 := 1; {1720#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:05,337 INFO L280 TraceCheckUtils]: 10: Hoare triple {1720#(= 0 main_~p2~0)} assume 0 != ~p4~0;~lk4~0 := 1; {1720#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:05,338 INFO L280 TraceCheckUtils]: 11: Hoare triple {1720#(= 0 main_~p2~0)} assume 0 != ~p5~0;~lk5~0 := 1; {1720#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:05,339 INFO L280 TraceCheckUtils]: 12: Hoare triple {1720#(= 0 main_~p2~0)} assume 0 != ~p6~0;~lk6~0 := 1; {1720#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:05,339 INFO L280 TraceCheckUtils]: 13: Hoare triple {1720#(= 0 main_~p2~0)} assume 0 != ~p7~0;~lk7~0 := 1; {1720#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:05,340 INFO L280 TraceCheckUtils]: 14: Hoare triple {1720#(= 0 main_~p2~0)} assume !(0 != ~p8~0); {1720#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:05,340 INFO L280 TraceCheckUtils]: 15: Hoare triple {1720#(= 0 main_~p2~0)} assume 0 != ~p9~0;~lk9~0 := 1; {1720#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:05,341 INFO L280 TraceCheckUtils]: 16: Hoare triple {1720#(= 0 main_~p2~0)} assume 0 != ~p10~0;~lk10~0 := 1; {1720#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:05,342 INFO L280 TraceCheckUtils]: 17: Hoare triple {1720#(= 0 main_~p2~0)} assume 0 != ~p11~0;~lk11~0 := 1; {1720#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:05,342 INFO L280 TraceCheckUtils]: 18: Hoare triple {1720#(= 0 main_~p2~0)} assume !(0 != ~p1~0); {1720#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:05,343 INFO L280 TraceCheckUtils]: 19: Hoare triple {1720#(= 0 main_~p2~0)} assume 0 != ~p2~0; {1717#false} is VALID [2020-07-17 22:26:05,343 INFO L280 TraceCheckUtils]: 20: Hoare triple {1717#false} assume 1 != ~lk2~0; {1717#false} is VALID [2020-07-17 22:26:05,344 INFO L280 TraceCheckUtils]: 21: Hoare triple {1717#false} assume !false; {1717#false} is VALID [2020-07-17 22:26:05,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:05,345 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195570642] [2020-07-17 22:26:05,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:05,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:05,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276761745] [2020-07-17 22:26:05,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-17 22:26:05,346 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:05,346 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:05,369 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:05,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:05,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:05,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:05,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:05,370 INFO L87 Difference]: Start difference. First operand 104 states and 184 transitions. Second operand 3 states. [2020-07-17 22:26:05,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:05,507 INFO L93 Difference]: Finished difference Result 244 states and 438 transitions. [2020-07-17 22:26:05,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:05,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-17 22:26:05,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:05,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:05,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 206 transitions. [2020-07-17 22:26:05,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:05,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 206 transitions. [2020-07-17 22:26:05,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 206 transitions. [2020-07-17 22:26:05,710 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 206 edges. 206 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:05,715 INFO L225 Difference]: With dead ends: 244 [2020-07-17 22:26:05,715 INFO L226 Difference]: Without dead ends: 148 [2020-07-17 22:26:05,716 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:05,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-07-17 22:26:05,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2020-07-17 22:26:05,746 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:05,746 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand 146 states. [2020-07-17 22:26:05,746 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand 146 states. [2020-07-17 22:26:05,747 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 146 states. [2020-07-17 22:26:05,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:05,753 INFO L93 Difference]: Finished difference Result 148 states and 259 transitions. [2020-07-17 22:26:05,753 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 259 transitions. [2020-07-17 22:26:05,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:05,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:05,754 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 148 states. [2020-07-17 22:26:05,754 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 148 states. [2020-07-17 22:26:05,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:05,760 INFO L93 Difference]: Finished difference Result 148 states and 259 transitions. [2020-07-17 22:26:05,760 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 259 transitions. [2020-07-17 22:26:05,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:05,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:05,761 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:05,761 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:05,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-07-17 22:26:05,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 258 transitions. [2020-07-17 22:26:05,767 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 258 transitions. Word has length 22 [2020-07-17 22:26:05,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:05,768 INFO L479 AbstractCegarLoop]: Abstraction has 146 states and 258 transitions. [2020-07-17 22:26:05,768 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:05,768 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 258 transitions. [2020-07-17 22:26:05,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-17 22:26:05,768 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:05,769 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:05,769 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-17 22:26:05,769 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:05,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:05,769 INFO L82 PathProgramCache]: Analyzing trace with hash -199417107, now seen corresponding path program 1 times [2020-07-17 22:26:05,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:05,770 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931286990] [2020-07-17 22:26:05,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:05,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:05,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:05,808 INFO L280 TraceCheckUtils]: 0: Hoare triple {2433#true} assume true; {2433#true} is VALID [2020-07-17 22:26:05,808 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2433#true} {2433#true} #214#return; {2433#true} is VALID [2020-07-17 22:26:05,809 INFO L263 TraceCheckUtils]: 0: Hoare triple {2433#true} call ULTIMATE.init(); {2433#true} is VALID [2020-07-17 22:26:05,809 INFO L280 TraceCheckUtils]: 1: Hoare triple {2433#true} assume true; {2433#true} is VALID [2020-07-17 22:26:05,809 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2433#true} {2433#true} #214#return; {2433#true} is VALID [2020-07-17 22:26:05,809 INFO L263 TraceCheckUtils]: 3: Hoare triple {2433#true} call #t~ret12 := main(); {2433#true} is VALID [2020-07-17 22:26:05,809 INFO L280 TraceCheckUtils]: 4: Hoare triple {2433#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;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {2433#true} is VALID [2020-07-17 22:26:05,810 INFO L280 TraceCheckUtils]: 5: Hoare triple {2433#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {2433#true} is VALID [2020-07-17 22:26:05,810 INFO L280 TraceCheckUtils]: 6: Hoare triple {2433#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;~lk11~0 := 0; {2433#true} is VALID [2020-07-17 22:26:05,810 INFO L280 TraceCheckUtils]: 7: Hoare triple {2433#true} assume !(0 != ~p1~0); {2433#true} is VALID [2020-07-17 22:26:05,811 INFO L280 TraceCheckUtils]: 8: Hoare triple {2433#true} assume 0 != ~p2~0;~lk2~0 := 1; {2437#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:05,812 INFO L280 TraceCheckUtils]: 9: Hoare triple {2437#(not (= 0 main_~p2~0))} assume 0 != ~p3~0;~lk3~0 := 1; {2437#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:05,812 INFO L280 TraceCheckUtils]: 10: Hoare triple {2437#(not (= 0 main_~p2~0))} assume 0 != ~p4~0;~lk4~0 := 1; {2437#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:05,813 INFO L280 TraceCheckUtils]: 11: Hoare triple {2437#(not (= 0 main_~p2~0))} assume 0 != ~p5~0;~lk5~0 := 1; {2437#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:05,814 INFO L280 TraceCheckUtils]: 12: Hoare triple {2437#(not (= 0 main_~p2~0))} assume 0 != ~p6~0;~lk6~0 := 1; {2437#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:05,814 INFO L280 TraceCheckUtils]: 13: Hoare triple {2437#(not (= 0 main_~p2~0))} assume 0 != ~p7~0;~lk7~0 := 1; {2437#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:05,815 INFO L280 TraceCheckUtils]: 14: Hoare triple {2437#(not (= 0 main_~p2~0))} assume !(0 != ~p8~0); {2437#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:05,815 INFO L280 TraceCheckUtils]: 15: Hoare triple {2437#(not (= 0 main_~p2~0))} assume 0 != ~p9~0;~lk9~0 := 1; {2437#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:05,816 INFO L280 TraceCheckUtils]: 16: Hoare triple {2437#(not (= 0 main_~p2~0))} assume 0 != ~p10~0;~lk10~0 := 1; {2437#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:05,816 INFO L280 TraceCheckUtils]: 17: Hoare triple {2437#(not (= 0 main_~p2~0))} assume 0 != ~p11~0;~lk11~0 := 1; {2437#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:05,817 INFO L280 TraceCheckUtils]: 18: Hoare triple {2437#(not (= 0 main_~p2~0))} assume !(0 != ~p1~0); {2437#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:05,818 INFO L280 TraceCheckUtils]: 19: Hoare triple {2437#(not (= 0 main_~p2~0))} assume !(0 != ~p2~0); {2434#false} is VALID [2020-07-17 22:26:05,818 INFO L280 TraceCheckUtils]: 20: Hoare triple {2434#false} assume 0 != ~p3~0; {2434#false} is VALID [2020-07-17 22:26:05,818 INFO L280 TraceCheckUtils]: 21: Hoare triple {2434#false} assume 1 != ~lk3~0; {2434#false} is VALID [2020-07-17 22:26:05,819 INFO L280 TraceCheckUtils]: 22: Hoare triple {2434#false} assume !false; {2434#false} is VALID [2020-07-17 22:26:05,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:05,820 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931286990] [2020-07-17 22:26:05,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:05,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:05,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202851907] [2020-07-17 22:26:05,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-17 22:26:05,821 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:05,821 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:05,844 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:05,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:05,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:05,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:05,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:05,845 INFO L87 Difference]: Start difference. First operand 146 states and 258 transitions. Second operand 3 states. [2020-07-17 22:26:06,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:06,029 INFO L93 Difference]: Finished difference Result 219 states and 385 transitions. [2020-07-17 22:26:06,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:06,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-17 22:26:06,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:06,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:06,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 201 transitions. [2020-07-17 22:26:06,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:06,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 201 transitions. [2020-07-17 22:26:06,039 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 201 transitions. [2020-07-17 22:26:06,236 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 201 edges. 201 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:06,239 INFO L225 Difference]: With dead ends: 219 [2020-07-17 22:26:06,239 INFO L226 Difference]: Without dead ends: 150 [2020-07-17 22:26:06,240 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:06,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2020-07-17 22:26:06,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2020-07-17 22:26:06,258 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:06,258 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand 148 states. [2020-07-17 22:26:06,258 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand 148 states. [2020-07-17 22:26:06,258 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 148 states. [2020-07-17 22:26:06,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:06,264 INFO L93 Difference]: Finished difference Result 150 states and 259 transitions. [2020-07-17 22:26:06,265 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 259 transitions. [2020-07-17 22:26:06,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:06,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:06,265 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand 150 states. [2020-07-17 22:26:06,266 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 150 states. [2020-07-17 22:26:06,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:06,272 INFO L93 Difference]: Finished difference Result 150 states and 259 transitions. [2020-07-17 22:26:06,272 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 259 transitions. [2020-07-17 22:26:06,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:06,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:06,273 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:06,273 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:06,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-07-17 22:26:06,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 258 transitions. [2020-07-17 22:26:06,279 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 258 transitions. Word has length 23 [2020-07-17 22:26:06,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:06,279 INFO L479 AbstractCegarLoop]: Abstraction has 148 states and 258 transitions. [2020-07-17 22:26:06,279 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:06,279 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 258 transitions. [2020-07-17 22:26:06,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-17 22:26:06,280 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:06,280 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:06,280 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-17 22:26:06,281 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:06,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:06,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1479280785, now seen corresponding path program 1 times [2020-07-17 22:26:06,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:06,282 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469609548] [2020-07-17 22:26:06,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:06,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:06,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:06,344 INFO L280 TraceCheckUtils]: 0: Hoare triple {3131#true} assume true; {3131#true} is VALID [2020-07-17 22:26:06,345 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3131#true} {3131#true} #214#return; {3131#true} is VALID [2020-07-17 22:26:06,345 INFO L263 TraceCheckUtils]: 0: Hoare triple {3131#true} call ULTIMATE.init(); {3131#true} is VALID [2020-07-17 22:26:06,345 INFO L280 TraceCheckUtils]: 1: Hoare triple {3131#true} assume true; {3131#true} is VALID [2020-07-17 22:26:06,346 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3131#true} {3131#true} #214#return; {3131#true} is VALID [2020-07-17 22:26:06,346 INFO L263 TraceCheckUtils]: 3: Hoare triple {3131#true} call #t~ret12 := main(); {3131#true} is VALID [2020-07-17 22:26:06,346 INFO L280 TraceCheckUtils]: 4: Hoare triple {3131#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;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {3131#true} is VALID [2020-07-17 22:26:06,346 INFO L280 TraceCheckUtils]: 5: Hoare triple {3131#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {3131#true} is VALID [2020-07-17 22:26:06,346 INFO L280 TraceCheckUtils]: 6: Hoare triple {3131#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;~lk11~0 := 0; {3131#true} is VALID [2020-07-17 22:26:06,347 INFO L280 TraceCheckUtils]: 7: Hoare triple {3131#true} assume !(0 != ~p1~0); {3131#true} is VALID [2020-07-17 22:26:06,347 INFO L280 TraceCheckUtils]: 8: Hoare triple {3131#true} assume !(0 != ~p2~0); {3131#true} is VALID [2020-07-17 22:26:06,348 INFO L280 TraceCheckUtils]: 9: Hoare triple {3131#true} assume 0 != ~p3~0;~lk3~0 := 1; {3135#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:06,348 INFO L280 TraceCheckUtils]: 10: Hoare triple {3135#(= 1 main_~lk3~0)} assume 0 != ~p4~0;~lk4~0 := 1; {3135#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:06,349 INFO L280 TraceCheckUtils]: 11: Hoare triple {3135#(= 1 main_~lk3~0)} assume 0 != ~p5~0;~lk5~0 := 1; {3135#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:06,349 INFO L280 TraceCheckUtils]: 12: Hoare triple {3135#(= 1 main_~lk3~0)} assume 0 != ~p6~0;~lk6~0 := 1; {3135#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:06,350 INFO L280 TraceCheckUtils]: 13: Hoare triple {3135#(= 1 main_~lk3~0)} assume 0 != ~p7~0;~lk7~0 := 1; {3135#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:06,351 INFO L280 TraceCheckUtils]: 14: Hoare triple {3135#(= 1 main_~lk3~0)} assume !(0 != ~p8~0); {3135#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:06,351 INFO L280 TraceCheckUtils]: 15: Hoare triple {3135#(= 1 main_~lk3~0)} assume 0 != ~p9~0;~lk9~0 := 1; {3135#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:06,352 INFO L280 TraceCheckUtils]: 16: Hoare triple {3135#(= 1 main_~lk3~0)} assume 0 != ~p10~0;~lk10~0 := 1; {3135#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:06,352 INFO L280 TraceCheckUtils]: 17: Hoare triple {3135#(= 1 main_~lk3~0)} assume 0 != ~p11~0;~lk11~0 := 1; {3135#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:06,353 INFO L280 TraceCheckUtils]: 18: Hoare triple {3135#(= 1 main_~lk3~0)} assume !(0 != ~p1~0); {3135#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:06,354 INFO L280 TraceCheckUtils]: 19: Hoare triple {3135#(= 1 main_~lk3~0)} assume !(0 != ~p2~0); {3135#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:06,354 INFO L280 TraceCheckUtils]: 20: Hoare triple {3135#(= 1 main_~lk3~0)} assume 0 != ~p3~0; {3135#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:06,355 INFO L280 TraceCheckUtils]: 21: Hoare triple {3135#(= 1 main_~lk3~0)} assume 1 != ~lk3~0; {3132#false} is VALID [2020-07-17 22:26:06,355 INFO L280 TraceCheckUtils]: 22: Hoare triple {3132#false} assume !false; {3132#false} is VALID [2020-07-17 22:26:06,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:06,357 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469609548] [2020-07-17 22:26:06,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:06,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:06,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206916992] [2020-07-17 22:26:06,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-17 22:26:06,359 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:06,359 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:06,383 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:06,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:06,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:06,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:06,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:06,385 INFO L87 Difference]: Start difference. First operand 148 states and 258 transitions. Second operand 3 states. [2020-07-17 22:26:06,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:06,552 INFO L93 Difference]: Finished difference Result 276 states and 488 transitions. [2020-07-17 22:26:06,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:06,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-17 22:26:06,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:06,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:06,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2020-07-17 22:26:06,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:06,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2020-07-17 22:26:06,567 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 134 transitions. [2020-07-17 22:26:06,695 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:06,702 INFO L225 Difference]: With dead ends: 276 [2020-07-17 22:26:06,702 INFO L226 Difference]: Without dead ends: 274 [2020-07-17 22:26:06,703 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:06,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2020-07-17 22:26:06,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 200. [2020-07-17 22:26:06,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:06,740 INFO L82 GeneralOperation]: Start isEquivalent. First operand 274 states. Second operand 200 states. [2020-07-17 22:26:06,740 INFO L74 IsIncluded]: Start isIncluded. First operand 274 states. Second operand 200 states. [2020-07-17 22:26:06,740 INFO L87 Difference]: Start difference. First operand 274 states. Second operand 200 states. [2020-07-17 22:26:06,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:06,759 INFO L93 Difference]: Finished difference Result 274 states and 483 transitions. [2020-07-17 22:26:06,759 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 483 transitions. [2020-07-17 22:26:06,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:06,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:06,761 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand 274 states. [2020-07-17 22:26:06,761 INFO L87 Difference]: Start difference. First operand 200 states. Second operand 274 states. [2020-07-17 22:26:06,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:06,770 INFO L93 Difference]: Finished difference Result 274 states and 483 transitions. [2020-07-17 22:26:06,770 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 483 transitions. [2020-07-17 22:26:06,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:06,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:06,771 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:06,772 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:06,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-07-17 22:26:06,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 346 transitions. [2020-07-17 22:26:06,777 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 346 transitions. Word has length 23 [2020-07-17 22:26:06,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:06,779 INFO L479 AbstractCegarLoop]: Abstraction has 200 states and 346 transitions. [2020-07-17 22:26:06,780 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:06,780 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 346 transitions. [2020-07-17 22:26:06,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-17 22:26:06,781 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:06,781 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:06,781 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-17 22:26:06,781 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:06,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:06,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1804569261, now seen corresponding path program 1 times [2020-07-17 22:26:06,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:06,789 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548237821] [2020-07-17 22:26:06,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:06,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:06,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:06,882 INFO L280 TraceCheckUtils]: 0: Hoare triple {4188#true} assume true; {4188#true} is VALID [2020-07-17 22:26:06,882 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {4188#true} {4188#true} #214#return; {4188#true} is VALID [2020-07-17 22:26:06,884 INFO L263 TraceCheckUtils]: 0: Hoare triple {4188#true} call ULTIMATE.init(); {4188#true} is VALID [2020-07-17 22:26:06,885 INFO L280 TraceCheckUtils]: 1: Hoare triple {4188#true} assume true; {4188#true} is VALID [2020-07-17 22:26:06,885 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4188#true} {4188#true} #214#return; {4188#true} is VALID [2020-07-17 22:26:06,885 INFO L263 TraceCheckUtils]: 3: Hoare triple {4188#true} call #t~ret12 := main(); {4188#true} is VALID [2020-07-17 22:26:06,885 INFO L280 TraceCheckUtils]: 4: Hoare triple {4188#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;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {4188#true} is VALID [2020-07-17 22:26:06,886 INFO L280 TraceCheckUtils]: 5: Hoare triple {4188#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {4188#true} is VALID [2020-07-17 22:26:06,886 INFO L280 TraceCheckUtils]: 6: Hoare triple {4188#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;~lk11~0 := 0; {4188#true} is VALID [2020-07-17 22:26:06,886 INFO L280 TraceCheckUtils]: 7: Hoare triple {4188#true} assume !(0 != ~p1~0); {4188#true} is VALID [2020-07-17 22:26:06,886 INFO L280 TraceCheckUtils]: 8: Hoare triple {4188#true} assume !(0 != ~p2~0); {4188#true} is VALID [2020-07-17 22:26:06,887 INFO L280 TraceCheckUtils]: 9: Hoare triple {4188#true} assume !(0 != ~p3~0); {4192#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:06,888 INFO L280 TraceCheckUtils]: 10: Hoare triple {4192#(= 0 main_~p3~0)} assume 0 != ~p4~0;~lk4~0 := 1; {4192#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:06,889 INFO L280 TraceCheckUtils]: 11: Hoare triple {4192#(= 0 main_~p3~0)} assume 0 != ~p5~0;~lk5~0 := 1; {4192#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:06,890 INFO L280 TraceCheckUtils]: 12: Hoare triple {4192#(= 0 main_~p3~0)} assume 0 != ~p6~0;~lk6~0 := 1; {4192#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:06,890 INFO L280 TraceCheckUtils]: 13: Hoare triple {4192#(= 0 main_~p3~0)} assume 0 != ~p7~0;~lk7~0 := 1; {4192#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:06,892 INFO L280 TraceCheckUtils]: 14: Hoare triple {4192#(= 0 main_~p3~0)} assume !(0 != ~p8~0); {4192#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:06,893 INFO L280 TraceCheckUtils]: 15: Hoare triple {4192#(= 0 main_~p3~0)} assume 0 != ~p9~0;~lk9~0 := 1; {4192#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:06,893 INFO L280 TraceCheckUtils]: 16: Hoare triple {4192#(= 0 main_~p3~0)} assume 0 != ~p10~0;~lk10~0 := 1; {4192#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:06,894 INFO L280 TraceCheckUtils]: 17: Hoare triple {4192#(= 0 main_~p3~0)} assume 0 != ~p11~0;~lk11~0 := 1; {4192#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:06,895 INFO L280 TraceCheckUtils]: 18: Hoare triple {4192#(= 0 main_~p3~0)} assume !(0 != ~p1~0); {4192#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:06,896 INFO L280 TraceCheckUtils]: 19: Hoare triple {4192#(= 0 main_~p3~0)} assume !(0 != ~p2~0); {4192#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:06,897 INFO L280 TraceCheckUtils]: 20: Hoare triple {4192#(= 0 main_~p3~0)} assume 0 != ~p3~0; {4189#false} is VALID [2020-07-17 22:26:06,897 INFO L280 TraceCheckUtils]: 21: Hoare triple {4189#false} assume 1 != ~lk3~0; {4189#false} is VALID [2020-07-17 22:26:06,898 INFO L280 TraceCheckUtils]: 22: Hoare triple {4189#false} assume !false; {4189#false} is VALID [2020-07-17 22:26:06,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:06,901 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548237821] [2020-07-17 22:26:06,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:06,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:06,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023230360] [2020-07-17 22:26:06,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-17 22:26:06,906 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:06,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:06,932 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:06,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:06,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:06,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:06,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:06,934 INFO L87 Difference]: Start difference. First operand 200 states and 346 transitions. Second operand 3 states. [2020-07-17 22:26:07,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:07,124 INFO L93 Difference]: Finished difference Result 472 states and 824 transitions. [2020-07-17 22:26:07,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:07,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-17 22:26:07,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:07,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:07,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 203 transitions. [2020-07-17 22:26:07,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:07,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 203 transitions. [2020-07-17 22:26:07,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 203 transitions. [2020-07-17 22:26:07,340 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 203 edges. 203 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:07,348 INFO L225 Difference]: With dead ends: 472 [2020-07-17 22:26:07,348 INFO L226 Difference]: Without dead ends: 282 [2020-07-17 22:26:07,349 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:07,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-07-17 22:26:07,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 280. [2020-07-17 22:26:07,380 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:07,380 INFO L82 GeneralOperation]: Start isEquivalent. First operand 282 states. Second operand 280 states. [2020-07-17 22:26:07,380 INFO L74 IsIncluded]: Start isIncluded. First operand 282 states. Second operand 280 states. [2020-07-17 22:26:07,381 INFO L87 Difference]: Start difference. First operand 282 states. Second operand 280 states. [2020-07-17 22:26:07,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:07,389 INFO L93 Difference]: Finished difference Result 282 states and 483 transitions. [2020-07-17 22:26:07,389 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 483 transitions. [2020-07-17 22:26:07,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:07,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:07,390 INFO L74 IsIncluded]: Start isIncluded. First operand 280 states. Second operand 282 states. [2020-07-17 22:26:07,391 INFO L87 Difference]: Start difference. First operand 280 states. Second operand 282 states. [2020-07-17 22:26:07,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:07,399 INFO L93 Difference]: Finished difference Result 282 states and 483 transitions. [2020-07-17 22:26:07,400 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 483 transitions. [2020-07-17 22:26:07,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:07,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:07,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:07,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:07,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2020-07-17 22:26:07,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 482 transitions. [2020-07-17 22:26:07,408 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 482 transitions. Word has length 23 [2020-07-17 22:26:07,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:07,409 INFO L479 AbstractCegarLoop]: Abstraction has 280 states and 482 transitions. [2020-07-17 22:26:07,409 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:07,409 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 482 transitions. [2020-07-17 22:26:07,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-17 22:26:07,410 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:07,410 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:07,410 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-17 22:26:07,411 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:07,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:07,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1387149659, now seen corresponding path program 1 times [2020-07-17 22:26:07,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:07,411 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111717389] [2020-07-17 22:26:07,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:07,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:07,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:07,455 INFO L280 TraceCheckUtils]: 0: Hoare triple {5545#true} assume true; {5545#true} is VALID [2020-07-17 22:26:07,455 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {5545#true} {5545#true} #214#return; {5545#true} is VALID [2020-07-17 22:26:07,456 INFO L263 TraceCheckUtils]: 0: Hoare triple {5545#true} call ULTIMATE.init(); {5545#true} is VALID [2020-07-17 22:26:07,456 INFO L280 TraceCheckUtils]: 1: Hoare triple {5545#true} assume true; {5545#true} is VALID [2020-07-17 22:26:07,456 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5545#true} {5545#true} #214#return; {5545#true} is VALID [2020-07-17 22:26:07,456 INFO L263 TraceCheckUtils]: 3: Hoare triple {5545#true} call #t~ret12 := main(); {5545#true} is VALID [2020-07-17 22:26:07,456 INFO L280 TraceCheckUtils]: 4: Hoare triple {5545#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;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {5545#true} is VALID [2020-07-17 22:26:07,457 INFO L280 TraceCheckUtils]: 5: Hoare triple {5545#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {5545#true} is VALID [2020-07-17 22:26:07,457 INFO L280 TraceCheckUtils]: 6: Hoare triple {5545#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;~lk11~0 := 0; {5545#true} is VALID [2020-07-17 22:26:07,457 INFO L280 TraceCheckUtils]: 7: Hoare triple {5545#true} assume !(0 != ~p1~0); {5545#true} is VALID [2020-07-17 22:26:07,457 INFO L280 TraceCheckUtils]: 8: Hoare triple {5545#true} assume !(0 != ~p2~0); {5545#true} is VALID [2020-07-17 22:26:07,464 INFO L280 TraceCheckUtils]: 9: Hoare triple {5545#true} assume 0 != ~p3~0;~lk3~0 := 1; {5549#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:07,464 INFO L280 TraceCheckUtils]: 10: Hoare triple {5549#(not (= 0 main_~p3~0))} assume 0 != ~p4~0;~lk4~0 := 1; {5549#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:07,466 INFO L280 TraceCheckUtils]: 11: Hoare triple {5549#(not (= 0 main_~p3~0))} assume 0 != ~p5~0;~lk5~0 := 1; {5549#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:07,467 INFO L280 TraceCheckUtils]: 12: Hoare triple {5549#(not (= 0 main_~p3~0))} assume 0 != ~p6~0;~lk6~0 := 1; {5549#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:07,468 INFO L280 TraceCheckUtils]: 13: Hoare triple {5549#(not (= 0 main_~p3~0))} assume 0 != ~p7~0;~lk7~0 := 1; {5549#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:07,469 INFO L280 TraceCheckUtils]: 14: Hoare triple {5549#(not (= 0 main_~p3~0))} assume !(0 != ~p8~0); {5549#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:07,469 INFO L280 TraceCheckUtils]: 15: Hoare triple {5549#(not (= 0 main_~p3~0))} assume 0 != ~p9~0;~lk9~0 := 1; {5549#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:07,470 INFO L280 TraceCheckUtils]: 16: Hoare triple {5549#(not (= 0 main_~p3~0))} assume 0 != ~p10~0;~lk10~0 := 1; {5549#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:07,471 INFO L280 TraceCheckUtils]: 17: Hoare triple {5549#(not (= 0 main_~p3~0))} assume 0 != ~p11~0;~lk11~0 := 1; {5549#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:07,471 INFO L280 TraceCheckUtils]: 18: Hoare triple {5549#(not (= 0 main_~p3~0))} assume !(0 != ~p1~0); {5549#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:07,472 INFO L280 TraceCheckUtils]: 19: Hoare triple {5549#(not (= 0 main_~p3~0))} assume !(0 != ~p2~0); {5549#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:07,472 INFO L280 TraceCheckUtils]: 20: Hoare triple {5549#(not (= 0 main_~p3~0))} assume !(0 != ~p3~0); {5546#false} is VALID [2020-07-17 22:26:07,473 INFO L280 TraceCheckUtils]: 21: Hoare triple {5546#false} assume 0 != ~p4~0; {5546#false} is VALID [2020-07-17 22:26:07,473 INFO L280 TraceCheckUtils]: 22: Hoare triple {5546#false} assume 1 != ~lk4~0; {5546#false} is VALID [2020-07-17 22:26:07,473 INFO L280 TraceCheckUtils]: 23: Hoare triple {5546#false} assume !false; {5546#false} is VALID [2020-07-17 22:26:07,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:07,475 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111717389] [2020-07-17 22:26:07,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:07,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:07,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315904986] [2020-07-17 22:26:07,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-17 22:26:07,476 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:07,476 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:07,503 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:07,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:07,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:07,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:07,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:07,505 INFO L87 Difference]: Start difference. First operand 280 states and 482 transitions. Second operand 3 states. [2020-07-17 22:26:07,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:07,703 INFO L93 Difference]: Finished difference Result 420 states and 720 transitions. [2020-07-17 22:26:07,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:07,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-17 22:26:07,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:07,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:07,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 198 transitions. [2020-07-17 22:26:07,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:07,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 198 transitions. [2020-07-17 22:26:07,713 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 198 transitions. [2020-07-17 22:26:07,906 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:07,913 INFO L225 Difference]: With dead ends: 420 [2020-07-17 22:26:07,914 INFO L226 Difference]: Without dead ends: 286 [2020-07-17 22:26:07,915 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:07,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2020-07-17 22:26:07,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 284. [2020-07-17 22:26:07,952 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:07,952 INFO L82 GeneralOperation]: Start isEquivalent. First operand 286 states. Second operand 284 states. [2020-07-17 22:26:07,952 INFO L74 IsIncluded]: Start isIncluded. First operand 286 states. Second operand 284 states. [2020-07-17 22:26:07,953 INFO L87 Difference]: Start difference. First operand 286 states. Second operand 284 states. [2020-07-17 22:26:07,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:07,962 INFO L93 Difference]: Finished difference Result 286 states and 483 transitions. [2020-07-17 22:26:07,962 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 483 transitions. [2020-07-17 22:26:07,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:07,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:07,963 INFO L74 IsIncluded]: Start isIncluded. First operand 284 states. Second operand 286 states. [2020-07-17 22:26:07,963 INFO L87 Difference]: Start difference. First operand 284 states. Second operand 286 states. [2020-07-17 22:26:07,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:07,975 INFO L93 Difference]: Finished difference Result 286 states and 483 transitions. [2020-07-17 22:26:07,975 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 483 transitions. [2020-07-17 22:26:07,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:07,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:07,976 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:07,976 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:07,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2020-07-17 22:26:07,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 482 transitions. [2020-07-17 22:26:07,992 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 482 transitions. Word has length 24 [2020-07-17 22:26:07,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:07,993 INFO L479 AbstractCegarLoop]: Abstraction has 284 states and 482 transitions. [2020-07-17 22:26:07,993 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:07,993 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 482 transitions. [2020-07-17 22:26:07,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-17 22:26:07,994 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:07,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-17 22:26:07,994 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-17 22:26:07,995 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:07,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:07,995 INFO L82 PathProgramCache]: Analyzing trace with hash 107285981, now seen corresponding path program 1 times [2020-07-17 22:26:07,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:07,996 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859878013] [2020-07-17 22:26:07,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:08,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:08,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:08,046 INFO L280 TraceCheckUtils]: 0: Hoare triple {6862#true} assume true; {6862#true} is VALID [2020-07-17 22:26:08,046 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {6862#true} {6862#true} #214#return; {6862#true} is VALID [2020-07-17 22:26:08,047 INFO L263 TraceCheckUtils]: 0: Hoare triple {6862#true} call ULTIMATE.init(); {6862#true} is VALID [2020-07-17 22:26:08,047 INFO L280 TraceCheckUtils]: 1: Hoare triple {6862#true} assume true; {6862#true} is VALID [2020-07-17 22:26:08,047 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {6862#true} {6862#true} #214#return; {6862#true} is VALID [2020-07-17 22:26:08,047 INFO L263 TraceCheckUtils]: 3: Hoare triple {6862#true} call #t~ret12 := main(); {6862#true} is VALID [2020-07-17 22:26:08,047 INFO L280 TraceCheckUtils]: 4: Hoare triple {6862#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;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {6862#true} is VALID [2020-07-17 22:26:08,048 INFO L280 TraceCheckUtils]: 5: Hoare triple {6862#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {6862#true} is VALID [2020-07-17 22:26:08,048 INFO L280 TraceCheckUtils]: 6: Hoare triple {6862#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;~lk11~0 := 0; {6862#true} is VALID [2020-07-17 22:26:08,048 INFO L280 TraceCheckUtils]: 7: Hoare triple {6862#true} assume !(0 != ~p1~0); {6862#true} is VALID [2020-07-17 22:26:08,048 INFO L280 TraceCheckUtils]: 8: Hoare triple {6862#true} assume !(0 != ~p2~0); {6862#true} is VALID [2020-07-17 22:26:08,049 INFO L280 TraceCheckUtils]: 9: Hoare triple {6862#true} assume !(0 != ~p3~0); {6862#true} is VALID [2020-07-17 22:26:08,050 INFO L280 TraceCheckUtils]: 10: Hoare triple {6862#true} assume 0 != ~p4~0;~lk4~0 := 1; {6866#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:08,051 INFO L280 TraceCheckUtils]: 11: Hoare triple {6866#(= 1 main_~lk4~0)} assume 0 != ~p5~0;~lk5~0 := 1; {6866#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:08,051 INFO L280 TraceCheckUtils]: 12: Hoare triple {6866#(= 1 main_~lk4~0)} assume 0 != ~p6~0;~lk6~0 := 1; {6866#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:08,052 INFO L280 TraceCheckUtils]: 13: Hoare triple {6866#(= 1 main_~lk4~0)} assume 0 != ~p7~0;~lk7~0 := 1; {6866#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:08,053 INFO L280 TraceCheckUtils]: 14: Hoare triple {6866#(= 1 main_~lk4~0)} assume !(0 != ~p8~0); {6866#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:08,053 INFO L280 TraceCheckUtils]: 15: Hoare triple {6866#(= 1 main_~lk4~0)} assume 0 != ~p9~0;~lk9~0 := 1; {6866#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:08,054 INFO L280 TraceCheckUtils]: 16: Hoare triple {6866#(= 1 main_~lk4~0)} assume 0 != ~p10~0;~lk10~0 := 1; {6866#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:08,054 INFO L280 TraceCheckUtils]: 17: Hoare triple {6866#(= 1 main_~lk4~0)} assume 0 != ~p11~0;~lk11~0 := 1; {6866#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:08,055 INFO L280 TraceCheckUtils]: 18: Hoare triple {6866#(= 1 main_~lk4~0)} assume !(0 != ~p1~0); {6866#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:08,056 INFO L280 TraceCheckUtils]: 19: Hoare triple {6866#(= 1 main_~lk4~0)} assume !(0 != ~p2~0); {6866#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:08,057 INFO L280 TraceCheckUtils]: 20: Hoare triple {6866#(= 1 main_~lk4~0)} assume !(0 != ~p3~0); {6866#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:08,057 INFO L280 TraceCheckUtils]: 21: Hoare triple {6866#(= 1 main_~lk4~0)} assume 0 != ~p4~0; {6866#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:08,058 INFO L280 TraceCheckUtils]: 22: Hoare triple {6866#(= 1 main_~lk4~0)} assume 1 != ~lk4~0; {6863#false} is VALID [2020-07-17 22:26:08,058 INFO L280 TraceCheckUtils]: 23: Hoare triple {6863#false} assume !false; {6863#false} is VALID [2020-07-17 22:26:08,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:08,060 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859878013] [2020-07-17 22:26:08,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:08,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:08,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237329198] [2020-07-17 22:26:08,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-17 22:26:08,073 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:08,074 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:08,103 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:08,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:08,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:08,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:08,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:08,104 INFO L87 Difference]: Start difference. First operand 284 states and 482 transitions. Second operand 3 states. [2020-07-17 22:26:08,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:08,288 INFO L93 Difference]: Finished difference Result 524 states and 904 transitions. [2020-07-17 22:26:08,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:08,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-17 22:26:08,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:08,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:08,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2020-07-17 22:26:08,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:08,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2020-07-17 22:26:08,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 130 transitions. [2020-07-17 22:26:08,415 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:08,435 INFO L225 Difference]: With dead ends: 524 [2020-07-17 22:26:08,436 INFO L226 Difference]: Without dead ends: 522 [2020-07-17 22:26:08,436 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:08,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2020-07-17 22:26:08,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 392. [2020-07-17 22:26:08,478 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:08,478 INFO L82 GeneralOperation]: Start isEquivalent. First operand 522 states. Second operand 392 states. [2020-07-17 22:26:08,478 INFO L74 IsIncluded]: Start isIncluded. First operand 522 states. Second operand 392 states. [2020-07-17 22:26:08,478 INFO L87 Difference]: Start difference. First operand 522 states. Second operand 392 states. [2020-07-17 22:26:08,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:08,505 INFO L93 Difference]: Finished difference Result 522 states and 895 transitions. [2020-07-17 22:26:08,505 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 895 transitions. [2020-07-17 22:26:08,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:08,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:08,507 INFO L74 IsIncluded]: Start isIncluded. First operand 392 states. Second operand 522 states. [2020-07-17 22:26:08,507 INFO L87 Difference]: Start difference. First operand 392 states. Second operand 522 states. [2020-07-17 22:26:08,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:08,531 INFO L93 Difference]: Finished difference Result 522 states and 895 transitions. [2020-07-17 22:26:08,531 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 895 transitions. [2020-07-17 22:26:08,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:08,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:08,532 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:08,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:08,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-07-17 22:26:08,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 654 transitions. [2020-07-17 22:26:08,545 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 654 transitions. Word has length 24 [2020-07-17 22:26:08,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:08,546 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 654 transitions. [2020-07-17 22:26:08,546 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:08,546 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 654 transitions. [2020-07-17 22:26:08,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-17 22:26:08,547 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:08,547 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:08,547 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-17 22:26:08,547 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:08,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:08,548 INFO L82 PathProgramCache]: Analyzing trace with hash -903831269, now seen corresponding path program 1 times [2020-07-17 22:26:08,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:08,548 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405366225] [2020-07-17 22:26:08,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:08,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:08,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:08,595 INFO L280 TraceCheckUtils]: 0: Hoare triple {8867#true} assume true; {8867#true} is VALID [2020-07-17 22:26:08,596 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {8867#true} {8867#true} #214#return; {8867#true} is VALID [2020-07-17 22:26:08,596 INFO L263 TraceCheckUtils]: 0: Hoare triple {8867#true} call ULTIMATE.init(); {8867#true} is VALID [2020-07-17 22:26:08,596 INFO L280 TraceCheckUtils]: 1: Hoare triple {8867#true} assume true; {8867#true} is VALID [2020-07-17 22:26:08,597 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {8867#true} {8867#true} #214#return; {8867#true} is VALID [2020-07-17 22:26:08,597 INFO L263 TraceCheckUtils]: 3: Hoare triple {8867#true} call #t~ret12 := main(); {8867#true} is VALID [2020-07-17 22:26:08,597 INFO L280 TraceCheckUtils]: 4: Hoare triple {8867#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;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {8867#true} is VALID [2020-07-17 22:26:08,598 INFO L280 TraceCheckUtils]: 5: Hoare triple {8867#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {8867#true} is VALID [2020-07-17 22:26:08,598 INFO L280 TraceCheckUtils]: 6: Hoare triple {8867#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;~lk11~0 := 0; {8867#true} is VALID [2020-07-17 22:26:08,598 INFO L280 TraceCheckUtils]: 7: Hoare triple {8867#true} assume !(0 != ~p1~0); {8867#true} is VALID [2020-07-17 22:26:08,599 INFO L280 TraceCheckUtils]: 8: Hoare triple {8867#true} assume !(0 != ~p2~0); {8867#true} is VALID [2020-07-17 22:26:08,599 INFO L280 TraceCheckUtils]: 9: Hoare triple {8867#true} assume !(0 != ~p3~0); {8867#true} is VALID [2020-07-17 22:26:08,601 INFO L280 TraceCheckUtils]: 10: Hoare triple {8867#true} assume !(0 != ~p4~0); {8871#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:08,602 INFO L280 TraceCheckUtils]: 11: Hoare triple {8871#(= 0 main_~p4~0)} assume 0 != ~p5~0;~lk5~0 := 1; {8871#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:08,603 INFO L280 TraceCheckUtils]: 12: Hoare triple {8871#(= 0 main_~p4~0)} assume 0 != ~p6~0;~lk6~0 := 1; {8871#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:08,607 INFO L280 TraceCheckUtils]: 13: Hoare triple {8871#(= 0 main_~p4~0)} assume 0 != ~p7~0;~lk7~0 := 1; {8871#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:08,608 INFO L280 TraceCheckUtils]: 14: Hoare triple {8871#(= 0 main_~p4~0)} assume !(0 != ~p8~0); {8871#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:08,608 INFO L280 TraceCheckUtils]: 15: Hoare triple {8871#(= 0 main_~p4~0)} assume 0 != ~p9~0;~lk9~0 := 1; {8871#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:08,609 INFO L280 TraceCheckUtils]: 16: Hoare triple {8871#(= 0 main_~p4~0)} assume 0 != ~p10~0;~lk10~0 := 1; {8871#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:08,609 INFO L280 TraceCheckUtils]: 17: Hoare triple {8871#(= 0 main_~p4~0)} assume 0 != ~p11~0;~lk11~0 := 1; {8871#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:08,610 INFO L280 TraceCheckUtils]: 18: Hoare triple {8871#(= 0 main_~p4~0)} assume !(0 != ~p1~0); {8871#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:08,611 INFO L280 TraceCheckUtils]: 19: Hoare triple {8871#(= 0 main_~p4~0)} assume !(0 != ~p2~0); {8871#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:08,611 INFO L280 TraceCheckUtils]: 20: Hoare triple {8871#(= 0 main_~p4~0)} assume !(0 != ~p3~0); {8871#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:08,612 INFO L280 TraceCheckUtils]: 21: Hoare triple {8871#(= 0 main_~p4~0)} assume 0 != ~p4~0; {8868#false} is VALID [2020-07-17 22:26:08,612 INFO L280 TraceCheckUtils]: 22: Hoare triple {8868#false} assume 1 != ~lk4~0; {8868#false} is VALID [2020-07-17 22:26:08,612 INFO L280 TraceCheckUtils]: 23: Hoare triple {8868#false} assume !false; {8868#false} is VALID [2020-07-17 22:26:08,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:08,614 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405366225] [2020-07-17 22:26:08,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:08,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:08,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6987026] [2020-07-17 22:26:08,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-17 22:26:08,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:08,615 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:08,639 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:08,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:08,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:08,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:08,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:08,640 INFO L87 Difference]: Start difference. First operand 392 states and 654 transitions. Second operand 3 states. [2020-07-17 22:26:08,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:08,880 INFO L93 Difference]: Finished difference Result 924 states and 1552 transitions. [2020-07-17 22:26:08,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:08,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-17 22:26:08,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:08,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:08,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 200 transitions. [2020-07-17 22:26:08,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:08,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 200 transitions. [2020-07-17 22:26:08,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 200 transitions. [2020-07-17 22:26:09,072 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 200 edges. 200 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:09,097 INFO L225 Difference]: With dead ends: 924 [2020-07-17 22:26:09,097 INFO L226 Difference]: Without dead ends: 546 [2020-07-17 22:26:09,099 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:09,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-07-17 22:26:09,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 544. [2020-07-17 22:26:09,180 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:09,180 INFO L82 GeneralOperation]: Start isEquivalent. First operand 546 states. Second operand 544 states. [2020-07-17 22:26:09,180 INFO L74 IsIncluded]: Start isIncluded. First operand 546 states. Second operand 544 states. [2020-07-17 22:26:09,180 INFO L87 Difference]: Start difference. First operand 546 states. Second operand 544 states. [2020-07-17 22:26:09,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:09,214 INFO L93 Difference]: Finished difference Result 546 states and 903 transitions. [2020-07-17 22:26:09,214 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 903 transitions. [2020-07-17 22:26:09,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:09,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:09,216 INFO L74 IsIncluded]: Start isIncluded. First operand 544 states. Second operand 546 states. [2020-07-17 22:26:09,216 INFO L87 Difference]: Start difference. First operand 544 states. Second operand 546 states. [2020-07-17 22:26:09,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:09,236 INFO L93 Difference]: Finished difference Result 546 states and 903 transitions. [2020-07-17 22:26:09,236 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 903 transitions. [2020-07-17 22:26:09,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:09,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:09,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:09,240 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:09,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2020-07-17 22:26:09,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 902 transitions. [2020-07-17 22:26:09,261 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 902 transitions. Word has length 24 [2020-07-17 22:26:09,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:09,261 INFO L479 AbstractCegarLoop]: Abstraction has 544 states and 902 transitions. [2020-07-17 22:26:09,261 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:09,261 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 902 transitions. [2020-07-17 22:26:09,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-17 22:26:09,264 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:09,265 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:09,265 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-17 22:26:09,265 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:09,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:09,266 INFO L82 PathProgramCache]: Analyzing trace with hash -968887806, now seen corresponding path program 1 times [2020-07-17 22:26:09,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:09,267 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640760921] [2020-07-17 22:26:09,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:09,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:09,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:09,306 INFO L280 TraceCheckUtils]: 0: Hoare triple {11488#true} assume true; {11488#true} is VALID [2020-07-17 22:26:09,306 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {11488#true} {11488#true} #214#return; {11488#true} is VALID [2020-07-17 22:26:09,307 INFO L263 TraceCheckUtils]: 0: Hoare triple {11488#true} call ULTIMATE.init(); {11488#true} is VALID [2020-07-17 22:26:09,307 INFO L280 TraceCheckUtils]: 1: Hoare triple {11488#true} assume true; {11488#true} is VALID [2020-07-17 22:26:09,307 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {11488#true} {11488#true} #214#return; {11488#true} is VALID [2020-07-17 22:26:09,307 INFO L263 TraceCheckUtils]: 3: Hoare triple {11488#true} call #t~ret12 := main(); {11488#true} is VALID [2020-07-17 22:26:09,308 INFO L280 TraceCheckUtils]: 4: Hoare triple {11488#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;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {11488#true} is VALID [2020-07-17 22:26:09,308 INFO L280 TraceCheckUtils]: 5: Hoare triple {11488#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {11488#true} is VALID [2020-07-17 22:26:09,308 INFO L280 TraceCheckUtils]: 6: Hoare triple {11488#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;~lk11~0 := 0; {11488#true} is VALID [2020-07-17 22:26:09,308 INFO L280 TraceCheckUtils]: 7: Hoare triple {11488#true} assume !(0 != ~p1~0); {11488#true} is VALID [2020-07-17 22:26:09,308 INFO L280 TraceCheckUtils]: 8: Hoare triple {11488#true} assume !(0 != ~p2~0); {11488#true} is VALID [2020-07-17 22:26:09,309 INFO L280 TraceCheckUtils]: 9: Hoare triple {11488#true} assume !(0 != ~p3~0); {11488#true} is VALID [2020-07-17 22:26:09,309 INFO L280 TraceCheckUtils]: 10: Hoare triple {11488#true} assume 0 != ~p4~0;~lk4~0 := 1; {11492#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:09,310 INFO L280 TraceCheckUtils]: 11: Hoare triple {11492#(not (= 0 main_~p4~0))} assume 0 != ~p5~0;~lk5~0 := 1; {11492#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:09,311 INFO L280 TraceCheckUtils]: 12: Hoare triple {11492#(not (= 0 main_~p4~0))} assume 0 != ~p6~0;~lk6~0 := 1; {11492#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:09,311 INFO L280 TraceCheckUtils]: 13: Hoare triple {11492#(not (= 0 main_~p4~0))} assume 0 != ~p7~0;~lk7~0 := 1; {11492#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:09,312 INFO L280 TraceCheckUtils]: 14: Hoare triple {11492#(not (= 0 main_~p4~0))} assume !(0 != ~p8~0); {11492#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:09,312 INFO L280 TraceCheckUtils]: 15: Hoare triple {11492#(not (= 0 main_~p4~0))} assume 0 != ~p9~0;~lk9~0 := 1; {11492#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:09,313 INFO L280 TraceCheckUtils]: 16: Hoare triple {11492#(not (= 0 main_~p4~0))} assume 0 != ~p10~0;~lk10~0 := 1; {11492#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:09,314 INFO L280 TraceCheckUtils]: 17: Hoare triple {11492#(not (= 0 main_~p4~0))} assume 0 != ~p11~0;~lk11~0 := 1; {11492#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:09,314 INFO L280 TraceCheckUtils]: 18: Hoare triple {11492#(not (= 0 main_~p4~0))} assume !(0 != ~p1~0); {11492#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:09,315 INFO L280 TraceCheckUtils]: 19: Hoare triple {11492#(not (= 0 main_~p4~0))} assume !(0 != ~p2~0); {11492#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:09,315 INFO L280 TraceCheckUtils]: 20: Hoare triple {11492#(not (= 0 main_~p4~0))} assume !(0 != ~p3~0); {11492#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:09,316 INFO L280 TraceCheckUtils]: 21: Hoare triple {11492#(not (= 0 main_~p4~0))} assume !(0 != ~p4~0); {11489#false} is VALID [2020-07-17 22:26:09,316 INFO L280 TraceCheckUtils]: 22: Hoare triple {11489#false} assume 0 != ~p5~0; {11489#false} is VALID [2020-07-17 22:26:09,317 INFO L280 TraceCheckUtils]: 23: Hoare triple {11489#false} assume 1 != ~lk5~0; {11489#false} is VALID [2020-07-17 22:26:09,317 INFO L280 TraceCheckUtils]: 24: Hoare triple {11489#false} assume !false; {11489#false} is VALID [2020-07-17 22:26:09,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:09,318 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640760921] [2020-07-17 22:26:09,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:09,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:09,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841990913] [2020-07-17 22:26:09,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-17 22:26:09,320 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:09,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:09,346 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:09,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:09,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:09,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:09,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:09,347 INFO L87 Difference]: Start difference. First operand 544 states and 902 transitions. Second operand 3 states. [2020-07-17 22:26:09,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:09,563 INFO L93 Difference]: Finished difference Result 816 states and 1348 transitions. [2020-07-17 22:26:09,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:09,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-17 22:26:09,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:09,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:09,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 195 transitions. [2020-07-17 22:26:09,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:09,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 195 transitions. [2020-07-17 22:26:09,570 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 195 transitions. [2020-07-17 22:26:09,753 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 195 edges. 195 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:09,774 INFO L225 Difference]: With dead ends: 816 [2020-07-17 22:26:09,774 INFO L226 Difference]: Without dead ends: 554 [2020-07-17 22:26:09,775 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:09,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-07-17 22:26:09,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 552. [2020-07-17 22:26:09,845 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:09,845 INFO L82 GeneralOperation]: Start isEquivalent. First operand 554 states. Second operand 552 states. [2020-07-17 22:26:09,845 INFO L74 IsIncluded]: Start isIncluded. First operand 554 states. Second operand 552 states. [2020-07-17 22:26:09,845 INFO L87 Difference]: Start difference. First operand 554 states. Second operand 552 states. [2020-07-17 22:26:09,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:09,864 INFO L93 Difference]: Finished difference Result 554 states and 903 transitions. [2020-07-17 22:26:09,864 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 903 transitions. [2020-07-17 22:26:09,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:09,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:09,866 INFO L74 IsIncluded]: Start isIncluded. First operand 552 states. Second operand 554 states. [2020-07-17 22:26:09,866 INFO L87 Difference]: Start difference. First operand 552 states. Second operand 554 states. [2020-07-17 22:26:09,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:09,885 INFO L93 Difference]: Finished difference Result 554 states and 903 transitions. [2020-07-17 22:26:09,885 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 903 transitions. [2020-07-17 22:26:09,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:09,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:09,886 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:09,886 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:09,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2020-07-17 22:26:09,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 902 transitions. [2020-07-17 22:26:09,906 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 902 transitions. Word has length 25 [2020-07-17 22:26:09,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:09,906 INFO L479 AbstractCegarLoop]: Abstraction has 552 states and 902 transitions. [2020-07-17 22:26:09,906 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:09,907 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 902 transitions. [2020-07-17 22:26:09,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-17 22:26:09,907 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:09,908 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:09,908 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-17 22:26:09,908 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:09,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:09,908 INFO L82 PathProgramCache]: Analyzing trace with hash 2046215812, now seen corresponding path program 1 times [2020-07-17 22:26:09,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:09,909 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134442214] [2020-07-17 22:26:09,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:09,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:09,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:09,956 INFO L280 TraceCheckUtils]: 0: Hoare triple {14025#true} assume true; {14025#true} is VALID [2020-07-17 22:26:09,957 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {14025#true} {14025#true} #214#return; {14025#true} is VALID [2020-07-17 22:26:09,957 INFO L263 TraceCheckUtils]: 0: Hoare triple {14025#true} call ULTIMATE.init(); {14025#true} is VALID [2020-07-17 22:26:09,957 INFO L280 TraceCheckUtils]: 1: Hoare triple {14025#true} assume true; {14025#true} is VALID [2020-07-17 22:26:09,958 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {14025#true} {14025#true} #214#return; {14025#true} is VALID [2020-07-17 22:26:09,958 INFO L263 TraceCheckUtils]: 3: Hoare triple {14025#true} call #t~ret12 := main(); {14025#true} is VALID [2020-07-17 22:26:09,958 INFO L280 TraceCheckUtils]: 4: Hoare triple {14025#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;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {14025#true} is VALID [2020-07-17 22:26:09,958 INFO L280 TraceCheckUtils]: 5: Hoare triple {14025#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {14025#true} is VALID [2020-07-17 22:26:09,958 INFO L280 TraceCheckUtils]: 6: Hoare triple {14025#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;~lk11~0 := 0; {14025#true} is VALID [2020-07-17 22:26:09,959 INFO L280 TraceCheckUtils]: 7: Hoare triple {14025#true} assume !(0 != ~p1~0); {14025#true} is VALID [2020-07-17 22:26:09,959 INFO L280 TraceCheckUtils]: 8: Hoare triple {14025#true} assume !(0 != ~p2~0); {14025#true} is VALID [2020-07-17 22:26:09,959 INFO L280 TraceCheckUtils]: 9: Hoare triple {14025#true} assume !(0 != ~p3~0); {14025#true} is VALID [2020-07-17 22:26:09,959 INFO L280 TraceCheckUtils]: 10: Hoare triple {14025#true} assume !(0 != ~p4~0); {14025#true} is VALID [2020-07-17 22:26:09,962 INFO L280 TraceCheckUtils]: 11: Hoare triple {14025#true} assume 0 != ~p5~0;~lk5~0 := 1; {14029#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:09,963 INFO L280 TraceCheckUtils]: 12: Hoare triple {14029#(= 1 main_~lk5~0)} assume 0 != ~p6~0;~lk6~0 := 1; {14029#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:09,964 INFO L280 TraceCheckUtils]: 13: Hoare triple {14029#(= 1 main_~lk5~0)} assume 0 != ~p7~0;~lk7~0 := 1; {14029#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:09,964 INFO L280 TraceCheckUtils]: 14: Hoare triple {14029#(= 1 main_~lk5~0)} assume !(0 != ~p8~0); {14029#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:09,965 INFO L280 TraceCheckUtils]: 15: Hoare triple {14029#(= 1 main_~lk5~0)} assume 0 != ~p9~0;~lk9~0 := 1; {14029#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:09,965 INFO L280 TraceCheckUtils]: 16: Hoare triple {14029#(= 1 main_~lk5~0)} assume 0 != ~p10~0;~lk10~0 := 1; {14029#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:09,966 INFO L280 TraceCheckUtils]: 17: Hoare triple {14029#(= 1 main_~lk5~0)} assume 0 != ~p11~0;~lk11~0 := 1; {14029#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:09,966 INFO L280 TraceCheckUtils]: 18: Hoare triple {14029#(= 1 main_~lk5~0)} assume !(0 != ~p1~0); {14029#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:09,967 INFO L280 TraceCheckUtils]: 19: Hoare triple {14029#(= 1 main_~lk5~0)} assume !(0 != ~p2~0); {14029#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:09,968 INFO L280 TraceCheckUtils]: 20: Hoare triple {14029#(= 1 main_~lk5~0)} assume !(0 != ~p3~0); {14029#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:09,968 INFO L280 TraceCheckUtils]: 21: Hoare triple {14029#(= 1 main_~lk5~0)} assume !(0 != ~p4~0); {14029#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:09,969 INFO L280 TraceCheckUtils]: 22: Hoare triple {14029#(= 1 main_~lk5~0)} assume 0 != ~p5~0; {14029#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:09,970 INFO L280 TraceCheckUtils]: 23: Hoare triple {14029#(= 1 main_~lk5~0)} assume 1 != ~lk5~0; {14026#false} is VALID [2020-07-17 22:26:09,970 INFO L280 TraceCheckUtils]: 24: Hoare triple {14026#false} assume !false; {14026#false} is VALID [2020-07-17 22:26:09,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:09,974 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134442214] [2020-07-17 22:26:09,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:09,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:09,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003150477] [2020-07-17 22:26:09,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-17 22:26:09,975 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:09,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:10,001 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:10,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:10,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:10,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:10,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:10,003 INFO L87 Difference]: Start difference. First operand 552 states and 902 transitions. Second operand 3 states. [2020-07-17 22:26:10,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:10,287 INFO L93 Difference]: Finished difference Result 1004 states and 1672 transitions. [2020-07-17 22:26:10,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:10,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-17 22:26:10,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:10,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:10,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2020-07-17 22:26:10,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:10,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2020-07-17 22:26:10,312 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 126 transitions. [2020-07-17 22:26:10,432 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:10,476 INFO L225 Difference]: With dead ends: 1004 [2020-07-17 22:26:10,476 INFO L226 Difference]: Without dead ends: 1002 [2020-07-17 22:26:10,477 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:10,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2020-07-17 22:26:10,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 776. [2020-07-17 22:26:10,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:10,555 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1002 states. Second operand 776 states. [2020-07-17 22:26:10,555 INFO L74 IsIncluded]: Start isIncluded. First operand 1002 states. Second operand 776 states. [2020-07-17 22:26:10,555 INFO L87 Difference]: Start difference. First operand 1002 states. Second operand 776 states. [2020-07-17 22:26:10,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:10,610 INFO L93 Difference]: Finished difference Result 1002 states and 1655 transitions. [2020-07-17 22:26:10,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1655 transitions. [2020-07-17 22:26:10,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:10,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:10,613 INFO L74 IsIncluded]: Start isIncluded. First operand 776 states. Second operand 1002 states. [2020-07-17 22:26:10,613 INFO L87 Difference]: Start difference. First operand 776 states. Second operand 1002 states. [2020-07-17 22:26:10,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:10,668 INFO L93 Difference]: Finished difference Result 1002 states and 1655 transitions. [2020-07-17 22:26:10,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1655 transitions. [2020-07-17 22:26:10,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:10,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:10,671 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:10,671 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:10,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-07-17 22:26:10,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1238 transitions. [2020-07-17 22:26:10,706 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1238 transitions. Word has length 25 [2020-07-17 22:26:10,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:10,707 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 1238 transitions. [2020-07-17 22:26:10,707 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:10,707 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1238 transitions. [2020-07-17 22:26:10,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-17 22:26:10,708 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:10,708 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:10,709 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-17 22:26:10,709 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:10,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:10,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1035098562, now seen corresponding path program 1 times [2020-07-17 22:26:10,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:10,710 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382494202] [2020-07-17 22:26:10,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:10,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:10,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:10,735 INFO L280 TraceCheckUtils]: 0: Hoare triple {17878#true} assume true; {17878#true} is VALID [2020-07-17 22:26:10,736 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {17878#true} {17878#true} #214#return; {17878#true} is VALID [2020-07-17 22:26:10,736 INFO L263 TraceCheckUtils]: 0: Hoare triple {17878#true} call ULTIMATE.init(); {17878#true} is VALID [2020-07-17 22:26:10,736 INFO L280 TraceCheckUtils]: 1: Hoare triple {17878#true} assume true; {17878#true} is VALID [2020-07-17 22:26:10,736 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {17878#true} {17878#true} #214#return; {17878#true} is VALID [2020-07-17 22:26:10,737 INFO L263 TraceCheckUtils]: 3: Hoare triple {17878#true} call #t~ret12 := main(); {17878#true} is VALID [2020-07-17 22:26:10,737 INFO L280 TraceCheckUtils]: 4: Hoare triple {17878#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;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {17878#true} is VALID [2020-07-17 22:26:10,737 INFO L280 TraceCheckUtils]: 5: Hoare triple {17878#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {17878#true} is VALID [2020-07-17 22:26:10,737 INFO L280 TraceCheckUtils]: 6: Hoare triple {17878#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;~lk11~0 := 0; {17878#true} is VALID [2020-07-17 22:26:10,737 INFO L280 TraceCheckUtils]: 7: Hoare triple {17878#true} assume !(0 != ~p1~0); {17878#true} is VALID [2020-07-17 22:26:10,738 INFO L280 TraceCheckUtils]: 8: Hoare triple {17878#true} assume !(0 != ~p2~0); {17878#true} is VALID [2020-07-17 22:26:10,738 INFO L280 TraceCheckUtils]: 9: Hoare triple {17878#true} assume !(0 != ~p3~0); {17878#true} is VALID [2020-07-17 22:26:10,738 INFO L280 TraceCheckUtils]: 10: Hoare triple {17878#true} assume !(0 != ~p4~0); {17878#true} is VALID [2020-07-17 22:26:10,739 INFO L280 TraceCheckUtils]: 11: Hoare triple {17878#true} assume !(0 != ~p5~0); {17882#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:10,739 INFO L280 TraceCheckUtils]: 12: Hoare triple {17882#(= 0 main_~p5~0)} assume 0 != ~p6~0;~lk6~0 := 1; {17882#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:10,740 INFO L280 TraceCheckUtils]: 13: Hoare triple {17882#(= 0 main_~p5~0)} assume 0 != ~p7~0;~lk7~0 := 1; {17882#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:10,740 INFO L280 TraceCheckUtils]: 14: Hoare triple {17882#(= 0 main_~p5~0)} assume !(0 != ~p8~0); {17882#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:10,741 INFO L280 TraceCheckUtils]: 15: Hoare triple {17882#(= 0 main_~p5~0)} assume 0 != ~p9~0;~lk9~0 := 1; {17882#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:10,741 INFO L280 TraceCheckUtils]: 16: Hoare triple {17882#(= 0 main_~p5~0)} assume 0 != ~p10~0;~lk10~0 := 1; {17882#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:10,742 INFO L280 TraceCheckUtils]: 17: Hoare triple {17882#(= 0 main_~p5~0)} assume 0 != ~p11~0;~lk11~0 := 1; {17882#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:10,742 INFO L280 TraceCheckUtils]: 18: Hoare triple {17882#(= 0 main_~p5~0)} assume !(0 != ~p1~0); {17882#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:10,743 INFO L280 TraceCheckUtils]: 19: Hoare triple {17882#(= 0 main_~p5~0)} assume !(0 != ~p2~0); {17882#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:10,743 INFO L280 TraceCheckUtils]: 20: Hoare triple {17882#(= 0 main_~p5~0)} assume !(0 != ~p3~0); {17882#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:10,744 INFO L280 TraceCheckUtils]: 21: Hoare triple {17882#(= 0 main_~p5~0)} assume !(0 != ~p4~0); {17882#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:10,744 INFO L280 TraceCheckUtils]: 22: Hoare triple {17882#(= 0 main_~p5~0)} assume 0 != ~p5~0; {17879#false} is VALID [2020-07-17 22:26:10,745 INFO L280 TraceCheckUtils]: 23: Hoare triple {17879#false} assume 1 != ~lk5~0; {17879#false} is VALID [2020-07-17 22:26:10,745 INFO L280 TraceCheckUtils]: 24: Hoare triple {17879#false} assume !false; {17879#false} is VALID [2020-07-17 22:26:10,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:10,746 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382494202] [2020-07-17 22:26:10,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:10,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:10,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431241700] [2020-07-17 22:26:10,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-17 22:26:10,747 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:10,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:10,768 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:10,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:10,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:10,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:10,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:10,769 INFO L87 Difference]: Start difference. First operand 776 states and 1238 transitions. Second operand 3 states. [2020-07-17 22:26:11,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:11,363 INFO L93 Difference]: Finished difference Result 1820 states and 2920 transitions. [2020-07-17 22:26:11,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:11,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-17 22:26:11,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:11,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:11,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 197 transitions. [2020-07-17 22:26:11,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:11,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 197 transitions. [2020-07-17 22:26:11,367 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 197 transitions. [2020-07-17 22:26:11,619 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:11,728 INFO L225 Difference]: With dead ends: 1820 [2020-07-17 22:26:11,728 INFO L226 Difference]: Without dead ends: 1066 [2020-07-17 22:26:11,731 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:11,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2020-07-17 22:26:11,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 1064. [2020-07-17 22:26:11,898 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:11,898 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1066 states. Second operand 1064 states. [2020-07-17 22:26:11,898 INFO L74 IsIncluded]: Start isIncluded. First operand 1066 states. Second operand 1064 states. [2020-07-17 22:26:11,898 INFO L87 Difference]: Start difference. First operand 1066 states. Second operand 1064 states. [2020-07-17 22:26:11,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:11,973 INFO L93 Difference]: Finished difference Result 1066 states and 1687 transitions. [2020-07-17 22:26:11,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1687 transitions. [2020-07-17 22:26:11,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:11,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:11,976 INFO L74 IsIncluded]: Start isIncluded. First operand 1064 states. Second operand 1066 states. [2020-07-17 22:26:11,976 INFO L87 Difference]: Start difference. First operand 1064 states. Second operand 1066 states. [2020-07-17 22:26:12,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:12,044 INFO L93 Difference]: Finished difference Result 1066 states and 1687 transitions. [2020-07-17 22:26:12,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1687 transitions. [2020-07-17 22:26:12,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:12,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:12,048 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:12,048 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:12,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1064 states. [2020-07-17 22:26:12,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1686 transitions. [2020-07-17 22:26:12,115 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1686 transitions. Word has length 25 [2020-07-17 22:26:12,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:12,115 INFO L479 AbstractCegarLoop]: Abstraction has 1064 states and 1686 transitions. [2020-07-17 22:26:12,115 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:12,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1686 transitions. [2020-07-17 22:26:12,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-17 22:26:12,117 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:12,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-17 22:26:12,118 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-17 22:26:12,118 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:12,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:12,118 INFO L82 PathProgramCache]: Analyzing trace with hash -991604848, now seen corresponding path program 1 times [2020-07-17 22:26:12,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:12,119 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860177669] [2020-07-17 22:26:12,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:12,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:12,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:12,143 INFO L280 TraceCheckUtils]: 0: Hoare triple {22995#true} assume true; {22995#true} is VALID [2020-07-17 22:26:12,143 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {22995#true} {22995#true} #214#return; {22995#true} is VALID [2020-07-17 22:26:12,144 INFO L263 TraceCheckUtils]: 0: Hoare triple {22995#true} call ULTIMATE.init(); {22995#true} is VALID [2020-07-17 22:26:12,144 INFO L280 TraceCheckUtils]: 1: Hoare triple {22995#true} assume true; {22995#true} is VALID [2020-07-17 22:26:12,144 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {22995#true} {22995#true} #214#return; {22995#true} is VALID [2020-07-17 22:26:12,144 INFO L263 TraceCheckUtils]: 3: Hoare triple {22995#true} call #t~ret12 := main(); {22995#true} is VALID [2020-07-17 22:26:12,144 INFO L280 TraceCheckUtils]: 4: Hoare triple {22995#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;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {22995#true} is VALID [2020-07-17 22:26:12,145 INFO L280 TraceCheckUtils]: 5: Hoare triple {22995#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {22995#true} is VALID [2020-07-17 22:26:12,145 INFO L280 TraceCheckUtils]: 6: Hoare triple {22995#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;~lk11~0 := 0; {22995#true} is VALID [2020-07-17 22:26:12,145 INFO L280 TraceCheckUtils]: 7: Hoare triple {22995#true} assume !(0 != ~p1~0); {22995#true} is VALID [2020-07-17 22:26:12,145 INFO L280 TraceCheckUtils]: 8: Hoare triple {22995#true} assume !(0 != ~p2~0); {22995#true} is VALID [2020-07-17 22:26:12,145 INFO L280 TraceCheckUtils]: 9: Hoare triple {22995#true} assume !(0 != ~p3~0); {22995#true} is VALID [2020-07-17 22:26:12,146 INFO L280 TraceCheckUtils]: 10: Hoare triple {22995#true} assume !(0 != ~p4~0); {22995#true} is VALID [2020-07-17 22:26:12,147 INFO L280 TraceCheckUtils]: 11: Hoare triple {22995#true} assume 0 != ~p5~0;~lk5~0 := 1; {22999#(not (= 0 main_~p5~0))} is VALID [2020-07-17 22:26:12,147 INFO L280 TraceCheckUtils]: 12: Hoare triple {22999#(not (= 0 main_~p5~0))} assume 0 != ~p6~0;~lk6~0 := 1; {22999#(not (= 0 main_~p5~0))} is VALID [2020-07-17 22:26:12,148 INFO L280 TraceCheckUtils]: 13: Hoare triple {22999#(not (= 0 main_~p5~0))} assume 0 != ~p7~0;~lk7~0 := 1; {22999#(not (= 0 main_~p5~0))} is VALID [2020-07-17 22:26:12,148 INFO L280 TraceCheckUtils]: 14: Hoare triple {22999#(not (= 0 main_~p5~0))} assume !(0 != ~p8~0); {22999#(not (= 0 main_~p5~0))} is VALID [2020-07-17 22:26:12,149 INFO L280 TraceCheckUtils]: 15: Hoare triple {22999#(not (= 0 main_~p5~0))} assume 0 != ~p9~0;~lk9~0 := 1; {22999#(not (= 0 main_~p5~0))} is VALID [2020-07-17 22:26:12,149 INFO L280 TraceCheckUtils]: 16: Hoare triple {22999#(not (= 0 main_~p5~0))} assume 0 != ~p10~0;~lk10~0 := 1; {22999#(not (= 0 main_~p5~0))} is VALID [2020-07-17 22:26:12,150 INFO L280 TraceCheckUtils]: 17: Hoare triple {22999#(not (= 0 main_~p5~0))} assume 0 != ~p11~0;~lk11~0 := 1; {22999#(not (= 0 main_~p5~0))} is VALID [2020-07-17 22:26:12,150 INFO L280 TraceCheckUtils]: 18: Hoare triple {22999#(not (= 0 main_~p5~0))} assume !(0 != ~p1~0); {22999#(not (= 0 main_~p5~0))} is VALID [2020-07-17 22:26:12,151 INFO L280 TraceCheckUtils]: 19: Hoare triple {22999#(not (= 0 main_~p5~0))} assume !(0 != ~p2~0); {22999#(not (= 0 main_~p5~0))} is VALID [2020-07-17 22:26:12,152 INFO L280 TraceCheckUtils]: 20: Hoare triple {22999#(not (= 0 main_~p5~0))} assume !(0 != ~p3~0); {22999#(not (= 0 main_~p5~0))} is VALID [2020-07-17 22:26:12,152 INFO L280 TraceCheckUtils]: 21: Hoare triple {22999#(not (= 0 main_~p5~0))} assume !(0 != ~p4~0); {22999#(not (= 0 main_~p5~0))} is VALID [2020-07-17 22:26:12,153 INFO L280 TraceCheckUtils]: 22: Hoare triple {22999#(not (= 0 main_~p5~0))} assume !(0 != ~p5~0); {22996#false} is VALID [2020-07-17 22:26:12,153 INFO L280 TraceCheckUtils]: 23: Hoare triple {22996#false} assume 0 != ~p6~0; {22996#false} is VALID [2020-07-17 22:26:12,153 INFO L280 TraceCheckUtils]: 24: Hoare triple {22996#false} assume 1 != ~lk6~0; {22996#false} is VALID [2020-07-17 22:26:12,153 INFO L280 TraceCheckUtils]: 25: Hoare triple {22996#false} assume !false; {22996#false} is VALID [2020-07-17 22:26:12,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:12,155 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860177669] [2020-07-17 22:26:12,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:12,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:12,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196723116] [2020-07-17 22:26:12,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-17 22:26:12,156 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:12,156 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:12,182 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:12,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:12,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:12,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:12,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:12,183 INFO L87 Difference]: Start difference. First operand 1064 states and 1686 transitions. Second operand 3 states. [2020-07-17 22:26:12,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:12,631 INFO L93 Difference]: Finished difference Result 1596 states and 2520 transitions. [2020-07-17 22:26:12,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:12,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-17 22:26:12,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:12,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:12,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 192 transitions. [2020-07-17 22:26:12,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:12,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 192 transitions. [2020-07-17 22:26:12,638 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 192 transitions. [2020-07-17 22:26:12,824 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:12,876 INFO L225 Difference]: With dead ends: 1596 [2020-07-17 22:26:12,877 INFO L226 Difference]: Without dead ends: 1082 [2020-07-17 22:26:12,878 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:12,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2020-07-17 22:26:13,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 1080. [2020-07-17 22:26:13,042 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:13,042 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1082 states. Second operand 1080 states. [2020-07-17 22:26:13,042 INFO L74 IsIncluded]: Start isIncluded. First operand 1082 states. Second operand 1080 states. [2020-07-17 22:26:13,043 INFO L87 Difference]: Start difference. First operand 1082 states. Second operand 1080 states. [2020-07-17 22:26:13,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:13,094 INFO L93 Difference]: Finished difference Result 1082 states and 1687 transitions. [2020-07-17 22:26:13,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1687 transitions. [2020-07-17 22:26:13,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:13,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:13,097 INFO L74 IsIncluded]: Start isIncluded. First operand 1080 states. Second operand 1082 states. [2020-07-17 22:26:13,097 INFO L87 Difference]: Start difference. First operand 1080 states. Second operand 1082 states. [2020-07-17 22:26:13,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:13,159 INFO L93 Difference]: Finished difference Result 1082 states and 1687 transitions. [2020-07-17 22:26:13,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1687 transitions. [2020-07-17 22:26:13,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:13,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:13,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:13,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:13,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1080 states. [2020-07-17 22:26:13,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1686 transitions. [2020-07-17 22:26:13,227 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1686 transitions. Word has length 26 [2020-07-17 22:26:13,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:13,228 INFO L479 AbstractCegarLoop]: Abstraction has 1080 states and 1686 transitions. [2020-07-17 22:26:13,228 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:13,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1686 transitions. [2020-07-17 22:26:13,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-17 22:26:13,230 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:13,230 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:13,230 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-17 22:26:13,230 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:13,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:13,231 INFO L82 PathProgramCache]: Analyzing trace with hash 2023498770, now seen corresponding path program 1 times [2020-07-17 22:26:13,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:13,231 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251127254] [2020-07-17 22:26:13,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:13,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:13,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:13,260 INFO L280 TraceCheckUtils]: 0: Hoare triple {27936#true} assume true; {27936#true} is VALID [2020-07-17 22:26:13,261 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {27936#true} {27936#true} #214#return; {27936#true} is VALID [2020-07-17 22:26:13,261 INFO L263 TraceCheckUtils]: 0: Hoare triple {27936#true} call ULTIMATE.init(); {27936#true} is VALID [2020-07-17 22:26:13,261 INFO L280 TraceCheckUtils]: 1: Hoare triple {27936#true} assume true; {27936#true} is VALID [2020-07-17 22:26:13,262 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {27936#true} {27936#true} #214#return; {27936#true} is VALID [2020-07-17 22:26:13,262 INFO L263 TraceCheckUtils]: 3: Hoare triple {27936#true} call #t~ret12 := main(); {27936#true} is VALID [2020-07-17 22:26:13,262 INFO L280 TraceCheckUtils]: 4: Hoare triple {27936#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;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {27936#true} is VALID [2020-07-17 22:26:13,262 INFO L280 TraceCheckUtils]: 5: Hoare triple {27936#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {27936#true} is VALID [2020-07-17 22:26:13,262 INFO L280 TraceCheckUtils]: 6: Hoare triple {27936#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;~lk11~0 := 0; {27936#true} is VALID [2020-07-17 22:26:13,263 INFO L280 TraceCheckUtils]: 7: Hoare triple {27936#true} assume !(0 != ~p1~0); {27936#true} is VALID [2020-07-17 22:26:13,263 INFO L280 TraceCheckUtils]: 8: Hoare triple {27936#true} assume !(0 != ~p2~0); {27936#true} is VALID [2020-07-17 22:26:13,263 INFO L280 TraceCheckUtils]: 9: Hoare triple {27936#true} assume !(0 != ~p3~0); {27936#true} is VALID [2020-07-17 22:26:13,263 INFO L280 TraceCheckUtils]: 10: Hoare triple {27936#true} assume !(0 != ~p4~0); {27936#true} is VALID [2020-07-17 22:26:13,263 INFO L280 TraceCheckUtils]: 11: Hoare triple {27936#true} assume !(0 != ~p5~0); {27936#true} is VALID [2020-07-17 22:26:13,264 INFO L280 TraceCheckUtils]: 12: Hoare triple {27936#true} assume 0 != ~p6~0;~lk6~0 := 1; {27940#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:13,265 INFO L280 TraceCheckUtils]: 13: Hoare triple {27940#(= 1 main_~lk6~0)} assume 0 != ~p7~0;~lk7~0 := 1; {27940#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:13,265 INFO L280 TraceCheckUtils]: 14: Hoare triple {27940#(= 1 main_~lk6~0)} assume !(0 != ~p8~0); {27940#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:13,266 INFO L280 TraceCheckUtils]: 15: Hoare triple {27940#(= 1 main_~lk6~0)} assume 0 != ~p9~0;~lk9~0 := 1; {27940#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:13,266 INFO L280 TraceCheckUtils]: 16: Hoare triple {27940#(= 1 main_~lk6~0)} assume 0 != ~p10~0;~lk10~0 := 1; {27940#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:13,267 INFO L280 TraceCheckUtils]: 17: Hoare triple {27940#(= 1 main_~lk6~0)} assume 0 != ~p11~0;~lk11~0 := 1; {27940#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:13,267 INFO L280 TraceCheckUtils]: 18: Hoare triple {27940#(= 1 main_~lk6~0)} assume !(0 != ~p1~0); {27940#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:13,268 INFO L280 TraceCheckUtils]: 19: Hoare triple {27940#(= 1 main_~lk6~0)} assume !(0 != ~p2~0); {27940#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:13,268 INFO L280 TraceCheckUtils]: 20: Hoare triple {27940#(= 1 main_~lk6~0)} assume !(0 != ~p3~0); {27940#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:13,269 INFO L280 TraceCheckUtils]: 21: Hoare triple {27940#(= 1 main_~lk6~0)} assume !(0 != ~p4~0); {27940#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:13,270 INFO L280 TraceCheckUtils]: 22: Hoare triple {27940#(= 1 main_~lk6~0)} assume !(0 != ~p5~0); {27940#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:13,270 INFO L280 TraceCheckUtils]: 23: Hoare triple {27940#(= 1 main_~lk6~0)} assume 0 != ~p6~0; {27940#(= 1 main_~lk6~0)} is VALID [2020-07-17 22:26:13,271 INFO L280 TraceCheckUtils]: 24: Hoare triple {27940#(= 1 main_~lk6~0)} assume 1 != ~lk6~0; {27937#false} is VALID [2020-07-17 22:26:13,271 INFO L280 TraceCheckUtils]: 25: Hoare triple {27937#false} assume !false; {27937#false} is VALID [2020-07-17 22:26:13,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:13,272 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251127254] [2020-07-17 22:26:13,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:13,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:13,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267355311] [2020-07-17 22:26:13,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-17 22:26:13,273 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:13,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:13,297 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:13,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:13,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:13,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:13,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:13,298 INFO L87 Difference]: Start difference. First operand 1080 states and 1686 transitions. Second operand 3 states. [2020-07-17 22:26:13,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:13,851 INFO L93 Difference]: Finished difference Result 1932 states and 3080 transitions. [2020-07-17 22:26:13,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:13,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-17 22:26:13,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:13,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:13,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2020-07-17 22:26:13,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:13,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2020-07-17 22:26:13,853 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 122 transitions. [2020-07-17 22:26:13,973 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:14,111 INFO L225 Difference]: With dead ends: 1932 [2020-07-17 22:26:14,112 INFO L226 Difference]: Without dead ends: 1930 [2020-07-17 22:26:14,113 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:14,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2020-07-17 22:26:14,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1544. [2020-07-17 22:26:14,333 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:14,333 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1930 states. Second operand 1544 states. [2020-07-17 22:26:14,334 INFO L74 IsIncluded]: Start isIncluded. First operand 1930 states. Second operand 1544 states. [2020-07-17 22:26:14,334 INFO L87 Difference]: Start difference. First operand 1930 states. Second operand 1544 states. [2020-07-17 22:26:14,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:14,574 INFO L93 Difference]: Finished difference Result 1930 states and 3047 transitions. [2020-07-17 22:26:14,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 3047 transitions. [2020-07-17 22:26:14,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:14,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:14,584 INFO L74 IsIncluded]: Start isIncluded. First operand 1544 states. Second operand 1930 states. [2020-07-17 22:26:14,584 INFO L87 Difference]: Start difference. First operand 1544 states. Second operand 1930 states. [2020-07-17 22:26:14,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:14,749 INFO L93 Difference]: Finished difference Result 1930 states and 3047 transitions. [2020-07-17 22:26:14,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 3047 transitions. [2020-07-17 22:26:14,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:14,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:14,752 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:14,753 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:14,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2020-07-17 22:26:14,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2342 transitions. [2020-07-17 22:26:14,832 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2342 transitions. Word has length 26 [2020-07-17 22:26:14,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:14,832 INFO L479 AbstractCegarLoop]: Abstraction has 1544 states and 2342 transitions. [2020-07-17 22:26:14,832 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:14,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2342 transitions. [2020-07-17 22:26:14,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-17 22:26:14,834 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:14,834 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:14,834 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-17 22:26:14,834 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:14,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:14,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1012381520, now seen corresponding path program 1 times [2020-07-17 22:26:14,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:14,835 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927861904] [2020-07-17 22:26:14,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:14,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:14,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:14,860 INFO L280 TraceCheckUtils]: 0: Hoare triple {35389#true} assume true; {35389#true} is VALID [2020-07-17 22:26:14,861 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {35389#true} {35389#true} #214#return; {35389#true} is VALID [2020-07-17 22:26:14,861 INFO L263 TraceCheckUtils]: 0: Hoare triple {35389#true} call ULTIMATE.init(); {35389#true} is VALID [2020-07-17 22:26:14,861 INFO L280 TraceCheckUtils]: 1: Hoare triple {35389#true} assume true; {35389#true} is VALID [2020-07-17 22:26:14,861 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {35389#true} {35389#true} #214#return; {35389#true} is VALID [2020-07-17 22:26:14,862 INFO L263 TraceCheckUtils]: 3: Hoare triple {35389#true} call #t~ret12 := main(); {35389#true} is VALID [2020-07-17 22:26:14,862 INFO L280 TraceCheckUtils]: 4: Hoare triple {35389#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;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {35389#true} is VALID [2020-07-17 22:26:14,862 INFO L280 TraceCheckUtils]: 5: Hoare triple {35389#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {35389#true} is VALID [2020-07-17 22:26:14,862 INFO L280 TraceCheckUtils]: 6: Hoare triple {35389#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;~lk11~0 := 0; {35389#true} is VALID [2020-07-17 22:26:14,862 INFO L280 TraceCheckUtils]: 7: Hoare triple {35389#true} assume !(0 != ~p1~0); {35389#true} is VALID [2020-07-17 22:26:14,863 INFO L280 TraceCheckUtils]: 8: Hoare triple {35389#true} assume !(0 != ~p2~0); {35389#true} is VALID [2020-07-17 22:26:14,863 INFO L280 TraceCheckUtils]: 9: Hoare triple {35389#true} assume !(0 != ~p3~0); {35389#true} is VALID [2020-07-17 22:26:14,863 INFO L280 TraceCheckUtils]: 10: Hoare triple {35389#true} assume !(0 != ~p4~0); {35389#true} is VALID [2020-07-17 22:26:14,863 INFO L280 TraceCheckUtils]: 11: Hoare triple {35389#true} assume !(0 != ~p5~0); {35389#true} is VALID [2020-07-17 22:26:14,864 INFO L280 TraceCheckUtils]: 12: Hoare triple {35389#true} assume !(0 != ~p6~0); {35393#(= 0 main_~p6~0)} is VALID [2020-07-17 22:26:14,865 INFO L280 TraceCheckUtils]: 13: Hoare triple {35393#(= 0 main_~p6~0)} assume 0 != ~p7~0;~lk7~0 := 1; {35393#(= 0 main_~p6~0)} is VALID [2020-07-17 22:26:14,865 INFO L280 TraceCheckUtils]: 14: Hoare triple {35393#(= 0 main_~p6~0)} assume !(0 != ~p8~0); {35393#(= 0 main_~p6~0)} is VALID [2020-07-17 22:26:14,866 INFO L280 TraceCheckUtils]: 15: Hoare triple {35393#(= 0 main_~p6~0)} assume 0 != ~p9~0;~lk9~0 := 1; {35393#(= 0 main_~p6~0)} is VALID [2020-07-17 22:26:14,866 INFO L280 TraceCheckUtils]: 16: Hoare triple {35393#(= 0 main_~p6~0)} assume 0 != ~p10~0;~lk10~0 := 1; {35393#(= 0 main_~p6~0)} is VALID [2020-07-17 22:26:14,867 INFO L280 TraceCheckUtils]: 17: Hoare triple {35393#(= 0 main_~p6~0)} assume 0 != ~p11~0;~lk11~0 := 1; {35393#(= 0 main_~p6~0)} is VALID [2020-07-17 22:26:14,868 INFO L280 TraceCheckUtils]: 18: Hoare triple {35393#(= 0 main_~p6~0)} assume !(0 != ~p1~0); {35393#(= 0 main_~p6~0)} is VALID [2020-07-17 22:26:14,868 INFO L280 TraceCheckUtils]: 19: Hoare triple {35393#(= 0 main_~p6~0)} assume !(0 != ~p2~0); {35393#(= 0 main_~p6~0)} is VALID [2020-07-17 22:26:14,869 INFO L280 TraceCheckUtils]: 20: Hoare triple {35393#(= 0 main_~p6~0)} assume !(0 != ~p3~0); {35393#(= 0 main_~p6~0)} is VALID [2020-07-17 22:26:14,869 INFO L280 TraceCheckUtils]: 21: Hoare triple {35393#(= 0 main_~p6~0)} assume !(0 != ~p4~0); {35393#(= 0 main_~p6~0)} is VALID [2020-07-17 22:26:14,870 INFO L280 TraceCheckUtils]: 22: Hoare triple {35393#(= 0 main_~p6~0)} assume !(0 != ~p5~0); {35393#(= 0 main_~p6~0)} is VALID [2020-07-17 22:26:14,870 INFO L280 TraceCheckUtils]: 23: Hoare triple {35393#(= 0 main_~p6~0)} assume 0 != ~p6~0; {35390#false} is VALID [2020-07-17 22:26:14,871 INFO L280 TraceCheckUtils]: 24: Hoare triple {35390#false} assume 1 != ~lk6~0; {35390#false} is VALID [2020-07-17 22:26:14,871 INFO L280 TraceCheckUtils]: 25: Hoare triple {35390#false} assume !false; {35390#false} is VALID [2020-07-17 22:26:14,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:14,872 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927861904] [2020-07-17 22:26:14,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:14,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:14,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759184912] [2020-07-17 22:26:14,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-17 22:26:14,873 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:14,873 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:14,893 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:14,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:14,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:14,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:14,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:14,894 INFO L87 Difference]: Start difference. First operand 1544 states and 2342 transitions. Second operand 3 states. [2020-07-17 22:26:15,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:15,750 INFO L93 Difference]: Finished difference Result 3596 states and 5480 transitions. [2020-07-17 22:26:15,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:15,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-17 22:26:15,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:15,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:15,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2020-07-17 22:26:15,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:15,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2020-07-17 22:26:15,753 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 194 transitions. [2020-07-17 22:26:15,940 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:16,097 INFO L225 Difference]: With dead ends: 3596 [2020-07-17 22:26:16,097 INFO L226 Difference]: Without dead ends: 2090 [2020-07-17 22:26:16,100 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:16,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2020-07-17 22:26:16,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 2088. [2020-07-17 22:26:16,463 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:16,463 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2090 states. Second operand 2088 states. [2020-07-17 22:26:16,463 INFO L74 IsIncluded]: Start isIncluded. First operand 2090 states. Second operand 2088 states. [2020-07-17 22:26:16,464 INFO L87 Difference]: Start difference. First operand 2090 states. Second operand 2088 states. [2020-07-17 22:26:16,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:16,604 INFO L93 Difference]: Finished difference Result 2090 states and 3143 transitions. [2020-07-17 22:26:16,604 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 3143 transitions. [2020-07-17 22:26:16,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:16,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:16,607 INFO L74 IsIncluded]: Start isIncluded. First operand 2088 states. Second operand 2090 states. [2020-07-17 22:26:16,607 INFO L87 Difference]: Start difference. First operand 2088 states. Second operand 2090 states. [2020-07-17 22:26:16,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:16,766 INFO L93 Difference]: Finished difference Result 2090 states and 3143 transitions. [2020-07-17 22:26:16,766 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 3143 transitions. [2020-07-17 22:26:16,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:16,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:16,769 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:16,769 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:16,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2088 states. [2020-07-17 22:26:16,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 3142 transitions. [2020-07-17 22:26:16,923 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 3142 transitions. Word has length 26 [2020-07-17 22:26:16,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:16,923 INFO L479 AbstractCegarLoop]: Abstraction has 2088 states and 3142 transitions. [2020-07-17 22:26:16,923 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:16,923 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 3142 transitions. [2020-07-17 22:26:16,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-17 22:26:16,925 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:16,926 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:16,926 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-17 22:26:16,926 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:16,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:16,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1695832809, now seen corresponding path program 1 times [2020-07-17 22:26:16,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:16,927 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434191102] [2020-07-17 22:26:16,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:16,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:16,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:16,956 INFO L280 TraceCheckUtils]: 0: Hoare triple {45434#true} assume true; {45434#true} is VALID [2020-07-17 22:26:16,956 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {45434#true} {45434#true} #214#return; {45434#true} is VALID [2020-07-17 22:26:16,956 INFO L263 TraceCheckUtils]: 0: Hoare triple {45434#true} call ULTIMATE.init(); {45434#true} is VALID [2020-07-17 22:26:16,956 INFO L280 TraceCheckUtils]: 1: Hoare triple {45434#true} assume true; {45434#true} is VALID [2020-07-17 22:26:16,956 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {45434#true} {45434#true} #214#return; {45434#true} is VALID [2020-07-17 22:26:16,957 INFO L263 TraceCheckUtils]: 3: Hoare triple {45434#true} call #t~ret12 := main(); {45434#true} is VALID [2020-07-17 22:26:16,957 INFO L280 TraceCheckUtils]: 4: Hoare triple {45434#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;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {45434#true} is VALID [2020-07-17 22:26:16,957 INFO L280 TraceCheckUtils]: 5: Hoare triple {45434#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {45434#true} is VALID [2020-07-17 22:26:16,957 INFO L280 TraceCheckUtils]: 6: Hoare triple {45434#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;~lk11~0 := 0; {45434#true} is VALID [2020-07-17 22:26:16,957 INFO L280 TraceCheckUtils]: 7: Hoare triple {45434#true} assume !(0 != ~p1~0); {45434#true} is VALID [2020-07-17 22:26:16,957 INFO L280 TraceCheckUtils]: 8: Hoare triple {45434#true} assume !(0 != ~p2~0); {45434#true} is VALID [2020-07-17 22:26:16,957 INFO L280 TraceCheckUtils]: 9: Hoare triple {45434#true} assume !(0 != ~p3~0); {45434#true} is VALID [2020-07-17 22:26:16,958 INFO L280 TraceCheckUtils]: 10: Hoare triple {45434#true} assume !(0 != ~p4~0); {45434#true} is VALID [2020-07-17 22:26:16,958 INFO L280 TraceCheckUtils]: 11: Hoare triple {45434#true} assume !(0 != ~p5~0); {45434#true} is VALID [2020-07-17 22:26:16,958 INFO L280 TraceCheckUtils]: 12: Hoare triple {45434#true} assume 0 != ~p6~0;~lk6~0 := 1; {45438#(not (= 0 main_~p6~0))} is VALID [2020-07-17 22:26:16,959 INFO L280 TraceCheckUtils]: 13: Hoare triple {45438#(not (= 0 main_~p6~0))} assume 0 != ~p7~0;~lk7~0 := 1; {45438#(not (= 0 main_~p6~0))} is VALID [2020-07-17 22:26:16,960 INFO L280 TraceCheckUtils]: 14: Hoare triple {45438#(not (= 0 main_~p6~0))} assume !(0 != ~p8~0); {45438#(not (= 0 main_~p6~0))} is VALID [2020-07-17 22:26:16,960 INFO L280 TraceCheckUtils]: 15: Hoare triple {45438#(not (= 0 main_~p6~0))} assume 0 != ~p9~0;~lk9~0 := 1; {45438#(not (= 0 main_~p6~0))} is VALID [2020-07-17 22:26:16,960 INFO L280 TraceCheckUtils]: 16: Hoare triple {45438#(not (= 0 main_~p6~0))} assume 0 != ~p10~0;~lk10~0 := 1; {45438#(not (= 0 main_~p6~0))} is VALID [2020-07-17 22:26:16,961 INFO L280 TraceCheckUtils]: 17: Hoare triple {45438#(not (= 0 main_~p6~0))} assume 0 != ~p11~0;~lk11~0 := 1; {45438#(not (= 0 main_~p6~0))} is VALID [2020-07-17 22:26:16,961 INFO L280 TraceCheckUtils]: 18: Hoare triple {45438#(not (= 0 main_~p6~0))} assume !(0 != ~p1~0); {45438#(not (= 0 main_~p6~0))} is VALID [2020-07-17 22:26:16,962 INFO L280 TraceCheckUtils]: 19: Hoare triple {45438#(not (= 0 main_~p6~0))} assume !(0 != ~p2~0); {45438#(not (= 0 main_~p6~0))} is VALID [2020-07-17 22:26:16,962 INFO L280 TraceCheckUtils]: 20: Hoare triple {45438#(not (= 0 main_~p6~0))} assume !(0 != ~p3~0); {45438#(not (= 0 main_~p6~0))} is VALID [2020-07-17 22:26:16,963 INFO L280 TraceCheckUtils]: 21: Hoare triple {45438#(not (= 0 main_~p6~0))} assume !(0 != ~p4~0); {45438#(not (= 0 main_~p6~0))} is VALID [2020-07-17 22:26:16,963 INFO L280 TraceCheckUtils]: 22: Hoare triple {45438#(not (= 0 main_~p6~0))} assume !(0 != ~p5~0); {45438#(not (= 0 main_~p6~0))} is VALID [2020-07-17 22:26:16,964 INFO L280 TraceCheckUtils]: 23: Hoare triple {45438#(not (= 0 main_~p6~0))} assume !(0 != ~p6~0); {45435#false} is VALID [2020-07-17 22:26:16,964 INFO L280 TraceCheckUtils]: 24: Hoare triple {45435#false} assume 0 != ~p7~0; {45435#false} is VALID [2020-07-17 22:26:16,964 INFO L280 TraceCheckUtils]: 25: Hoare triple {45435#false} assume 1 != ~lk7~0; {45435#false} is VALID [2020-07-17 22:26:16,965 INFO L280 TraceCheckUtils]: 26: Hoare triple {45435#false} assume !false; {45435#false} is VALID [2020-07-17 22:26:16,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:16,966 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434191102] [2020-07-17 22:26:16,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:16,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:16,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481791286] [2020-07-17 22:26:16,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-07-17 22:26:16,967 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:16,967 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:16,998 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:16,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:16,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:16,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:16,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:16,999 INFO L87 Difference]: Start difference. First operand 2088 states and 3142 transitions. Second operand 3 states. [2020-07-17 22:26:17,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:17,773 INFO L93 Difference]: Finished difference Result 3132 states and 4696 transitions. [2020-07-17 22:26:17,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:17,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-07-17 22:26:17,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:17,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:17,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2020-07-17 22:26:17,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:17,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2020-07-17 22:26:17,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 189 transitions. [2020-07-17 22:26:17,962 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:18,127 INFO L225 Difference]: With dead ends: 3132 [2020-07-17 22:26:18,128 INFO L226 Difference]: Without dead ends: 2122 [2020-07-17 22:26:18,130 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:18,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2020-07-17 22:26:18,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2120. [2020-07-17 22:26:18,506 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:18,506 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2122 states. Second operand 2120 states. [2020-07-17 22:26:18,506 INFO L74 IsIncluded]: Start isIncluded. First operand 2122 states. Second operand 2120 states. [2020-07-17 22:26:18,507 INFO L87 Difference]: Start difference. First operand 2122 states. Second operand 2120 states. [2020-07-17 22:26:18,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:18,652 INFO L93 Difference]: Finished difference Result 2122 states and 3143 transitions. [2020-07-17 22:26:18,652 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 3143 transitions. [2020-07-17 22:26:18,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:18,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:18,655 INFO L74 IsIncluded]: Start isIncluded. First operand 2120 states. Second operand 2122 states. [2020-07-17 22:26:18,655 INFO L87 Difference]: Start difference. First operand 2120 states. Second operand 2122 states. [2020-07-17 22:26:18,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:18,793 INFO L93 Difference]: Finished difference Result 2122 states and 3143 transitions. [2020-07-17 22:26:18,793 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 3143 transitions. [2020-07-17 22:26:18,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:18,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:18,796 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:18,796 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:18,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2120 states. [2020-07-17 22:26:18,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2120 states to 2120 states and 3142 transitions. [2020-07-17 22:26:18,941 INFO L78 Accepts]: Start accepts. Automaton has 2120 states and 3142 transitions. Word has length 27 [2020-07-17 22:26:18,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:18,941 INFO L479 AbstractCegarLoop]: Abstraction has 2120 states and 3142 transitions. [2020-07-17 22:26:18,941 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:18,941 INFO L276 IsEmpty]: Start isEmpty. Operand 2120 states and 3142 transitions. [2020-07-17 22:26:18,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-17 22:26:18,943 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:18,943 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:18,944 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-07-17 22:26:18,944 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:18,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:18,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1319270809, now seen corresponding path program 1 times [2020-07-17 22:26:18,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:18,945 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493728721] [2020-07-17 22:26:18,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:18,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:18,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:18,997 INFO L280 TraceCheckUtils]: 0: Hoare triple {55111#true} assume true; {55111#true} is VALID [2020-07-17 22:26:18,998 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {55111#true} {55111#true} #214#return; {55111#true} is VALID [2020-07-17 22:26:18,998 INFO L263 TraceCheckUtils]: 0: Hoare triple {55111#true} call ULTIMATE.init(); {55111#true} is VALID [2020-07-17 22:26:18,998 INFO L280 TraceCheckUtils]: 1: Hoare triple {55111#true} assume true; {55111#true} is VALID [2020-07-17 22:26:18,998 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {55111#true} {55111#true} #214#return; {55111#true} is VALID [2020-07-17 22:26:18,999 INFO L263 TraceCheckUtils]: 3: Hoare triple {55111#true} call #t~ret12 := main(); {55111#true} is VALID [2020-07-17 22:26:18,999 INFO L280 TraceCheckUtils]: 4: Hoare triple {55111#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;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {55111#true} is VALID [2020-07-17 22:26:18,999 INFO L280 TraceCheckUtils]: 5: Hoare triple {55111#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {55111#true} is VALID [2020-07-17 22:26:18,999 INFO L280 TraceCheckUtils]: 6: Hoare triple {55111#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;~lk11~0 := 0; {55111#true} is VALID [2020-07-17 22:26:18,999 INFO L280 TraceCheckUtils]: 7: Hoare triple {55111#true} assume !(0 != ~p1~0); {55111#true} is VALID [2020-07-17 22:26:19,000 INFO L280 TraceCheckUtils]: 8: Hoare triple {55111#true} assume !(0 != ~p2~0); {55111#true} is VALID [2020-07-17 22:26:19,000 INFO L280 TraceCheckUtils]: 9: Hoare triple {55111#true} assume !(0 != ~p3~0); {55111#true} is VALID [2020-07-17 22:26:19,000 INFO L280 TraceCheckUtils]: 10: Hoare triple {55111#true} assume !(0 != ~p4~0); {55111#true} is VALID [2020-07-17 22:26:19,000 INFO L280 TraceCheckUtils]: 11: Hoare triple {55111#true} assume !(0 != ~p5~0); {55111#true} is VALID [2020-07-17 22:26:19,000 INFO L280 TraceCheckUtils]: 12: Hoare triple {55111#true} assume !(0 != ~p6~0); {55111#true} is VALID [2020-07-17 22:26:19,001 INFO L280 TraceCheckUtils]: 13: Hoare triple {55111#true} assume 0 != ~p7~0;~lk7~0 := 1; {55115#(= main_~lk7~0 1)} is VALID [2020-07-17 22:26:19,002 INFO L280 TraceCheckUtils]: 14: Hoare triple {55115#(= main_~lk7~0 1)} assume !(0 != ~p8~0); {55115#(= main_~lk7~0 1)} is VALID [2020-07-17 22:26:19,002 INFO L280 TraceCheckUtils]: 15: Hoare triple {55115#(= main_~lk7~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {55115#(= main_~lk7~0 1)} is VALID [2020-07-17 22:26:19,003 INFO L280 TraceCheckUtils]: 16: Hoare triple {55115#(= main_~lk7~0 1)} assume 0 != ~p10~0;~lk10~0 := 1; {55115#(= main_~lk7~0 1)} is VALID [2020-07-17 22:26:19,003 INFO L280 TraceCheckUtils]: 17: Hoare triple {55115#(= main_~lk7~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {55115#(= main_~lk7~0 1)} is VALID [2020-07-17 22:26:19,004 INFO L280 TraceCheckUtils]: 18: Hoare triple {55115#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {55115#(= main_~lk7~0 1)} is VALID [2020-07-17 22:26:19,004 INFO L280 TraceCheckUtils]: 19: Hoare triple {55115#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {55115#(= main_~lk7~0 1)} is VALID [2020-07-17 22:26:19,005 INFO L280 TraceCheckUtils]: 20: Hoare triple {55115#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {55115#(= main_~lk7~0 1)} is VALID [2020-07-17 22:26:19,005 INFO L280 TraceCheckUtils]: 21: Hoare triple {55115#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {55115#(= main_~lk7~0 1)} is VALID [2020-07-17 22:26:19,006 INFO L280 TraceCheckUtils]: 22: Hoare triple {55115#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {55115#(= main_~lk7~0 1)} is VALID [2020-07-17 22:26:19,006 INFO L280 TraceCheckUtils]: 23: Hoare triple {55115#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {55115#(= main_~lk7~0 1)} is VALID [2020-07-17 22:26:19,007 INFO L280 TraceCheckUtils]: 24: Hoare triple {55115#(= main_~lk7~0 1)} assume 0 != ~p7~0; {55115#(= main_~lk7~0 1)} is VALID [2020-07-17 22:26:19,008 INFO L280 TraceCheckUtils]: 25: Hoare triple {55115#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {55112#false} is VALID [2020-07-17 22:26:19,008 INFO L280 TraceCheckUtils]: 26: Hoare triple {55112#false} assume !false; {55112#false} is VALID [2020-07-17 22:26:19,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:19,009 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493728721] [2020-07-17 22:26:19,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:19,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:19,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482055712] [2020-07-17 22:26:19,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-07-17 22:26:19,010 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:19,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:19,040 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:19,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:19,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:19,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:19,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:19,041 INFO L87 Difference]: Start difference. First operand 2120 states and 3142 transitions. Second operand 3 states. [2020-07-17 22:26:20,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:20,429 INFO L93 Difference]: Finished difference Result 3724 states and 5640 transitions. [2020-07-17 22:26:20,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:20,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-07-17 22:26:20,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:20,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:20,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2020-07-17 22:26:20,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:20,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2020-07-17 22:26:20,431 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 118 transitions. [2020-07-17 22:26:20,552 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:21,054 INFO L225 Difference]: With dead ends: 3724 [2020-07-17 22:26:21,055 INFO L226 Difference]: Without dead ends: 3722 [2020-07-17 22:26:21,056 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:21,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2020-07-17 22:26:21,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3080. [2020-07-17 22:26:21,495 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:21,495 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3722 states. Second operand 3080 states. [2020-07-17 22:26:21,495 INFO L74 IsIncluded]: Start isIncluded. First operand 3722 states. Second operand 3080 states. [2020-07-17 22:26:21,495 INFO L87 Difference]: Start difference. First operand 3722 states. Second operand 3080 states. [2020-07-17 22:26:21,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:21,897 INFO L93 Difference]: Finished difference Result 3722 states and 5575 transitions. [2020-07-17 22:26:21,897 INFO L276 IsEmpty]: Start isEmpty. Operand 3722 states and 5575 transitions. [2020-07-17 22:26:21,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:21,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:21,901 INFO L74 IsIncluded]: Start isIncluded. First operand 3080 states. Second operand 3722 states. [2020-07-17 22:26:21,901 INFO L87 Difference]: Start difference. First operand 3080 states. Second operand 3722 states. [2020-07-17 22:26:22,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:22,333 INFO L93 Difference]: Finished difference Result 3722 states and 5575 transitions. [2020-07-17 22:26:22,333 INFO L276 IsEmpty]: Start isEmpty. Operand 3722 states and 5575 transitions. [2020-07-17 22:26:22,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:22,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:22,337 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:22,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:22,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3080 states. [2020-07-17 22:26:22,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3080 states to 3080 states and 4422 transitions. [2020-07-17 22:26:22,643 INFO L78 Accepts]: Start accepts. Automaton has 3080 states and 4422 transitions. Word has length 27 [2020-07-17 22:26:22,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:22,643 INFO L479 AbstractCegarLoop]: Abstraction has 3080 states and 4422 transitions. [2020-07-17 22:26:22,643 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:22,643 INFO L276 IsEmpty]: Start isEmpty. Operand 3080 states and 4422 transitions. [2020-07-17 22:26:22,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-17 22:26:22,645 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:22,646 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:22,646 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-07-17 22:26:22,646 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:22,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:22,646 INFO L82 PathProgramCache]: Analyzing trace with hash 308153559, now seen corresponding path program 1 times [2020-07-17 22:26:22,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:22,647 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748666757] [2020-07-17 22:26:22,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:22,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:22,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:22,672 INFO L280 TraceCheckUtils]: 0: Hoare triple {69572#true} assume true; {69572#true} is VALID [2020-07-17 22:26:22,672 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {69572#true} {69572#true} #214#return; {69572#true} is VALID [2020-07-17 22:26:22,673 INFO L263 TraceCheckUtils]: 0: Hoare triple {69572#true} call ULTIMATE.init(); {69572#true} is VALID [2020-07-17 22:26:22,673 INFO L280 TraceCheckUtils]: 1: Hoare triple {69572#true} assume true; {69572#true} is VALID [2020-07-17 22:26:22,673 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {69572#true} {69572#true} #214#return; {69572#true} is VALID [2020-07-17 22:26:22,673 INFO L263 TraceCheckUtils]: 3: Hoare triple {69572#true} call #t~ret12 := main(); {69572#true} is VALID [2020-07-17 22:26:22,674 INFO L280 TraceCheckUtils]: 4: Hoare triple {69572#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;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {69572#true} is VALID [2020-07-17 22:26:22,674 INFO L280 TraceCheckUtils]: 5: Hoare triple {69572#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {69572#true} is VALID [2020-07-17 22:26:22,674 INFO L280 TraceCheckUtils]: 6: Hoare triple {69572#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;~lk11~0 := 0; {69572#true} is VALID [2020-07-17 22:26:22,674 INFO L280 TraceCheckUtils]: 7: Hoare triple {69572#true} assume !(0 != ~p1~0); {69572#true} is VALID [2020-07-17 22:26:22,674 INFO L280 TraceCheckUtils]: 8: Hoare triple {69572#true} assume !(0 != ~p2~0); {69572#true} is VALID [2020-07-17 22:26:22,675 INFO L280 TraceCheckUtils]: 9: Hoare triple {69572#true} assume !(0 != ~p3~0); {69572#true} is VALID [2020-07-17 22:26:22,675 INFO L280 TraceCheckUtils]: 10: Hoare triple {69572#true} assume !(0 != ~p4~0); {69572#true} is VALID [2020-07-17 22:26:22,675 INFO L280 TraceCheckUtils]: 11: Hoare triple {69572#true} assume !(0 != ~p5~0); {69572#true} is VALID [2020-07-17 22:26:22,675 INFO L280 TraceCheckUtils]: 12: Hoare triple {69572#true} assume !(0 != ~p6~0); {69572#true} is VALID [2020-07-17 22:26:22,676 INFO L280 TraceCheckUtils]: 13: Hoare triple {69572#true} assume !(0 != ~p7~0); {69576#(= 0 main_~p7~0)} is VALID [2020-07-17 22:26:22,677 INFO L280 TraceCheckUtils]: 14: Hoare triple {69576#(= 0 main_~p7~0)} assume !(0 != ~p8~0); {69576#(= 0 main_~p7~0)} is VALID [2020-07-17 22:26:22,681 INFO L280 TraceCheckUtils]: 15: Hoare triple {69576#(= 0 main_~p7~0)} assume 0 != ~p9~0;~lk9~0 := 1; {69576#(= 0 main_~p7~0)} is VALID [2020-07-17 22:26:22,687 INFO L280 TraceCheckUtils]: 16: Hoare triple {69576#(= 0 main_~p7~0)} assume 0 != ~p10~0;~lk10~0 := 1; {69576#(= 0 main_~p7~0)} is VALID [2020-07-17 22:26:22,689 INFO L280 TraceCheckUtils]: 17: Hoare triple {69576#(= 0 main_~p7~0)} assume 0 != ~p11~0;~lk11~0 := 1; {69576#(= 0 main_~p7~0)} is VALID [2020-07-17 22:26:22,690 INFO L280 TraceCheckUtils]: 18: Hoare triple {69576#(= 0 main_~p7~0)} assume !(0 != ~p1~0); {69576#(= 0 main_~p7~0)} is VALID [2020-07-17 22:26:22,690 INFO L280 TraceCheckUtils]: 19: Hoare triple {69576#(= 0 main_~p7~0)} assume !(0 != ~p2~0); {69576#(= 0 main_~p7~0)} is VALID [2020-07-17 22:26:22,691 INFO L280 TraceCheckUtils]: 20: Hoare triple {69576#(= 0 main_~p7~0)} assume !(0 != ~p3~0); {69576#(= 0 main_~p7~0)} is VALID [2020-07-17 22:26:22,691 INFO L280 TraceCheckUtils]: 21: Hoare triple {69576#(= 0 main_~p7~0)} assume !(0 != ~p4~0); {69576#(= 0 main_~p7~0)} is VALID [2020-07-17 22:26:22,692 INFO L280 TraceCheckUtils]: 22: Hoare triple {69576#(= 0 main_~p7~0)} assume !(0 != ~p5~0); {69576#(= 0 main_~p7~0)} is VALID [2020-07-17 22:26:22,693 INFO L280 TraceCheckUtils]: 23: Hoare triple {69576#(= 0 main_~p7~0)} assume !(0 != ~p6~0); {69576#(= 0 main_~p7~0)} is VALID [2020-07-17 22:26:22,693 INFO L280 TraceCheckUtils]: 24: Hoare triple {69576#(= 0 main_~p7~0)} assume 0 != ~p7~0; {69573#false} is VALID [2020-07-17 22:26:22,693 INFO L280 TraceCheckUtils]: 25: Hoare triple {69573#false} assume 1 != ~lk7~0; {69573#false} is VALID [2020-07-17 22:26:22,694 INFO L280 TraceCheckUtils]: 26: Hoare triple {69573#false} assume !false; {69573#false} is VALID [2020-07-17 22:26:22,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:22,695 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748666757] [2020-07-17 22:26:22,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:22,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:22,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219809204] [2020-07-17 22:26:22,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-07-17 22:26:22,696 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:22,696 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:22,723 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:22,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:22,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:22,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:22,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:22,724 INFO L87 Difference]: Start difference. First operand 3080 states and 4422 transitions. Second operand 3 states. [2020-07-17 22:26:25,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:25,375 INFO L93 Difference]: Finished difference Result 7116 states and 10248 transitions. [2020-07-17 22:26:25,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:25,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-07-17 22:26:25,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:25,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:25,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2020-07-17 22:26:25,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:25,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2020-07-17 22:26:25,378 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 191 transitions. [2020-07-17 22:26:25,577 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:26,167 INFO L225 Difference]: With dead ends: 7116 [2020-07-17 22:26:26,167 INFO L226 Difference]: Without dead ends: 4106 [2020-07-17 22:26:26,172 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:26,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2020-07-17 22:26:27,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 4104. [2020-07-17 22:26:27,017 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:27,018 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4106 states. Second operand 4104 states. [2020-07-17 22:26:27,018 INFO L74 IsIncluded]: Start isIncluded. First operand 4106 states. Second operand 4104 states. [2020-07-17 22:26:27,018 INFO L87 Difference]: Start difference. First operand 4106 states. Second operand 4104 states. [2020-07-17 22:26:27,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:27,518 INFO L93 Difference]: Finished difference Result 4106 states and 5831 transitions. [2020-07-17 22:26:27,518 INFO L276 IsEmpty]: Start isEmpty. Operand 4106 states and 5831 transitions. [2020-07-17 22:26:27,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:27,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:27,522 INFO L74 IsIncluded]: Start isIncluded. First operand 4104 states. Second operand 4106 states. [2020-07-17 22:26:27,522 INFO L87 Difference]: Start difference. First operand 4104 states. Second operand 4106 states. [2020-07-17 22:26:28,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:28,038 INFO L93 Difference]: Finished difference Result 4106 states and 5831 transitions. [2020-07-17 22:26:28,039 INFO L276 IsEmpty]: Start isEmpty. Operand 4106 states and 5831 transitions. [2020-07-17 22:26:28,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:28,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:28,044 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:28,044 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:28,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4104 states. [2020-07-17 22:26:28,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4104 states to 4104 states and 5830 transitions. [2020-07-17 22:26:28,569 INFO L78 Accepts]: Start accepts. Automaton has 4104 states and 5830 transitions. Word has length 27 [2020-07-17 22:26:28,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:28,569 INFO L479 AbstractCegarLoop]: Abstraction has 4104 states and 5830 transitions. [2020-07-17 22:26:28,570 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:28,570 INFO L276 IsEmpty]: Start isEmpty. Operand 4104 states and 5830 transitions. [2020-07-17 22:26:28,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-17 22:26:28,572 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:28,572 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:28,574 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-07-17 22:26:28,576 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:28,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:28,576 INFO L82 PathProgramCache]: Analyzing trace with hash -2052062779, now seen corresponding path program 1 times [2020-07-17 22:26:28,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:28,576 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293894882] [2020-07-17 22:26:28,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:28,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:28,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:28,607 INFO L280 TraceCheckUtils]: 0: Hoare triple {89345#true} assume true; {89345#true} is VALID [2020-07-17 22:26:28,608 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {89345#true} {89345#true} #214#return; {89345#true} is VALID [2020-07-17 22:26:28,608 INFO L263 TraceCheckUtils]: 0: Hoare triple {89345#true} call ULTIMATE.init(); {89345#true} is VALID [2020-07-17 22:26:28,608 INFO L280 TraceCheckUtils]: 1: Hoare triple {89345#true} assume true; {89345#true} is VALID [2020-07-17 22:26:28,608 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {89345#true} {89345#true} #214#return; {89345#true} is VALID [2020-07-17 22:26:28,609 INFO L263 TraceCheckUtils]: 3: Hoare triple {89345#true} call #t~ret12 := main(); {89345#true} is VALID [2020-07-17 22:26:28,609 INFO L280 TraceCheckUtils]: 4: Hoare triple {89345#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;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {89345#true} is VALID [2020-07-17 22:26:28,609 INFO L280 TraceCheckUtils]: 5: Hoare triple {89345#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {89345#true} is VALID [2020-07-17 22:26:28,609 INFO L280 TraceCheckUtils]: 6: Hoare triple {89345#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;~lk11~0 := 0; {89345#true} is VALID [2020-07-17 22:26:28,609 INFO L280 TraceCheckUtils]: 7: Hoare triple {89345#true} assume !(0 != ~p1~0); {89345#true} is VALID [2020-07-17 22:26:28,610 INFO L280 TraceCheckUtils]: 8: Hoare triple {89345#true} assume !(0 != ~p2~0); {89345#true} is VALID [2020-07-17 22:26:28,610 INFO L280 TraceCheckUtils]: 9: Hoare triple {89345#true} assume !(0 != ~p3~0); {89345#true} is VALID [2020-07-17 22:26:28,610 INFO L280 TraceCheckUtils]: 10: Hoare triple {89345#true} assume !(0 != ~p4~0); {89345#true} is VALID [2020-07-17 22:26:28,610 INFO L280 TraceCheckUtils]: 11: Hoare triple {89345#true} assume !(0 != ~p5~0); {89345#true} is VALID [2020-07-17 22:26:28,610 INFO L280 TraceCheckUtils]: 12: Hoare triple {89345#true} assume !(0 != ~p6~0); {89345#true} is VALID [2020-07-17 22:26:28,611 INFO L280 TraceCheckUtils]: 13: Hoare triple {89345#true} assume 0 != ~p7~0;~lk7~0 := 1; {89349#(not (= 0 main_~p7~0))} is VALID [2020-07-17 22:26:28,612 INFO L280 TraceCheckUtils]: 14: Hoare triple {89349#(not (= 0 main_~p7~0))} assume !(0 != ~p8~0); {89349#(not (= 0 main_~p7~0))} is VALID [2020-07-17 22:26:28,612 INFO L280 TraceCheckUtils]: 15: Hoare triple {89349#(not (= 0 main_~p7~0))} assume 0 != ~p9~0;~lk9~0 := 1; {89349#(not (= 0 main_~p7~0))} is VALID [2020-07-17 22:26:28,613 INFO L280 TraceCheckUtils]: 16: Hoare triple {89349#(not (= 0 main_~p7~0))} assume 0 != ~p10~0;~lk10~0 := 1; {89349#(not (= 0 main_~p7~0))} is VALID [2020-07-17 22:26:28,614 INFO L280 TraceCheckUtils]: 17: Hoare triple {89349#(not (= 0 main_~p7~0))} assume 0 != ~p11~0;~lk11~0 := 1; {89349#(not (= 0 main_~p7~0))} is VALID [2020-07-17 22:26:28,614 INFO L280 TraceCheckUtils]: 18: Hoare triple {89349#(not (= 0 main_~p7~0))} assume !(0 != ~p1~0); {89349#(not (= 0 main_~p7~0))} is VALID [2020-07-17 22:26:28,615 INFO L280 TraceCheckUtils]: 19: Hoare triple {89349#(not (= 0 main_~p7~0))} assume !(0 != ~p2~0); {89349#(not (= 0 main_~p7~0))} is VALID [2020-07-17 22:26:28,615 INFO L280 TraceCheckUtils]: 20: Hoare triple {89349#(not (= 0 main_~p7~0))} assume !(0 != ~p3~0); {89349#(not (= 0 main_~p7~0))} is VALID [2020-07-17 22:26:28,616 INFO L280 TraceCheckUtils]: 21: Hoare triple {89349#(not (= 0 main_~p7~0))} assume !(0 != ~p4~0); {89349#(not (= 0 main_~p7~0))} is VALID [2020-07-17 22:26:28,617 INFO L280 TraceCheckUtils]: 22: Hoare triple {89349#(not (= 0 main_~p7~0))} assume !(0 != ~p5~0); {89349#(not (= 0 main_~p7~0))} is VALID [2020-07-17 22:26:28,617 INFO L280 TraceCheckUtils]: 23: Hoare triple {89349#(not (= 0 main_~p7~0))} assume !(0 != ~p6~0); {89349#(not (= 0 main_~p7~0))} is VALID [2020-07-17 22:26:28,618 INFO L280 TraceCheckUtils]: 24: Hoare triple {89349#(not (= 0 main_~p7~0))} assume !(0 != ~p7~0); {89346#false} is VALID [2020-07-17 22:26:28,618 INFO L280 TraceCheckUtils]: 25: Hoare triple {89346#false} assume 0 != ~p8~0; {89346#false} is VALID [2020-07-17 22:26:28,619 INFO L280 TraceCheckUtils]: 26: Hoare triple {89346#false} assume 1 != ~lk8~0; {89346#false} is VALID [2020-07-17 22:26:28,619 INFO L280 TraceCheckUtils]: 27: Hoare triple {89346#false} assume !false; {89346#false} is VALID [2020-07-17 22:26:28,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:28,622 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293894882] [2020-07-17 22:26:28,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:28,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:28,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52900337] [2020-07-17 22:26:28,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-07-17 22:26:28,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:28,623 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:28,661 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:28,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:28,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:28,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:28,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:28,662 INFO L87 Difference]: Start difference. First operand 4104 states and 5830 transitions. Second operand 3 states. [2020-07-17 22:26:30,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:30,750 INFO L93 Difference]: Finished difference Result 6156 states and 8712 transitions. [2020-07-17 22:26:30,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:30,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-07-17 22:26:30,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:30,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:30,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2020-07-17 22:26:30,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:30,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2020-07-17 22:26:30,753 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 186 transitions. [2020-07-17 22:26:30,945 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:31,569 INFO L225 Difference]: With dead ends: 6156 [2020-07-17 22:26:31,569 INFO L226 Difference]: Without dead ends: 4170 [2020-07-17 22:26:31,572 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:31,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4170 states. [2020-07-17 22:26:32,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4170 to 4168. [2020-07-17 22:26:32,351 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:32,351 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4170 states. Second operand 4168 states. [2020-07-17 22:26:32,351 INFO L74 IsIncluded]: Start isIncluded. First operand 4170 states. Second operand 4168 states. [2020-07-17 22:26:32,352 INFO L87 Difference]: Start difference. First operand 4170 states. Second operand 4168 states. [2020-07-17 22:26:32,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:32,863 INFO L93 Difference]: Finished difference Result 4170 states and 5831 transitions. [2020-07-17 22:26:32,863 INFO L276 IsEmpty]: Start isEmpty. Operand 4170 states and 5831 transitions. [2020-07-17 22:26:32,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:32,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:32,867 INFO L74 IsIncluded]: Start isIncluded. First operand 4168 states. Second operand 4170 states. [2020-07-17 22:26:32,868 INFO L87 Difference]: Start difference. First operand 4168 states. Second operand 4170 states. [2020-07-17 22:26:33,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:33,376 INFO L93 Difference]: Finished difference Result 4170 states and 5831 transitions. [2020-07-17 22:26:33,376 INFO L276 IsEmpty]: Start isEmpty. Operand 4170 states and 5831 transitions. [2020-07-17 22:26:33,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:33,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:33,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:33,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:33,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4168 states. [2020-07-17 22:26:33,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4168 states to 4168 states and 5830 transitions. [2020-07-17 22:26:33,953 INFO L78 Accepts]: Start accepts. Automaton has 4168 states and 5830 transitions. Word has length 28 [2020-07-17 22:26:33,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:33,953 INFO L479 AbstractCegarLoop]: Abstraction has 4168 states and 5830 transitions. [2020-07-17 22:26:33,953 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:33,953 INFO L276 IsEmpty]: Start isEmpty. Operand 4168 states and 5830 transitions. [2020-07-17 22:26:33,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-17 22:26:33,956 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:33,956 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:33,956 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-07-17 22:26:33,956 INFO L427 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:33,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:33,957 INFO L82 PathProgramCache]: Analyzing trace with hash 963040839, now seen corresponding path program 1 times [2020-07-17 22:26:33,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:33,957 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611773039] [2020-07-17 22:26:33,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:33,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:33,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:33,983 INFO L280 TraceCheckUtils]: 0: Hoare triple {108350#true} assume true; {108350#true} is VALID [2020-07-17 22:26:33,984 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {108350#true} {108350#true} #214#return; {108350#true} is VALID [2020-07-17 22:26:33,984 INFO L263 TraceCheckUtils]: 0: Hoare triple {108350#true} call ULTIMATE.init(); {108350#true} is VALID [2020-07-17 22:26:33,984 INFO L280 TraceCheckUtils]: 1: Hoare triple {108350#true} assume true; {108350#true} is VALID [2020-07-17 22:26:33,984 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {108350#true} {108350#true} #214#return; {108350#true} is VALID [2020-07-17 22:26:33,985 INFO L263 TraceCheckUtils]: 3: Hoare triple {108350#true} call #t~ret12 := main(); {108350#true} is VALID [2020-07-17 22:26:33,985 INFO L280 TraceCheckUtils]: 4: Hoare triple {108350#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;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {108350#true} is VALID [2020-07-17 22:26:33,985 INFO L280 TraceCheckUtils]: 5: Hoare triple {108350#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {108350#true} is VALID [2020-07-17 22:26:33,985 INFO L280 TraceCheckUtils]: 6: Hoare triple {108350#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;~lk11~0 := 0; {108350#true} is VALID [2020-07-17 22:26:33,985 INFO L280 TraceCheckUtils]: 7: Hoare triple {108350#true} assume !(0 != ~p1~0); {108350#true} is VALID [2020-07-17 22:26:33,986 INFO L280 TraceCheckUtils]: 8: Hoare triple {108350#true} assume !(0 != ~p2~0); {108350#true} is VALID [2020-07-17 22:26:33,986 INFO L280 TraceCheckUtils]: 9: Hoare triple {108350#true} assume !(0 != ~p3~0); {108350#true} is VALID [2020-07-17 22:26:33,986 INFO L280 TraceCheckUtils]: 10: Hoare triple {108350#true} assume !(0 != ~p4~0); {108350#true} is VALID [2020-07-17 22:26:33,986 INFO L280 TraceCheckUtils]: 11: Hoare triple {108350#true} assume !(0 != ~p5~0); {108350#true} is VALID [2020-07-17 22:26:33,986 INFO L280 TraceCheckUtils]: 12: Hoare triple {108350#true} assume !(0 != ~p6~0); {108350#true} is VALID [2020-07-17 22:26:33,987 INFO L280 TraceCheckUtils]: 13: Hoare triple {108350#true} assume !(0 != ~p7~0); {108350#true} is VALID [2020-07-17 22:26:33,987 INFO L280 TraceCheckUtils]: 14: Hoare triple {108350#true} assume !(0 != ~p8~0); {108354#(= 0 main_~p8~0)} is VALID [2020-07-17 22:26:33,988 INFO L280 TraceCheckUtils]: 15: Hoare triple {108354#(= 0 main_~p8~0)} assume 0 != ~p9~0;~lk9~0 := 1; {108354#(= 0 main_~p8~0)} is VALID [2020-07-17 22:26:33,988 INFO L280 TraceCheckUtils]: 16: Hoare triple {108354#(= 0 main_~p8~0)} assume 0 != ~p10~0;~lk10~0 := 1; {108354#(= 0 main_~p8~0)} is VALID [2020-07-17 22:26:33,989 INFO L280 TraceCheckUtils]: 17: Hoare triple {108354#(= 0 main_~p8~0)} assume 0 != ~p11~0;~lk11~0 := 1; {108354#(= 0 main_~p8~0)} is VALID [2020-07-17 22:26:33,989 INFO L280 TraceCheckUtils]: 18: Hoare triple {108354#(= 0 main_~p8~0)} assume !(0 != ~p1~0); {108354#(= 0 main_~p8~0)} is VALID [2020-07-17 22:26:33,990 INFO L280 TraceCheckUtils]: 19: Hoare triple {108354#(= 0 main_~p8~0)} assume !(0 != ~p2~0); {108354#(= 0 main_~p8~0)} is VALID [2020-07-17 22:26:33,990 INFO L280 TraceCheckUtils]: 20: Hoare triple {108354#(= 0 main_~p8~0)} assume !(0 != ~p3~0); {108354#(= 0 main_~p8~0)} is VALID [2020-07-17 22:26:33,990 INFO L280 TraceCheckUtils]: 21: Hoare triple {108354#(= 0 main_~p8~0)} assume !(0 != ~p4~0); {108354#(= 0 main_~p8~0)} is VALID [2020-07-17 22:26:33,991 INFO L280 TraceCheckUtils]: 22: Hoare triple {108354#(= 0 main_~p8~0)} assume !(0 != ~p5~0); {108354#(= 0 main_~p8~0)} is VALID [2020-07-17 22:26:33,991 INFO L280 TraceCheckUtils]: 23: Hoare triple {108354#(= 0 main_~p8~0)} assume !(0 != ~p6~0); {108354#(= 0 main_~p8~0)} is VALID [2020-07-17 22:26:33,992 INFO L280 TraceCheckUtils]: 24: Hoare triple {108354#(= 0 main_~p8~0)} assume !(0 != ~p7~0); {108354#(= 0 main_~p8~0)} is VALID [2020-07-17 22:26:33,992 INFO L280 TraceCheckUtils]: 25: Hoare triple {108354#(= 0 main_~p8~0)} assume 0 != ~p8~0; {108351#false} is VALID [2020-07-17 22:26:33,993 INFO L280 TraceCheckUtils]: 26: Hoare triple {108351#false} assume 1 != ~lk8~0; {108351#false} is VALID [2020-07-17 22:26:33,993 INFO L280 TraceCheckUtils]: 27: Hoare triple {108351#false} assume !false; {108351#false} is VALID [2020-07-17 22:26:33,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:33,994 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611773039] [2020-07-17 22:26:33,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:33,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:33,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715598119] [2020-07-17 22:26:33,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-07-17 22:26:33,995 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:33,995 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:34,016 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:34,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:34,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:34,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:34,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:34,017 INFO L87 Difference]: Start difference. First operand 4168 states and 5830 transitions. Second operand 3 states. [2020-07-17 22:26:39,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:39,894 INFO L93 Difference]: Finished difference Result 12108 states and 16712 transitions. [2020-07-17 22:26:39,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:39,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-07-17 22:26:39,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:39,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:39,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2020-07-17 22:26:39,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:39,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2020-07-17 22:26:39,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 189 transitions. [2020-07-17 22:26:40,083 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:42,455 INFO L225 Difference]: With dead ends: 12108 [2020-07-17 22:26:42,456 INFO L226 Difference]: Without dead ends: 8074 [2020-07-17 22:26:42,462 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:42,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8074 states. [2020-07-17 22:26:44,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8074 to 8072. [2020-07-17 22:26:44,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:44,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8074 states. Second operand 8072 states. [2020-07-17 22:26:44,099 INFO L74 IsIncluded]: Start isIncluded. First operand 8074 states. Second operand 8072 states. [2020-07-17 22:26:44,099 INFO L87 Difference]: Start difference. First operand 8074 states. Second operand 8072 states. [2020-07-17 22:26:46,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:46,090 INFO L93 Difference]: Finished difference Result 8074 states and 10887 transitions. [2020-07-17 22:26:46,090 INFO L276 IsEmpty]: Start isEmpty. Operand 8074 states and 10887 transitions. [2020-07-17 22:26:46,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:46,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:46,097 INFO L74 IsIncluded]: Start isIncluded. First operand 8072 states. Second operand 8074 states. [2020-07-17 22:26:46,097 INFO L87 Difference]: Start difference. First operand 8072 states. Second operand 8074 states. [2020-07-17 22:26:48,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:48,104 INFO L93 Difference]: Finished difference Result 8074 states and 10887 transitions. [2020-07-17 22:26:48,104 INFO L276 IsEmpty]: Start isEmpty. Operand 8074 states and 10887 transitions. [2020-07-17 22:26:48,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:48,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:48,110 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:48,110 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:48,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8072 states. [2020-07-17 22:26:50,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 10886 transitions. [2020-07-17 22:26:50,106 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 10886 transitions. Word has length 28 [2020-07-17 22:26:50,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:50,106 INFO L479 AbstractCegarLoop]: Abstraction has 8072 states and 10886 transitions. [2020-07-17 22:26:50,106 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:50,106 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 10886 transitions. [2020-07-17 22:26:50,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-17 22:26:50,109 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:50,109 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:50,109 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-07-17 22:26:50,110 INFO L427 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:50,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:50,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1974158089, now seen corresponding path program 1 times [2020-07-17 22:26:50,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:50,111 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555807491] [2020-07-17 22:26:50,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:50,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:50,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:50,143 INFO L280 TraceCheckUtils]: 0: Hoare triple {145339#true} assume true; {145339#true} is VALID [2020-07-17 22:26:50,143 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {145339#true} {145339#true} #214#return; {145339#true} is VALID [2020-07-17 22:26:50,143 INFO L263 TraceCheckUtils]: 0: Hoare triple {145339#true} call ULTIMATE.init(); {145339#true} is VALID [2020-07-17 22:26:50,144 INFO L280 TraceCheckUtils]: 1: Hoare triple {145339#true} assume true; {145339#true} is VALID [2020-07-17 22:26:50,144 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {145339#true} {145339#true} #214#return; {145339#true} is VALID [2020-07-17 22:26:50,144 INFO L263 TraceCheckUtils]: 3: Hoare triple {145339#true} call #t~ret12 := main(); {145339#true} is VALID [2020-07-17 22:26:50,144 INFO L280 TraceCheckUtils]: 4: Hoare triple {145339#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;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {145339#true} is VALID [2020-07-17 22:26:50,144 INFO L280 TraceCheckUtils]: 5: Hoare triple {145339#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {145339#true} is VALID [2020-07-17 22:26:50,145 INFO L280 TraceCheckUtils]: 6: Hoare triple {145339#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;~lk11~0 := 0; {145339#true} is VALID [2020-07-17 22:26:50,145 INFO L280 TraceCheckUtils]: 7: Hoare triple {145339#true} assume !(0 != ~p1~0); {145339#true} is VALID [2020-07-17 22:26:50,145 INFO L280 TraceCheckUtils]: 8: Hoare triple {145339#true} assume !(0 != ~p2~0); {145339#true} is VALID [2020-07-17 22:26:50,145 INFO L280 TraceCheckUtils]: 9: Hoare triple {145339#true} assume !(0 != ~p3~0); {145339#true} is VALID [2020-07-17 22:26:50,145 INFO L280 TraceCheckUtils]: 10: Hoare triple {145339#true} assume !(0 != ~p4~0); {145339#true} is VALID [2020-07-17 22:26:50,145 INFO L280 TraceCheckUtils]: 11: Hoare triple {145339#true} assume !(0 != ~p5~0); {145339#true} is VALID [2020-07-17 22:26:50,146 INFO L280 TraceCheckUtils]: 12: Hoare triple {145339#true} assume !(0 != ~p6~0); {145339#true} is VALID [2020-07-17 22:26:50,146 INFO L280 TraceCheckUtils]: 13: Hoare triple {145339#true} assume !(0 != ~p7~0); {145339#true} is VALID [2020-07-17 22:26:50,147 INFO L280 TraceCheckUtils]: 14: Hoare triple {145339#true} assume 0 != ~p8~0;~lk8~0 := 1; {145343#(= 1 main_~lk8~0)} is VALID [2020-07-17 22:26:50,147 INFO L280 TraceCheckUtils]: 15: Hoare triple {145343#(= 1 main_~lk8~0)} assume 0 != ~p9~0;~lk9~0 := 1; {145343#(= 1 main_~lk8~0)} is VALID [2020-07-17 22:26:50,148 INFO L280 TraceCheckUtils]: 16: Hoare triple {145343#(= 1 main_~lk8~0)} assume 0 != ~p10~0;~lk10~0 := 1; {145343#(= 1 main_~lk8~0)} is VALID [2020-07-17 22:26:50,148 INFO L280 TraceCheckUtils]: 17: Hoare triple {145343#(= 1 main_~lk8~0)} assume 0 != ~p11~0;~lk11~0 := 1; {145343#(= 1 main_~lk8~0)} is VALID [2020-07-17 22:26:50,149 INFO L280 TraceCheckUtils]: 18: Hoare triple {145343#(= 1 main_~lk8~0)} assume !(0 != ~p1~0); {145343#(= 1 main_~lk8~0)} is VALID [2020-07-17 22:26:50,149 INFO L280 TraceCheckUtils]: 19: Hoare triple {145343#(= 1 main_~lk8~0)} assume !(0 != ~p2~0); {145343#(= 1 main_~lk8~0)} is VALID [2020-07-17 22:26:50,149 INFO L280 TraceCheckUtils]: 20: Hoare triple {145343#(= 1 main_~lk8~0)} assume !(0 != ~p3~0); {145343#(= 1 main_~lk8~0)} is VALID [2020-07-17 22:26:50,150 INFO L280 TraceCheckUtils]: 21: Hoare triple {145343#(= 1 main_~lk8~0)} assume !(0 != ~p4~0); {145343#(= 1 main_~lk8~0)} is VALID [2020-07-17 22:26:50,150 INFO L280 TraceCheckUtils]: 22: Hoare triple {145343#(= 1 main_~lk8~0)} assume !(0 != ~p5~0); {145343#(= 1 main_~lk8~0)} is VALID [2020-07-17 22:26:50,151 INFO L280 TraceCheckUtils]: 23: Hoare triple {145343#(= 1 main_~lk8~0)} assume !(0 != ~p6~0); {145343#(= 1 main_~lk8~0)} is VALID [2020-07-17 22:26:50,151 INFO L280 TraceCheckUtils]: 24: Hoare triple {145343#(= 1 main_~lk8~0)} assume !(0 != ~p7~0); {145343#(= 1 main_~lk8~0)} is VALID [2020-07-17 22:26:50,152 INFO L280 TraceCheckUtils]: 25: Hoare triple {145343#(= 1 main_~lk8~0)} assume 0 != ~p8~0; {145343#(= 1 main_~lk8~0)} is VALID [2020-07-17 22:26:50,152 INFO L280 TraceCheckUtils]: 26: Hoare triple {145343#(= 1 main_~lk8~0)} assume 1 != ~lk8~0; {145340#false} is VALID [2020-07-17 22:26:50,152 INFO L280 TraceCheckUtils]: 27: Hoare triple {145340#false} assume !false; {145340#false} is VALID [2020-07-17 22:26:50,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:50,154 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555807491] [2020-07-17 22:26:50,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:50,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:50,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957965006] [2020-07-17 22:26:50,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-07-17 22:26:50,155 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:50,155 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:50,180 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:50,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:50,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:50,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:50,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:50,181 INFO L87 Difference]: Start difference. First operand 8072 states and 10886 transitions. Second operand 3 states. [2020-07-17 22:26:55,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:55,152 INFO L93 Difference]: Finished difference Result 9100 states and 12680 transitions. [2020-07-17 22:26:55,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:55,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-07-17 22:26:55,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:55,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:55,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2020-07-17 22:26:55,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:55,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2020-07-17 22:26:55,155 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 111 transitions. [2020-07-17 22:26:55,264 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:58,238 INFO L225 Difference]: With dead ends: 9100 [2020-07-17 22:26:58,238 INFO L226 Difference]: Without dead ends: 9098 [2020-07-17 22:26:58,240 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:58,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9098 states. [2020-07-17 22:27:00,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9098 to 8072. [2020-07-17 22:27:00,017 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:27:00,017 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9098 states. Second operand 8072 states. [2020-07-17 22:27:00,018 INFO L74 IsIncluded]: Start isIncluded. First operand 9098 states. Second operand 8072 states. [2020-07-17 22:27:00,018 INFO L87 Difference]: Start difference. First operand 9098 states. Second operand 8072 states. [2020-07-17 22:27:02,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:02,302 INFO L93 Difference]: Finished difference Result 9098 states and 12551 transitions. [2020-07-17 22:27:02,302 INFO L276 IsEmpty]: Start isEmpty. Operand 9098 states and 12551 transitions. [2020-07-17 22:27:02,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:27:02,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:27:02,307 INFO L74 IsIncluded]: Start isIncluded. First operand 8072 states. Second operand 9098 states. [2020-07-17 22:27:02,307 INFO L87 Difference]: Start difference. First operand 8072 states. Second operand 9098 states. [2020-07-17 22:27:04,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:04,833 INFO L93 Difference]: Finished difference Result 9098 states and 12551 transitions. [2020-07-17 22:27:04,833 INFO L276 IsEmpty]: Start isEmpty. Operand 9098 states and 12551 transitions. [2020-07-17 22:27:04,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:27:04,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:27:04,839 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:27:04,839 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:27:04,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8072 states. [2020-07-17 22:27:06,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 10758 transitions. [2020-07-17 22:27:06,930 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 10758 transitions. Word has length 28 [2020-07-17 22:27:06,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:27:06,931 INFO L479 AbstractCegarLoop]: Abstraction has 8072 states and 10758 transitions. [2020-07-17 22:27:06,931 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:27:06,931 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 10758 transitions. [2020-07-17 22:27:06,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-17 22:27:06,935 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:27:06,935 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:27:06,935 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-07-17 22:27:06,936 INFO L427 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:27:06,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:27:06,936 INFO L82 PathProgramCache]: Analyzing trace with hash -210289620, now seen corresponding path program 1 times [2020-07-17 22:27:06,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:27:06,937 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591580044] [2020-07-17 22:27:06,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:27:06,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:06,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:06,987 INFO L280 TraceCheckUtils]: 0: Hoare triple {181368#true} assume true; {181368#true} is VALID [2020-07-17 22:27:06,988 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {181368#true} {181368#true} #214#return; {181368#true} is VALID [2020-07-17 22:27:06,988 INFO L263 TraceCheckUtils]: 0: Hoare triple {181368#true} call ULTIMATE.init(); {181368#true} is VALID [2020-07-17 22:27:06,988 INFO L280 TraceCheckUtils]: 1: Hoare triple {181368#true} assume true; {181368#true} is VALID [2020-07-17 22:27:06,988 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {181368#true} {181368#true} #214#return; {181368#true} is VALID [2020-07-17 22:27:06,988 INFO L263 TraceCheckUtils]: 3: Hoare triple {181368#true} call #t~ret12 := main(); {181368#true} is VALID [2020-07-17 22:27:06,988 INFO L280 TraceCheckUtils]: 4: Hoare triple {181368#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;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {181368#true} is VALID [2020-07-17 22:27:06,988 INFO L280 TraceCheckUtils]: 5: Hoare triple {181368#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {181368#true} is VALID [2020-07-17 22:27:06,989 INFO L280 TraceCheckUtils]: 6: Hoare triple {181368#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;~lk11~0 := 0; {181368#true} is VALID [2020-07-17 22:27:06,989 INFO L280 TraceCheckUtils]: 7: Hoare triple {181368#true} assume !(0 != ~p1~0); {181368#true} is VALID [2020-07-17 22:27:06,989 INFO L280 TraceCheckUtils]: 8: Hoare triple {181368#true} assume !(0 != ~p2~0); {181368#true} is VALID [2020-07-17 22:27:06,989 INFO L280 TraceCheckUtils]: 9: Hoare triple {181368#true} assume !(0 != ~p3~0); {181368#true} is VALID [2020-07-17 22:27:06,989 INFO L280 TraceCheckUtils]: 10: Hoare triple {181368#true} assume !(0 != ~p4~0); {181368#true} is VALID [2020-07-17 22:27:06,989 INFO L280 TraceCheckUtils]: 11: Hoare triple {181368#true} assume !(0 != ~p5~0); {181368#true} is VALID [2020-07-17 22:27:06,989 INFO L280 TraceCheckUtils]: 12: Hoare triple {181368#true} assume !(0 != ~p6~0); {181368#true} is VALID [2020-07-17 22:27:06,989 INFO L280 TraceCheckUtils]: 13: Hoare triple {181368#true} assume !(0 != ~p7~0); {181368#true} is VALID [2020-07-17 22:27:06,990 INFO L280 TraceCheckUtils]: 14: Hoare triple {181368#true} assume !(0 != ~p8~0); {181368#true} is VALID [2020-07-17 22:27:06,990 INFO L280 TraceCheckUtils]: 15: Hoare triple {181368#true} assume 0 != ~p9~0;~lk9~0 := 1; {181372#(= 1 main_~lk9~0)} is VALID [2020-07-17 22:27:06,992 INFO L280 TraceCheckUtils]: 16: Hoare triple {181372#(= 1 main_~lk9~0)} assume 0 != ~p10~0;~lk10~0 := 1; {181372#(= 1 main_~lk9~0)} is VALID [2020-07-17 22:27:06,992 INFO L280 TraceCheckUtils]: 17: Hoare triple {181372#(= 1 main_~lk9~0)} assume 0 != ~p11~0;~lk11~0 := 1; {181372#(= 1 main_~lk9~0)} is VALID [2020-07-17 22:27:06,993 INFO L280 TraceCheckUtils]: 18: Hoare triple {181372#(= 1 main_~lk9~0)} assume !(0 != ~p1~0); {181372#(= 1 main_~lk9~0)} is VALID [2020-07-17 22:27:06,994 INFO L280 TraceCheckUtils]: 19: Hoare triple {181372#(= 1 main_~lk9~0)} assume !(0 != ~p2~0); {181372#(= 1 main_~lk9~0)} is VALID [2020-07-17 22:27:06,995 INFO L280 TraceCheckUtils]: 20: Hoare triple {181372#(= 1 main_~lk9~0)} assume !(0 != ~p3~0); {181372#(= 1 main_~lk9~0)} is VALID [2020-07-17 22:27:06,995 INFO L280 TraceCheckUtils]: 21: Hoare triple {181372#(= 1 main_~lk9~0)} assume !(0 != ~p4~0); {181372#(= 1 main_~lk9~0)} is VALID [2020-07-17 22:27:06,996 INFO L280 TraceCheckUtils]: 22: Hoare triple {181372#(= 1 main_~lk9~0)} assume !(0 != ~p5~0); {181372#(= 1 main_~lk9~0)} is VALID [2020-07-17 22:27:06,996 INFO L280 TraceCheckUtils]: 23: Hoare triple {181372#(= 1 main_~lk9~0)} assume !(0 != ~p6~0); {181372#(= 1 main_~lk9~0)} is VALID [2020-07-17 22:27:06,996 INFO L280 TraceCheckUtils]: 24: Hoare triple {181372#(= 1 main_~lk9~0)} assume !(0 != ~p7~0); {181372#(= 1 main_~lk9~0)} is VALID [2020-07-17 22:27:07,004 INFO L280 TraceCheckUtils]: 25: Hoare triple {181372#(= 1 main_~lk9~0)} assume !(0 != ~p8~0); {181372#(= 1 main_~lk9~0)} is VALID [2020-07-17 22:27:07,005 INFO L280 TraceCheckUtils]: 26: Hoare triple {181372#(= 1 main_~lk9~0)} assume 0 != ~p9~0; {181372#(= 1 main_~lk9~0)} is VALID [2020-07-17 22:27:07,007 INFO L280 TraceCheckUtils]: 27: Hoare triple {181372#(= 1 main_~lk9~0)} assume 1 != ~lk9~0; {181369#false} is VALID [2020-07-17 22:27:07,008 INFO L280 TraceCheckUtils]: 28: Hoare triple {181369#false} assume !false; {181369#false} is VALID [2020-07-17 22:27:07,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:27:07,009 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591580044] [2020-07-17 22:27:07,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:27:07,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:27:07,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822123191] [2020-07-17 22:27:07,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-07-17 22:27:07,010 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:27:07,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:27:07,038 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:27:07,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:27:07,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:27:07,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:27:07,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:27:07,038 INFO L87 Difference]: Start difference. First operand 8072 states and 10758 transitions. Second operand 3 states. [2020-07-17 22:27:16,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:16,127 INFO L93 Difference]: Finished difference Result 13708 states and 18568 transitions. [2020-07-17 22:27:16,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:27:16,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-07-17 22:27:16,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:27:16,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:27:16,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2020-07-17 22:27:16,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:27:16,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2020-07-17 22:27:16,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 110 transitions. [2020-07-17 22:27:16,236 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:27:22,890 INFO L225 Difference]: With dead ends: 13708 [2020-07-17 22:27:22,890 INFO L226 Difference]: Without dead ends: 13706 [2020-07-17 22:27:22,892 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:27:22,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13706 states. [2020-07-17 22:27:24,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13706 to 12168. [2020-07-17 22:27:24,717 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:27:24,717 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13706 states. Second operand 12168 states. [2020-07-17 22:27:24,717 INFO L74 IsIncluded]: Start isIncluded. First operand 13706 states. Second operand 12168 states. [2020-07-17 22:27:24,717 INFO L87 Difference]: Start difference. First operand 13706 states. Second operand 12168 states. [2020-07-17 22:27:30,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:30,622 INFO L93 Difference]: Finished difference Result 13706 states and 18311 transitions. [2020-07-17 22:27:30,622 INFO L276 IsEmpty]: Start isEmpty. Operand 13706 states and 18311 transitions. [2020-07-17 22:27:30,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:27:30,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:27:30,635 INFO L74 IsIncluded]: Start isIncluded. First operand 12168 states. Second operand 13706 states. [2020-07-17 22:27:30,635 INFO L87 Difference]: Start difference. First operand 12168 states. Second operand 13706 states. [2020-07-17 22:27:36,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:27:36,531 INFO L93 Difference]: Finished difference Result 13706 states and 18311 transitions. [2020-07-17 22:27:36,531 INFO L276 IsEmpty]: Start isEmpty. Operand 13706 states and 18311 transitions. [2020-07-17 22:27:36,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:27:36,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:27:36,541 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:27:36,541 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:27:36,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12168 states. [2020-07-17 22:27:41,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12168 states to 12168 states and 15750 transitions. [2020-07-17 22:27:41,423 INFO L78 Accepts]: Start accepts. Automaton has 12168 states and 15750 transitions. Word has length 29 [2020-07-17 22:27:41,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:27:41,423 INFO L479 AbstractCegarLoop]: Abstraction has 12168 states and 15750 transitions. [2020-07-17 22:27:41,423 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:27:41,424 INFO L276 IsEmpty]: Start isEmpty. Operand 12168 states and 15750 transitions. [2020-07-17 22:27:41,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-17 22:27:41,430 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:27:41,430 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:27:41,430 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-07-17 22:27:41,430 INFO L427 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:27:41,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:27:41,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1221406870, now seen corresponding path program 1 times [2020-07-17 22:27:41,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:27:41,431 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501244617] [2020-07-17 22:27:41,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:27:41,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:41,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:27:41,455 INFO L280 TraceCheckUtils]: 0: Hoare triple {235445#true} assume true; {235445#true} is VALID [2020-07-17 22:27:41,455 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {235445#true} {235445#true} #214#return; {235445#true} is VALID [2020-07-17 22:27:41,455 INFO L263 TraceCheckUtils]: 0: Hoare triple {235445#true} call ULTIMATE.init(); {235445#true} is VALID [2020-07-17 22:27:41,455 INFO L280 TraceCheckUtils]: 1: Hoare triple {235445#true} assume true; {235445#true} is VALID [2020-07-17 22:27:41,456 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {235445#true} {235445#true} #214#return; {235445#true} is VALID [2020-07-17 22:27:41,456 INFO L263 TraceCheckUtils]: 3: Hoare triple {235445#true} call #t~ret12 := main(); {235445#true} is VALID [2020-07-17 22:27:41,456 INFO L280 TraceCheckUtils]: 4: Hoare triple {235445#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;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {235445#true} is VALID [2020-07-17 22:27:41,456 INFO L280 TraceCheckUtils]: 5: Hoare triple {235445#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {235445#true} is VALID [2020-07-17 22:27:41,456 INFO L280 TraceCheckUtils]: 6: Hoare triple {235445#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;~lk11~0 := 0; {235445#true} is VALID [2020-07-17 22:27:41,457 INFO L280 TraceCheckUtils]: 7: Hoare triple {235445#true} assume !(0 != ~p1~0); {235445#true} is VALID [2020-07-17 22:27:41,457 INFO L280 TraceCheckUtils]: 8: Hoare triple {235445#true} assume !(0 != ~p2~0); {235445#true} is VALID [2020-07-17 22:27:41,457 INFO L280 TraceCheckUtils]: 9: Hoare triple {235445#true} assume !(0 != ~p3~0); {235445#true} is VALID [2020-07-17 22:27:41,457 INFO L280 TraceCheckUtils]: 10: Hoare triple {235445#true} assume !(0 != ~p4~0); {235445#true} is VALID [2020-07-17 22:27:41,457 INFO L280 TraceCheckUtils]: 11: Hoare triple {235445#true} assume !(0 != ~p5~0); {235445#true} is VALID [2020-07-17 22:27:41,457 INFO L280 TraceCheckUtils]: 12: Hoare triple {235445#true} assume !(0 != ~p6~0); {235445#true} is VALID [2020-07-17 22:27:41,458 INFO L280 TraceCheckUtils]: 13: Hoare triple {235445#true} assume !(0 != ~p7~0); {235445#true} is VALID [2020-07-17 22:27:41,458 INFO L280 TraceCheckUtils]: 14: Hoare triple {235445#true} assume !(0 != ~p8~0); {235445#true} is VALID [2020-07-17 22:27:41,459 INFO L280 TraceCheckUtils]: 15: Hoare triple {235445#true} assume !(0 != ~p9~0); {235449#(= 0 main_~p9~0)} is VALID [2020-07-17 22:27:41,459 INFO L280 TraceCheckUtils]: 16: Hoare triple {235449#(= 0 main_~p9~0)} assume 0 != ~p10~0;~lk10~0 := 1; {235449#(= 0 main_~p9~0)} is VALID [2020-07-17 22:27:41,459 INFO L280 TraceCheckUtils]: 17: Hoare triple {235449#(= 0 main_~p9~0)} assume 0 != ~p11~0;~lk11~0 := 1; {235449#(= 0 main_~p9~0)} is VALID [2020-07-17 22:27:41,460 INFO L280 TraceCheckUtils]: 18: Hoare triple {235449#(= 0 main_~p9~0)} assume !(0 != ~p1~0); {235449#(= 0 main_~p9~0)} is VALID [2020-07-17 22:27:41,460 INFO L280 TraceCheckUtils]: 19: Hoare triple {235449#(= 0 main_~p9~0)} assume !(0 != ~p2~0); {235449#(= 0 main_~p9~0)} is VALID [2020-07-17 22:27:41,461 INFO L280 TraceCheckUtils]: 20: Hoare triple {235449#(= 0 main_~p9~0)} assume !(0 != ~p3~0); {235449#(= 0 main_~p9~0)} is VALID [2020-07-17 22:27:41,461 INFO L280 TraceCheckUtils]: 21: Hoare triple {235449#(= 0 main_~p9~0)} assume !(0 != ~p4~0); {235449#(= 0 main_~p9~0)} is VALID [2020-07-17 22:27:41,461 INFO L280 TraceCheckUtils]: 22: Hoare triple {235449#(= 0 main_~p9~0)} assume !(0 != ~p5~0); {235449#(= 0 main_~p9~0)} is VALID [2020-07-17 22:27:41,462 INFO L280 TraceCheckUtils]: 23: Hoare triple {235449#(= 0 main_~p9~0)} assume !(0 != ~p6~0); {235449#(= 0 main_~p9~0)} is VALID [2020-07-17 22:27:41,462 INFO L280 TraceCheckUtils]: 24: Hoare triple {235449#(= 0 main_~p9~0)} assume !(0 != ~p7~0); {235449#(= 0 main_~p9~0)} is VALID [2020-07-17 22:27:41,462 INFO L280 TraceCheckUtils]: 25: Hoare triple {235449#(= 0 main_~p9~0)} assume !(0 != ~p8~0); {235449#(= 0 main_~p9~0)} is VALID [2020-07-17 22:27:41,463 INFO L280 TraceCheckUtils]: 26: Hoare triple {235449#(= 0 main_~p9~0)} assume 0 != ~p9~0; {235446#false} is VALID [2020-07-17 22:27:41,463 INFO L280 TraceCheckUtils]: 27: Hoare triple {235446#false} assume 1 != ~lk9~0; {235446#false} is VALID [2020-07-17 22:27:41,463 INFO L280 TraceCheckUtils]: 28: Hoare triple {235446#false} assume !false; {235446#false} is VALID [2020-07-17 22:27:41,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:27:41,464 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501244617] [2020-07-17 22:27:41,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:27:41,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:27:41,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090477412] [2020-07-17 22:27:41,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-07-17 22:27:41,465 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:27:41,465 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:27:41,505 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:27:41,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:27:41,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:27:41,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:27:41,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:27:41,506 INFO L87 Difference]: Start difference. First operand 12168 states and 15750 transitions. Second operand 3 states. [2020-07-17 22:28:24,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:28:24,486 INFO L93 Difference]: Finished difference Result 27788 states and 35976 transitions. [2020-07-17 22:28:24,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:28:24,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-07-17 22:28:24,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:28:24,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:28:24,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 185 transitions. [2020-07-17 22:28:24,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:28:24,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 185 transitions. [2020-07-17 22:28:24,488 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 185 transitions. [2020-07-17 22:28:24,795 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 185 edges. 185 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:28:34,014 INFO L225 Difference]: With dead ends: 27788 [2020-07-17 22:28:34,014 INFO L226 Difference]: Without dead ends: 15754 [2020-07-17 22:28:34,025 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:28:34,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15754 states. [2020-07-17 22:28:37,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15754 to 15752. [2020-07-17 22:28:37,732 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:28:37,732 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15754 states. Second operand 15752 states. [2020-07-17 22:28:37,733 INFO L74 IsIncluded]: Start isIncluded. First operand 15754 states. Second operand 15752 states. [2020-07-17 22:28:37,733 INFO L87 Difference]: Start difference. First operand 15754 states. Second operand 15752 states. [2020-07-17 22:28:44,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:28:44,937 INFO L93 Difference]: Finished difference Result 15754 states and 19975 transitions. [2020-07-17 22:28:44,937 INFO L276 IsEmpty]: Start isEmpty. Operand 15754 states and 19975 transitions. [2020-07-17 22:28:44,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:28:44,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:28:44,947 INFO L74 IsIncluded]: Start isIncluded. First operand 15752 states. Second operand 15754 states. [2020-07-17 22:28:44,947 INFO L87 Difference]: Start difference. First operand 15752 states. Second operand 15754 states. [2020-07-17 22:28:51,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:28:51,889 INFO L93 Difference]: Finished difference Result 15754 states and 19975 transitions. [2020-07-17 22:28:51,889 INFO L276 IsEmpty]: Start isEmpty. Operand 15754 states and 19975 transitions. [2020-07-17 22:28:51,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:28:51,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:28:51,899 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:28:51,899 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:28:51,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15752 states. [2020-07-17 22:29:00,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15752 states to 15752 states and 19974 transitions. [2020-07-17 22:29:00,835 INFO L78 Accepts]: Start accepts. Automaton has 15752 states and 19974 transitions. Word has length 29 [2020-07-17 22:29:00,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:29:00,835 INFO L479 AbstractCegarLoop]: Abstraction has 15752 states and 19974 transitions. [2020-07-17 22:29:00,835 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:29:00,835 INFO L276 IsEmpty]: Start isEmpty. Operand 15752 states and 19974 transitions. [2020-07-17 22:29:00,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-17 22:29:00,841 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:29:00,842 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:29:00,842 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-07-17 22:29:00,842 INFO L427 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:29:00,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:29:00,843 INFO L82 PathProgramCache]: Analyzing trace with hash 2071172156, now seen corresponding path program 1 times [2020-07-17 22:29:00,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:29:00,843 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701992526] [2020-07-17 22:29:00,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:29:00,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:29:00,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:29:00,886 INFO L280 TraceCheckUtils]: 0: Hoare triple {311794#true} assume true; {311794#true} is VALID [2020-07-17 22:29:00,886 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {311794#true} {311794#true} #214#return; {311794#true} is VALID [2020-07-17 22:29:00,887 INFO L263 TraceCheckUtils]: 0: Hoare triple {311794#true} call ULTIMATE.init(); {311794#true} is VALID [2020-07-17 22:29:00,887 INFO L280 TraceCheckUtils]: 1: Hoare triple {311794#true} assume true; {311794#true} is VALID [2020-07-17 22:29:00,887 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {311794#true} {311794#true} #214#return; {311794#true} is VALID [2020-07-17 22:29:00,887 INFO L263 TraceCheckUtils]: 3: Hoare triple {311794#true} call #t~ret12 := main(); {311794#true} is VALID [2020-07-17 22:29:00,887 INFO L280 TraceCheckUtils]: 4: Hoare triple {311794#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;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {311794#true} is VALID [2020-07-17 22:29:00,888 INFO L280 TraceCheckUtils]: 5: Hoare triple {311794#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {311794#true} is VALID [2020-07-17 22:29:00,888 INFO L280 TraceCheckUtils]: 6: Hoare triple {311794#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;~lk11~0 := 0; {311794#true} is VALID [2020-07-17 22:29:00,888 INFO L280 TraceCheckUtils]: 7: Hoare triple {311794#true} assume !(0 != ~p1~0); {311794#true} is VALID [2020-07-17 22:29:00,888 INFO L280 TraceCheckUtils]: 8: Hoare triple {311794#true} assume !(0 != ~p2~0); {311794#true} is VALID [2020-07-17 22:29:00,888 INFO L280 TraceCheckUtils]: 9: Hoare triple {311794#true} assume !(0 != ~p3~0); {311794#true} is VALID [2020-07-17 22:29:00,889 INFO L280 TraceCheckUtils]: 10: Hoare triple {311794#true} assume !(0 != ~p4~0); {311794#true} is VALID [2020-07-17 22:29:00,889 INFO L280 TraceCheckUtils]: 11: Hoare triple {311794#true} assume !(0 != ~p5~0); {311794#true} is VALID [2020-07-17 22:29:00,889 INFO L280 TraceCheckUtils]: 12: Hoare triple {311794#true} assume !(0 != ~p6~0); {311794#true} is VALID [2020-07-17 22:29:00,889 INFO L280 TraceCheckUtils]: 13: Hoare triple {311794#true} assume !(0 != ~p7~0); {311794#true} is VALID [2020-07-17 22:29:00,889 INFO L280 TraceCheckUtils]: 14: Hoare triple {311794#true} assume !(0 != ~p8~0); {311794#true} is VALID [2020-07-17 22:29:00,890 INFO L280 TraceCheckUtils]: 15: Hoare triple {311794#true} assume 0 != ~p9~0;~lk9~0 := 1; {311798#(not (= 0 main_~p9~0))} is VALID [2020-07-17 22:29:00,890 INFO L280 TraceCheckUtils]: 16: Hoare triple {311798#(not (= 0 main_~p9~0))} assume 0 != ~p10~0;~lk10~0 := 1; {311798#(not (= 0 main_~p9~0))} is VALID [2020-07-17 22:29:00,891 INFO L280 TraceCheckUtils]: 17: Hoare triple {311798#(not (= 0 main_~p9~0))} assume 0 != ~p11~0;~lk11~0 := 1; {311798#(not (= 0 main_~p9~0))} is VALID [2020-07-17 22:29:00,891 INFO L280 TraceCheckUtils]: 18: Hoare triple {311798#(not (= 0 main_~p9~0))} assume !(0 != ~p1~0); {311798#(not (= 0 main_~p9~0))} is VALID [2020-07-17 22:29:00,892 INFO L280 TraceCheckUtils]: 19: Hoare triple {311798#(not (= 0 main_~p9~0))} assume !(0 != ~p2~0); {311798#(not (= 0 main_~p9~0))} is VALID [2020-07-17 22:29:00,892 INFO L280 TraceCheckUtils]: 20: Hoare triple {311798#(not (= 0 main_~p9~0))} assume !(0 != ~p3~0); {311798#(not (= 0 main_~p9~0))} is VALID [2020-07-17 22:29:00,893 INFO L280 TraceCheckUtils]: 21: Hoare triple {311798#(not (= 0 main_~p9~0))} assume !(0 != ~p4~0); {311798#(not (= 0 main_~p9~0))} is VALID [2020-07-17 22:29:00,893 INFO L280 TraceCheckUtils]: 22: Hoare triple {311798#(not (= 0 main_~p9~0))} assume !(0 != ~p5~0); {311798#(not (= 0 main_~p9~0))} is VALID [2020-07-17 22:29:00,894 INFO L280 TraceCheckUtils]: 23: Hoare triple {311798#(not (= 0 main_~p9~0))} assume !(0 != ~p6~0); {311798#(not (= 0 main_~p9~0))} is VALID [2020-07-17 22:29:00,894 INFO L280 TraceCheckUtils]: 24: Hoare triple {311798#(not (= 0 main_~p9~0))} assume !(0 != ~p7~0); {311798#(not (= 0 main_~p9~0))} is VALID [2020-07-17 22:29:00,895 INFO L280 TraceCheckUtils]: 25: Hoare triple {311798#(not (= 0 main_~p9~0))} assume !(0 != ~p8~0); {311798#(not (= 0 main_~p9~0))} is VALID [2020-07-17 22:29:00,895 INFO L280 TraceCheckUtils]: 26: Hoare triple {311798#(not (= 0 main_~p9~0))} assume !(0 != ~p9~0); {311795#false} is VALID [2020-07-17 22:29:00,895 INFO L280 TraceCheckUtils]: 27: Hoare triple {311795#false} assume 0 != ~p10~0; {311795#false} is VALID [2020-07-17 22:29:00,895 INFO L280 TraceCheckUtils]: 28: Hoare triple {311795#false} assume 1 != ~lk10~0; {311795#false} is VALID [2020-07-17 22:29:00,896 INFO L280 TraceCheckUtils]: 29: Hoare triple {311795#false} assume !false; {311795#false} is VALID [2020-07-17 22:29:00,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:29:00,896 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701992526] [2020-07-17 22:29:00,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:29:00,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:29:00,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129560125] [2020-07-17 22:29:00,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-07-17 22:29:00,898 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:29:00,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:29:00,926 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:29:00,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:29:00,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:29:00,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:29:00,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:29:00,927 INFO L87 Difference]: Start difference. First operand 15752 states and 19974 transitions. Second operand 3 states. [2020-07-17 22:29:30,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:29:30,751 INFO L93 Difference]: Finished difference Result 23820 states and 30216 transitions. [2020-07-17 22:29:30,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:29:30,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-07-17 22:29:30,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:29:30,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:29:30,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2020-07-17 22:29:30,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:29:30,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2020-07-17 22:29:30,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 180 transitions. [2020-07-17 22:29:31,013 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:29:41,031 INFO L225 Difference]: With dead ends: 23820 [2020-07-17 22:29:41,031 INFO L226 Difference]: Without dead ends: 16138 [2020-07-17 22:29:41,038 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:29:41,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16138 states. [2020-07-17 22:29:44,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16138 to 16136. [2020-07-17 22:29:44,886 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:29:44,886 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16138 states. Second operand 16136 states. [2020-07-17 22:29:44,886 INFO L74 IsIncluded]: Start isIncluded. First operand 16138 states. Second operand 16136 states. [2020-07-17 22:29:44,886 INFO L87 Difference]: Start difference. First operand 16138 states. Second operand 16136 states. [2020-07-17 22:29:53,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:29:53,318 INFO L93 Difference]: Finished difference Result 16138 states and 20231 transitions. [2020-07-17 22:29:53,318 INFO L276 IsEmpty]: Start isEmpty. Operand 16138 states and 20231 transitions. [2020-07-17 22:29:53,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:29:53,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:29:53,330 INFO L74 IsIncluded]: Start isIncluded. First operand 16136 states. Second operand 16138 states. [2020-07-17 22:29:53,330 INFO L87 Difference]: Start difference. First operand 16136 states. Second operand 16138 states. [2020-07-17 22:30:02,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:02,345 INFO L93 Difference]: Finished difference Result 16138 states and 20231 transitions. [2020-07-17 22:30:02,345 INFO L276 IsEmpty]: Start isEmpty. Operand 16138 states and 20231 transitions. [2020-07-17 22:30:02,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:30:02,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:30:02,356 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:30:02,356 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:30:02,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16136 states. [2020-07-17 22:30:10,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16136 states to 16136 states and 20230 transitions. [2020-07-17 22:30:10,958 INFO L78 Accepts]: Start accepts. Automaton has 16136 states and 20230 transitions. Word has length 30 [2020-07-17 22:30:10,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:30:10,958 INFO L479 AbstractCegarLoop]: Abstraction has 16136 states and 20230 transitions. [2020-07-17 22:30:10,958 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:30:10,958 INFO L276 IsEmpty]: Start isEmpty. Operand 16136 states and 20230 transitions. [2020-07-17 22:30:10,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-17 22:30:10,964 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:30:10,964 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:30:10,964 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-07-17 22:30:10,964 INFO L427 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:30:10,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:30:10,965 INFO L82 PathProgramCache]: Analyzing trace with hash 791308478, now seen corresponding path program 1 times [2020-07-17 22:30:10,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:30:10,966 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413081134] [2020-07-17 22:30:10,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:30:10,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:10,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:30:10,989 INFO L280 TraceCheckUtils]: 0: Hoare triple {385327#true} assume true; {385327#true} is VALID [2020-07-17 22:30:10,989 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {385327#true} {385327#true} #214#return; {385327#true} is VALID [2020-07-17 22:30:10,989 INFO L263 TraceCheckUtils]: 0: Hoare triple {385327#true} call ULTIMATE.init(); {385327#true} is VALID [2020-07-17 22:30:10,989 INFO L280 TraceCheckUtils]: 1: Hoare triple {385327#true} assume true; {385327#true} is VALID [2020-07-17 22:30:10,990 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {385327#true} {385327#true} #214#return; {385327#true} is VALID [2020-07-17 22:30:10,990 INFO L263 TraceCheckUtils]: 3: Hoare triple {385327#true} call #t~ret12 := main(); {385327#true} is VALID [2020-07-17 22:30:10,990 INFO L280 TraceCheckUtils]: 4: Hoare triple {385327#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;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {385327#true} is VALID [2020-07-17 22:30:10,990 INFO L280 TraceCheckUtils]: 5: Hoare triple {385327#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {385327#true} is VALID [2020-07-17 22:30:10,990 INFO L280 TraceCheckUtils]: 6: Hoare triple {385327#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;~lk11~0 := 0; {385327#true} is VALID [2020-07-17 22:30:10,990 INFO L280 TraceCheckUtils]: 7: Hoare triple {385327#true} assume !(0 != ~p1~0); {385327#true} is VALID [2020-07-17 22:30:10,991 INFO L280 TraceCheckUtils]: 8: Hoare triple {385327#true} assume !(0 != ~p2~0); {385327#true} is VALID [2020-07-17 22:30:10,991 INFO L280 TraceCheckUtils]: 9: Hoare triple {385327#true} assume !(0 != ~p3~0); {385327#true} is VALID [2020-07-17 22:30:10,991 INFO L280 TraceCheckUtils]: 10: Hoare triple {385327#true} assume !(0 != ~p4~0); {385327#true} is VALID [2020-07-17 22:30:10,991 INFO L280 TraceCheckUtils]: 11: Hoare triple {385327#true} assume !(0 != ~p5~0); {385327#true} is VALID [2020-07-17 22:30:10,991 INFO L280 TraceCheckUtils]: 12: Hoare triple {385327#true} assume !(0 != ~p6~0); {385327#true} is VALID [2020-07-17 22:30:10,992 INFO L280 TraceCheckUtils]: 13: Hoare triple {385327#true} assume !(0 != ~p7~0); {385327#true} is VALID [2020-07-17 22:30:10,992 INFO L280 TraceCheckUtils]: 14: Hoare triple {385327#true} assume !(0 != ~p8~0); {385327#true} is VALID [2020-07-17 22:30:10,992 INFO L280 TraceCheckUtils]: 15: Hoare triple {385327#true} assume !(0 != ~p9~0); {385327#true} is VALID [2020-07-17 22:30:10,993 INFO L280 TraceCheckUtils]: 16: Hoare triple {385327#true} assume 0 != ~p10~0;~lk10~0 := 1; {385331#(= main_~lk10~0 1)} is VALID [2020-07-17 22:30:10,993 INFO L280 TraceCheckUtils]: 17: Hoare triple {385331#(= main_~lk10~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {385331#(= main_~lk10~0 1)} is VALID [2020-07-17 22:30:10,994 INFO L280 TraceCheckUtils]: 18: Hoare triple {385331#(= main_~lk10~0 1)} assume !(0 != ~p1~0); {385331#(= main_~lk10~0 1)} is VALID [2020-07-17 22:30:10,994 INFO L280 TraceCheckUtils]: 19: Hoare triple {385331#(= main_~lk10~0 1)} assume !(0 != ~p2~0); {385331#(= main_~lk10~0 1)} is VALID [2020-07-17 22:30:10,995 INFO L280 TraceCheckUtils]: 20: Hoare triple {385331#(= main_~lk10~0 1)} assume !(0 != ~p3~0); {385331#(= main_~lk10~0 1)} is VALID [2020-07-17 22:30:10,995 INFO L280 TraceCheckUtils]: 21: Hoare triple {385331#(= main_~lk10~0 1)} assume !(0 != ~p4~0); {385331#(= main_~lk10~0 1)} is VALID [2020-07-17 22:30:10,996 INFO L280 TraceCheckUtils]: 22: Hoare triple {385331#(= main_~lk10~0 1)} assume !(0 != ~p5~0); {385331#(= main_~lk10~0 1)} is VALID [2020-07-17 22:30:10,996 INFO L280 TraceCheckUtils]: 23: Hoare triple {385331#(= main_~lk10~0 1)} assume !(0 != ~p6~0); {385331#(= main_~lk10~0 1)} is VALID [2020-07-17 22:30:10,997 INFO L280 TraceCheckUtils]: 24: Hoare triple {385331#(= main_~lk10~0 1)} assume !(0 != ~p7~0); {385331#(= main_~lk10~0 1)} is VALID [2020-07-17 22:30:10,997 INFO L280 TraceCheckUtils]: 25: Hoare triple {385331#(= main_~lk10~0 1)} assume !(0 != ~p8~0); {385331#(= main_~lk10~0 1)} is VALID [2020-07-17 22:30:10,998 INFO L280 TraceCheckUtils]: 26: Hoare triple {385331#(= main_~lk10~0 1)} assume !(0 != ~p9~0); {385331#(= main_~lk10~0 1)} is VALID [2020-07-17 22:30:10,998 INFO L280 TraceCheckUtils]: 27: Hoare triple {385331#(= main_~lk10~0 1)} assume 0 != ~p10~0; {385331#(= main_~lk10~0 1)} is VALID [2020-07-17 22:30:10,999 INFO L280 TraceCheckUtils]: 28: Hoare triple {385331#(= main_~lk10~0 1)} assume 1 != ~lk10~0; {385328#false} is VALID [2020-07-17 22:30:10,999 INFO L280 TraceCheckUtils]: 29: Hoare triple {385328#false} assume !false; {385328#false} is VALID [2020-07-17 22:30:10,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:30:11,000 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413081134] [2020-07-17 22:30:11,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:30:11,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:30:11,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856204723] [2020-07-17 22:30:11,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-07-17 22:30:11,001 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:30:11,001 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:30:11,031 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:30:11,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:30:11,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:30:11,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:30:11,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:30:11,032 INFO L87 Difference]: Start difference. First operand 16136 states and 20230 transitions. Second operand 3 states. [2020-07-17 22:30:42,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:30:42,392 INFO L93 Difference]: Finished difference Result 26636 states and 33544 transitions. [2020-07-17 22:30:42,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:30:42,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-07-17 22:30:42,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:30:42,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:30:42,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2020-07-17 22:30:42,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:30:42,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2020-07-17 22:30:42,394 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 106 transitions. [2020-07-17 22:30:42,498 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:31:22,157 INFO L225 Difference]: With dead ends: 26636 [2020-07-17 22:31:22,157 INFO L226 Difference]: Without dead ends: 26634 [2020-07-17 22:31:22,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-17 22:31:22,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26634 states. [2020-07-17 22:31:26,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26634 to 24584. [2020-07-17 22:31:26,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:31:26,248 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26634 states. Second operand 24584 states. [2020-07-17 22:31:26,248 INFO L74 IsIncluded]: Start isIncluded. First operand 26634 states. Second operand 24584 states. [2020-07-17 22:31:26,249 INFO L87 Difference]: Start difference. First operand 26634 states. Second operand 24584 states. [2020-07-17 22:32:26,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:32:26,303 INFO L93 Difference]: Finished difference Result 26634 states and 33031 transitions. [2020-07-17 22:32:26,303 INFO L276 IsEmpty]: Start isEmpty. Operand 26634 states and 33031 transitions. [2020-07-17 22:32:26,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:32:26,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:32:26,320 INFO L74 IsIncluded]: Start isIncluded. First operand 24584 states. Second operand 26634 states. [2020-07-17 22:32:26,320 INFO L87 Difference]: Start difference. First operand 24584 states. Second operand 26634 states. [2020-07-17 22:32:50,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:32:50,488 INFO L93 Difference]: Finished difference Result 26634 states and 33031 transitions. [2020-07-17 22:32:50,488 INFO L276 IsEmpty]: Start isEmpty. Operand 26634 states and 33031 transitions. [2020-07-17 22:32:50,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:32:50,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:32:50,503 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:32:50,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:32:50,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24584 states. [2020-07-17 22:33:53,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24584 states to 24584 states and 29958 transitions. [2020-07-17 22:33:53,591 INFO L78 Accepts]: Start accepts. Automaton has 24584 states and 29958 transitions. Word has length 30 [2020-07-17 22:33:53,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:33:53,591 INFO L479 AbstractCegarLoop]: Abstraction has 24584 states and 29958 transitions. [2020-07-17 22:33:53,591 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:33:53,591 INFO L276 IsEmpty]: Start isEmpty. Operand 24584 states and 29958 transitions. [2020-07-17 22:33:53,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-17 22:33:53,607 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:33:53,607 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:33:53,607 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-07-17 22:33:53,607 INFO L427 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:33:53,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:33:53,608 INFO L82 PathProgramCache]: Analyzing trace with hash -219808772, now seen corresponding path program 1 times [2020-07-17 22:33:53,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:33:53,609 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304693476] [2020-07-17 22:33:53,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:33:53,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:53,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:33:53,662 INFO L280 TraceCheckUtils]: 0: Hoare triple {491372#true} assume true; {491372#true} is VALID [2020-07-17 22:33:53,663 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {491372#true} {491372#true} #214#return; {491372#true} is VALID [2020-07-17 22:33:53,663 INFO L263 TraceCheckUtils]: 0: Hoare triple {491372#true} call ULTIMATE.init(); {491372#true} is VALID [2020-07-17 22:33:53,663 INFO L280 TraceCheckUtils]: 1: Hoare triple {491372#true} assume true; {491372#true} is VALID [2020-07-17 22:33:53,663 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {491372#true} {491372#true} #214#return; {491372#true} is VALID [2020-07-17 22:33:53,663 INFO L263 TraceCheckUtils]: 3: Hoare triple {491372#true} call #t~ret12 := main(); {491372#true} is VALID [2020-07-17 22:33:53,664 INFO L280 TraceCheckUtils]: 4: Hoare triple {491372#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;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;havoc ~cond~0; {491372#true} is VALID [2020-07-17 22:33:53,664 INFO L280 TraceCheckUtils]: 5: Hoare triple {491372#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {491372#true} is VALID [2020-07-17 22:33:53,664 INFO L280 TraceCheckUtils]: 6: Hoare triple {491372#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;~lk11~0 := 0; {491372#true} is VALID [2020-07-17 22:33:53,664 INFO L280 TraceCheckUtils]: 7: Hoare triple {491372#true} assume !(0 != ~p1~0); {491372#true} is VALID [2020-07-17 22:33:53,664 INFO L280 TraceCheckUtils]: 8: Hoare triple {491372#true} assume !(0 != ~p2~0); {491372#true} is VALID [2020-07-17 22:33:53,664 INFO L280 TraceCheckUtils]: 9: Hoare triple {491372#true} assume !(0 != ~p3~0); {491372#true} is VALID [2020-07-17 22:33:53,665 INFO L280 TraceCheckUtils]: 10: Hoare triple {491372#true} assume !(0 != ~p4~0); {491372#true} is VALID [2020-07-17 22:33:53,665 INFO L280 TraceCheckUtils]: 11: Hoare triple {491372#true} assume !(0 != ~p5~0); {491372#true} is VALID [2020-07-17 22:33:53,665 INFO L280 TraceCheckUtils]: 12: Hoare triple {491372#true} assume !(0 != ~p6~0); {491372#true} is VALID [2020-07-17 22:33:53,665 INFO L280 TraceCheckUtils]: 13: Hoare triple {491372#true} assume !(0 != ~p7~0); {491372#true} is VALID [2020-07-17 22:33:53,665 INFO L280 TraceCheckUtils]: 14: Hoare triple {491372#true} assume !(0 != ~p8~0); {491372#true} is VALID [2020-07-17 22:33:53,665 INFO L280 TraceCheckUtils]: 15: Hoare triple {491372#true} assume !(0 != ~p9~0); {491372#true} is VALID [2020-07-17 22:33:53,666 INFO L280 TraceCheckUtils]: 16: Hoare triple {491372#true} assume !(0 != ~p10~0); {491376#(= 0 main_~p10~0)} is VALID [2020-07-17 22:33:53,667 INFO L280 TraceCheckUtils]: 17: Hoare triple {491376#(= 0 main_~p10~0)} assume 0 != ~p11~0;~lk11~0 := 1; {491376#(= 0 main_~p10~0)} is VALID [2020-07-17 22:33:53,667 INFO L280 TraceCheckUtils]: 18: Hoare triple {491376#(= 0 main_~p10~0)} assume !(0 != ~p1~0); {491376#(= 0 main_~p10~0)} is VALID [2020-07-17 22:33:53,667 INFO L280 TraceCheckUtils]: 19: Hoare triple {491376#(= 0 main_~p10~0)} assume !(0 != ~p2~0); {491376#(= 0 main_~p10~0)} is VALID [2020-07-17 22:33:53,668 INFO L280 TraceCheckUtils]: 20: Hoare triple {491376#(= 0 main_~p10~0)} assume !(0 != ~p3~0); {491376#(= 0 main_~p10~0)} is VALID [2020-07-17 22:33:53,668 INFO L280 TraceCheckUtils]: 21: Hoare triple {491376#(= 0 main_~p10~0)} assume !(0 != ~p4~0); {491376#(= 0 main_~p10~0)} is VALID [2020-07-17 22:33:53,669 INFO L280 TraceCheckUtils]: 22: Hoare triple {491376#(= 0 main_~p10~0)} assume !(0 != ~p5~0); {491376#(= 0 main_~p10~0)} is VALID [2020-07-17 22:33:53,669 INFO L280 TraceCheckUtils]: 23: Hoare triple {491376#(= 0 main_~p10~0)} assume !(0 != ~p6~0); {491376#(= 0 main_~p10~0)} is VALID [2020-07-17 22:33:53,670 INFO L280 TraceCheckUtils]: 24: Hoare triple {491376#(= 0 main_~p10~0)} assume !(0 != ~p7~0); {491376#(= 0 main_~p10~0)} is VALID [2020-07-17 22:33:53,670 INFO L280 TraceCheckUtils]: 25: Hoare triple {491376#(= 0 main_~p10~0)} assume !(0 != ~p8~0); {491376#(= 0 main_~p10~0)} is VALID [2020-07-17 22:33:53,671 INFO L280 TraceCheckUtils]: 26: Hoare triple {491376#(= 0 main_~p10~0)} assume !(0 != ~p9~0); {491376#(= 0 main_~p10~0)} is VALID [2020-07-17 22:33:53,671 INFO L280 TraceCheckUtils]: 27: Hoare triple {491376#(= 0 main_~p10~0)} assume 0 != ~p10~0; {491373#false} is VALID [2020-07-17 22:33:53,671 INFO L280 TraceCheckUtils]: 28: Hoare triple {491373#false} assume 1 != ~lk10~0; {491373#false} is VALID [2020-07-17 22:33:53,672 INFO L280 TraceCheckUtils]: 29: Hoare triple {491373#false} assume !false; {491373#false} is VALID [2020-07-17 22:33:53,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:33:53,673 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304693476] [2020-07-17 22:33:53,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:33:53,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:33:53,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988809277] [2020-07-17 22:33:53,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-07-17 22:33:53,674 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:33:53,674 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:33:53,699 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:33:53,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:33:53,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:33:53,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:33:53,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:33:53,700 INFO L87 Difference]: Start difference. First operand 24584 states and 29958 transitions. Second operand 3 states. [2020-07-17 22:38:05,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:38:05,604 INFO L93 Difference]: Finished difference Result 55308 states and 66824 transitions. [2020-07-17 22:38:05,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:38:05,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-07-17 22:38:05,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:38:05,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:38:05,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2020-07-17 22:38:05,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:38:05,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2020-07-17 22:38:05,606 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 182 transitions. [2020-07-17 22:38:05,783 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:39:11,618 INFO L225 Difference]: With dead ends: 55308 [2020-07-17 22:39:11,618 INFO L226 Difference]: Without dead ends: 31242 [2020-07-17 22:39:11,639 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:39:11,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31242 states. [2020-07-17 22:39:20,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31242 to 31240. [2020-07-17 22:39:20,079 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:39:20,079 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31242 states. Second operand 31240 states. [2020-07-17 22:39:20,079 INFO L74 IsIncluded]: Start isIncluded. First operand 31242 states. Second operand 31240 states. [2020-07-17 22:39:20,079 INFO L87 Difference]: Start difference. First operand 31242 states. Second operand 31240 states.