/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_8.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 12:21:20,540 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 12:21:20,543 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 12:21:20,563 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 12:21:20,564 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 12:21:20,565 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 12:21:20,567 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 12:21:20,578 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 12:21:20,581 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 12:21:20,584 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 12:21:20,586 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 12:21:20,588 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 12:21:20,588 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 12:21:20,590 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 12:21:20,592 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 12:21:20,593 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 12:21:20,594 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 12:21:20,595 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 12:21:20,596 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 12:21:20,601 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 12:21:20,605 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 12:21:20,609 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 12:21:20,610 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 12:21:20,610 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 12:21:20,612 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 12:21:20,613 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 12:21:20,613 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 12:21:20,615 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 12:21:20,615 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 12:21:20,617 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 12:21:20,617 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 12:21:20,619 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 12:21:20,620 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 12:21:20,621 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 12:21:20,622 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 12:21:20,622 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 12:21:20,623 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 12:21:20,623 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 12:21:20,623 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 12:21:20,624 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 12:21:20,625 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 12:21:20,626 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-08 12:21:20,660 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 12:21:20,661 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 12:21:20,665 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-08 12:21:20,665 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-08 12:21:20,665 INFO L138 SettingsManager]: * Use SBE=true [2020-07-08 12:21:20,665 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 12:21:20,666 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 12:21:20,666 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 12:21:20,666 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 12:21:20,666 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 12:21:20,666 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 12:21:20,667 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 12:21:20,667 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 12:21:20,667 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 12:21:20,667 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 12:21:20,669 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 12:21:20,669 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 12:21:20,670 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 12:21:20,670 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-08 12:21:20,670 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 12:21:20,670 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 12:21:20,670 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:21:20,671 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 12:21:20,671 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-08 12:21:20,671 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-08 12:21:20,671 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-08 12:21:20,671 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-08 12:21:20,672 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 12:21:20,672 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-08 12:21:20,672 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-08 12:21:20,947 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 12:21:20,962 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 12:21:20,967 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 12:21:20,968 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 12:21:20,969 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 12:21:20,969 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_8.c [2020-07-08 12:21:21,049 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f76b53fb/db700ea8798f48bd874886d025035743/FLAG1f13c1747 [2020-07-08 12:21:21,491 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 12:21:21,492 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_8.c [2020-07-08 12:21:21,500 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f76b53fb/db700ea8798f48bd874886d025035743/FLAG1f13c1747 [2020-07-08 12:21:21,869 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f76b53fb/db700ea8798f48bd874886d025035743 [2020-07-08 12:21:21,878 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 12:21:21,879 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 12:21:21,880 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 12:21:21,881 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 12:21:21,884 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 12:21:21,886 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:21:21" (1/1) ... [2020-07-08 12:21:21,889 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5167524d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:21:21, skipping insertion in model container [2020-07-08 12:21:21,890 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:21:21" (1/1) ... [2020-07-08 12:21:21,898 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 12:21:21,920 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 12:21:22,161 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:21:22,168 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 12:21:22,220 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:21:22,234 INFO L208 MainTranslator]: Completed translation [2020-07-08 12:21:22,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:21:22 WrapperNode [2020-07-08 12:21:22,235 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 12:21:22,235 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 12:21:22,236 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 12:21:22,236 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 12:21:22,333 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:21:22" (1/1) ... [2020-07-08 12:21:22,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:21:22" (1/1) ... [2020-07-08 12:21:22,339 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:21:22" (1/1) ... [2020-07-08 12:21:22,339 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:21:22" (1/1) ... [2020-07-08 12:21:22,355 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:21:22" (1/1) ... [2020-07-08 12:21:22,363 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:21:22" (1/1) ... [2020-07-08 12:21:22,365 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:21:22" (1/1) ... [2020-07-08 12:21:22,367 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 12:21:22,367 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 12:21:22,367 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 12:21:22,367 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 12:21:22,368 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:21:22" (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-08 12:21:22,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 12:21:22,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 12:21:22,424 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 12:21:22,425 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 12:21:22,425 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 12:21:22,425 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 12:21:22,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 12:21:22,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 12:21:22,893 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 12:21:22,894 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-08 12:21:22,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:21:22 BoogieIcfgContainer [2020-07-08 12:21:22,898 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 12:21:22,899 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 12:21:22,899 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 12:21:22,903 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 12:21:22,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 12:21:21" (1/3) ... [2020-07-08 12:21:22,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@747c145b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:21:22, skipping insertion in model container [2020-07-08 12:21:22,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:21:22" (2/3) ... [2020-07-08 12:21:22,905 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@747c145b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:21:22, skipping insertion in model container [2020-07-08 12:21:22,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:21:22" (3/3) ... [2020-07-08 12:21:22,907 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2020-07-08 12:21:22,918 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-08 12:21:22,926 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 12:21:22,941 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 12:21:22,963 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 12:21:22,964 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 12:21:22,964 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-08 12:21:22,964 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 12:21:22,964 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 12:21:22,964 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 12:21:22,964 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 12:21:22,965 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 12:21:22,981 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2020-07-08 12:21:22,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-08 12:21:22,988 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:21:22,989 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:21:22,989 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:21:22,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:21:22,995 INFO L82 PathProgramCache]: Analyzing trace with hash 577441593, now seen corresponding path program 1 times [2020-07-08 12:21:23,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:21:23,003 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033254572] [2020-07-08 12:21:23,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:21:23,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:23,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:23,221 INFO L280 TraceCheckUtils]: 0: Hoare triple {41#true} assume true; {41#true} is VALID [2020-07-08 12:21:23,222 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {41#true} {41#true} #163#return; {41#true} is VALID [2020-07-08 12:21:23,224 INFO L263 TraceCheckUtils]: 0: Hoare triple {41#true} call ULTIMATE.init(); {41#true} is VALID [2020-07-08 12:21:23,225 INFO L280 TraceCheckUtils]: 1: Hoare triple {41#true} assume true; {41#true} is VALID [2020-07-08 12:21:23,225 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {41#true} {41#true} #163#return; {41#true} is VALID [2020-07-08 12:21:23,226 INFO L263 TraceCheckUtils]: 3: Hoare triple {41#true} call #t~ret9 := main(); {41#true} is VALID [2020-07-08 12:21:23,226 INFO L280 TraceCheckUtils]: 4: Hoare triple {41#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;havoc ~cond~0; {41#true} is VALID [2020-07-08 12:21:23,227 INFO L280 TraceCheckUtils]: 5: Hoare triple {41#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {41#true} is VALID [2020-07-08 12:21:23,227 INFO L280 TraceCheckUtils]: 6: Hoare triple {41#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; {41#true} is VALID [2020-07-08 12:21:23,232 INFO L280 TraceCheckUtils]: 7: Hoare triple {41#true} assume 0 != ~p1~0;~lk1~0 := 1; {45#(= 1 main_~lk1~0)} is VALID [2020-07-08 12:21:23,233 INFO L280 TraceCheckUtils]: 8: Hoare triple {45#(= 1 main_~lk1~0)} assume 0 != ~p2~0;~lk2~0 := 1; {45#(= 1 main_~lk1~0)} is VALID [2020-07-08 12:21:23,234 INFO L280 TraceCheckUtils]: 9: Hoare triple {45#(= 1 main_~lk1~0)} assume 0 != ~p3~0;~lk3~0 := 1; {45#(= 1 main_~lk1~0)} is VALID [2020-07-08 12:21:23,238 INFO L280 TraceCheckUtils]: 10: Hoare triple {45#(= 1 main_~lk1~0)} assume 0 != ~p4~0;~lk4~0 := 1; {45#(= 1 main_~lk1~0)} is VALID [2020-07-08 12:21:23,239 INFO L280 TraceCheckUtils]: 11: Hoare triple {45#(= 1 main_~lk1~0)} assume 0 != ~p5~0;~lk5~0 := 1; {45#(= 1 main_~lk1~0)} is VALID [2020-07-08 12:21:23,241 INFO L280 TraceCheckUtils]: 12: Hoare triple {45#(= 1 main_~lk1~0)} assume 0 != ~p6~0;~lk6~0 := 1; {45#(= 1 main_~lk1~0)} is VALID [2020-07-08 12:21:23,243 INFO L280 TraceCheckUtils]: 13: Hoare triple {45#(= 1 main_~lk1~0)} assume 0 != ~p7~0;~lk7~0 := 1; {45#(= 1 main_~lk1~0)} is VALID [2020-07-08 12:21:23,244 INFO L280 TraceCheckUtils]: 14: Hoare triple {45#(= 1 main_~lk1~0)} assume !(0 != ~p8~0); {45#(= 1 main_~lk1~0)} is VALID [2020-07-08 12:21:23,245 INFO L280 TraceCheckUtils]: 15: Hoare triple {45#(= 1 main_~lk1~0)} assume 0 != ~p1~0; {45#(= 1 main_~lk1~0)} is VALID [2020-07-08 12:21:23,248 INFO L280 TraceCheckUtils]: 16: Hoare triple {45#(= 1 main_~lk1~0)} assume 1 != ~lk1~0; {42#false} is VALID [2020-07-08 12:21:23,248 INFO L280 TraceCheckUtils]: 17: Hoare triple {42#false} assume !false; {42#false} is VALID [2020-07-08 12:21:23,253 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-08 12:21:23,254 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033254572] [2020-07-08 12:21:23,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:21:23,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:21:23,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110277104] [2020-07-08 12:21:23,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-08 12:21:23,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:21:23,271 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:21:23,315 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:23,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:21:23,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:21:23,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:21:23,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:21:23,327 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2020-07-08 12:21:23,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:23,535 INFO L93 Difference]: Finished difference Result 75 states and 126 transitions. [2020-07-08 12:21:23,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:21:23,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-08 12:21:23,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:21:23,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:23,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2020-07-08 12:21:23,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:23,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2020-07-08 12:21:23,562 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 126 transitions. [2020-07-08 12:21:23,782 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-08 12:21:23,811 INFO L225 Difference]: With dead ends: 75 [2020-07-08 12:21:23,811 INFO L226 Difference]: Without dead ends: 60 [2020-07-08 12:21:23,820 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-08 12:21:23,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-07-08 12:21:23,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2020-07-08 12:21:23,875 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:21:23,876 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 42 states. [2020-07-08 12:21:23,877 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 42 states. [2020-07-08 12:21:23,877 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 42 states. [2020-07-08 12:21:23,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:23,893 INFO L93 Difference]: Finished difference Result 60 states and 104 transitions. [2020-07-08 12:21:23,893 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 104 transitions. [2020-07-08 12:21:23,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:23,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:23,896 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 60 states. [2020-07-08 12:21:23,896 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 60 states. [2020-07-08 12:21:23,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:23,910 INFO L93 Difference]: Finished difference Result 60 states and 104 transitions. [2020-07-08 12:21:23,910 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 104 transitions. [2020-07-08 12:21:23,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:23,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:23,912 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:21:23,912 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:21:23,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-08 12:21:23,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 73 transitions. [2020-07-08 12:21:23,919 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 73 transitions. Word has length 18 [2020-07-08 12:21:23,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:21:23,920 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 73 transitions. [2020-07-08 12:21:23,920 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:21:23,921 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 73 transitions. [2020-07-08 12:21:23,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-08 12:21:23,922 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:21:23,923 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:21:23,923 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 12:21:23,924 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:21:23,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:21:23,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1278506171, now seen corresponding path program 1 times [2020-07-08 12:21:23,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:21:23,925 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686288722] [2020-07-08 12:21:23,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:21:23,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:24,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:24,029 INFO L280 TraceCheckUtils]: 0: Hoare triple {303#true} assume true; {303#true} is VALID [2020-07-08 12:21:24,030 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {303#true} {303#true} #163#return; {303#true} is VALID [2020-07-08 12:21:24,030 INFO L263 TraceCheckUtils]: 0: Hoare triple {303#true} call ULTIMATE.init(); {303#true} is VALID [2020-07-08 12:21:24,030 INFO L280 TraceCheckUtils]: 1: Hoare triple {303#true} assume true; {303#true} is VALID [2020-07-08 12:21:24,031 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {303#true} {303#true} #163#return; {303#true} is VALID [2020-07-08 12:21:24,031 INFO L263 TraceCheckUtils]: 3: Hoare triple {303#true} call #t~ret9 := main(); {303#true} is VALID [2020-07-08 12:21:24,031 INFO L280 TraceCheckUtils]: 4: Hoare triple {303#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;havoc ~cond~0; {303#true} is VALID [2020-07-08 12:21:24,032 INFO L280 TraceCheckUtils]: 5: Hoare triple {303#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {303#true} is VALID [2020-07-08 12:21:24,032 INFO L280 TraceCheckUtils]: 6: Hoare triple {303#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; {303#true} is VALID [2020-07-08 12:21:24,033 INFO L280 TraceCheckUtils]: 7: Hoare triple {303#true} assume !(0 != ~p1~0); {307#(= 0 main_~p1~0)} is VALID [2020-07-08 12:21:24,034 INFO L280 TraceCheckUtils]: 8: Hoare triple {307#(= 0 main_~p1~0)} assume 0 != ~p2~0;~lk2~0 := 1; {307#(= 0 main_~p1~0)} is VALID [2020-07-08 12:21:24,034 INFO L280 TraceCheckUtils]: 9: Hoare triple {307#(= 0 main_~p1~0)} assume 0 != ~p3~0;~lk3~0 := 1; {307#(= 0 main_~p1~0)} is VALID [2020-07-08 12:21:24,035 INFO L280 TraceCheckUtils]: 10: Hoare triple {307#(= 0 main_~p1~0)} assume 0 != ~p4~0;~lk4~0 := 1; {307#(= 0 main_~p1~0)} is VALID [2020-07-08 12:21:24,036 INFO L280 TraceCheckUtils]: 11: Hoare triple {307#(= 0 main_~p1~0)} assume 0 != ~p5~0;~lk5~0 := 1; {307#(= 0 main_~p1~0)} is VALID [2020-07-08 12:21:24,036 INFO L280 TraceCheckUtils]: 12: Hoare triple {307#(= 0 main_~p1~0)} assume 0 != ~p6~0;~lk6~0 := 1; {307#(= 0 main_~p1~0)} is VALID [2020-07-08 12:21:24,037 INFO L280 TraceCheckUtils]: 13: Hoare triple {307#(= 0 main_~p1~0)} assume 0 != ~p7~0;~lk7~0 := 1; {307#(= 0 main_~p1~0)} is VALID [2020-07-08 12:21:24,038 INFO L280 TraceCheckUtils]: 14: Hoare triple {307#(= 0 main_~p1~0)} assume !(0 != ~p8~0); {307#(= 0 main_~p1~0)} is VALID [2020-07-08 12:21:24,039 INFO L280 TraceCheckUtils]: 15: Hoare triple {307#(= 0 main_~p1~0)} assume 0 != ~p1~0; {304#false} is VALID [2020-07-08 12:21:24,039 INFO L280 TraceCheckUtils]: 16: Hoare triple {304#false} assume 1 != ~lk1~0; {304#false} is VALID [2020-07-08 12:21:24,039 INFO L280 TraceCheckUtils]: 17: Hoare triple {304#false} assume !false; {304#false} is VALID [2020-07-08 12:21:24,041 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-08 12:21:24,041 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686288722] [2020-07-08 12:21:24,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:21:24,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:21:24,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142208347] [2020-07-08 12:21:24,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-08 12:21:24,044 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:21:24,044 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:21:24,065 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:24,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:21:24,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:21:24,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:21:24,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:21:24,066 INFO L87 Difference]: Start difference. First operand 42 states and 73 transitions. Second operand 3 states. [2020-07-08 12:21:24,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:24,187 INFO L93 Difference]: Finished difference Result 97 states and 172 transitions. [2020-07-08 12:21:24,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:21:24,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-08 12:21:24,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:21:24,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:24,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2020-07-08 12:21:24,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:24,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2020-07-08 12:21:24,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 155 transitions. [2020-07-08 12:21:24,375 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:24,378 INFO L225 Difference]: With dead ends: 97 [2020-07-08 12:21:24,378 INFO L226 Difference]: Without dead ends: 60 [2020-07-08 12:21:24,379 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-08 12:21:24,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-07-08 12:21:24,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2020-07-08 12:21:24,391 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:21:24,391 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 58 states. [2020-07-08 12:21:24,391 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 58 states. [2020-07-08 12:21:24,391 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 58 states. [2020-07-08 12:21:24,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:24,395 INFO L93 Difference]: Finished difference Result 60 states and 102 transitions. [2020-07-08 12:21:24,395 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 102 transitions. [2020-07-08 12:21:24,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:24,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:24,397 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 60 states. [2020-07-08 12:21:24,397 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 60 states. [2020-07-08 12:21:24,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:24,401 INFO L93 Difference]: Finished difference Result 60 states and 102 transitions. [2020-07-08 12:21:24,401 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 102 transitions. [2020-07-08 12:21:24,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:24,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:24,402 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:21:24,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:21:24,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-07-08 12:21:24,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 101 transitions. [2020-07-08 12:21:24,406 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 101 transitions. Word has length 18 [2020-07-08 12:21:24,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:21:24,407 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 101 transitions. [2020-07-08 12:21:24,407 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:21:24,407 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 101 transitions. [2020-07-08 12:21:24,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-08 12:21:24,408 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:21:24,408 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:21:24,408 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 12:21:24,409 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:21:24,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:21:24,409 INFO L82 PathProgramCache]: Analyzing trace with hash 721034227, now seen corresponding path program 1 times [2020-07-08 12:21:24,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:21:24,410 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355509597] [2020-07-08 12:21:24,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:21:24,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:24,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:24,458 INFO L280 TraceCheckUtils]: 0: Hoare triple {602#true} assume true; {602#true} is VALID [2020-07-08 12:21:24,458 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {602#true} {602#true} #163#return; {602#true} is VALID [2020-07-08 12:21:24,459 INFO L263 TraceCheckUtils]: 0: Hoare triple {602#true} call ULTIMATE.init(); {602#true} is VALID [2020-07-08 12:21:24,459 INFO L280 TraceCheckUtils]: 1: Hoare triple {602#true} assume true; {602#true} is VALID [2020-07-08 12:21:24,459 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {602#true} {602#true} #163#return; {602#true} is VALID [2020-07-08 12:21:24,459 INFO L263 TraceCheckUtils]: 3: Hoare triple {602#true} call #t~ret9 := main(); {602#true} is VALID [2020-07-08 12:21:24,460 INFO L280 TraceCheckUtils]: 4: Hoare triple {602#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;havoc ~cond~0; {602#true} is VALID [2020-07-08 12:21:24,460 INFO L280 TraceCheckUtils]: 5: Hoare triple {602#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {602#true} is VALID [2020-07-08 12:21:24,460 INFO L280 TraceCheckUtils]: 6: Hoare triple {602#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; {602#true} is VALID [2020-07-08 12:21:24,461 INFO L280 TraceCheckUtils]: 7: Hoare triple {602#true} assume 0 != ~p1~0;~lk1~0 := 1; {606#(not (= 0 main_~p1~0))} is VALID [2020-07-08 12:21:24,464 INFO L280 TraceCheckUtils]: 8: Hoare triple {606#(not (= 0 main_~p1~0))} assume 0 != ~p2~0;~lk2~0 := 1; {606#(not (= 0 main_~p1~0))} is VALID [2020-07-08 12:21:24,465 INFO L280 TraceCheckUtils]: 9: Hoare triple {606#(not (= 0 main_~p1~0))} assume 0 != ~p3~0;~lk3~0 := 1; {606#(not (= 0 main_~p1~0))} is VALID [2020-07-08 12:21:24,466 INFO L280 TraceCheckUtils]: 10: Hoare triple {606#(not (= 0 main_~p1~0))} assume 0 != ~p4~0;~lk4~0 := 1; {606#(not (= 0 main_~p1~0))} is VALID [2020-07-08 12:21:24,466 INFO L280 TraceCheckUtils]: 11: Hoare triple {606#(not (= 0 main_~p1~0))} assume 0 != ~p5~0;~lk5~0 := 1; {606#(not (= 0 main_~p1~0))} is VALID [2020-07-08 12:21:24,467 INFO L280 TraceCheckUtils]: 12: Hoare triple {606#(not (= 0 main_~p1~0))} assume 0 != ~p6~0;~lk6~0 := 1; {606#(not (= 0 main_~p1~0))} is VALID [2020-07-08 12:21:24,468 INFO L280 TraceCheckUtils]: 13: Hoare triple {606#(not (= 0 main_~p1~0))} assume 0 != ~p7~0;~lk7~0 := 1; {606#(not (= 0 main_~p1~0))} is VALID [2020-07-08 12:21:24,468 INFO L280 TraceCheckUtils]: 14: Hoare triple {606#(not (= 0 main_~p1~0))} assume !(0 != ~p8~0); {606#(not (= 0 main_~p1~0))} is VALID [2020-07-08 12:21:24,469 INFO L280 TraceCheckUtils]: 15: Hoare triple {606#(not (= 0 main_~p1~0))} assume !(0 != ~p1~0); {603#false} is VALID [2020-07-08 12:21:24,469 INFO L280 TraceCheckUtils]: 16: Hoare triple {603#false} assume 0 != ~p2~0; {603#false} is VALID [2020-07-08 12:21:24,470 INFO L280 TraceCheckUtils]: 17: Hoare triple {603#false} assume 1 != ~lk2~0; {603#false} is VALID [2020-07-08 12:21:24,470 INFO L280 TraceCheckUtils]: 18: Hoare triple {603#false} assume !false; {603#false} is VALID [2020-07-08 12:21:24,471 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-08 12:21:24,471 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355509597] [2020-07-08 12:21:24,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:21:24,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:21:24,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244439623] [2020-07-08 12:21:24,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-08 12:21:24,473 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:21:24,473 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:21:24,493 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:24,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:21:24,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:21:24,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:21:24,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:21:24,494 INFO L87 Difference]: Start difference. First operand 58 states and 101 transitions. Second operand 3 states. [2020-07-08 12:21:24,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:24,607 INFO L93 Difference]: Finished difference Result 90 states and 153 transitions. [2020-07-08 12:21:24,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:21:24,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-08 12:21:24,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:21:24,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:24,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2020-07-08 12:21:24,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:24,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2020-07-08 12:21:24,616 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 150 transitions. [2020-07-08 12:21:24,795 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:24,797 INFO L225 Difference]: With dead ends: 90 [2020-07-08 12:21:24,798 INFO L226 Difference]: Without dead ends: 63 [2020-07-08 12:21:24,799 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-08 12:21:24,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-07-08 12:21:24,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2020-07-08 12:21:24,810 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:21:24,811 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 61 states. [2020-07-08 12:21:24,811 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 61 states. [2020-07-08 12:21:24,811 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 61 states. [2020-07-08 12:21:24,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:24,815 INFO L93 Difference]: Finished difference Result 63 states and 104 transitions. [2020-07-08 12:21:24,815 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 104 transitions. [2020-07-08 12:21:24,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:24,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:24,816 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 63 states. [2020-07-08 12:21:24,816 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 63 states. [2020-07-08 12:21:24,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:24,820 INFO L93 Difference]: Finished difference Result 63 states and 104 transitions. [2020-07-08 12:21:24,820 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 104 transitions. [2020-07-08 12:21:24,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:24,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:24,821 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:21:24,821 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:21:24,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-08 12:21:24,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 103 transitions. [2020-07-08 12:21:24,827 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 103 transitions. Word has length 19 [2020-07-08 12:21:24,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:21:24,828 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 103 transitions. [2020-07-08 12:21:24,828 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:21:24,828 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 103 transitions. [2020-07-08 12:21:24,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-08 12:21:24,829 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:21:24,829 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:21:24,829 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 12:21:24,829 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:21:24,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:21:24,830 INFO L82 PathProgramCache]: Analyzing trace with hash 979199665, now seen corresponding path program 1 times [2020-07-08 12:21:24,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:21:24,830 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539766707] [2020-07-08 12:21:24,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:21:24,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:24,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:24,870 INFO L280 TraceCheckUtils]: 0: Hoare triple {905#true} assume true; {905#true} is VALID [2020-07-08 12:21:24,871 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {905#true} {905#true} #163#return; {905#true} is VALID [2020-07-08 12:21:24,871 INFO L263 TraceCheckUtils]: 0: Hoare triple {905#true} call ULTIMATE.init(); {905#true} is VALID [2020-07-08 12:21:24,871 INFO L280 TraceCheckUtils]: 1: Hoare triple {905#true} assume true; {905#true} is VALID [2020-07-08 12:21:24,872 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {905#true} {905#true} #163#return; {905#true} is VALID [2020-07-08 12:21:24,872 INFO L263 TraceCheckUtils]: 3: Hoare triple {905#true} call #t~ret9 := main(); {905#true} is VALID [2020-07-08 12:21:24,872 INFO L280 TraceCheckUtils]: 4: Hoare triple {905#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;havoc ~cond~0; {905#true} is VALID [2020-07-08 12:21:24,872 INFO L280 TraceCheckUtils]: 5: Hoare triple {905#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {905#true} is VALID [2020-07-08 12:21:24,873 INFO L280 TraceCheckUtils]: 6: Hoare triple {905#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; {905#true} is VALID [2020-07-08 12:21:24,873 INFO L280 TraceCheckUtils]: 7: Hoare triple {905#true} assume !(0 != ~p1~0); {905#true} is VALID [2020-07-08 12:21:24,874 INFO L280 TraceCheckUtils]: 8: Hoare triple {905#true} assume 0 != ~p2~0;~lk2~0 := 1; {909#(= 1 main_~lk2~0)} is VALID [2020-07-08 12:21:24,875 INFO L280 TraceCheckUtils]: 9: Hoare triple {909#(= 1 main_~lk2~0)} assume 0 != ~p3~0;~lk3~0 := 1; {909#(= 1 main_~lk2~0)} is VALID [2020-07-08 12:21:24,875 INFO L280 TraceCheckUtils]: 10: Hoare triple {909#(= 1 main_~lk2~0)} assume 0 != ~p4~0;~lk4~0 := 1; {909#(= 1 main_~lk2~0)} is VALID [2020-07-08 12:21:24,876 INFO L280 TraceCheckUtils]: 11: Hoare triple {909#(= 1 main_~lk2~0)} assume 0 != ~p5~0;~lk5~0 := 1; {909#(= 1 main_~lk2~0)} is VALID [2020-07-08 12:21:24,876 INFO L280 TraceCheckUtils]: 12: Hoare triple {909#(= 1 main_~lk2~0)} assume 0 != ~p6~0;~lk6~0 := 1; {909#(= 1 main_~lk2~0)} is VALID [2020-07-08 12:21:24,877 INFO L280 TraceCheckUtils]: 13: Hoare triple {909#(= 1 main_~lk2~0)} assume 0 != ~p7~0;~lk7~0 := 1; {909#(= 1 main_~lk2~0)} is VALID [2020-07-08 12:21:24,878 INFO L280 TraceCheckUtils]: 14: Hoare triple {909#(= 1 main_~lk2~0)} assume !(0 != ~p8~0); {909#(= 1 main_~lk2~0)} is VALID [2020-07-08 12:21:24,878 INFO L280 TraceCheckUtils]: 15: Hoare triple {909#(= 1 main_~lk2~0)} assume !(0 != ~p1~0); {909#(= 1 main_~lk2~0)} is VALID [2020-07-08 12:21:24,879 INFO L280 TraceCheckUtils]: 16: Hoare triple {909#(= 1 main_~lk2~0)} assume 0 != ~p2~0; {909#(= 1 main_~lk2~0)} is VALID [2020-07-08 12:21:24,880 INFO L280 TraceCheckUtils]: 17: Hoare triple {909#(= 1 main_~lk2~0)} assume 1 != ~lk2~0; {906#false} is VALID [2020-07-08 12:21:24,880 INFO L280 TraceCheckUtils]: 18: Hoare triple {906#false} assume !false; {906#false} is VALID [2020-07-08 12:21:24,881 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-08 12:21:24,881 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539766707] [2020-07-08 12:21:24,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:21:24,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:21:24,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695228283] [2020-07-08 12:21:24,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-08 12:21:24,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:21:24,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:21:24,902 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:24,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:21:24,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:21:24,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:21:24,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:21:24,903 INFO L87 Difference]: Start difference. First operand 61 states and 103 transitions. Second operand 3 states. [2020-07-08 12:21:25,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:25,023 INFO L93 Difference]: Finished difference Result 112 states and 192 transitions. [2020-07-08 12:21:25,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:21:25,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-08 12:21:25,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:21:25,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:25,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2020-07-08 12:21:25,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:25,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2020-07-08 12:21:25,030 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 102 transitions. [2020-07-08 12:21:25,130 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:25,134 INFO L225 Difference]: With dead ends: 112 [2020-07-08 12:21:25,134 INFO L226 Difference]: Without dead ends: 110 [2020-07-08 12:21:25,135 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-08 12:21:25,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-07-08 12:21:25,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 80. [2020-07-08 12:21:25,151 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:21:25,151 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand 80 states. [2020-07-08 12:21:25,151 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 80 states. [2020-07-08 12:21:25,151 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 80 states. [2020-07-08 12:21:25,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:25,157 INFO L93 Difference]: Finished difference Result 110 states and 189 transitions. [2020-07-08 12:21:25,157 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 189 transitions. [2020-07-08 12:21:25,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:25,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:25,158 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 110 states. [2020-07-08 12:21:25,158 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 110 states. [2020-07-08 12:21:25,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:25,164 INFO L93 Difference]: Finished difference Result 110 states and 189 transitions. [2020-07-08 12:21:25,165 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 189 transitions. [2020-07-08 12:21:25,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:25,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:25,166 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:21:25,166 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:21:25,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-07-08 12:21:25,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 136 transitions. [2020-07-08 12:21:25,170 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 136 transitions. Word has length 19 [2020-07-08 12:21:25,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:21:25,170 INFO L479 AbstractCegarLoop]: Abstraction has 80 states and 136 transitions. [2020-07-08 12:21:25,171 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:21:25,171 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 136 transitions. [2020-07-08 12:21:25,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-08 12:21:25,172 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:21:25,172 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:21:25,172 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 12:21:25,172 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:21:25,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:21:25,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1680264243, now seen corresponding path program 1 times [2020-07-08 12:21:25,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:21:25,173 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278621511] [2020-07-08 12:21:25,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:21:25,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:25,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:25,230 INFO L280 TraceCheckUtils]: 0: Hoare triple {1344#true} assume true; {1344#true} is VALID [2020-07-08 12:21:25,230 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1344#true} {1344#true} #163#return; {1344#true} is VALID [2020-07-08 12:21:25,231 INFO L263 TraceCheckUtils]: 0: Hoare triple {1344#true} call ULTIMATE.init(); {1344#true} is VALID [2020-07-08 12:21:25,231 INFO L280 TraceCheckUtils]: 1: Hoare triple {1344#true} assume true; {1344#true} is VALID [2020-07-08 12:21:25,231 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1344#true} {1344#true} #163#return; {1344#true} is VALID [2020-07-08 12:21:25,232 INFO L263 TraceCheckUtils]: 3: Hoare triple {1344#true} call #t~ret9 := main(); {1344#true} is VALID [2020-07-08 12:21:25,232 INFO L280 TraceCheckUtils]: 4: Hoare triple {1344#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;havoc ~cond~0; {1344#true} is VALID [2020-07-08 12:21:25,232 INFO L280 TraceCheckUtils]: 5: Hoare triple {1344#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {1344#true} is VALID [2020-07-08 12:21:25,233 INFO L280 TraceCheckUtils]: 6: Hoare triple {1344#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; {1344#true} is VALID [2020-07-08 12:21:25,233 INFO L280 TraceCheckUtils]: 7: Hoare triple {1344#true} assume !(0 != ~p1~0); {1344#true} is VALID [2020-07-08 12:21:25,234 INFO L280 TraceCheckUtils]: 8: Hoare triple {1344#true} assume !(0 != ~p2~0); {1348#(= 0 main_~p2~0)} is VALID [2020-07-08 12:21:25,234 INFO L280 TraceCheckUtils]: 9: Hoare triple {1348#(= 0 main_~p2~0)} assume 0 != ~p3~0;~lk3~0 := 1; {1348#(= 0 main_~p2~0)} is VALID [2020-07-08 12:21:25,235 INFO L280 TraceCheckUtils]: 10: Hoare triple {1348#(= 0 main_~p2~0)} assume 0 != ~p4~0;~lk4~0 := 1; {1348#(= 0 main_~p2~0)} is VALID [2020-07-08 12:21:25,235 INFO L280 TraceCheckUtils]: 11: Hoare triple {1348#(= 0 main_~p2~0)} assume 0 != ~p5~0;~lk5~0 := 1; {1348#(= 0 main_~p2~0)} is VALID [2020-07-08 12:21:25,236 INFO L280 TraceCheckUtils]: 12: Hoare triple {1348#(= 0 main_~p2~0)} assume 0 != ~p6~0;~lk6~0 := 1; {1348#(= 0 main_~p2~0)} is VALID [2020-07-08 12:21:25,237 INFO L280 TraceCheckUtils]: 13: Hoare triple {1348#(= 0 main_~p2~0)} assume 0 != ~p7~0;~lk7~0 := 1; {1348#(= 0 main_~p2~0)} is VALID [2020-07-08 12:21:25,237 INFO L280 TraceCheckUtils]: 14: Hoare triple {1348#(= 0 main_~p2~0)} assume !(0 != ~p8~0); {1348#(= 0 main_~p2~0)} is VALID [2020-07-08 12:21:25,238 INFO L280 TraceCheckUtils]: 15: Hoare triple {1348#(= 0 main_~p2~0)} assume !(0 != ~p1~0); {1348#(= 0 main_~p2~0)} is VALID [2020-07-08 12:21:25,238 INFO L280 TraceCheckUtils]: 16: Hoare triple {1348#(= 0 main_~p2~0)} assume 0 != ~p2~0; {1345#false} is VALID [2020-07-08 12:21:25,239 INFO L280 TraceCheckUtils]: 17: Hoare triple {1345#false} assume 1 != ~lk2~0; {1345#false} is VALID [2020-07-08 12:21:25,239 INFO L280 TraceCheckUtils]: 18: Hoare triple {1345#false} assume !false; {1345#false} is VALID [2020-07-08 12:21:25,240 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-08 12:21:25,240 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278621511] [2020-07-08 12:21:25,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:21:25,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:21:25,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708997549] [2020-07-08 12:21:25,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-08 12:21:25,241 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:21:25,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:21:25,259 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:25,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:21:25,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:21:25,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:21:25,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:21:25,260 INFO L87 Difference]: Start difference. First operand 80 states and 136 transitions. Second operand 3 states. [2020-07-08 12:21:25,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:25,365 INFO L93 Difference]: Finished difference Result 184 states and 318 transitions. [2020-07-08 12:21:25,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:21:25,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-08 12:21:25,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:21:25,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:25,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2020-07-08 12:21:25,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:25,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2020-07-08 12:21:25,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 152 transitions. [2020-07-08 12:21:25,517 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:25,520 INFO L225 Difference]: With dead ends: 184 [2020-07-08 12:21:25,520 INFO L226 Difference]: Without dead ends: 112 [2020-07-08 12:21:25,521 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-08 12:21:25,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-07-08 12:21:25,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2020-07-08 12:21:25,543 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:21:25,544 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand 110 states. [2020-07-08 12:21:25,544 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 110 states. [2020-07-08 12:21:25,544 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 110 states. [2020-07-08 12:21:25,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:25,551 INFO L93 Difference]: Finished difference Result 112 states and 187 transitions. [2020-07-08 12:21:25,557 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 187 transitions. [2020-07-08 12:21:25,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:25,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:25,558 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 112 states. [2020-07-08 12:21:25,558 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 112 states. [2020-07-08 12:21:25,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:25,563 INFO L93 Difference]: Finished difference Result 112 states and 187 transitions. [2020-07-08 12:21:25,563 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 187 transitions. [2020-07-08 12:21:25,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:25,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:25,564 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:21:25,564 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:21:25,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-07-08 12:21:25,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 186 transitions. [2020-07-08 12:21:25,568 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 186 transitions. Word has length 19 [2020-07-08 12:21:25,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:21:25,572 INFO L479 AbstractCegarLoop]: Abstraction has 110 states and 186 transitions. [2020-07-08 12:21:25,572 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:21:25,572 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 186 transitions. [2020-07-08 12:21:25,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-08 12:21:25,573 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:21:25,573 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:21:25,574 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-08 12:21:25,575 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:21:25,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:21:25,575 INFO L82 PathProgramCache]: Analyzing trace with hash 290632912, now seen corresponding path program 1 times [2020-07-08 12:21:25,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:21:25,576 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585964308] [2020-07-08 12:21:25,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:21:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:25,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:25,657 INFO L280 TraceCheckUtils]: 0: Hoare triple {1893#true} assume true; {1893#true} is VALID [2020-07-08 12:21:25,658 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1893#true} {1893#true} #163#return; {1893#true} is VALID [2020-07-08 12:21:25,658 INFO L263 TraceCheckUtils]: 0: Hoare triple {1893#true} call ULTIMATE.init(); {1893#true} is VALID [2020-07-08 12:21:25,659 INFO L280 TraceCheckUtils]: 1: Hoare triple {1893#true} assume true; {1893#true} is VALID [2020-07-08 12:21:25,659 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1893#true} {1893#true} #163#return; {1893#true} is VALID [2020-07-08 12:21:25,659 INFO L263 TraceCheckUtils]: 3: Hoare triple {1893#true} call #t~ret9 := main(); {1893#true} is VALID [2020-07-08 12:21:25,660 INFO L280 TraceCheckUtils]: 4: Hoare triple {1893#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;havoc ~cond~0; {1893#true} is VALID [2020-07-08 12:21:25,660 INFO L280 TraceCheckUtils]: 5: Hoare triple {1893#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {1893#true} is VALID [2020-07-08 12:21:25,660 INFO L280 TraceCheckUtils]: 6: Hoare triple {1893#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; {1893#true} is VALID [2020-07-08 12:21:25,660 INFO L280 TraceCheckUtils]: 7: Hoare triple {1893#true} assume !(0 != ~p1~0); {1893#true} is VALID [2020-07-08 12:21:25,662 INFO L280 TraceCheckUtils]: 8: Hoare triple {1893#true} assume 0 != ~p2~0;~lk2~0 := 1; {1897#(not (= 0 main_~p2~0))} is VALID [2020-07-08 12:21:25,662 INFO L280 TraceCheckUtils]: 9: Hoare triple {1897#(not (= 0 main_~p2~0))} assume 0 != ~p3~0;~lk3~0 := 1; {1897#(not (= 0 main_~p2~0))} is VALID [2020-07-08 12:21:25,663 INFO L280 TraceCheckUtils]: 10: Hoare triple {1897#(not (= 0 main_~p2~0))} assume 0 != ~p4~0;~lk4~0 := 1; {1897#(not (= 0 main_~p2~0))} is VALID [2020-07-08 12:21:25,663 INFO L280 TraceCheckUtils]: 11: Hoare triple {1897#(not (= 0 main_~p2~0))} assume 0 != ~p5~0;~lk5~0 := 1; {1897#(not (= 0 main_~p2~0))} is VALID [2020-07-08 12:21:25,664 INFO L280 TraceCheckUtils]: 12: Hoare triple {1897#(not (= 0 main_~p2~0))} assume 0 != ~p6~0;~lk6~0 := 1; {1897#(not (= 0 main_~p2~0))} is VALID [2020-07-08 12:21:25,664 INFO L280 TraceCheckUtils]: 13: Hoare triple {1897#(not (= 0 main_~p2~0))} assume 0 != ~p7~0;~lk7~0 := 1; {1897#(not (= 0 main_~p2~0))} is VALID [2020-07-08 12:21:25,665 INFO L280 TraceCheckUtils]: 14: Hoare triple {1897#(not (= 0 main_~p2~0))} assume !(0 != ~p8~0); {1897#(not (= 0 main_~p2~0))} is VALID [2020-07-08 12:21:25,666 INFO L280 TraceCheckUtils]: 15: Hoare triple {1897#(not (= 0 main_~p2~0))} assume !(0 != ~p1~0); {1897#(not (= 0 main_~p2~0))} is VALID [2020-07-08 12:21:25,679 INFO L280 TraceCheckUtils]: 16: Hoare triple {1897#(not (= 0 main_~p2~0))} assume !(0 != ~p2~0); {1894#false} is VALID [2020-07-08 12:21:25,679 INFO L280 TraceCheckUtils]: 17: Hoare triple {1894#false} assume 0 != ~p3~0; {1894#false} is VALID [2020-07-08 12:21:25,680 INFO L280 TraceCheckUtils]: 18: Hoare triple {1894#false} assume 1 != ~lk3~0; {1894#false} is VALID [2020-07-08 12:21:25,680 INFO L280 TraceCheckUtils]: 19: Hoare triple {1894#false} assume !false; {1894#false} is VALID [2020-07-08 12:21:25,681 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-08 12:21:25,682 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585964308] [2020-07-08 12:21:25,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:21:25,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:21:25,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193898380] [2020-07-08 12:21:25,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-08 12:21:25,684 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:21:25,684 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:21:25,702 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:25,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:21:25,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:21:25,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:21:25,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:21:25,703 INFO L87 Difference]: Start difference. First operand 110 states and 186 transitions. Second operand 3 states. [2020-07-08 12:21:25,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:25,801 INFO L93 Difference]: Finished difference Result 165 states and 277 transitions. [2020-07-08 12:21:25,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:21:25,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-08 12:21:25,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:21:25,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:25,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2020-07-08 12:21:25,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:25,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2020-07-08 12:21:25,807 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 147 transitions. [2020-07-08 12:21:25,959 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:25,962 INFO L225 Difference]: With dead ends: 165 [2020-07-08 12:21:25,962 INFO L226 Difference]: Without dead ends: 114 [2020-07-08 12:21:25,963 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-08 12:21:25,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-07-08 12:21:25,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2020-07-08 12:21:25,984 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:21:25,984 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand 112 states. [2020-07-08 12:21:25,984 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 112 states. [2020-07-08 12:21:25,984 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 112 states. [2020-07-08 12:21:25,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:25,989 INFO L93 Difference]: Finished difference Result 114 states and 187 transitions. [2020-07-08 12:21:25,989 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 187 transitions. [2020-07-08 12:21:25,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:25,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:25,989 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 114 states. [2020-07-08 12:21:25,990 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 114 states. [2020-07-08 12:21:25,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:25,994 INFO L93 Difference]: Finished difference Result 114 states and 187 transitions. [2020-07-08 12:21:25,994 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 187 transitions. [2020-07-08 12:21:25,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:25,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:25,995 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:21:25,995 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:21:25,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-07-08 12:21:25,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 186 transitions. [2020-07-08 12:21:25,999 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 186 transitions. Word has length 20 [2020-07-08 12:21:26,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:21:26,000 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 186 transitions. [2020-07-08 12:21:26,000 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:21:26,000 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 186 transitions. [2020-07-08 12:21:26,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-08 12:21:26,001 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:21:26,001 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:21:26,001 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-08 12:21:26,001 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:21:26,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:21:26,002 INFO L82 PathProgramCache]: Analyzing trace with hash 548798350, now seen corresponding path program 1 times [2020-07-08 12:21:26,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:21:26,002 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908920347] [2020-07-08 12:21:26,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:21:26,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:26,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:26,033 INFO L280 TraceCheckUtils]: 0: Hoare triple {2429#true} assume true; {2429#true} is VALID [2020-07-08 12:21:26,033 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2429#true} {2429#true} #163#return; {2429#true} is VALID [2020-07-08 12:21:26,034 INFO L263 TraceCheckUtils]: 0: Hoare triple {2429#true} call ULTIMATE.init(); {2429#true} is VALID [2020-07-08 12:21:26,034 INFO L280 TraceCheckUtils]: 1: Hoare triple {2429#true} assume true; {2429#true} is VALID [2020-07-08 12:21:26,034 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2429#true} {2429#true} #163#return; {2429#true} is VALID [2020-07-08 12:21:26,034 INFO L263 TraceCheckUtils]: 3: Hoare triple {2429#true} call #t~ret9 := main(); {2429#true} is VALID [2020-07-08 12:21:26,035 INFO L280 TraceCheckUtils]: 4: Hoare triple {2429#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;havoc ~cond~0; {2429#true} is VALID [2020-07-08 12:21:26,035 INFO L280 TraceCheckUtils]: 5: Hoare triple {2429#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {2429#true} is VALID [2020-07-08 12:21:26,035 INFO L280 TraceCheckUtils]: 6: Hoare triple {2429#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; {2429#true} is VALID [2020-07-08 12:21:26,035 INFO L280 TraceCheckUtils]: 7: Hoare triple {2429#true} assume !(0 != ~p1~0); {2429#true} is VALID [2020-07-08 12:21:26,036 INFO L280 TraceCheckUtils]: 8: Hoare triple {2429#true} assume !(0 != ~p2~0); {2429#true} is VALID [2020-07-08 12:21:26,037 INFO L280 TraceCheckUtils]: 9: Hoare triple {2429#true} assume 0 != ~p3~0;~lk3~0 := 1; {2433#(= 1 main_~lk3~0)} is VALID [2020-07-08 12:21:26,038 INFO L280 TraceCheckUtils]: 10: Hoare triple {2433#(= 1 main_~lk3~0)} assume 0 != ~p4~0;~lk4~0 := 1; {2433#(= 1 main_~lk3~0)} is VALID [2020-07-08 12:21:26,040 INFO L280 TraceCheckUtils]: 11: Hoare triple {2433#(= 1 main_~lk3~0)} assume 0 != ~p5~0;~lk5~0 := 1; {2433#(= 1 main_~lk3~0)} is VALID [2020-07-08 12:21:26,041 INFO L280 TraceCheckUtils]: 12: Hoare triple {2433#(= 1 main_~lk3~0)} assume 0 != ~p6~0;~lk6~0 := 1; {2433#(= 1 main_~lk3~0)} is VALID [2020-07-08 12:21:26,042 INFO L280 TraceCheckUtils]: 13: Hoare triple {2433#(= 1 main_~lk3~0)} assume 0 != ~p7~0;~lk7~0 := 1; {2433#(= 1 main_~lk3~0)} is VALID [2020-07-08 12:21:26,042 INFO L280 TraceCheckUtils]: 14: Hoare triple {2433#(= 1 main_~lk3~0)} assume !(0 != ~p8~0); {2433#(= 1 main_~lk3~0)} is VALID [2020-07-08 12:21:26,043 INFO L280 TraceCheckUtils]: 15: Hoare triple {2433#(= 1 main_~lk3~0)} assume !(0 != ~p1~0); {2433#(= 1 main_~lk3~0)} is VALID [2020-07-08 12:21:26,043 INFO L280 TraceCheckUtils]: 16: Hoare triple {2433#(= 1 main_~lk3~0)} assume !(0 != ~p2~0); {2433#(= 1 main_~lk3~0)} is VALID [2020-07-08 12:21:26,044 INFO L280 TraceCheckUtils]: 17: Hoare triple {2433#(= 1 main_~lk3~0)} assume 0 != ~p3~0; {2433#(= 1 main_~lk3~0)} is VALID [2020-07-08 12:21:26,045 INFO L280 TraceCheckUtils]: 18: Hoare triple {2433#(= 1 main_~lk3~0)} assume 1 != ~lk3~0; {2430#false} is VALID [2020-07-08 12:21:26,045 INFO L280 TraceCheckUtils]: 19: Hoare triple {2430#false} assume !false; {2430#false} is VALID [2020-07-08 12:21:26,046 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-08 12:21:26,046 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908920347] [2020-07-08 12:21:26,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:21:26,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:21:26,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856164794] [2020-07-08 12:21:26,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-08 12:21:26,047 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:21:26,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:21:26,065 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:26,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:21:26,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:21:26,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:21:26,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:21:26,066 INFO L87 Difference]: Start difference. First operand 112 states and 186 transitions. Second operand 3 states. [2020-07-08 12:21:26,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:26,193 INFO L93 Difference]: Finished difference Result 204 states and 344 transitions. [2020-07-08 12:21:26,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:21:26,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-08 12:21:26,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:21:26,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:26,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2020-07-08 12:21:26,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:26,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2020-07-08 12:21:26,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 98 transitions. [2020-07-08 12:21:26,287 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:26,293 INFO L225 Difference]: With dead ends: 204 [2020-07-08 12:21:26,293 INFO L226 Difference]: Without dead ends: 202 [2020-07-08 12:21:26,293 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-08 12:21:26,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2020-07-08 12:21:26,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 152. [2020-07-08 12:21:26,318 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:21:26,318 INFO L82 GeneralOperation]: Start isEquivalent. First operand 202 states. Second operand 152 states. [2020-07-08 12:21:26,318 INFO L74 IsIncluded]: Start isIncluded. First operand 202 states. Second operand 152 states. [2020-07-08 12:21:26,318 INFO L87 Difference]: Start difference. First operand 202 states. Second operand 152 states. [2020-07-08 12:21:26,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:26,326 INFO L93 Difference]: Finished difference Result 202 states and 339 transitions. [2020-07-08 12:21:26,327 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 339 transitions. [2020-07-08 12:21:26,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:26,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:26,328 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 202 states. [2020-07-08 12:21:26,328 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 202 states. [2020-07-08 12:21:26,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:26,336 INFO L93 Difference]: Finished difference Result 202 states and 339 transitions. [2020-07-08 12:21:26,336 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 339 transitions. [2020-07-08 12:21:26,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:26,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:26,337 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:21:26,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:21:26,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-07-08 12:21:26,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 250 transitions. [2020-07-08 12:21:26,342 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 250 transitions. Word has length 20 [2020-07-08 12:21:26,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:21:26,343 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 250 transitions. [2020-07-08 12:21:26,343 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:21:26,343 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 250 transitions. [2020-07-08 12:21:26,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-08 12:21:26,343 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:21:26,344 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:21:26,344 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-08 12:21:26,344 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:21:26,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:21:26,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1249862928, now seen corresponding path program 1 times [2020-07-08 12:21:26,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:21:26,345 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438111505] [2020-07-08 12:21:26,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:21:26,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:26,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:26,372 INFO L280 TraceCheckUtils]: 0: Hoare triple {3222#true} assume true; {3222#true} is VALID [2020-07-08 12:21:26,372 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3222#true} {3222#true} #163#return; {3222#true} is VALID [2020-07-08 12:21:26,373 INFO L263 TraceCheckUtils]: 0: Hoare triple {3222#true} call ULTIMATE.init(); {3222#true} is VALID [2020-07-08 12:21:26,373 INFO L280 TraceCheckUtils]: 1: Hoare triple {3222#true} assume true; {3222#true} is VALID [2020-07-08 12:21:26,373 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3222#true} {3222#true} #163#return; {3222#true} is VALID [2020-07-08 12:21:26,374 INFO L263 TraceCheckUtils]: 3: Hoare triple {3222#true} call #t~ret9 := main(); {3222#true} is VALID [2020-07-08 12:21:26,382 INFO L280 TraceCheckUtils]: 4: Hoare triple {3222#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;havoc ~cond~0; {3222#true} is VALID [2020-07-08 12:21:26,382 INFO L280 TraceCheckUtils]: 5: Hoare triple {3222#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {3222#true} is VALID [2020-07-08 12:21:26,383 INFO L280 TraceCheckUtils]: 6: Hoare triple {3222#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; {3222#true} is VALID [2020-07-08 12:21:26,384 INFO L280 TraceCheckUtils]: 7: Hoare triple {3222#true} assume !(0 != ~p1~0); {3222#true} is VALID [2020-07-08 12:21:26,384 INFO L280 TraceCheckUtils]: 8: Hoare triple {3222#true} assume !(0 != ~p2~0); {3222#true} is VALID [2020-07-08 12:21:26,386 INFO L280 TraceCheckUtils]: 9: Hoare triple {3222#true} assume !(0 != ~p3~0); {3226#(= 0 main_~p3~0)} is VALID [2020-07-08 12:21:26,391 INFO L280 TraceCheckUtils]: 10: Hoare triple {3226#(= 0 main_~p3~0)} assume 0 != ~p4~0;~lk4~0 := 1; {3226#(= 0 main_~p3~0)} is VALID [2020-07-08 12:21:26,392 INFO L280 TraceCheckUtils]: 11: Hoare triple {3226#(= 0 main_~p3~0)} assume 0 != ~p5~0;~lk5~0 := 1; {3226#(= 0 main_~p3~0)} is VALID [2020-07-08 12:21:26,396 INFO L280 TraceCheckUtils]: 12: Hoare triple {3226#(= 0 main_~p3~0)} assume 0 != ~p6~0;~lk6~0 := 1; {3226#(= 0 main_~p3~0)} is VALID [2020-07-08 12:21:26,397 INFO L280 TraceCheckUtils]: 13: Hoare triple {3226#(= 0 main_~p3~0)} assume 0 != ~p7~0;~lk7~0 := 1; {3226#(= 0 main_~p3~0)} is VALID [2020-07-08 12:21:26,401 INFO L280 TraceCheckUtils]: 14: Hoare triple {3226#(= 0 main_~p3~0)} assume !(0 != ~p8~0); {3226#(= 0 main_~p3~0)} is VALID [2020-07-08 12:21:26,402 INFO L280 TraceCheckUtils]: 15: Hoare triple {3226#(= 0 main_~p3~0)} assume !(0 != ~p1~0); {3226#(= 0 main_~p3~0)} is VALID [2020-07-08 12:21:26,403 INFO L280 TraceCheckUtils]: 16: Hoare triple {3226#(= 0 main_~p3~0)} assume !(0 != ~p2~0); {3226#(= 0 main_~p3~0)} is VALID [2020-07-08 12:21:26,405 INFO L280 TraceCheckUtils]: 17: Hoare triple {3226#(= 0 main_~p3~0)} assume 0 != ~p3~0; {3223#false} is VALID [2020-07-08 12:21:26,405 INFO L280 TraceCheckUtils]: 18: Hoare triple {3223#false} assume 1 != ~lk3~0; {3223#false} is VALID [2020-07-08 12:21:26,405 INFO L280 TraceCheckUtils]: 19: Hoare triple {3223#false} assume !false; {3223#false} is VALID [2020-07-08 12:21:26,406 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-08 12:21:26,407 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438111505] [2020-07-08 12:21:26,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:21:26,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:21:26,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166389177] [2020-07-08 12:21:26,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-08 12:21:26,408 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:21:26,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:21:26,425 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:26,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:21:26,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:21:26,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:21:26,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:21:26,427 INFO L87 Difference]: Start difference. First operand 152 states and 250 transitions. Second operand 3 states. [2020-07-08 12:21:26,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:26,578 INFO L93 Difference]: Finished difference Result 352 states and 584 transitions. [2020-07-08 12:21:26,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:21:26,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-08 12:21:26,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:21:26,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:26,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2020-07-08 12:21:26,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:26,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2020-07-08 12:21:26,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 149 transitions. [2020-07-08 12:21:26,730 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:26,735 INFO L225 Difference]: With dead ends: 352 [2020-07-08 12:21:26,735 INFO L226 Difference]: Without dead ends: 210 [2020-07-08 12:21:26,736 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-08 12:21:26,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2020-07-08 12:21:26,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2020-07-08 12:21:26,769 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:21:26,769 INFO L82 GeneralOperation]: Start isEquivalent. First operand 210 states. Second operand 208 states. [2020-07-08 12:21:26,769 INFO L74 IsIncluded]: Start isIncluded. First operand 210 states. Second operand 208 states. [2020-07-08 12:21:26,770 INFO L87 Difference]: Start difference. First operand 210 states. Second operand 208 states. [2020-07-08 12:21:26,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:26,775 INFO L93 Difference]: Finished difference Result 210 states and 339 transitions. [2020-07-08 12:21:26,775 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 339 transitions. [2020-07-08 12:21:26,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:26,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:26,776 INFO L74 IsIncluded]: Start isIncluded. First operand 208 states. Second operand 210 states. [2020-07-08 12:21:26,777 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 210 states. [2020-07-08 12:21:26,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:26,782 INFO L93 Difference]: Finished difference Result 210 states and 339 transitions. [2020-07-08 12:21:26,782 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 339 transitions. [2020-07-08 12:21:26,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:26,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:26,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:21:26,783 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:21:26,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2020-07-08 12:21:26,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 338 transitions. [2020-07-08 12:21:26,788 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 338 transitions. Word has length 20 [2020-07-08 12:21:26,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:21:26,789 INFO L479 AbstractCegarLoop]: Abstraction has 208 states and 338 transitions. [2020-07-08 12:21:26,789 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:21:26,789 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 338 transitions. [2020-07-08 12:21:26,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-08 12:21:26,790 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:21:26,790 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-08 12:21:26,790 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-08 12:21:26,790 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:21:26,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:21:26,791 INFO L82 PathProgramCache]: Analyzing trace with hash -166905624, now seen corresponding path program 1 times [2020-07-08 12:21:26,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:21:26,791 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580781469] [2020-07-08 12:21:26,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:21:26,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:26,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:26,817 INFO L280 TraceCheckUtils]: 0: Hoare triple {4243#true} assume true; {4243#true} is VALID [2020-07-08 12:21:26,818 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {4243#true} {4243#true} #163#return; {4243#true} is VALID [2020-07-08 12:21:26,818 INFO L263 TraceCheckUtils]: 0: Hoare triple {4243#true} call ULTIMATE.init(); {4243#true} is VALID [2020-07-08 12:21:26,818 INFO L280 TraceCheckUtils]: 1: Hoare triple {4243#true} assume true; {4243#true} is VALID [2020-07-08 12:21:26,818 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4243#true} {4243#true} #163#return; {4243#true} is VALID [2020-07-08 12:21:26,819 INFO L263 TraceCheckUtils]: 3: Hoare triple {4243#true} call #t~ret9 := main(); {4243#true} is VALID [2020-07-08 12:21:26,819 INFO L280 TraceCheckUtils]: 4: Hoare triple {4243#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;havoc ~cond~0; {4243#true} is VALID [2020-07-08 12:21:26,819 INFO L280 TraceCheckUtils]: 5: Hoare triple {4243#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {4243#true} is VALID [2020-07-08 12:21:26,820 INFO L280 TraceCheckUtils]: 6: Hoare triple {4243#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; {4243#true} is VALID [2020-07-08 12:21:26,820 INFO L280 TraceCheckUtils]: 7: Hoare triple {4243#true} assume !(0 != ~p1~0); {4243#true} is VALID [2020-07-08 12:21:26,820 INFO L280 TraceCheckUtils]: 8: Hoare triple {4243#true} assume !(0 != ~p2~0); {4243#true} is VALID [2020-07-08 12:21:26,821 INFO L280 TraceCheckUtils]: 9: Hoare triple {4243#true} assume 0 != ~p3~0;~lk3~0 := 1; {4247#(not (= 0 main_~p3~0))} is VALID [2020-07-08 12:21:26,821 INFO L280 TraceCheckUtils]: 10: Hoare triple {4247#(not (= 0 main_~p3~0))} assume 0 != ~p4~0;~lk4~0 := 1; {4247#(not (= 0 main_~p3~0))} is VALID [2020-07-08 12:21:26,822 INFO L280 TraceCheckUtils]: 11: Hoare triple {4247#(not (= 0 main_~p3~0))} assume 0 != ~p5~0;~lk5~0 := 1; {4247#(not (= 0 main_~p3~0))} is VALID [2020-07-08 12:21:26,823 INFO L280 TraceCheckUtils]: 12: Hoare triple {4247#(not (= 0 main_~p3~0))} assume 0 != ~p6~0;~lk6~0 := 1; {4247#(not (= 0 main_~p3~0))} is VALID [2020-07-08 12:21:26,823 INFO L280 TraceCheckUtils]: 13: Hoare triple {4247#(not (= 0 main_~p3~0))} assume 0 != ~p7~0;~lk7~0 := 1; {4247#(not (= 0 main_~p3~0))} is VALID [2020-07-08 12:21:26,824 INFO L280 TraceCheckUtils]: 14: Hoare triple {4247#(not (= 0 main_~p3~0))} assume !(0 != ~p8~0); {4247#(not (= 0 main_~p3~0))} is VALID [2020-07-08 12:21:26,824 INFO L280 TraceCheckUtils]: 15: Hoare triple {4247#(not (= 0 main_~p3~0))} assume !(0 != ~p1~0); {4247#(not (= 0 main_~p3~0))} is VALID [2020-07-08 12:21:26,825 INFO L280 TraceCheckUtils]: 16: Hoare triple {4247#(not (= 0 main_~p3~0))} assume !(0 != ~p2~0); {4247#(not (= 0 main_~p3~0))} is VALID [2020-07-08 12:21:26,826 INFO L280 TraceCheckUtils]: 17: Hoare triple {4247#(not (= 0 main_~p3~0))} assume !(0 != ~p3~0); {4244#false} is VALID [2020-07-08 12:21:26,826 INFO L280 TraceCheckUtils]: 18: Hoare triple {4244#false} assume 0 != ~p4~0; {4244#false} is VALID [2020-07-08 12:21:26,826 INFO L280 TraceCheckUtils]: 19: Hoare triple {4244#false} assume 1 != ~lk4~0; {4244#false} is VALID [2020-07-08 12:21:26,826 INFO L280 TraceCheckUtils]: 20: Hoare triple {4244#false} assume !false; {4244#false} is VALID [2020-07-08 12:21:26,827 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-08 12:21:26,827 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580781469] [2020-07-08 12:21:26,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:21:26,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:21:26,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749297951] [2020-07-08 12:21:26,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-08 12:21:26,829 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:21:26,829 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:21:26,848 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-08 12:21:26,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:21:26,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:21:26,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:21:26,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:21:26,850 INFO L87 Difference]: Start difference. First operand 208 states and 338 transitions. Second operand 3 states. [2020-07-08 12:21:26,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:26,999 INFO L93 Difference]: Finished difference Result 312 states and 504 transitions. [2020-07-08 12:21:26,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:21:26,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-08 12:21:27,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:21:27,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:27,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2020-07-08 12:21:27,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:27,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2020-07-08 12:21:27,004 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 144 transitions. [2020-07-08 12:21:27,133 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:27,139 INFO L225 Difference]: With dead ends: 312 [2020-07-08 12:21:27,139 INFO L226 Difference]: Without dead ends: 214 [2020-07-08 12:21:27,141 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-08 12:21:27,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2020-07-08 12:21:27,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2020-07-08 12:21:27,176 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:21:27,176 INFO L82 GeneralOperation]: Start isEquivalent. First operand 214 states. Second operand 212 states. [2020-07-08 12:21:27,176 INFO L74 IsIncluded]: Start isIncluded. First operand 214 states. Second operand 212 states. [2020-07-08 12:21:27,177 INFO L87 Difference]: Start difference. First operand 214 states. Second operand 212 states. [2020-07-08 12:21:27,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:27,184 INFO L93 Difference]: Finished difference Result 214 states and 339 transitions. [2020-07-08 12:21:27,184 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 339 transitions. [2020-07-08 12:21:27,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:27,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:27,185 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states. Second operand 214 states. [2020-07-08 12:21:27,185 INFO L87 Difference]: Start difference. First operand 212 states. Second operand 214 states. [2020-07-08 12:21:27,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:27,191 INFO L93 Difference]: Finished difference Result 214 states and 339 transitions. [2020-07-08 12:21:27,192 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 339 transitions. [2020-07-08 12:21:27,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:27,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:27,193 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:21:27,193 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:21:27,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-07-08 12:21:27,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 338 transitions. [2020-07-08 12:21:27,200 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 338 transitions. Word has length 21 [2020-07-08 12:21:27,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:21:27,200 INFO L479 AbstractCegarLoop]: Abstraction has 212 states and 338 transitions. [2020-07-08 12:21:27,200 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:21:27,200 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 338 transitions. [2020-07-08 12:21:27,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-08 12:21:27,201 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:21:27,201 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-08 12:21:27,202 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-08 12:21:27,202 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:21:27,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:21:27,202 INFO L82 PathProgramCache]: Analyzing trace with hash 91259814, now seen corresponding path program 1 times [2020-07-08 12:21:27,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:21:27,203 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861444223] [2020-07-08 12:21:27,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:21:27,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:27,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:27,245 INFO L280 TraceCheckUtils]: 0: Hoare triple {5236#true} assume true; {5236#true} is VALID [2020-07-08 12:21:27,246 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {5236#true} {5236#true} #163#return; {5236#true} is VALID [2020-07-08 12:21:27,246 INFO L263 TraceCheckUtils]: 0: Hoare triple {5236#true} call ULTIMATE.init(); {5236#true} is VALID [2020-07-08 12:21:27,246 INFO L280 TraceCheckUtils]: 1: Hoare triple {5236#true} assume true; {5236#true} is VALID [2020-07-08 12:21:27,247 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5236#true} {5236#true} #163#return; {5236#true} is VALID [2020-07-08 12:21:27,247 INFO L263 TraceCheckUtils]: 3: Hoare triple {5236#true} call #t~ret9 := main(); {5236#true} is VALID [2020-07-08 12:21:27,247 INFO L280 TraceCheckUtils]: 4: Hoare triple {5236#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;havoc ~cond~0; {5236#true} is VALID [2020-07-08 12:21:27,247 INFO L280 TraceCheckUtils]: 5: Hoare triple {5236#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {5236#true} is VALID [2020-07-08 12:21:27,248 INFO L280 TraceCheckUtils]: 6: Hoare triple {5236#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; {5236#true} is VALID [2020-07-08 12:21:27,248 INFO L280 TraceCheckUtils]: 7: Hoare triple {5236#true} assume !(0 != ~p1~0); {5236#true} is VALID [2020-07-08 12:21:27,248 INFO L280 TraceCheckUtils]: 8: Hoare triple {5236#true} assume !(0 != ~p2~0); {5236#true} is VALID [2020-07-08 12:21:27,248 INFO L280 TraceCheckUtils]: 9: Hoare triple {5236#true} assume !(0 != ~p3~0); {5236#true} is VALID [2020-07-08 12:21:27,255 INFO L280 TraceCheckUtils]: 10: Hoare triple {5236#true} assume 0 != ~p4~0;~lk4~0 := 1; {5240#(= 1 main_~lk4~0)} is VALID [2020-07-08 12:21:27,256 INFO L280 TraceCheckUtils]: 11: Hoare triple {5240#(= 1 main_~lk4~0)} assume 0 != ~p5~0;~lk5~0 := 1; {5240#(= 1 main_~lk4~0)} is VALID [2020-07-08 12:21:27,257 INFO L280 TraceCheckUtils]: 12: Hoare triple {5240#(= 1 main_~lk4~0)} assume 0 != ~p6~0;~lk6~0 := 1; {5240#(= 1 main_~lk4~0)} is VALID [2020-07-08 12:21:27,257 INFO L280 TraceCheckUtils]: 13: Hoare triple {5240#(= 1 main_~lk4~0)} assume 0 != ~p7~0;~lk7~0 := 1; {5240#(= 1 main_~lk4~0)} is VALID [2020-07-08 12:21:27,258 INFO L280 TraceCheckUtils]: 14: Hoare triple {5240#(= 1 main_~lk4~0)} assume !(0 != ~p8~0); {5240#(= 1 main_~lk4~0)} is VALID [2020-07-08 12:21:27,258 INFO L280 TraceCheckUtils]: 15: Hoare triple {5240#(= 1 main_~lk4~0)} assume !(0 != ~p1~0); {5240#(= 1 main_~lk4~0)} is VALID [2020-07-08 12:21:27,259 INFO L280 TraceCheckUtils]: 16: Hoare triple {5240#(= 1 main_~lk4~0)} assume !(0 != ~p2~0); {5240#(= 1 main_~lk4~0)} is VALID [2020-07-08 12:21:27,259 INFO L280 TraceCheckUtils]: 17: Hoare triple {5240#(= 1 main_~lk4~0)} assume !(0 != ~p3~0); {5240#(= 1 main_~lk4~0)} is VALID [2020-07-08 12:21:27,260 INFO L280 TraceCheckUtils]: 18: Hoare triple {5240#(= 1 main_~lk4~0)} assume 0 != ~p4~0; {5240#(= 1 main_~lk4~0)} is VALID [2020-07-08 12:21:27,261 INFO L280 TraceCheckUtils]: 19: Hoare triple {5240#(= 1 main_~lk4~0)} assume 1 != ~lk4~0; {5237#false} is VALID [2020-07-08 12:21:27,261 INFO L280 TraceCheckUtils]: 20: Hoare triple {5237#false} assume !false; {5237#false} is VALID [2020-07-08 12:21:27,262 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-08 12:21:27,264 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861444223] [2020-07-08 12:21:27,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:21:27,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:21:27,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388702544] [2020-07-08 12:21:27,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-08 12:21:27,265 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:21:27,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:21:27,289 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-08 12:21:27,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:21:27,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:21:27,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:21:27,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:21:27,290 INFO L87 Difference]: Start difference. First operand 212 states and 338 transitions. Second operand 3 states. [2020-07-08 12:21:27,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:27,448 INFO L93 Difference]: Finished difference Result 380 states and 616 transitions. [2020-07-08 12:21:27,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:21:27,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-08 12:21:27,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:21:27,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:27,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2020-07-08 12:21:27,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:27,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2020-07-08 12:21:27,452 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 94 transitions. [2020-07-08 12:21:27,537 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:27,549 INFO L225 Difference]: With dead ends: 380 [2020-07-08 12:21:27,550 INFO L226 Difference]: Without dead ends: 378 [2020-07-08 12:21:27,550 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-08 12:21:27,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2020-07-08 12:21:27,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 296. [2020-07-08 12:21:27,583 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:21:27,584 INFO L82 GeneralOperation]: Start isEquivalent. First operand 378 states. Second operand 296 states. [2020-07-08 12:21:27,584 INFO L74 IsIncluded]: Start isIncluded. First operand 378 states. Second operand 296 states. [2020-07-08 12:21:27,584 INFO L87 Difference]: Start difference. First operand 378 states. Second operand 296 states. [2020-07-08 12:21:27,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:27,596 INFO L93 Difference]: Finished difference Result 378 states and 607 transitions. [2020-07-08 12:21:27,596 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 607 transitions. [2020-07-08 12:21:27,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:27,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:27,597 INFO L74 IsIncluded]: Start isIncluded. First operand 296 states. Second operand 378 states. [2020-07-08 12:21:27,597 INFO L87 Difference]: Start difference. First operand 296 states. Second operand 378 states. [2020-07-08 12:21:27,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:27,608 INFO L93 Difference]: Finished difference Result 378 states and 607 transitions. [2020-07-08 12:21:27,608 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 607 transitions. [2020-07-08 12:21:27,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:27,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:27,609 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:21:27,610 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:21:27,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2020-07-08 12:21:27,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 462 transitions. [2020-07-08 12:21:27,618 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 462 transitions. Word has length 21 [2020-07-08 12:21:27,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:21:27,618 INFO L479 AbstractCegarLoop]: Abstraction has 296 states and 462 transitions. [2020-07-08 12:21:27,618 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:21:27,618 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 462 transitions. [2020-07-08 12:21:27,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-08 12:21:27,619 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:21:27,619 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-08 12:21:27,620 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-08 12:21:27,620 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:21:27,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:21:27,620 INFO L82 PathProgramCache]: Analyzing trace with hash 792324392, now seen corresponding path program 1 times [2020-07-08 12:21:27,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:21:27,621 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452557975] [2020-07-08 12:21:27,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:21:27,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:27,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:27,644 INFO L280 TraceCheckUtils]: 0: Hoare triple {6713#true} assume true; {6713#true} is VALID [2020-07-08 12:21:27,645 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {6713#true} {6713#true} #163#return; {6713#true} is VALID [2020-07-08 12:21:27,645 INFO L263 TraceCheckUtils]: 0: Hoare triple {6713#true} call ULTIMATE.init(); {6713#true} is VALID [2020-07-08 12:21:27,645 INFO L280 TraceCheckUtils]: 1: Hoare triple {6713#true} assume true; {6713#true} is VALID [2020-07-08 12:21:27,646 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {6713#true} {6713#true} #163#return; {6713#true} is VALID [2020-07-08 12:21:27,646 INFO L263 TraceCheckUtils]: 3: Hoare triple {6713#true} call #t~ret9 := main(); {6713#true} is VALID [2020-07-08 12:21:27,646 INFO L280 TraceCheckUtils]: 4: Hoare triple {6713#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;havoc ~cond~0; {6713#true} is VALID [2020-07-08 12:21:27,646 INFO L280 TraceCheckUtils]: 5: Hoare triple {6713#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {6713#true} is VALID [2020-07-08 12:21:27,646 INFO L280 TraceCheckUtils]: 6: Hoare triple {6713#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; {6713#true} is VALID [2020-07-08 12:21:27,647 INFO L280 TraceCheckUtils]: 7: Hoare triple {6713#true} assume !(0 != ~p1~0); {6713#true} is VALID [2020-07-08 12:21:27,647 INFO L280 TraceCheckUtils]: 8: Hoare triple {6713#true} assume !(0 != ~p2~0); {6713#true} is VALID [2020-07-08 12:21:27,647 INFO L280 TraceCheckUtils]: 9: Hoare triple {6713#true} assume !(0 != ~p3~0); {6713#true} is VALID [2020-07-08 12:21:27,648 INFO L280 TraceCheckUtils]: 10: Hoare triple {6713#true} assume !(0 != ~p4~0); {6717#(= 0 main_~p4~0)} is VALID [2020-07-08 12:21:27,648 INFO L280 TraceCheckUtils]: 11: Hoare triple {6717#(= 0 main_~p4~0)} assume 0 != ~p5~0;~lk5~0 := 1; {6717#(= 0 main_~p4~0)} is VALID [2020-07-08 12:21:27,649 INFO L280 TraceCheckUtils]: 12: Hoare triple {6717#(= 0 main_~p4~0)} assume 0 != ~p6~0;~lk6~0 := 1; {6717#(= 0 main_~p4~0)} is VALID [2020-07-08 12:21:27,649 INFO L280 TraceCheckUtils]: 13: Hoare triple {6717#(= 0 main_~p4~0)} assume 0 != ~p7~0;~lk7~0 := 1; {6717#(= 0 main_~p4~0)} is VALID [2020-07-08 12:21:27,650 INFO L280 TraceCheckUtils]: 14: Hoare triple {6717#(= 0 main_~p4~0)} assume !(0 != ~p8~0); {6717#(= 0 main_~p4~0)} is VALID [2020-07-08 12:21:27,651 INFO L280 TraceCheckUtils]: 15: Hoare triple {6717#(= 0 main_~p4~0)} assume !(0 != ~p1~0); {6717#(= 0 main_~p4~0)} is VALID [2020-07-08 12:21:27,651 INFO L280 TraceCheckUtils]: 16: Hoare triple {6717#(= 0 main_~p4~0)} assume !(0 != ~p2~0); {6717#(= 0 main_~p4~0)} is VALID [2020-07-08 12:21:27,652 INFO L280 TraceCheckUtils]: 17: Hoare triple {6717#(= 0 main_~p4~0)} assume !(0 != ~p3~0); {6717#(= 0 main_~p4~0)} is VALID [2020-07-08 12:21:27,652 INFO L280 TraceCheckUtils]: 18: Hoare triple {6717#(= 0 main_~p4~0)} assume 0 != ~p4~0; {6714#false} is VALID [2020-07-08 12:21:27,652 INFO L280 TraceCheckUtils]: 19: Hoare triple {6714#false} assume 1 != ~lk4~0; {6714#false} is VALID [2020-07-08 12:21:27,653 INFO L280 TraceCheckUtils]: 20: Hoare triple {6714#false} assume !false; {6714#false} is VALID [2020-07-08 12:21:27,653 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-08 12:21:27,653 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452557975] [2020-07-08 12:21:27,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:21:27,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:21:27,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447815224] [2020-07-08 12:21:27,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-08 12:21:27,655 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:21:27,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:21:27,675 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-08 12:21:27,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:21:27,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:21:27,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:21:27,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:21:27,676 INFO L87 Difference]: Start difference. First operand 296 states and 462 transitions. Second operand 3 states. [2020-07-08 12:21:27,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:27,852 INFO L93 Difference]: Finished difference Result 684 states and 1072 transitions. [2020-07-08 12:21:27,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:21:27,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-08 12:21:27,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:21:27,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:27,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2020-07-08 12:21:27,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:27,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2020-07-08 12:21:27,858 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 146 transitions. [2020-07-08 12:21:27,996 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:28,011 INFO L225 Difference]: With dead ends: 684 [2020-07-08 12:21:28,012 INFO L226 Difference]: Without dead ends: 402 [2020-07-08 12:21:28,014 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-08 12:21:28,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2020-07-08 12:21:28,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 400. [2020-07-08 12:21:28,077 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:21:28,078 INFO L82 GeneralOperation]: Start isEquivalent. First operand 402 states. Second operand 400 states. [2020-07-08 12:21:28,078 INFO L74 IsIncluded]: Start isIncluded. First operand 402 states. Second operand 400 states. [2020-07-08 12:21:28,078 INFO L87 Difference]: Start difference. First operand 402 states. Second operand 400 states. [2020-07-08 12:21:28,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:28,093 INFO L93 Difference]: Finished difference Result 402 states and 615 transitions. [2020-07-08 12:21:28,093 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 615 transitions. [2020-07-08 12:21:28,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:28,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:28,095 INFO L74 IsIncluded]: Start isIncluded. First operand 400 states. Second operand 402 states. [2020-07-08 12:21:28,095 INFO L87 Difference]: Start difference. First operand 400 states. Second operand 402 states. [2020-07-08 12:21:28,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:28,108 INFO L93 Difference]: Finished difference Result 402 states and 615 transitions. [2020-07-08 12:21:28,108 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 615 transitions. [2020-07-08 12:21:28,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:28,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:28,110 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:21:28,110 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:21:28,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2020-07-08 12:21:28,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 614 transitions. [2020-07-08 12:21:28,124 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 614 transitions. Word has length 21 [2020-07-08 12:21:28,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:21:28,124 INFO L479 AbstractCegarLoop]: Abstraction has 400 states and 614 transitions. [2020-07-08 12:21:28,124 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:21:28,125 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 614 transitions. [2020-07-08 12:21:28,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-08 12:21:28,128 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:21:28,128 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-08 12:21:28,128 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-08 12:21:28,129 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:21:28,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:21:28,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1465698011, now seen corresponding path program 1 times [2020-07-08 12:21:28,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:21:28,129 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178214672] [2020-07-08 12:21:28,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:21:28,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:28,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:28,152 INFO L280 TraceCheckUtils]: 0: Hoare triple {8662#true} assume true; {8662#true} is VALID [2020-07-08 12:21:28,152 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {8662#true} {8662#true} #163#return; {8662#true} is VALID [2020-07-08 12:21:28,153 INFO L263 TraceCheckUtils]: 0: Hoare triple {8662#true} call ULTIMATE.init(); {8662#true} is VALID [2020-07-08 12:21:28,153 INFO L280 TraceCheckUtils]: 1: Hoare triple {8662#true} assume true; {8662#true} is VALID [2020-07-08 12:21:28,153 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {8662#true} {8662#true} #163#return; {8662#true} is VALID [2020-07-08 12:21:28,153 INFO L263 TraceCheckUtils]: 3: Hoare triple {8662#true} call #t~ret9 := main(); {8662#true} is VALID [2020-07-08 12:21:28,153 INFO L280 TraceCheckUtils]: 4: Hoare triple {8662#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;havoc ~cond~0; {8662#true} is VALID [2020-07-08 12:21:28,154 INFO L280 TraceCheckUtils]: 5: Hoare triple {8662#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {8662#true} is VALID [2020-07-08 12:21:28,154 INFO L280 TraceCheckUtils]: 6: Hoare triple {8662#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; {8662#true} is VALID [2020-07-08 12:21:28,154 INFO L280 TraceCheckUtils]: 7: Hoare triple {8662#true} assume !(0 != ~p1~0); {8662#true} is VALID [2020-07-08 12:21:28,154 INFO L280 TraceCheckUtils]: 8: Hoare triple {8662#true} assume !(0 != ~p2~0); {8662#true} is VALID [2020-07-08 12:21:28,155 INFO L280 TraceCheckUtils]: 9: Hoare triple {8662#true} assume !(0 != ~p3~0); {8662#true} is VALID [2020-07-08 12:21:28,155 INFO L280 TraceCheckUtils]: 10: Hoare triple {8662#true} assume 0 != ~p4~0;~lk4~0 := 1; {8666#(not (= 0 main_~p4~0))} is VALID [2020-07-08 12:21:28,156 INFO L280 TraceCheckUtils]: 11: Hoare triple {8666#(not (= 0 main_~p4~0))} assume 0 != ~p5~0;~lk5~0 := 1; {8666#(not (= 0 main_~p4~0))} is VALID [2020-07-08 12:21:28,156 INFO L280 TraceCheckUtils]: 12: Hoare triple {8666#(not (= 0 main_~p4~0))} assume 0 != ~p6~0;~lk6~0 := 1; {8666#(not (= 0 main_~p4~0))} is VALID [2020-07-08 12:21:28,157 INFO L280 TraceCheckUtils]: 13: Hoare triple {8666#(not (= 0 main_~p4~0))} assume 0 != ~p7~0;~lk7~0 := 1; {8666#(not (= 0 main_~p4~0))} is VALID [2020-07-08 12:21:28,158 INFO L280 TraceCheckUtils]: 14: Hoare triple {8666#(not (= 0 main_~p4~0))} assume !(0 != ~p8~0); {8666#(not (= 0 main_~p4~0))} is VALID [2020-07-08 12:21:28,158 INFO L280 TraceCheckUtils]: 15: Hoare triple {8666#(not (= 0 main_~p4~0))} assume !(0 != ~p1~0); {8666#(not (= 0 main_~p4~0))} is VALID [2020-07-08 12:21:28,159 INFO L280 TraceCheckUtils]: 16: Hoare triple {8666#(not (= 0 main_~p4~0))} assume !(0 != ~p2~0); {8666#(not (= 0 main_~p4~0))} is VALID [2020-07-08 12:21:28,159 INFO L280 TraceCheckUtils]: 17: Hoare triple {8666#(not (= 0 main_~p4~0))} assume !(0 != ~p3~0); {8666#(not (= 0 main_~p4~0))} is VALID [2020-07-08 12:21:28,160 INFO L280 TraceCheckUtils]: 18: Hoare triple {8666#(not (= 0 main_~p4~0))} assume !(0 != ~p4~0); {8663#false} is VALID [2020-07-08 12:21:28,160 INFO L280 TraceCheckUtils]: 19: Hoare triple {8663#false} assume 0 != ~p5~0; {8663#false} is VALID [2020-07-08 12:21:28,160 INFO L280 TraceCheckUtils]: 20: Hoare triple {8663#false} assume 1 != ~lk5~0; {8663#false} is VALID [2020-07-08 12:21:28,161 INFO L280 TraceCheckUtils]: 21: Hoare triple {8663#false} assume !false; {8663#false} is VALID [2020-07-08 12:21:28,161 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-08 12:21:28,162 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178214672] [2020-07-08 12:21:28,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:21:28,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:21:28,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196445054] [2020-07-08 12:21:28,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-08 12:21:28,163 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:21:28,163 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:21:28,183 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-08 12:21:28,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:21:28,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:21:28,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:21:28,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:21:28,184 INFO L87 Difference]: Start difference. First operand 400 states and 614 transitions. Second operand 3 states. [2020-07-08 12:21:28,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:28,360 INFO L93 Difference]: Finished difference Result 600 states and 916 transitions. [2020-07-08 12:21:28,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:21:28,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-08 12:21:28,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:21:28,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:28,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2020-07-08 12:21:28,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:28,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2020-07-08 12:21:28,365 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 141 transitions. [2020-07-08 12:21:28,491 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:28,504 INFO L225 Difference]: With dead ends: 600 [2020-07-08 12:21:28,504 INFO L226 Difference]: Without dead ends: 410 [2020-07-08 12:21:28,505 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-08 12:21:28,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2020-07-08 12:21:28,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 408. [2020-07-08 12:21:28,573 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:21:28,573 INFO L82 GeneralOperation]: Start isEquivalent. First operand 410 states. Second operand 408 states. [2020-07-08 12:21:28,573 INFO L74 IsIncluded]: Start isIncluded. First operand 410 states. Second operand 408 states. [2020-07-08 12:21:28,573 INFO L87 Difference]: Start difference. First operand 410 states. Second operand 408 states. [2020-07-08 12:21:28,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:28,588 INFO L93 Difference]: Finished difference Result 410 states and 615 transitions. [2020-07-08 12:21:28,588 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 615 transitions. [2020-07-08 12:21:28,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:28,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:28,589 INFO L74 IsIncluded]: Start isIncluded. First operand 408 states. Second operand 410 states. [2020-07-08 12:21:28,590 INFO L87 Difference]: Start difference. First operand 408 states. Second operand 410 states. [2020-07-08 12:21:28,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:28,606 INFO L93 Difference]: Finished difference Result 410 states and 615 transitions. [2020-07-08 12:21:28,606 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 615 transitions. [2020-07-08 12:21:28,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:28,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:28,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:21:28,608 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:21:28,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2020-07-08 12:21:28,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 614 transitions. [2020-07-08 12:21:28,621 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 614 transitions. Word has length 22 [2020-07-08 12:21:28,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:21:28,622 INFO L479 AbstractCegarLoop]: Abstraction has 408 states and 614 transitions. [2020-07-08 12:21:28,622 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:21:28,622 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 614 transitions. [2020-07-08 12:21:28,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-08 12:21:28,624 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:21:28,624 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-08 12:21:28,625 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-08 12:21:28,625 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:21:28,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:21:28,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1207532573, now seen corresponding path program 1 times [2020-07-08 12:21:28,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:21:28,626 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356802561] [2020-07-08 12:21:28,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:21:28,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:28,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:28,669 INFO L280 TraceCheckUtils]: 0: Hoare triple {10551#true} assume true; {10551#true} is VALID [2020-07-08 12:21:28,669 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {10551#true} {10551#true} #163#return; {10551#true} is VALID [2020-07-08 12:21:28,670 INFO L263 TraceCheckUtils]: 0: Hoare triple {10551#true} call ULTIMATE.init(); {10551#true} is VALID [2020-07-08 12:21:28,670 INFO L280 TraceCheckUtils]: 1: Hoare triple {10551#true} assume true; {10551#true} is VALID [2020-07-08 12:21:28,670 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {10551#true} {10551#true} #163#return; {10551#true} is VALID [2020-07-08 12:21:28,670 INFO L263 TraceCheckUtils]: 3: Hoare triple {10551#true} call #t~ret9 := main(); {10551#true} is VALID [2020-07-08 12:21:28,671 INFO L280 TraceCheckUtils]: 4: Hoare triple {10551#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;havoc ~cond~0; {10551#true} is VALID [2020-07-08 12:21:28,671 INFO L280 TraceCheckUtils]: 5: Hoare triple {10551#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {10551#true} is VALID [2020-07-08 12:21:28,671 INFO L280 TraceCheckUtils]: 6: Hoare triple {10551#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; {10551#true} is VALID [2020-07-08 12:21:28,671 INFO L280 TraceCheckUtils]: 7: Hoare triple {10551#true} assume !(0 != ~p1~0); {10551#true} is VALID [2020-07-08 12:21:28,672 INFO L280 TraceCheckUtils]: 8: Hoare triple {10551#true} assume !(0 != ~p2~0); {10551#true} is VALID [2020-07-08 12:21:28,672 INFO L280 TraceCheckUtils]: 9: Hoare triple {10551#true} assume !(0 != ~p3~0); {10551#true} is VALID [2020-07-08 12:21:28,672 INFO L280 TraceCheckUtils]: 10: Hoare triple {10551#true} assume !(0 != ~p4~0); {10551#true} is VALID [2020-07-08 12:21:28,673 INFO L280 TraceCheckUtils]: 11: Hoare triple {10551#true} assume 0 != ~p5~0;~lk5~0 := 1; {10555#(= 1 main_~lk5~0)} is VALID [2020-07-08 12:21:28,674 INFO L280 TraceCheckUtils]: 12: Hoare triple {10555#(= 1 main_~lk5~0)} assume 0 != ~p6~0;~lk6~0 := 1; {10555#(= 1 main_~lk5~0)} is VALID [2020-07-08 12:21:28,674 INFO L280 TraceCheckUtils]: 13: Hoare triple {10555#(= 1 main_~lk5~0)} assume 0 != ~p7~0;~lk7~0 := 1; {10555#(= 1 main_~lk5~0)} is VALID [2020-07-08 12:21:28,675 INFO L280 TraceCheckUtils]: 14: Hoare triple {10555#(= 1 main_~lk5~0)} assume !(0 != ~p8~0); {10555#(= 1 main_~lk5~0)} is VALID [2020-07-08 12:21:28,676 INFO L280 TraceCheckUtils]: 15: Hoare triple {10555#(= 1 main_~lk5~0)} assume !(0 != ~p1~0); {10555#(= 1 main_~lk5~0)} is VALID [2020-07-08 12:21:28,676 INFO L280 TraceCheckUtils]: 16: Hoare triple {10555#(= 1 main_~lk5~0)} assume !(0 != ~p2~0); {10555#(= 1 main_~lk5~0)} is VALID [2020-07-08 12:21:28,677 INFO L280 TraceCheckUtils]: 17: Hoare triple {10555#(= 1 main_~lk5~0)} assume !(0 != ~p3~0); {10555#(= 1 main_~lk5~0)} is VALID [2020-07-08 12:21:28,677 INFO L280 TraceCheckUtils]: 18: Hoare triple {10555#(= 1 main_~lk5~0)} assume !(0 != ~p4~0); {10555#(= 1 main_~lk5~0)} is VALID [2020-07-08 12:21:28,678 INFO L280 TraceCheckUtils]: 19: Hoare triple {10555#(= 1 main_~lk5~0)} assume 0 != ~p5~0; {10555#(= 1 main_~lk5~0)} is VALID [2020-07-08 12:21:28,679 INFO L280 TraceCheckUtils]: 20: Hoare triple {10555#(= 1 main_~lk5~0)} assume 1 != ~lk5~0; {10552#false} is VALID [2020-07-08 12:21:28,679 INFO L280 TraceCheckUtils]: 21: Hoare triple {10552#false} assume !false; {10552#false} is VALID [2020-07-08 12:21:28,680 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-08 12:21:28,680 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356802561] [2020-07-08 12:21:28,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:21:28,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:21:28,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611730469] [2020-07-08 12:21:28,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-08 12:21:28,682 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:21:28,682 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:21:28,704 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-08 12:21:28,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:21:28,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:21:28,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:21:28,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:21:28,705 INFO L87 Difference]: Start difference. First operand 408 states and 614 transitions. Second operand 3 states. [2020-07-08 12:21:28,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:28,930 INFO L93 Difference]: Finished difference Result 716 states and 1096 transitions. [2020-07-08 12:21:28,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:21:28,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-08 12:21:28,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:21:28,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:28,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2020-07-08 12:21:28,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:28,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2020-07-08 12:21:28,937 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 90 transitions. [2020-07-08 12:21:29,016 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:29,047 INFO L225 Difference]: With dead ends: 716 [2020-07-08 12:21:29,047 INFO L226 Difference]: Without dead ends: 714 [2020-07-08 12:21:29,048 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-08 12:21:29,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2020-07-08 12:21:29,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 584. [2020-07-08 12:21:29,122 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:21:29,122 INFO L82 GeneralOperation]: Start isEquivalent. First operand 714 states. Second operand 584 states. [2020-07-08 12:21:29,122 INFO L74 IsIncluded]: Start isIncluded. First operand 714 states. Second operand 584 states. [2020-07-08 12:21:29,123 INFO L87 Difference]: Start difference. First operand 714 states. Second operand 584 states. [2020-07-08 12:21:29,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:29,151 INFO L93 Difference]: Finished difference Result 714 states and 1079 transitions. [2020-07-08 12:21:29,152 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1079 transitions. [2020-07-08 12:21:29,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:29,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:29,153 INFO L74 IsIncluded]: Start isIncluded. First operand 584 states. Second operand 714 states. [2020-07-08 12:21:29,154 INFO L87 Difference]: Start difference. First operand 584 states. Second operand 714 states. [2020-07-08 12:21:29,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:29,185 INFO L93 Difference]: Finished difference Result 714 states and 1079 transitions. [2020-07-08 12:21:29,185 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1079 transitions. [2020-07-08 12:21:29,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:29,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:29,190 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:21:29,190 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:21:29,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2020-07-08 12:21:29,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 854 transitions. [2020-07-08 12:21:29,211 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 854 transitions. Word has length 22 [2020-07-08 12:21:29,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:21:29,211 INFO L479 AbstractCegarLoop]: Abstraction has 584 states and 854 transitions. [2020-07-08 12:21:29,211 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:21:29,211 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 854 transitions. [2020-07-08 12:21:29,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-08 12:21:29,212 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:21:29,213 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-08 12:21:29,213 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-08 12:21:29,213 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:21:29,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:21:29,214 INFO L82 PathProgramCache]: Analyzing trace with hash -506467995, now seen corresponding path program 1 times [2020-07-08 12:21:29,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:21:29,218 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732693170] [2020-07-08 12:21:29,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:21:29,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:29,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:29,246 INFO L280 TraceCheckUtils]: 0: Hoare triple {13348#true} assume true; {13348#true} is VALID [2020-07-08 12:21:29,246 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {13348#true} {13348#true} #163#return; {13348#true} is VALID [2020-07-08 12:21:29,246 INFO L263 TraceCheckUtils]: 0: Hoare triple {13348#true} call ULTIMATE.init(); {13348#true} is VALID [2020-07-08 12:21:29,247 INFO L280 TraceCheckUtils]: 1: Hoare triple {13348#true} assume true; {13348#true} is VALID [2020-07-08 12:21:29,247 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {13348#true} {13348#true} #163#return; {13348#true} is VALID [2020-07-08 12:21:29,247 INFO L263 TraceCheckUtils]: 3: Hoare triple {13348#true} call #t~ret9 := main(); {13348#true} is VALID [2020-07-08 12:21:29,247 INFO L280 TraceCheckUtils]: 4: Hoare triple {13348#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;havoc ~cond~0; {13348#true} is VALID [2020-07-08 12:21:29,247 INFO L280 TraceCheckUtils]: 5: Hoare triple {13348#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {13348#true} is VALID [2020-07-08 12:21:29,248 INFO L280 TraceCheckUtils]: 6: Hoare triple {13348#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; {13348#true} is VALID [2020-07-08 12:21:29,248 INFO L280 TraceCheckUtils]: 7: Hoare triple {13348#true} assume !(0 != ~p1~0); {13348#true} is VALID [2020-07-08 12:21:29,248 INFO L280 TraceCheckUtils]: 8: Hoare triple {13348#true} assume !(0 != ~p2~0); {13348#true} is VALID [2020-07-08 12:21:29,248 INFO L280 TraceCheckUtils]: 9: Hoare triple {13348#true} assume !(0 != ~p3~0); {13348#true} is VALID [2020-07-08 12:21:29,249 INFO L280 TraceCheckUtils]: 10: Hoare triple {13348#true} assume !(0 != ~p4~0); {13348#true} is VALID [2020-07-08 12:21:29,249 INFO L280 TraceCheckUtils]: 11: Hoare triple {13348#true} assume !(0 != ~p5~0); {13352#(= 0 main_~p5~0)} is VALID [2020-07-08 12:21:29,250 INFO L280 TraceCheckUtils]: 12: Hoare triple {13352#(= 0 main_~p5~0)} assume 0 != ~p6~0;~lk6~0 := 1; {13352#(= 0 main_~p5~0)} is VALID [2020-07-08 12:21:29,251 INFO L280 TraceCheckUtils]: 13: Hoare triple {13352#(= 0 main_~p5~0)} assume 0 != ~p7~0;~lk7~0 := 1; {13352#(= 0 main_~p5~0)} is VALID [2020-07-08 12:21:29,251 INFO L280 TraceCheckUtils]: 14: Hoare triple {13352#(= 0 main_~p5~0)} assume !(0 != ~p8~0); {13352#(= 0 main_~p5~0)} is VALID [2020-07-08 12:21:29,252 INFO L280 TraceCheckUtils]: 15: Hoare triple {13352#(= 0 main_~p5~0)} assume !(0 != ~p1~0); {13352#(= 0 main_~p5~0)} is VALID [2020-07-08 12:21:29,252 INFO L280 TraceCheckUtils]: 16: Hoare triple {13352#(= 0 main_~p5~0)} assume !(0 != ~p2~0); {13352#(= 0 main_~p5~0)} is VALID [2020-07-08 12:21:29,253 INFO L280 TraceCheckUtils]: 17: Hoare triple {13352#(= 0 main_~p5~0)} assume !(0 != ~p3~0); {13352#(= 0 main_~p5~0)} is VALID [2020-07-08 12:21:29,255 INFO L280 TraceCheckUtils]: 18: Hoare triple {13352#(= 0 main_~p5~0)} assume !(0 != ~p4~0); {13352#(= 0 main_~p5~0)} is VALID [2020-07-08 12:21:29,256 INFO L280 TraceCheckUtils]: 19: Hoare triple {13352#(= 0 main_~p5~0)} assume 0 != ~p5~0; {13349#false} is VALID [2020-07-08 12:21:29,256 INFO L280 TraceCheckUtils]: 20: Hoare triple {13349#false} assume 1 != ~lk5~0; {13349#false} is VALID [2020-07-08 12:21:29,256 INFO L280 TraceCheckUtils]: 21: Hoare triple {13349#false} assume !false; {13349#false} is VALID [2020-07-08 12:21:29,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:21:29,258 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732693170] [2020-07-08 12:21:29,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:21:29,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:21:29,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913996544] [2020-07-08 12:21:29,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-08 12:21:29,259 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:21:29,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:21:29,283 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-08 12:21:29,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:21:29,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:21:29,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:21:29,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:21:29,284 INFO L87 Difference]: Start difference. First operand 584 states and 854 transitions. Second operand 3 states. [2020-07-08 12:21:29,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:29,643 INFO L93 Difference]: Finished difference Result 1340 states and 1960 transitions. [2020-07-08 12:21:29,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:21:29,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-08 12:21:29,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:21:29,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:29,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2020-07-08 12:21:29,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:29,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2020-07-08 12:21:29,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 143 transitions. [2020-07-08 12:21:29,772 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:29,811 INFO L225 Difference]: With dead ends: 1340 [2020-07-08 12:21:29,812 INFO L226 Difference]: Without dead ends: 778 [2020-07-08 12:21:29,813 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:21:29,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2020-07-08 12:21:29,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 776. [2020-07-08 12:21:29,965 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:21:29,966 INFO L82 GeneralOperation]: Start isEquivalent. First operand 778 states. Second operand 776 states. [2020-07-08 12:21:29,966 INFO L74 IsIncluded]: Start isIncluded. First operand 778 states. Second operand 776 states. [2020-07-08 12:21:29,966 INFO L87 Difference]: Start difference. First operand 778 states. Second operand 776 states. [2020-07-08 12:21:30,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:30,004 INFO L93 Difference]: Finished difference Result 778 states and 1111 transitions. [2020-07-08 12:21:30,005 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1111 transitions. [2020-07-08 12:21:30,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:30,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:30,006 INFO L74 IsIncluded]: Start isIncluded. First operand 776 states. Second operand 778 states. [2020-07-08 12:21:30,006 INFO L87 Difference]: Start difference. First operand 776 states. Second operand 778 states. [2020-07-08 12:21:30,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:30,045 INFO L93 Difference]: Finished difference Result 778 states and 1111 transitions. [2020-07-08 12:21:30,045 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1111 transitions. [2020-07-08 12:21:30,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:30,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:30,047 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:21:30,047 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:21:30,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-07-08 12:21:30,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1110 transitions. [2020-07-08 12:21:30,088 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1110 transitions. Word has length 22 [2020-07-08 12:21:30,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:21:30,088 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 1110 transitions. [2020-07-08 12:21:30,088 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:21:30,089 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1110 transitions. [2020-07-08 12:21:30,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-08 12:21:30,090 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:21:30,090 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-08 12:21:30,090 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-08 12:21:30,091 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:21:30,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:21:30,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1221411293, now seen corresponding path program 1 times [2020-07-08 12:21:30,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:21:30,091 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504198879] [2020-07-08 12:21:30,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:21:30,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:30,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:30,119 INFO L280 TraceCheckUtils]: 0: Hoare triple {17121#true} assume true; {17121#true} is VALID [2020-07-08 12:21:30,119 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {17121#true} {17121#true} #163#return; {17121#true} is VALID [2020-07-08 12:21:30,119 INFO L263 TraceCheckUtils]: 0: Hoare triple {17121#true} call ULTIMATE.init(); {17121#true} is VALID [2020-07-08 12:21:30,120 INFO L280 TraceCheckUtils]: 1: Hoare triple {17121#true} assume true; {17121#true} is VALID [2020-07-08 12:21:30,120 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {17121#true} {17121#true} #163#return; {17121#true} is VALID [2020-07-08 12:21:30,120 INFO L263 TraceCheckUtils]: 3: Hoare triple {17121#true} call #t~ret9 := main(); {17121#true} is VALID [2020-07-08 12:21:30,120 INFO L280 TraceCheckUtils]: 4: Hoare triple {17121#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;havoc ~cond~0; {17121#true} is VALID [2020-07-08 12:21:30,120 INFO L280 TraceCheckUtils]: 5: Hoare triple {17121#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {17121#true} is VALID [2020-07-08 12:21:30,121 INFO L280 TraceCheckUtils]: 6: Hoare triple {17121#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; {17121#true} is VALID [2020-07-08 12:21:30,121 INFO L280 TraceCheckUtils]: 7: Hoare triple {17121#true} assume !(0 != ~p1~0); {17121#true} is VALID [2020-07-08 12:21:30,121 INFO L280 TraceCheckUtils]: 8: Hoare triple {17121#true} assume !(0 != ~p2~0); {17121#true} is VALID [2020-07-08 12:21:30,121 INFO L280 TraceCheckUtils]: 9: Hoare triple {17121#true} assume !(0 != ~p3~0); {17121#true} is VALID [2020-07-08 12:21:30,122 INFO L280 TraceCheckUtils]: 10: Hoare triple {17121#true} assume !(0 != ~p4~0); {17121#true} is VALID [2020-07-08 12:21:30,123 INFO L280 TraceCheckUtils]: 11: Hoare triple {17121#true} assume 0 != ~p5~0;~lk5~0 := 1; {17125#(not (= 0 main_~p5~0))} is VALID [2020-07-08 12:21:30,123 INFO L280 TraceCheckUtils]: 12: Hoare triple {17125#(not (= 0 main_~p5~0))} assume 0 != ~p6~0;~lk6~0 := 1; {17125#(not (= 0 main_~p5~0))} is VALID [2020-07-08 12:21:30,124 INFO L280 TraceCheckUtils]: 13: Hoare triple {17125#(not (= 0 main_~p5~0))} assume 0 != ~p7~0;~lk7~0 := 1; {17125#(not (= 0 main_~p5~0))} is VALID [2020-07-08 12:21:30,125 INFO L280 TraceCheckUtils]: 14: Hoare triple {17125#(not (= 0 main_~p5~0))} assume !(0 != ~p8~0); {17125#(not (= 0 main_~p5~0))} is VALID [2020-07-08 12:21:30,125 INFO L280 TraceCheckUtils]: 15: Hoare triple {17125#(not (= 0 main_~p5~0))} assume !(0 != ~p1~0); {17125#(not (= 0 main_~p5~0))} is VALID [2020-07-08 12:21:30,126 INFO L280 TraceCheckUtils]: 16: Hoare triple {17125#(not (= 0 main_~p5~0))} assume !(0 != ~p2~0); {17125#(not (= 0 main_~p5~0))} is VALID [2020-07-08 12:21:30,126 INFO L280 TraceCheckUtils]: 17: Hoare triple {17125#(not (= 0 main_~p5~0))} assume !(0 != ~p3~0); {17125#(not (= 0 main_~p5~0))} is VALID [2020-07-08 12:21:30,127 INFO L280 TraceCheckUtils]: 18: Hoare triple {17125#(not (= 0 main_~p5~0))} assume !(0 != ~p4~0); {17125#(not (= 0 main_~p5~0))} is VALID [2020-07-08 12:21:30,128 INFO L280 TraceCheckUtils]: 19: Hoare triple {17125#(not (= 0 main_~p5~0))} assume !(0 != ~p5~0); {17122#false} is VALID [2020-07-08 12:21:30,128 INFO L280 TraceCheckUtils]: 20: Hoare triple {17122#false} assume 0 != ~p6~0; {17122#false} is VALID [2020-07-08 12:21:30,129 INFO L280 TraceCheckUtils]: 21: Hoare triple {17122#false} assume 1 != ~lk6~0; {17122#false} is VALID [2020-07-08 12:21:30,129 INFO L280 TraceCheckUtils]: 22: Hoare triple {17122#false} assume !false; {17122#false} is VALID [2020-07-08 12:21:30,130 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-08 12:21:30,130 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504198879] [2020-07-08 12:21:30,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:21:30,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:21:30,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471065124] [2020-07-08 12:21:30,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-08 12:21:30,131 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:21:30,132 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:21:30,153 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-08 12:21:30,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:21:30,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:21:30,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:21:30,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:21:30,154 INFO L87 Difference]: Start difference. First operand 776 states and 1110 transitions. Second operand 3 states. [2020-07-08 12:21:30,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:30,445 INFO L93 Difference]: Finished difference Result 1164 states and 1656 transitions. [2020-07-08 12:21:30,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:21:30,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-08 12:21:30,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:21:30,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:30,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2020-07-08 12:21:30,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:30,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2020-07-08 12:21:30,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 138 transitions. [2020-07-08 12:21:30,601 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-08 12:21:30,633 INFO L225 Difference]: With dead ends: 1164 [2020-07-08 12:21:30,633 INFO L226 Difference]: Without dead ends: 794 [2020-07-08 12:21:30,634 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-08 12:21:30,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2020-07-08 12:21:30,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 792. [2020-07-08 12:21:30,790 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:21:30,790 INFO L82 GeneralOperation]: Start isEquivalent. First operand 794 states. Second operand 792 states. [2020-07-08 12:21:30,790 INFO L74 IsIncluded]: Start isIncluded. First operand 794 states. Second operand 792 states. [2020-07-08 12:21:30,790 INFO L87 Difference]: Start difference. First operand 794 states. Second operand 792 states. [2020-07-08 12:21:30,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:30,825 INFO L93 Difference]: Finished difference Result 794 states and 1111 transitions. [2020-07-08 12:21:30,825 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1111 transitions. [2020-07-08 12:21:30,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:30,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:30,827 INFO L74 IsIncluded]: Start isIncluded. First operand 792 states. Second operand 794 states. [2020-07-08 12:21:30,828 INFO L87 Difference]: Start difference. First operand 792 states. Second operand 794 states. [2020-07-08 12:21:30,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:30,862 INFO L93 Difference]: Finished difference Result 794 states and 1111 transitions. [2020-07-08 12:21:30,862 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1111 transitions. [2020-07-08 12:21:30,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:30,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:30,864 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:21:30,865 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:21:30,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-07-08 12:21:30,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1110 transitions. [2020-07-08 12:21:30,900 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1110 transitions. Word has length 23 [2020-07-08 12:21:30,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:21:30,900 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 1110 transitions. [2020-07-08 12:21:30,900 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:21:30,901 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1110 transitions. [2020-07-08 12:21:30,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-08 12:21:30,902 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:21:30,902 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-08 12:21:30,903 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-08 12:21:30,903 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:21:30,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:21:30,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1479576731, now seen corresponding path program 1 times [2020-07-08 12:21:30,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:21:30,905 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072843500] [2020-07-08 12:21:30,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:21:30,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:30,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:30,938 INFO L280 TraceCheckUtils]: 0: Hoare triple {20766#true} assume true; {20766#true} is VALID [2020-07-08 12:21:30,939 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {20766#true} {20766#true} #163#return; {20766#true} is VALID [2020-07-08 12:21:30,939 INFO L263 TraceCheckUtils]: 0: Hoare triple {20766#true} call ULTIMATE.init(); {20766#true} is VALID [2020-07-08 12:21:30,939 INFO L280 TraceCheckUtils]: 1: Hoare triple {20766#true} assume true; {20766#true} is VALID [2020-07-08 12:21:30,939 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {20766#true} {20766#true} #163#return; {20766#true} is VALID [2020-07-08 12:21:30,940 INFO L263 TraceCheckUtils]: 3: Hoare triple {20766#true} call #t~ret9 := main(); {20766#true} is VALID [2020-07-08 12:21:30,940 INFO L280 TraceCheckUtils]: 4: Hoare triple {20766#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;havoc ~cond~0; {20766#true} is VALID [2020-07-08 12:21:30,940 INFO L280 TraceCheckUtils]: 5: Hoare triple {20766#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {20766#true} is VALID [2020-07-08 12:21:30,940 INFO L280 TraceCheckUtils]: 6: Hoare triple {20766#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; {20766#true} is VALID [2020-07-08 12:21:30,940 INFO L280 TraceCheckUtils]: 7: Hoare triple {20766#true} assume !(0 != ~p1~0); {20766#true} is VALID [2020-07-08 12:21:30,941 INFO L280 TraceCheckUtils]: 8: Hoare triple {20766#true} assume !(0 != ~p2~0); {20766#true} is VALID [2020-07-08 12:21:30,941 INFO L280 TraceCheckUtils]: 9: Hoare triple {20766#true} assume !(0 != ~p3~0); {20766#true} is VALID [2020-07-08 12:21:30,941 INFO L280 TraceCheckUtils]: 10: Hoare triple {20766#true} assume !(0 != ~p4~0); {20766#true} is VALID [2020-07-08 12:21:30,941 INFO L280 TraceCheckUtils]: 11: Hoare triple {20766#true} assume !(0 != ~p5~0); {20766#true} is VALID [2020-07-08 12:21:30,942 INFO L280 TraceCheckUtils]: 12: Hoare triple {20766#true} assume 0 != ~p6~0;~lk6~0 := 1; {20770#(= 1 main_~lk6~0)} is VALID [2020-07-08 12:21:30,943 INFO L280 TraceCheckUtils]: 13: Hoare triple {20770#(= 1 main_~lk6~0)} assume 0 != ~p7~0;~lk7~0 := 1; {20770#(= 1 main_~lk6~0)} is VALID [2020-07-08 12:21:30,943 INFO L280 TraceCheckUtils]: 14: Hoare triple {20770#(= 1 main_~lk6~0)} assume !(0 != ~p8~0); {20770#(= 1 main_~lk6~0)} is VALID [2020-07-08 12:21:30,944 INFO L280 TraceCheckUtils]: 15: Hoare triple {20770#(= 1 main_~lk6~0)} assume !(0 != ~p1~0); {20770#(= 1 main_~lk6~0)} is VALID [2020-07-08 12:21:30,944 INFO L280 TraceCheckUtils]: 16: Hoare triple {20770#(= 1 main_~lk6~0)} assume !(0 != ~p2~0); {20770#(= 1 main_~lk6~0)} is VALID [2020-07-08 12:21:30,945 INFO L280 TraceCheckUtils]: 17: Hoare triple {20770#(= 1 main_~lk6~0)} assume !(0 != ~p3~0); {20770#(= 1 main_~lk6~0)} is VALID [2020-07-08 12:21:30,945 INFO L280 TraceCheckUtils]: 18: Hoare triple {20770#(= 1 main_~lk6~0)} assume !(0 != ~p4~0); {20770#(= 1 main_~lk6~0)} is VALID [2020-07-08 12:21:30,946 INFO L280 TraceCheckUtils]: 19: Hoare triple {20770#(= 1 main_~lk6~0)} assume !(0 != ~p5~0); {20770#(= 1 main_~lk6~0)} is VALID [2020-07-08 12:21:30,946 INFO L280 TraceCheckUtils]: 20: Hoare triple {20770#(= 1 main_~lk6~0)} assume 0 != ~p6~0; {20770#(= 1 main_~lk6~0)} is VALID [2020-07-08 12:21:30,947 INFO L280 TraceCheckUtils]: 21: Hoare triple {20770#(= 1 main_~lk6~0)} assume 1 != ~lk6~0; {20767#false} is VALID [2020-07-08 12:21:30,947 INFO L280 TraceCheckUtils]: 22: Hoare triple {20767#false} assume !false; {20767#false} is VALID [2020-07-08 12:21:30,948 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-08 12:21:30,948 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072843500] [2020-07-08 12:21:30,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:21:30,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:21:30,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035025266] [2020-07-08 12:21:30,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-08 12:21:30,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:21:30,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:21:30,974 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-08 12:21:30,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:21:30,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:21:30,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:21:30,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:21:30,976 INFO L87 Difference]: Start difference. First operand 792 states and 1110 transitions. Second operand 3 states. [2020-07-08 12:21:31,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:31,430 INFO L93 Difference]: Finished difference Result 1356 states and 1928 transitions. [2020-07-08 12:21:31,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:21:31,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-08 12:21:31,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:21:31,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:31,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2020-07-08 12:21:31,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:31,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2020-07-08 12:21:31,433 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 86 transitions. [2020-07-08 12:21:31,513 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:31,649 INFO L225 Difference]: With dead ends: 1356 [2020-07-08 12:21:31,649 INFO L226 Difference]: Without dead ends: 1354 [2020-07-08 12:21:31,650 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-08 12:21:31,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2020-07-08 12:21:31,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1160. [2020-07-08 12:21:31,836 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:21:31,836 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1354 states. Second operand 1160 states. [2020-07-08 12:21:31,836 INFO L74 IsIncluded]: Start isIncluded. First operand 1354 states. Second operand 1160 states. [2020-07-08 12:21:31,836 INFO L87 Difference]: Start difference. First operand 1354 states. Second operand 1160 states. [2020-07-08 12:21:31,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:31,926 INFO L93 Difference]: Finished difference Result 1354 states and 1895 transitions. [2020-07-08 12:21:31,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1895 transitions. [2020-07-08 12:21:31,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:31,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:31,929 INFO L74 IsIncluded]: Start isIncluded. First operand 1160 states. Second operand 1354 states. [2020-07-08 12:21:31,930 INFO L87 Difference]: Start difference. First operand 1160 states. Second operand 1354 states. [2020-07-08 12:21:32,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:32,022 INFO L93 Difference]: Finished difference Result 1354 states and 1895 transitions. [2020-07-08 12:21:32,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1895 transitions. [2020-07-08 12:21:32,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:32,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:32,045 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:21:32,045 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:21:32,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1160 states. [2020-07-08 12:21:32,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1574 transitions. [2020-07-08 12:21:32,102 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1574 transitions. Word has length 23 [2020-07-08 12:21:32,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:21:32,102 INFO L479 AbstractCegarLoop]: Abstraction has 1160 states and 1574 transitions. [2020-07-08 12:21:32,102 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:21:32,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1574 transitions. [2020-07-08 12:21:32,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-08 12:21:32,104 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:21:32,104 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-08 12:21:32,105 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-08 12:21:32,105 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:21:32,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:21:32,105 INFO L82 PathProgramCache]: Analyzing trace with hash -2114325987, now seen corresponding path program 1 times [2020-07-08 12:21:32,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:21:32,106 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491240113] [2020-07-08 12:21:32,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:21:32,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:32,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:32,132 INFO L280 TraceCheckUtils]: 0: Hoare triple {26107#true} assume true; {26107#true} is VALID [2020-07-08 12:21:32,133 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {26107#true} {26107#true} #163#return; {26107#true} is VALID [2020-07-08 12:21:32,133 INFO L263 TraceCheckUtils]: 0: Hoare triple {26107#true} call ULTIMATE.init(); {26107#true} is VALID [2020-07-08 12:21:32,133 INFO L280 TraceCheckUtils]: 1: Hoare triple {26107#true} assume true; {26107#true} is VALID [2020-07-08 12:21:32,133 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {26107#true} {26107#true} #163#return; {26107#true} is VALID [2020-07-08 12:21:32,133 INFO L263 TraceCheckUtils]: 3: Hoare triple {26107#true} call #t~ret9 := main(); {26107#true} is VALID [2020-07-08 12:21:32,134 INFO L280 TraceCheckUtils]: 4: Hoare triple {26107#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;havoc ~cond~0; {26107#true} is VALID [2020-07-08 12:21:32,134 INFO L280 TraceCheckUtils]: 5: Hoare triple {26107#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {26107#true} is VALID [2020-07-08 12:21:32,134 INFO L280 TraceCheckUtils]: 6: Hoare triple {26107#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; {26107#true} is VALID [2020-07-08 12:21:32,134 INFO L280 TraceCheckUtils]: 7: Hoare triple {26107#true} assume !(0 != ~p1~0); {26107#true} is VALID [2020-07-08 12:21:32,135 INFO L280 TraceCheckUtils]: 8: Hoare triple {26107#true} assume !(0 != ~p2~0); {26107#true} is VALID [2020-07-08 12:21:32,135 INFO L280 TraceCheckUtils]: 9: Hoare triple {26107#true} assume !(0 != ~p3~0); {26107#true} is VALID [2020-07-08 12:21:32,135 INFO L280 TraceCheckUtils]: 10: Hoare triple {26107#true} assume !(0 != ~p4~0); {26107#true} is VALID [2020-07-08 12:21:32,135 INFO L280 TraceCheckUtils]: 11: Hoare triple {26107#true} assume !(0 != ~p5~0); {26107#true} is VALID [2020-07-08 12:21:32,136 INFO L280 TraceCheckUtils]: 12: Hoare triple {26107#true} assume !(0 != ~p6~0); {26111#(= 0 main_~p6~0)} is VALID [2020-07-08 12:21:32,137 INFO L280 TraceCheckUtils]: 13: Hoare triple {26111#(= 0 main_~p6~0)} assume 0 != ~p7~0;~lk7~0 := 1; {26111#(= 0 main_~p6~0)} is VALID [2020-07-08 12:21:32,137 INFO L280 TraceCheckUtils]: 14: Hoare triple {26111#(= 0 main_~p6~0)} assume !(0 != ~p8~0); {26111#(= 0 main_~p6~0)} is VALID [2020-07-08 12:21:32,140 INFO L280 TraceCheckUtils]: 15: Hoare triple {26111#(= 0 main_~p6~0)} assume !(0 != ~p1~0); {26111#(= 0 main_~p6~0)} is VALID [2020-07-08 12:21:32,140 INFO L280 TraceCheckUtils]: 16: Hoare triple {26111#(= 0 main_~p6~0)} assume !(0 != ~p2~0); {26111#(= 0 main_~p6~0)} is VALID [2020-07-08 12:21:32,141 INFO L280 TraceCheckUtils]: 17: Hoare triple {26111#(= 0 main_~p6~0)} assume !(0 != ~p3~0); {26111#(= 0 main_~p6~0)} is VALID [2020-07-08 12:21:32,141 INFO L280 TraceCheckUtils]: 18: Hoare triple {26111#(= 0 main_~p6~0)} assume !(0 != ~p4~0); {26111#(= 0 main_~p6~0)} is VALID [2020-07-08 12:21:32,142 INFO L280 TraceCheckUtils]: 19: Hoare triple {26111#(= 0 main_~p6~0)} assume !(0 != ~p5~0); {26111#(= 0 main_~p6~0)} is VALID [2020-07-08 12:21:32,145 INFO L280 TraceCheckUtils]: 20: Hoare triple {26111#(= 0 main_~p6~0)} assume 0 != ~p6~0; {26108#false} is VALID [2020-07-08 12:21:32,145 INFO L280 TraceCheckUtils]: 21: Hoare triple {26108#false} assume 1 != ~lk6~0; {26108#false} is VALID [2020-07-08 12:21:32,145 INFO L280 TraceCheckUtils]: 22: Hoare triple {26108#false} assume !false; {26108#false} is VALID [2020-07-08 12:21:32,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:21:32,146 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491240113] [2020-07-08 12:21:32,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:21:32,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:21:32,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801138179] [2020-07-08 12:21:32,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-08 12:21:32,151 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:21:32,151 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:21:32,173 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-08 12:21:32,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:21:32,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:21:32,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:21:32,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:21:32,174 INFO L87 Difference]: Start difference. First operand 1160 states and 1574 transitions. Second operand 3 states. [2020-07-08 12:21:32,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:32,805 INFO L93 Difference]: Finished difference Result 2636 states and 3560 transitions. [2020-07-08 12:21:32,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:21:32,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-08 12:21:32,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:21:32,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:32,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2020-07-08 12:21:32,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:32,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2020-07-08 12:21:32,808 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 140 transitions. [2020-07-08 12:21:32,939 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:33,021 INFO L225 Difference]: With dead ends: 2636 [2020-07-08 12:21:33,021 INFO L226 Difference]: Without dead ends: 1514 [2020-07-08 12:21:33,023 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-08 12:21:33,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2020-07-08 12:21:33,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1512. [2020-07-08 12:21:33,371 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:21:33,371 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1514 states. Second operand 1512 states. [2020-07-08 12:21:33,371 INFO L74 IsIncluded]: Start isIncluded. First operand 1514 states. Second operand 1512 states. [2020-07-08 12:21:33,371 INFO L87 Difference]: Start difference. First operand 1514 states. Second operand 1512 states. [2020-07-08 12:21:33,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:33,475 INFO L93 Difference]: Finished difference Result 1514 states and 1991 transitions. [2020-07-08 12:21:33,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 1991 transitions. [2020-07-08 12:21:33,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:33,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:33,478 INFO L74 IsIncluded]: Start isIncluded. First operand 1512 states. Second operand 1514 states. [2020-07-08 12:21:33,479 INFO L87 Difference]: Start difference. First operand 1512 states. Second operand 1514 states. [2020-07-08 12:21:33,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:33,567 INFO L93 Difference]: Finished difference Result 1514 states and 1991 transitions. [2020-07-08 12:21:33,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 1991 transitions. [2020-07-08 12:21:33,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:33,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:33,569 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:21:33,569 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:21:33,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1512 states. [2020-07-08 12:21:33,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 1990 transitions. [2020-07-08 12:21:33,638 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 1990 transitions. Word has length 23 [2020-07-08 12:21:33,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:21:33,638 INFO L479 AbstractCegarLoop]: Abstraction has 1512 states and 1990 transitions. [2020-07-08 12:21:33,638 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:21:33,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 1990 transitions. [2020-07-08 12:21:33,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-08 12:21:33,639 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:21:33,640 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:21:33,640 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-08 12:21:33,640 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:21:33,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:21:33,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1377545862, now seen corresponding path program 1 times [2020-07-08 12:21:33,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:21:33,641 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946298107] [2020-07-08 12:21:33,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:21:33,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:33,666 INFO L280 TraceCheckUtils]: 0: Hoare triple {33464#true} assume true; {33464#true} is VALID [2020-07-08 12:21:33,666 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {33464#true} {33464#true} #163#return; {33464#true} is VALID [2020-07-08 12:21:33,666 INFO L263 TraceCheckUtils]: 0: Hoare triple {33464#true} call ULTIMATE.init(); {33464#true} is VALID [2020-07-08 12:21:33,667 INFO L280 TraceCheckUtils]: 1: Hoare triple {33464#true} assume true; {33464#true} is VALID [2020-07-08 12:21:33,667 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {33464#true} {33464#true} #163#return; {33464#true} is VALID [2020-07-08 12:21:33,667 INFO L263 TraceCheckUtils]: 3: Hoare triple {33464#true} call #t~ret9 := main(); {33464#true} is VALID [2020-07-08 12:21:33,667 INFO L280 TraceCheckUtils]: 4: Hoare triple {33464#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;havoc ~cond~0; {33464#true} is VALID [2020-07-08 12:21:33,667 INFO L280 TraceCheckUtils]: 5: Hoare triple {33464#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {33464#true} is VALID [2020-07-08 12:21:33,668 INFO L280 TraceCheckUtils]: 6: Hoare triple {33464#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; {33464#true} is VALID [2020-07-08 12:21:33,668 INFO L280 TraceCheckUtils]: 7: Hoare triple {33464#true} assume !(0 != ~p1~0); {33464#true} is VALID [2020-07-08 12:21:33,668 INFO L280 TraceCheckUtils]: 8: Hoare triple {33464#true} assume !(0 != ~p2~0); {33464#true} is VALID [2020-07-08 12:21:33,668 INFO L280 TraceCheckUtils]: 9: Hoare triple {33464#true} assume !(0 != ~p3~0); {33464#true} is VALID [2020-07-08 12:21:33,668 INFO L280 TraceCheckUtils]: 10: Hoare triple {33464#true} assume !(0 != ~p4~0); {33464#true} is VALID [2020-07-08 12:21:33,669 INFO L280 TraceCheckUtils]: 11: Hoare triple {33464#true} assume !(0 != ~p5~0); {33464#true} is VALID [2020-07-08 12:21:33,669 INFO L280 TraceCheckUtils]: 12: Hoare triple {33464#true} assume 0 != ~p6~0;~lk6~0 := 1; {33468#(not (= 0 main_~p6~0))} is VALID [2020-07-08 12:21:33,670 INFO L280 TraceCheckUtils]: 13: Hoare triple {33468#(not (= 0 main_~p6~0))} assume 0 != ~p7~0;~lk7~0 := 1; {33468#(not (= 0 main_~p6~0))} is VALID [2020-07-08 12:21:33,670 INFO L280 TraceCheckUtils]: 14: Hoare triple {33468#(not (= 0 main_~p6~0))} assume !(0 != ~p8~0); {33468#(not (= 0 main_~p6~0))} is VALID [2020-07-08 12:21:33,671 INFO L280 TraceCheckUtils]: 15: Hoare triple {33468#(not (= 0 main_~p6~0))} assume !(0 != ~p1~0); {33468#(not (= 0 main_~p6~0))} is VALID [2020-07-08 12:21:33,671 INFO L280 TraceCheckUtils]: 16: Hoare triple {33468#(not (= 0 main_~p6~0))} assume !(0 != ~p2~0); {33468#(not (= 0 main_~p6~0))} is VALID [2020-07-08 12:21:33,675 INFO L280 TraceCheckUtils]: 17: Hoare triple {33468#(not (= 0 main_~p6~0))} assume !(0 != ~p3~0); {33468#(not (= 0 main_~p6~0))} is VALID [2020-07-08 12:21:33,675 INFO L280 TraceCheckUtils]: 18: Hoare triple {33468#(not (= 0 main_~p6~0))} assume !(0 != ~p4~0); {33468#(not (= 0 main_~p6~0))} is VALID [2020-07-08 12:21:33,676 INFO L280 TraceCheckUtils]: 19: Hoare triple {33468#(not (= 0 main_~p6~0))} assume !(0 != ~p5~0); {33468#(not (= 0 main_~p6~0))} is VALID [2020-07-08 12:21:33,676 INFO L280 TraceCheckUtils]: 20: Hoare triple {33468#(not (= 0 main_~p6~0))} assume !(0 != ~p6~0); {33465#false} is VALID [2020-07-08 12:21:33,677 INFO L280 TraceCheckUtils]: 21: Hoare triple {33465#false} assume 0 != ~p7~0; {33465#false} is VALID [2020-07-08 12:21:33,677 INFO L280 TraceCheckUtils]: 22: Hoare triple {33465#false} assume 1 != ~lk7~0; {33465#false} is VALID [2020-07-08 12:21:33,677 INFO L280 TraceCheckUtils]: 23: Hoare triple {33465#false} assume !false; {33465#false} is VALID [2020-07-08 12:21:33,678 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-08 12:21:33,678 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946298107] [2020-07-08 12:21:33,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:21:33,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:21:33,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75579553] [2020-07-08 12:21:33,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-08 12:21:33,679 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:21:33,679 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:21:33,705 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-08 12:21:33,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:21:33,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:21:33,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:21:33,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:21:33,706 INFO L87 Difference]: Start difference. First operand 1512 states and 1990 transitions. Second operand 3 states. [2020-07-08 12:21:34,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:34,270 INFO L93 Difference]: Finished difference Result 2268 states and 2968 transitions. [2020-07-08 12:21:34,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:21:34,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-08 12:21:34,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:21:34,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:34,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2020-07-08 12:21:34,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:34,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2020-07-08 12:21:34,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 135 transitions. [2020-07-08 12:21:34,404 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:34,492 INFO L225 Difference]: With dead ends: 2268 [2020-07-08 12:21:34,492 INFO L226 Difference]: Without dead ends: 1546 [2020-07-08 12:21:34,494 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-08 12:21:34,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2020-07-08 12:21:34,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1544. [2020-07-08 12:21:34,822 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:21:34,822 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1546 states. Second operand 1544 states. [2020-07-08 12:21:34,823 INFO L74 IsIncluded]: Start isIncluded. First operand 1546 states. Second operand 1544 states. [2020-07-08 12:21:34,823 INFO L87 Difference]: Start difference. First operand 1546 states. Second operand 1544 states. [2020-07-08 12:21:34,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:34,943 INFO L93 Difference]: Finished difference Result 1546 states and 1991 transitions. [2020-07-08 12:21:34,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 1991 transitions. [2020-07-08 12:21:34,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:34,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:34,944 INFO L74 IsIncluded]: Start isIncluded. First operand 1544 states. Second operand 1546 states. [2020-07-08 12:21:34,945 INFO L87 Difference]: Start difference. First operand 1544 states. Second operand 1546 states. [2020-07-08 12:21:35,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:35,021 INFO L93 Difference]: Finished difference Result 1546 states and 1991 transitions. [2020-07-08 12:21:35,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 1991 transitions. [2020-07-08 12:21:35,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:35,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:35,022 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:21:35,022 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:21:35,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2020-07-08 12:21:35,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 1990 transitions. [2020-07-08 12:21:35,096 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 1990 transitions. Word has length 24 [2020-07-08 12:21:35,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:21:35,096 INFO L479 AbstractCegarLoop]: Abstraction has 1544 states and 1990 transitions. [2020-07-08 12:21:35,096 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:21:35,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 1990 transitions. [2020-07-08 12:21:35,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-08 12:21:35,097 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:21:35,097 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-08 12:21:35,097 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-07-08 12:21:35,097 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:21:35,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:21:35,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1119380424, now seen corresponding path program 1 times [2020-07-08 12:21:35,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:21:35,098 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563632795] [2020-07-08 12:21:35,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:21:35,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:35,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:35,119 INFO L280 TraceCheckUtils]: 0: Hoare triple {40549#true} assume true; {40549#true} is VALID [2020-07-08 12:21:35,119 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {40549#true} {40549#true} #163#return; {40549#true} is VALID [2020-07-08 12:21:35,119 INFO L263 TraceCheckUtils]: 0: Hoare triple {40549#true} call ULTIMATE.init(); {40549#true} is VALID [2020-07-08 12:21:35,119 INFO L280 TraceCheckUtils]: 1: Hoare triple {40549#true} assume true; {40549#true} is VALID [2020-07-08 12:21:35,119 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {40549#true} {40549#true} #163#return; {40549#true} is VALID [2020-07-08 12:21:35,120 INFO L263 TraceCheckUtils]: 3: Hoare triple {40549#true} call #t~ret9 := main(); {40549#true} is VALID [2020-07-08 12:21:35,120 INFO L280 TraceCheckUtils]: 4: Hoare triple {40549#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;havoc ~cond~0; {40549#true} is VALID [2020-07-08 12:21:35,120 INFO L280 TraceCheckUtils]: 5: Hoare triple {40549#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {40549#true} is VALID [2020-07-08 12:21:35,120 INFO L280 TraceCheckUtils]: 6: Hoare triple {40549#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; {40549#true} is VALID [2020-07-08 12:21:35,121 INFO L280 TraceCheckUtils]: 7: Hoare triple {40549#true} assume !(0 != ~p1~0); {40549#true} is VALID [2020-07-08 12:21:35,121 INFO L280 TraceCheckUtils]: 8: Hoare triple {40549#true} assume !(0 != ~p2~0); {40549#true} is VALID [2020-07-08 12:21:35,121 INFO L280 TraceCheckUtils]: 9: Hoare triple {40549#true} assume !(0 != ~p3~0); {40549#true} is VALID [2020-07-08 12:21:35,121 INFO L280 TraceCheckUtils]: 10: Hoare triple {40549#true} assume !(0 != ~p4~0); {40549#true} is VALID [2020-07-08 12:21:35,121 INFO L280 TraceCheckUtils]: 11: Hoare triple {40549#true} assume !(0 != ~p5~0); {40549#true} is VALID [2020-07-08 12:21:35,121 INFO L280 TraceCheckUtils]: 12: Hoare triple {40549#true} assume !(0 != ~p6~0); {40549#true} is VALID [2020-07-08 12:21:35,122 INFO L280 TraceCheckUtils]: 13: Hoare triple {40549#true} assume 0 != ~p7~0;~lk7~0 := 1; {40553#(= main_~lk7~0 1)} is VALID [2020-07-08 12:21:35,122 INFO L280 TraceCheckUtils]: 14: Hoare triple {40553#(= main_~lk7~0 1)} assume !(0 != ~p8~0); {40553#(= main_~lk7~0 1)} is VALID [2020-07-08 12:21:35,123 INFO L280 TraceCheckUtils]: 15: Hoare triple {40553#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {40553#(= main_~lk7~0 1)} is VALID [2020-07-08 12:21:35,123 INFO L280 TraceCheckUtils]: 16: Hoare triple {40553#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {40553#(= main_~lk7~0 1)} is VALID [2020-07-08 12:21:35,124 INFO L280 TraceCheckUtils]: 17: Hoare triple {40553#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {40553#(= main_~lk7~0 1)} is VALID [2020-07-08 12:21:35,124 INFO L280 TraceCheckUtils]: 18: Hoare triple {40553#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {40553#(= main_~lk7~0 1)} is VALID [2020-07-08 12:21:35,125 INFO L280 TraceCheckUtils]: 19: Hoare triple {40553#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {40553#(= main_~lk7~0 1)} is VALID [2020-07-08 12:21:35,125 INFO L280 TraceCheckUtils]: 20: Hoare triple {40553#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {40553#(= main_~lk7~0 1)} is VALID [2020-07-08 12:21:35,126 INFO L280 TraceCheckUtils]: 21: Hoare triple {40553#(= main_~lk7~0 1)} assume 0 != ~p7~0; {40553#(= main_~lk7~0 1)} is VALID [2020-07-08 12:21:35,126 INFO L280 TraceCheckUtils]: 22: Hoare triple {40553#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {40550#false} is VALID [2020-07-08 12:21:35,127 INFO L280 TraceCheckUtils]: 23: Hoare triple {40550#false} assume !false; {40550#false} is VALID [2020-07-08 12:21:35,127 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-08 12:21:35,127 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563632795] [2020-07-08 12:21:35,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:21:35,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:21:35,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932025428] [2020-07-08 12:21:35,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-08 12:21:35,129 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:21:35,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:21:35,148 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-08 12:21:35,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:21:35,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:21:35,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:21:35,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:21:35,149 INFO L87 Difference]: Start difference. First operand 1544 states and 1990 transitions. Second operand 3 states. [2020-07-08 12:21:36,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:36,063 INFO L93 Difference]: Finished difference Result 2572 states and 3336 transitions. [2020-07-08 12:21:36,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:21:36,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-08 12:21:36,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:21:36,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:36,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2020-07-08 12:21:36,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:36,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2020-07-08 12:21:36,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 82 transitions. [2020-07-08 12:21:36,143 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:36,362 INFO L225 Difference]: With dead ends: 2572 [2020-07-08 12:21:36,363 INFO L226 Difference]: Without dead ends: 2570 [2020-07-08 12:21:36,364 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-08 12:21:36,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2570 states. [2020-07-08 12:21:36,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2570 to 2312. [2020-07-08 12:21:36,741 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:21:36,741 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2570 states. Second operand 2312 states. [2020-07-08 12:21:36,742 INFO L74 IsIncluded]: Start isIncluded. First operand 2570 states. Second operand 2312 states. [2020-07-08 12:21:36,742 INFO L87 Difference]: Start difference. First operand 2570 states. Second operand 2312 states. [2020-07-08 12:21:36,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:36,941 INFO L93 Difference]: Finished difference Result 2570 states and 3271 transitions. [2020-07-08 12:21:36,941 INFO L276 IsEmpty]: Start isEmpty. Operand 2570 states and 3271 transitions. [2020-07-08 12:21:36,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:36,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:36,944 INFO L74 IsIncluded]: Start isIncluded. First operand 2312 states. Second operand 2570 states. [2020-07-08 12:21:36,944 INFO L87 Difference]: Start difference. First operand 2312 states. Second operand 2570 states. [2020-07-08 12:21:37,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:37,135 INFO L93 Difference]: Finished difference Result 2570 states and 3271 transitions. [2020-07-08 12:21:37,135 INFO L276 IsEmpty]: Start isEmpty. Operand 2570 states and 3271 transitions. [2020-07-08 12:21:37,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:37,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:37,137 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:21:37,137 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:21:37,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2312 states. [2020-07-08 12:21:37,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 2886 transitions. [2020-07-08 12:21:37,311 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 2886 transitions. Word has length 24 [2020-07-08 12:21:37,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:21:37,311 INFO L479 AbstractCegarLoop]: Abstraction has 2312 states and 2886 transitions. [2020-07-08 12:21:37,311 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:21:37,311 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 2886 transitions. [2020-07-08 12:21:37,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-08 12:21:37,313 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:21:37,314 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-08 12:21:37,314 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-07-08 12:21:37,314 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:21:37,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:21:37,314 INFO L82 PathProgramCache]: Analyzing trace with hash -418315846, now seen corresponding path program 1 times [2020-07-08 12:21:37,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:21:37,315 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704013549] [2020-07-08 12:21:37,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:21:37,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:37,340 INFO L280 TraceCheckUtils]: 0: Hoare triple {50786#true} assume true; {50786#true} is VALID [2020-07-08 12:21:37,340 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {50786#true} {50786#true} #163#return; {50786#true} is VALID [2020-07-08 12:21:37,340 INFO L263 TraceCheckUtils]: 0: Hoare triple {50786#true} call ULTIMATE.init(); {50786#true} is VALID [2020-07-08 12:21:37,340 INFO L280 TraceCheckUtils]: 1: Hoare triple {50786#true} assume true; {50786#true} is VALID [2020-07-08 12:21:37,341 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {50786#true} {50786#true} #163#return; {50786#true} is VALID [2020-07-08 12:21:37,341 INFO L263 TraceCheckUtils]: 3: Hoare triple {50786#true} call #t~ret9 := main(); {50786#true} is VALID [2020-07-08 12:21:37,341 INFO L280 TraceCheckUtils]: 4: Hoare triple {50786#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;havoc ~cond~0; {50786#true} is VALID [2020-07-08 12:21:37,341 INFO L280 TraceCheckUtils]: 5: Hoare triple {50786#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {50786#true} is VALID [2020-07-08 12:21:37,341 INFO L280 TraceCheckUtils]: 6: Hoare triple {50786#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; {50786#true} is VALID [2020-07-08 12:21:37,341 INFO L280 TraceCheckUtils]: 7: Hoare triple {50786#true} assume !(0 != ~p1~0); {50786#true} is VALID [2020-07-08 12:21:37,342 INFO L280 TraceCheckUtils]: 8: Hoare triple {50786#true} assume !(0 != ~p2~0); {50786#true} is VALID [2020-07-08 12:21:37,342 INFO L280 TraceCheckUtils]: 9: Hoare triple {50786#true} assume !(0 != ~p3~0); {50786#true} is VALID [2020-07-08 12:21:37,342 INFO L280 TraceCheckUtils]: 10: Hoare triple {50786#true} assume !(0 != ~p4~0); {50786#true} is VALID [2020-07-08 12:21:37,342 INFO L280 TraceCheckUtils]: 11: Hoare triple {50786#true} assume !(0 != ~p5~0); {50786#true} is VALID [2020-07-08 12:21:37,342 INFO L280 TraceCheckUtils]: 12: Hoare triple {50786#true} assume !(0 != ~p6~0); {50786#true} is VALID [2020-07-08 12:21:37,343 INFO L280 TraceCheckUtils]: 13: Hoare triple {50786#true} assume !(0 != ~p7~0); {50790#(= 0 main_~p7~0)} is VALID [2020-07-08 12:21:37,343 INFO L280 TraceCheckUtils]: 14: Hoare triple {50790#(= 0 main_~p7~0)} assume !(0 != ~p8~0); {50790#(= 0 main_~p7~0)} is VALID [2020-07-08 12:21:37,344 INFO L280 TraceCheckUtils]: 15: Hoare triple {50790#(= 0 main_~p7~0)} assume !(0 != ~p1~0); {50790#(= 0 main_~p7~0)} is VALID [2020-07-08 12:21:37,344 INFO L280 TraceCheckUtils]: 16: Hoare triple {50790#(= 0 main_~p7~0)} assume !(0 != ~p2~0); {50790#(= 0 main_~p7~0)} is VALID [2020-07-08 12:21:37,345 INFO L280 TraceCheckUtils]: 17: Hoare triple {50790#(= 0 main_~p7~0)} assume !(0 != ~p3~0); {50790#(= 0 main_~p7~0)} is VALID [2020-07-08 12:21:37,346 INFO L280 TraceCheckUtils]: 18: Hoare triple {50790#(= 0 main_~p7~0)} assume !(0 != ~p4~0); {50790#(= 0 main_~p7~0)} is VALID [2020-07-08 12:21:37,347 INFO L280 TraceCheckUtils]: 19: Hoare triple {50790#(= 0 main_~p7~0)} assume !(0 != ~p5~0); {50790#(= 0 main_~p7~0)} is VALID [2020-07-08 12:21:37,347 INFO L280 TraceCheckUtils]: 20: Hoare triple {50790#(= 0 main_~p7~0)} assume !(0 != ~p6~0); {50790#(= 0 main_~p7~0)} is VALID [2020-07-08 12:21:37,348 INFO L280 TraceCheckUtils]: 21: Hoare triple {50790#(= 0 main_~p7~0)} assume 0 != ~p7~0; {50787#false} is VALID [2020-07-08 12:21:37,348 INFO L280 TraceCheckUtils]: 22: Hoare triple {50787#false} assume 1 != ~lk7~0; {50787#false} is VALID [2020-07-08 12:21:37,348 INFO L280 TraceCheckUtils]: 23: Hoare triple {50787#false} assume !false; {50787#false} is VALID [2020-07-08 12:21:37,348 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-08 12:21:37,349 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704013549] [2020-07-08 12:21:37,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:21:37,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:21:37,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039648458] [2020-07-08 12:21:37,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-08 12:21:37,350 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:21:37,350 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:21:37,377 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-08 12:21:37,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:21:37,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:21:37,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:21:37,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:21:37,378 INFO L87 Difference]: Start difference. First operand 2312 states and 2886 transitions. Second operand 3 states. [2020-07-08 12:21:38,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:38,893 INFO L93 Difference]: Finished difference Result 5196 states and 6408 transitions. [2020-07-08 12:21:38,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:21:38,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-08 12:21:38,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:21:38,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:38,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2020-07-08 12:21:38,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:38,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2020-07-08 12:21:38,895 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 137 transitions. [2020-07-08 12:21:39,020 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:39,300 INFO L225 Difference]: With dead ends: 5196 [2020-07-08 12:21:39,301 INFO L226 Difference]: Without dead ends: 2954 [2020-07-08 12:21:39,304 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-08 12:21:39,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2020-07-08 12:21:39,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2952. [2020-07-08 12:21:39,972 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:21:39,972 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2954 states. Second operand 2952 states. [2020-07-08 12:21:39,972 INFO L74 IsIncluded]: Start isIncluded. First operand 2954 states. Second operand 2952 states. [2020-07-08 12:21:39,972 INFO L87 Difference]: Start difference. First operand 2954 states. Second operand 2952 states. [2020-07-08 12:21:40,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:40,198 INFO L93 Difference]: Finished difference Result 2954 states and 3527 transitions. [2020-07-08 12:21:40,198 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 3527 transitions. [2020-07-08 12:21:40,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:40,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:40,201 INFO L74 IsIncluded]: Start isIncluded. First operand 2952 states. Second operand 2954 states. [2020-07-08 12:21:40,201 INFO L87 Difference]: Start difference. First operand 2952 states. Second operand 2954 states. [2020-07-08 12:21:40,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:40,445 INFO L93 Difference]: Finished difference Result 2954 states and 3527 transitions. [2020-07-08 12:21:40,445 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 3527 transitions. [2020-07-08 12:21:40,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:40,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:40,448 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:21:40,448 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:21:40,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2952 states. [2020-07-08 12:21:40,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2952 states to 2952 states and 3526 transitions. [2020-07-08 12:21:40,715 INFO L78 Accepts]: Start accepts. Automaton has 2952 states and 3526 transitions. Word has length 24 [2020-07-08 12:21:40,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:21:40,715 INFO L479 AbstractCegarLoop]: Abstraction has 2952 states and 3526 transitions. [2020-07-08 12:21:40,715 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:21:40,715 INFO L276 IsEmpty]: Start isEmpty. Operand 2952 states and 3526 transitions. [2020-07-08 12:21:40,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-08 12:21:40,717 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:21:40,718 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-08 12:21:40,718 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-07-08 12:21:40,718 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:21:40,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:21:40,718 INFO L82 PathProgramCache]: Analyzing trace with hash -340838702, now seen corresponding path program 1 times [2020-07-08 12:21:40,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:21:40,719 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807009073] [2020-07-08 12:21:40,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:21:40,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:40,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:40,744 INFO L280 TraceCheckUtils]: 0: Hoare triple {65183#true} assume true; {65183#true} is VALID [2020-07-08 12:21:40,745 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {65183#true} {65183#true} #163#return; {65183#true} is VALID [2020-07-08 12:21:40,745 INFO L263 TraceCheckUtils]: 0: Hoare triple {65183#true} call ULTIMATE.init(); {65183#true} is VALID [2020-07-08 12:21:40,745 INFO L280 TraceCheckUtils]: 1: Hoare triple {65183#true} assume true; {65183#true} is VALID [2020-07-08 12:21:40,745 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {65183#true} {65183#true} #163#return; {65183#true} is VALID [2020-07-08 12:21:40,745 INFO L263 TraceCheckUtils]: 3: Hoare triple {65183#true} call #t~ret9 := main(); {65183#true} is VALID [2020-07-08 12:21:40,746 INFO L280 TraceCheckUtils]: 4: Hoare triple {65183#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;havoc ~cond~0; {65183#true} is VALID [2020-07-08 12:21:40,746 INFO L280 TraceCheckUtils]: 5: Hoare triple {65183#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {65183#true} is VALID [2020-07-08 12:21:40,746 INFO L280 TraceCheckUtils]: 6: Hoare triple {65183#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; {65183#true} is VALID [2020-07-08 12:21:40,746 INFO L280 TraceCheckUtils]: 7: Hoare triple {65183#true} assume !(0 != ~p1~0); {65183#true} is VALID [2020-07-08 12:21:40,746 INFO L280 TraceCheckUtils]: 8: Hoare triple {65183#true} assume !(0 != ~p2~0); {65183#true} is VALID [2020-07-08 12:21:40,747 INFO L280 TraceCheckUtils]: 9: Hoare triple {65183#true} assume !(0 != ~p3~0); {65183#true} is VALID [2020-07-08 12:21:40,747 INFO L280 TraceCheckUtils]: 10: Hoare triple {65183#true} assume !(0 != ~p4~0); {65183#true} is VALID [2020-07-08 12:21:40,747 INFO L280 TraceCheckUtils]: 11: Hoare triple {65183#true} assume !(0 != ~p5~0); {65183#true} is VALID [2020-07-08 12:21:40,747 INFO L280 TraceCheckUtils]: 12: Hoare triple {65183#true} assume !(0 != ~p6~0); {65183#true} is VALID [2020-07-08 12:21:40,748 INFO L280 TraceCheckUtils]: 13: Hoare triple {65183#true} assume 0 != ~p7~0;~lk7~0 := 1; {65187#(not (= 0 main_~p7~0))} is VALID [2020-07-08 12:21:40,748 INFO L280 TraceCheckUtils]: 14: Hoare triple {65187#(not (= 0 main_~p7~0))} assume !(0 != ~p8~0); {65187#(not (= 0 main_~p7~0))} is VALID [2020-07-08 12:21:40,749 INFO L280 TraceCheckUtils]: 15: Hoare triple {65187#(not (= 0 main_~p7~0))} assume !(0 != ~p1~0); {65187#(not (= 0 main_~p7~0))} is VALID [2020-07-08 12:21:40,749 INFO L280 TraceCheckUtils]: 16: Hoare triple {65187#(not (= 0 main_~p7~0))} assume !(0 != ~p2~0); {65187#(not (= 0 main_~p7~0))} is VALID [2020-07-08 12:21:40,750 INFO L280 TraceCheckUtils]: 17: Hoare triple {65187#(not (= 0 main_~p7~0))} assume !(0 != ~p3~0); {65187#(not (= 0 main_~p7~0))} is VALID [2020-07-08 12:21:40,750 INFO L280 TraceCheckUtils]: 18: Hoare triple {65187#(not (= 0 main_~p7~0))} assume !(0 != ~p4~0); {65187#(not (= 0 main_~p7~0))} is VALID [2020-07-08 12:21:40,751 INFO L280 TraceCheckUtils]: 19: Hoare triple {65187#(not (= 0 main_~p7~0))} assume !(0 != ~p5~0); {65187#(not (= 0 main_~p7~0))} is VALID [2020-07-08 12:21:40,751 INFO L280 TraceCheckUtils]: 20: Hoare triple {65187#(not (= 0 main_~p7~0))} assume !(0 != ~p6~0); {65187#(not (= 0 main_~p7~0))} is VALID [2020-07-08 12:21:40,752 INFO L280 TraceCheckUtils]: 21: Hoare triple {65187#(not (= 0 main_~p7~0))} assume !(0 != ~p7~0); {65184#false} is VALID [2020-07-08 12:21:40,752 INFO L280 TraceCheckUtils]: 22: Hoare triple {65184#false} assume 0 != ~p8~0; {65184#false} is VALID [2020-07-08 12:21:40,752 INFO L280 TraceCheckUtils]: 23: Hoare triple {65184#false} assume 1 != ~lk8~0; {65184#false} is VALID [2020-07-08 12:21:40,752 INFO L280 TraceCheckUtils]: 24: Hoare triple {65184#false} assume !false; {65184#false} is VALID [2020-07-08 12:21:40,753 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-08 12:21:40,753 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807009073] [2020-07-08 12:21:40,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:21:40,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:21:40,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123115946] [2020-07-08 12:21:40,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-08 12:21:40,755 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:21:40,755 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:21:40,774 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-08 12:21:40,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:21:40,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:21:40,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:21:40,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:21:40,775 INFO L87 Difference]: Start difference. First operand 2952 states and 3526 transitions. Second operand 3 states. [2020-07-08 12:21:42,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:42,161 INFO L93 Difference]: Finished difference Result 4428 states and 5256 transitions. [2020-07-08 12:21:42,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:21:42,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-08 12:21:42,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:21:42,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:42,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 132 transitions. [2020-07-08 12:21:42,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:42,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 132 transitions. [2020-07-08 12:21:42,164 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 132 transitions. [2020-07-08 12:21:42,284 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:42,584 INFO L225 Difference]: With dead ends: 4428 [2020-07-08 12:21:42,585 INFO L226 Difference]: Without dead ends: 3018 [2020-07-08 12:21:42,587 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-08 12:21:42,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2020-07-08 12:21:43,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 3016. [2020-07-08 12:21:43,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:21:43,320 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3018 states. Second operand 3016 states. [2020-07-08 12:21:43,320 INFO L74 IsIncluded]: Start isIncluded. First operand 3018 states. Second operand 3016 states. [2020-07-08 12:21:43,320 INFO L87 Difference]: Start difference. First operand 3018 states. Second operand 3016 states. [2020-07-08 12:21:43,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:43,563 INFO L93 Difference]: Finished difference Result 3018 states and 3527 transitions. [2020-07-08 12:21:43,563 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 3527 transitions. [2020-07-08 12:21:43,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:43,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:43,566 INFO L74 IsIncluded]: Start isIncluded. First operand 3016 states. Second operand 3018 states. [2020-07-08 12:21:43,566 INFO L87 Difference]: Start difference. First operand 3016 states. Second operand 3018 states. [2020-07-08 12:21:43,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:43,811 INFO L93 Difference]: Finished difference Result 3018 states and 3527 transitions. [2020-07-08 12:21:43,811 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 3527 transitions. [2020-07-08 12:21:43,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:43,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:43,813 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:21:43,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:21:43,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3016 states. [2020-07-08 12:21:44,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 3016 states and 3526 transitions. [2020-07-08 12:21:44,079 INFO L78 Accepts]: Start accepts. Automaton has 3016 states and 3526 transitions. Word has length 25 [2020-07-08 12:21:44,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:21:44,080 INFO L479 AbstractCegarLoop]: Abstraction has 3016 states and 3526 transitions. [2020-07-08 12:21:44,080 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:21:44,080 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3526 transitions. [2020-07-08 12:21:44,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-08 12:21:44,081 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:21:44,082 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-08 12:21:44,082 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-07-08 12:21:44,082 INFO L427 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:21:44,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:21:44,083 INFO L82 PathProgramCache]: Analyzing trace with hash -82673264, now seen corresponding path program 1 times [2020-07-08 12:21:44,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:21:44,083 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228781218] [2020-07-08 12:21:44,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:21:44,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:44,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:44,127 INFO L280 TraceCheckUtils]: 0: Hoare triple {79004#true} assume true; {79004#true} is VALID [2020-07-08 12:21:44,127 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {79004#true} {79004#true} #163#return; {79004#true} is VALID [2020-07-08 12:21:44,127 INFO L263 TraceCheckUtils]: 0: Hoare triple {79004#true} call ULTIMATE.init(); {79004#true} is VALID [2020-07-08 12:21:44,128 INFO L280 TraceCheckUtils]: 1: Hoare triple {79004#true} assume true; {79004#true} is VALID [2020-07-08 12:21:44,128 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {79004#true} {79004#true} #163#return; {79004#true} is VALID [2020-07-08 12:21:44,128 INFO L263 TraceCheckUtils]: 3: Hoare triple {79004#true} call #t~ret9 := main(); {79004#true} is VALID [2020-07-08 12:21:44,128 INFO L280 TraceCheckUtils]: 4: Hoare triple {79004#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;havoc ~cond~0; {79004#true} is VALID [2020-07-08 12:21:44,128 INFO L280 TraceCheckUtils]: 5: Hoare triple {79004#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {79004#true} is VALID [2020-07-08 12:21:44,129 INFO L280 TraceCheckUtils]: 6: Hoare triple {79004#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; {79004#true} is VALID [2020-07-08 12:21:44,131 INFO L280 TraceCheckUtils]: 7: Hoare triple {79004#true} assume !(0 != ~p1~0); {79004#true} is VALID [2020-07-08 12:21:44,131 INFO L280 TraceCheckUtils]: 8: Hoare triple {79004#true} assume !(0 != ~p2~0); {79004#true} is VALID [2020-07-08 12:21:44,132 INFO L280 TraceCheckUtils]: 9: Hoare triple {79004#true} assume !(0 != ~p3~0); {79004#true} is VALID [2020-07-08 12:21:44,132 INFO L280 TraceCheckUtils]: 10: Hoare triple {79004#true} assume !(0 != ~p4~0); {79004#true} is VALID [2020-07-08 12:21:44,132 INFO L280 TraceCheckUtils]: 11: Hoare triple {79004#true} assume !(0 != ~p5~0); {79004#true} is VALID [2020-07-08 12:21:44,132 INFO L280 TraceCheckUtils]: 12: Hoare triple {79004#true} assume !(0 != ~p6~0); {79004#true} is VALID [2020-07-08 12:21:44,132 INFO L280 TraceCheckUtils]: 13: Hoare triple {79004#true} assume !(0 != ~p7~0); {79004#true} is VALID [2020-07-08 12:21:44,137 INFO L280 TraceCheckUtils]: 14: Hoare triple {79004#true} assume !(0 != ~p8~0); {79008#(= 0 main_~p8~0)} is VALID [2020-07-08 12:21:44,138 INFO L280 TraceCheckUtils]: 15: Hoare triple {79008#(= 0 main_~p8~0)} assume !(0 != ~p1~0); {79008#(= 0 main_~p8~0)} is VALID [2020-07-08 12:21:44,138 INFO L280 TraceCheckUtils]: 16: Hoare triple {79008#(= 0 main_~p8~0)} assume !(0 != ~p2~0); {79008#(= 0 main_~p8~0)} is VALID [2020-07-08 12:21:44,139 INFO L280 TraceCheckUtils]: 17: Hoare triple {79008#(= 0 main_~p8~0)} assume !(0 != ~p3~0); {79008#(= 0 main_~p8~0)} is VALID [2020-07-08 12:21:44,139 INFO L280 TraceCheckUtils]: 18: Hoare triple {79008#(= 0 main_~p8~0)} assume !(0 != ~p4~0); {79008#(= 0 main_~p8~0)} is VALID [2020-07-08 12:21:44,140 INFO L280 TraceCheckUtils]: 19: Hoare triple {79008#(= 0 main_~p8~0)} assume !(0 != ~p5~0); {79008#(= 0 main_~p8~0)} is VALID [2020-07-08 12:21:44,144 INFO L280 TraceCheckUtils]: 20: Hoare triple {79008#(= 0 main_~p8~0)} assume !(0 != ~p6~0); {79008#(= 0 main_~p8~0)} is VALID [2020-07-08 12:21:44,145 INFO L280 TraceCheckUtils]: 21: Hoare triple {79008#(= 0 main_~p8~0)} assume !(0 != ~p7~0); {79008#(= 0 main_~p8~0)} is VALID [2020-07-08 12:21:44,145 INFO L280 TraceCheckUtils]: 22: Hoare triple {79008#(= 0 main_~p8~0)} assume 0 != ~p8~0; {79005#false} is VALID [2020-07-08 12:21:44,146 INFO L280 TraceCheckUtils]: 23: Hoare triple {79005#false} assume 1 != ~lk8~0; {79005#false} is VALID [2020-07-08 12:21:44,146 INFO L280 TraceCheckUtils]: 24: Hoare triple {79005#false} assume !false; {79005#false} is VALID [2020-07-08 12:21:44,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:21:44,147 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228781218] [2020-07-08 12:21:44,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:21:44,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:21:44,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127184015] [2020-07-08 12:21:44,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-08 12:21:44,148 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:21:44,148 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:21:44,185 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-08 12:21:44,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:21:44,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:21:44,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:21:44,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:21:44,186 INFO L87 Difference]: Start difference. First operand 3016 states and 3526 transitions. Second operand 3 states. [2020-07-08 12:21:47,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:47,923 INFO L93 Difference]: Finished difference Result 8650 states and 9799 transitions. [2020-07-08 12:21:47,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:21:47,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-08 12:21:47,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:21:47,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:47,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2020-07-08 12:21:47,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:47,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2020-07-08 12:21:47,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 134 transitions. [2020-07-08 12:21:48,051 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-08 12:21:48,372 INFO L225 Difference]: With dead ends: 8650 [2020-07-08 12:21:48,372 INFO L226 Difference]: Without dead ends: 3016 [2020-07-08 12:21:48,378 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-08 12:21:48,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3016 states. [2020-07-08 12:21:49,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3016 to 3016. [2020-07-08 12:21:49,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:21:49,121 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3016 states. Second operand 3016 states. [2020-07-08 12:21:49,121 INFO L74 IsIncluded]: Start isIncluded. First operand 3016 states. Second operand 3016 states. [2020-07-08 12:21:49,121 INFO L87 Difference]: Start difference. First operand 3016 states. Second operand 3016 states. [2020-07-08 12:21:49,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:49,361 INFO L93 Difference]: Finished difference Result 3016 states and 3270 transitions. [2020-07-08 12:21:49,361 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3270 transitions. [2020-07-08 12:21:49,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:49,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:49,364 INFO L74 IsIncluded]: Start isIncluded. First operand 3016 states. Second operand 3016 states. [2020-07-08 12:21:49,364 INFO L87 Difference]: Start difference. First operand 3016 states. Second operand 3016 states. [2020-07-08 12:21:49,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:49,605 INFO L93 Difference]: Finished difference Result 3016 states and 3270 transitions. [2020-07-08 12:21:49,605 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3270 transitions. [2020-07-08 12:21:49,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:49,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:49,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:21:49,608 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:21:49,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3016 states. [2020-07-08 12:21:49,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 3016 states and 3270 transitions. [2020-07-08 12:21:49,875 INFO L78 Accepts]: Start accepts. Automaton has 3016 states and 3270 transitions. Word has length 25 [2020-07-08 12:21:49,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:21:49,875 INFO L479 AbstractCegarLoop]: Abstraction has 3016 states and 3270 transitions. [2020-07-08 12:21:49,875 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:21:49,875 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3270 transitions. [2020-07-08 12:21:49,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-08 12:21:49,877 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:21:49,877 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-08 12:21:49,877 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-07-08 12:21:49,877 INFO L427 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:21:49,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:21:49,878 INFO L82 PathProgramCache]: Analyzing trace with hash -783737842, now seen corresponding path program 1 times [2020-07-08 12:21:49,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:21:49,878 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7739901] [2020-07-08 12:21:49,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:21:49,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:49,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:21:49,913 INFO L280 TraceCheckUtils]: 0: Hoare triple {97234#true} assume true; {97234#true} is VALID [2020-07-08 12:21:49,913 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {97234#true} {97234#true} #163#return; {97234#true} is VALID [2020-07-08 12:21:49,913 INFO L263 TraceCheckUtils]: 0: Hoare triple {97234#true} call ULTIMATE.init(); {97234#true} is VALID [2020-07-08 12:21:49,913 INFO L280 TraceCheckUtils]: 1: Hoare triple {97234#true} assume true; {97234#true} is VALID [2020-07-08 12:21:49,914 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {97234#true} {97234#true} #163#return; {97234#true} is VALID [2020-07-08 12:21:49,914 INFO L263 TraceCheckUtils]: 3: Hoare triple {97234#true} call #t~ret9 := main(); {97234#true} is VALID [2020-07-08 12:21:49,914 INFO L280 TraceCheckUtils]: 4: Hoare triple {97234#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;havoc ~cond~0; {97234#true} is VALID [2020-07-08 12:21:49,914 INFO L280 TraceCheckUtils]: 5: Hoare triple {97234#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {97234#true} is VALID [2020-07-08 12:21:49,914 INFO L280 TraceCheckUtils]: 6: Hoare triple {97234#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; {97234#true} is VALID [2020-07-08 12:21:49,915 INFO L280 TraceCheckUtils]: 7: Hoare triple {97234#true} assume !(0 != ~p1~0); {97234#true} is VALID [2020-07-08 12:21:49,915 INFO L280 TraceCheckUtils]: 8: Hoare triple {97234#true} assume !(0 != ~p2~0); {97234#true} is VALID [2020-07-08 12:21:49,915 INFO L280 TraceCheckUtils]: 9: Hoare triple {97234#true} assume !(0 != ~p3~0); {97234#true} is VALID [2020-07-08 12:21:49,915 INFO L280 TraceCheckUtils]: 10: Hoare triple {97234#true} assume !(0 != ~p4~0); {97234#true} is VALID [2020-07-08 12:21:49,915 INFO L280 TraceCheckUtils]: 11: Hoare triple {97234#true} assume !(0 != ~p5~0); {97234#true} is VALID [2020-07-08 12:21:49,916 INFO L280 TraceCheckUtils]: 12: Hoare triple {97234#true} assume !(0 != ~p6~0); {97234#true} is VALID [2020-07-08 12:21:49,916 INFO L280 TraceCheckUtils]: 13: Hoare triple {97234#true} assume !(0 != ~p7~0); {97234#true} is VALID [2020-07-08 12:21:49,917 INFO L280 TraceCheckUtils]: 14: Hoare triple {97234#true} assume 0 != ~p8~0;~lk8~0 := 1; {97238#(= 1 main_~lk8~0)} is VALID [2020-07-08 12:21:49,919 INFO L280 TraceCheckUtils]: 15: Hoare triple {97238#(= 1 main_~lk8~0)} assume !(0 != ~p1~0); {97238#(= 1 main_~lk8~0)} is VALID [2020-07-08 12:21:49,920 INFO L280 TraceCheckUtils]: 16: Hoare triple {97238#(= 1 main_~lk8~0)} assume !(0 != ~p2~0); {97238#(= 1 main_~lk8~0)} is VALID [2020-07-08 12:21:49,922 INFO L280 TraceCheckUtils]: 17: Hoare triple {97238#(= 1 main_~lk8~0)} assume !(0 != ~p3~0); {97238#(= 1 main_~lk8~0)} is VALID [2020-07-08 12:21:49,925 INFO L280 TraceCheckUtils]: 18: Hoare triple {97238#(= 1 main_~lk8~0)} assume !(0 != ~p4~0); {97238#(= 1 main_~lk8~0)} is VALID [2020-07-08 12:21:49,926 INFO L280 TraceCheckUtils]: 19: Hoare triple {97238#(= 1 main_~lk8~0)} assume !(0 != ~p5~0); {97238#(= 1 main_~lk8~0)} is VALID [2020-07-08 12:21:49,926 INFO L280 TraceCheckUtils]: 20: Hoare triple {97238#(= 1 main_~lk8~0)} assume !(0 != ~p6~0); {97238#(= 1 main_~lk8~0)} is VALID [2020-07-08 12:21:49,927 INFO L280 TraceCheckUtils]: 21: Hoare triple {97238#(= 1 main_~lk8~0)} assume !(0 != ~p7~0); {97238#(= 1 main_~lk8~0)} is VALID [2020-07-08 12:21:49,927 INFO L280 TraceCheckUtils]: 22: Hoare triple {97238#(= 1 main_~lk8~0)} assume 0 != ~p8~0; {97238#(= 1 main_~lk8~0)} is VALID [2020-07-08 12:21:49,928 INFO L280 TraceCheckUtils]: 23: Hoare triple {97238#(= 1 main_~lk8~0)} assume 1 != ~lk8~0; {97235#false} is VALID [2020-07-08 12:21:49,928 INFO L280 TraceCheckUtils]: 24: Hoare triple {97235#false} assume !false; {97235#false} is VALID [2020-07-08 12:21:49,929 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-08 12:21:49,929 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7739901] [2020-07-08 12:21:49,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:21:49,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:21:49,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747624691] [2020-07-08 12:21:49,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-08 12:21:49,930 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:21:49,933 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:21:49,964 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-08 12:21:49,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:21:49,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:21:49,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:21:49,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:21:49,966 INFO L87 Difference]: Start difference. First operand 3016 states and 3270 transitions. Second operand 3 states. [2020-07-08 12:21:50,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:50,980 INFO L93 Difference]: Finished difference Result 3016 states and 3270 transitions. [2020-07-08 12:21:50,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:21:50,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-08 12:21:50,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:21:50,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:50,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2020-07-08 12:21:50,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:21:50,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2020-07-08 12:21:50,982 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 47 transitions. [2020-07-08 12:21:51,025 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:21:51,025 INFO L225 Difference]: With dead ends: 3016 [2020-07-08 12:21:51,025 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 12:21:51,030 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-08 12:21:51,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 12:21:51,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 12:21:51,030 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:21:51,030 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 12:21:51,030 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 12:21:51,030 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 12:21:51,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:51,031 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 12:21:51,031 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:21:51,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:51,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:51,031 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 12:21:51,031 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 12:21:51,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:21:51,031 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 12:21:51,031 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:21:51,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:51,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:21:51,032 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:21:51,032 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:21:51,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 12:21:51,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 12:21:51,032 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2020-07-08 12:21:51,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:21:51,032 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 12:21:51,033 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:21:51,033 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:21:51,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:21:51,033 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-07-08 12:21:51,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 12:21:51,062 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-08 12:21:51,062 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-08 12:21:51,062 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-08 12:21:51,062 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 12:21:51,062 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 12:21:51,062 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-08 12:21:51,062 INFO L268 CegarLoopResult]: For program point L126(line 126) no Hoare annotation was computed. [2020-07-08 12:21:51,062 INFO L264 CegarLoopResult]: At program point L126-1(lines 5 135) the Hoare annotation is: false [2020-07-08 12:21:51,062 INFO L268 CegarLoopResult]: For program point L60-1(lines 33 130) no Hoare annotation was computed. [2020-07-08 12:21:51,062 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 4 135) no Hoare annotation was computed. [2020-07-08 12:21:51,062 INFO L268 CegarLoopResult]: For program point L110-1(lines 33 130) no Hoare annotation was computed. [2020-07-08 12:21:51,063 INFO L268 CegarLoopResult]: For program point L111(line 111) no Hoare annotation was computed. [2020-07-08 12:21:51,063 INFO L268 CegarLoopResult]: For program point L95-1(lines 33 130) no Hoare annotation was computed. [2020-07-08 12:21:51,063 INFO L268 CegarLoopResult]: For program point L120-1(lines 33 130) no Hoare annotation was computed. [2020-07-08 12:21:51,063 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 4 135) no Hoare annotation was computed. [2020-07-08 12:21:51,063 INFO L268 CegarLoopResult]: For program point L96(line 96) no Hoare annotation was computed. [2020-07-08 12:21:51,063 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 133) no Hoare annotation was computed. [2020-07-08 12:21:51,064 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 135) the Hoare annotation is: true [2020-07-08 12:21:51,064 INFO L268 CegarLoopResult]: For program point L121(line 121) no Hoare annotation was computed. [2020-07-08 12:21:51,064 INFO L268 CegarLoopResult]: For program point L80-1(lines 33 130) no Hoare annotation was computed. [2020-07-08 12:21:51,064 INFO L268 CegarLoopResult]: For program point L105-1(lines 33 130) no Hoare annotation was computed. [2020-07-08 12:21:51,065 INFO L268 CegarLoopResult]: For program point L72-1(lines 33 130) no Hoare annotation was computed. [2020-07-08 12:21:51,065 INFO L268 CegarLoopResult]: For program point L64-1(lines 33 130) no Hoare annotation was computed. [2020-07-08 12:21:51,065 INFO L268 CegarLoopResult]: For program point L56(lines 56 58) no Hoare annotation was computed. [2020-07-08 12:21:51,065 INFO L268 CegarLoopResult]: For program point L56-2(lines 33 130) no Hoare annotation was computed. [2020-07-08 12:21:51,065 INFO L268 CegarLoopResult]: For program point L106(line 106) no Hoare annotation was computed. [2020-07-08 12:21:51,065 INFO L271 CegarLoopResult]: At program point L131(lines 5 135) the Hoare annotation is: true [2020-07-08 12:21:51,065 INFO L268 CegarLoopResult]: For program point L90-1(lines 33 130) no Hoare annotation was computed. [2020-07-08 12:21:51,065 INFO L268 CegarLoopResult]: For program point L115-1(lines 33 130) no Hoare annotation was computed. [2020-07-08 12:21:51,065 INFO L268 CegarLoopResult]: For program point L91(line 91) no Hoare annotation was computed. [2020-07-08 12:21:51,065 INFO L268 CegarLoopResult]: For program point L116(line 116) no Hoare annotation was computed. [2020-07-08 12:21:51,066 INFO L268 CegarLoopResult]: For program point L100-1(lines 33 130) no Hoare annotation was computed. [2020-07-08 12:21:51,066 INFO L271 CegarLoopResult]: At program point L125-1(lines 33 130) the Hoare annotation is: true [2020-07-08 12:21:51,066 INFO L268 CegarLoopResult]: For program point L84-1(lines 33 130) no Hoare annotation was computed. [2020-07-08 12:21:51,066 INFO L268 CegarLoopResult]: For program point L76-1(lines 33 130) no Hoare annotation was computed. [2020-07-08 12:21:51,066 INFO L268 CegarLoopResult]: For program point L101(line 101) no Hoare annotation was computed. [2020-07-08 12:21:51,066 INFO L268 CegarLoopResult]: For program point L35(lines 35 37) no Hoare annotation was computed. [2020-07-08 12:21:51,066 INFO L268 CegarLoopResult]: For program point L68-1(lines 33 130) no Hoare annotation was computed. [2020-07-08 12:21:51,069 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:21:51,069 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:21:51,070 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:21:51,070 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-08 12:21:51,070 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:21:51,070 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:21:51,070 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-08 12:21:51,070 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-08 12:21:51,070 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:21:51,070 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2020-07-08 12:21:51,070 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2020-07-08 12:21:51,070 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 12:21:51,070 WARN L170 areAnnotationChecker]: L56-2 has no Hoare annotation [2020-07-08 12:21:51,070 WARN L170 areAnnotationChecker]: L56-2 has no Hoare annotation [2020-07-08 12:21:51,070 WARN L170 areAnnotationChecker]: L60-1 has no Hoare annotation [2020-07-08 12:21:51,071 WARN L170 areAnnotationChecker]: L60-1 has no Hoare annotation [2020-07-08 12:21:51,071 WARN L170 areAnnotationChecker]: L64-1 has no Hoare annotation [2020-07-08 12:21:51,071 WARN L170 areAnnotationChecker]: L64-1 has no Hoare annotation [2020-07-08 12:21:51,071 WARN L170 areAnnotationChecker]: L68-1 has no Hoare annotation [2020-07-08 12:21:51,071 WARN L170 areAnnotationChecker]: L68-1 has no Hoare annotation [2020-07-08 12:21:51,071 WARN L170 areAnnotationChecker]: L72-1 has no Hoare annotation [2020-07-08 12:21:51,071 WARN L170 areAnnotationChecker]: L72-1 has no Hoare annotation [2020-07-08 12:21:51,071 WARN L170 areAnnotationChecker]: L76-1 has no Hoare annotation [2020-07-08 12:21:51,071 WARN L170 areAnnotationChecker]: L76-1 has no Hoare annotation [2020-07-08 12:21:51,071 WARN L170 areAnnotationChecker]: L80-1 has no Hoare annotation [2020-07-08 12:21:51,071 WARN L170 areAnnotationChecker]: L80-1 has no Hoare annotation [2020-07-08 12:21:51,071 WARN L170 areAnnotationChecker]: L84-1 has no Hoare annotation [2020-07-08 12:21:51,071 WARN L170 areAnnotationChecker]: L84-1 has no Hoare annotation [2020-07-08 12:21:51,071 WARN L170 areAnnotationChecker]: L91 has no Hoare annotation [2020-07-08 12:21:51,071 WARN L170 areAnnotationChecker]: L91 has no Hoare annotation [2020-07-08 12:21:51,072 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2020-07-08 12:21:51,072 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2020-07-08 12:21:51,072 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2020-07-08 12:21:51,072 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:21:51,072 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2020-07-08 12:21:51,072 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2020-07-08 12:21:51,072 WARN L170 areAnnotationChecker]: L95-1 has no Hoare annotation [2020-07-08 12:21:51,072 WARN L170 areAnnotationChecker]: L95-1 has no Hoare annotation [2020-07-08 12:21:51,072 WARN L170 areAnnotationChecker]: L101 has no Hoare annotation [2020-07-08 12:21:51,072 WARN L170 areAnnotationChecker]: L101 has no Hoare annotation [2020-07-08 12:21:51,072 WARN L170 areAnnotationChecker]: L100-1 has no Hoare annotation [2020-07-08 12:21:51,072 WARN L170 areAnnotationChecker]: L100-1 has no Hoare annotation [2020-07-08 12:21:51,072 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2020-07-08 12:21:51,073 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2020-07-08 12:21:51,073 WARN L170 areAnnotationChecker]: L105-1 has no Hoare annotation [2020-07-08 12:21:51,073 WARN L170 areAnnotationChecker]: L105-1 has no Hoare annotation [2020-07-08 12:21:51,073 WARN L170 areAnnotationChecker]: L111 has no Hoare annotation [2020-07-08 12:21:51,073 WARN L170 areAnnotationChecker]: L111 has no Hoare annotation [2020-07-08 12:21:51,073 WARN L170 areAnnotationChecker]: L110-1 has no Hoare annotation [2020-07-08 12:21:51,073 WARN L170 areAnnotationChecker]: L110-1 has no Hoare annotation [2020-07-08 12:21:51,073 WARN L170 areAnnotationChecker]: L116 has no Hoare annotation [2020-07-08 12:21:51,073 WARN L170 areAnnotationChecker]: L116 has no Hoare annotation [2020-07-08 12:21:51,073 WARN L170 areAnnotationChecker]: L115-1 has no Hoare annotation [2020-07-08 12:21:51,073 WARN L170 areAnnotationChecker]: L115-1 has no Hoare annotation [2020-07-08 12:21:51,073 WARN L170 areAnnotationChecker]: L121 has no Hoare annotation [2020-07-08 12:21:51,073 WARN L170 areAnnotationChecker]: L121 has no Hoare annotation [2020-07-08 12:21:51,073 WARN L170 areAnnotationChecker]: L120-1 has no Hoare annotation [2020-07-08 12:21:51,074 WARN L170 areAnnotationChecker]: L120-1 has no Hoare annotation [2020-07-08 12:21:51,074 WARN L170 areAnnotationChecker]: L126 has no Hoare annotation [2020-07-08 12:21:51,074 WARN L170 areAnnotationChecker]: L126 has no Hoare annotation [2020-07-08 12:21:51,074 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 12:21:51,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 12:21:51 BoogieIcfgContainer [2020-07-08 12:21:51,079 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 12:21:51,081 INFO L168 Benchmark]: Toolchain (without parser) took 29202.53 ms. Allocated memory was 136.8 MB in the beginning and 489.2 MB in the end (delta: 352.3 MB). Free memory was 102.3 MB in the beginning and 421.5 MB in the end (delta: -319.1 MB). Peak memory consumption was 33.2 MB. Max. memory is 7.1 GB. [2020-07-08 12:21:51,082 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-08 12:21:51,082 INFO L168 Benchmark]: CACSL2BoogieTranslator took 354.66 ms. Allocated memory is still 136.8 MB. Free memory was 102.1 MB in the beginning and 91.0 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. [2020-07-08 12:21:51,083 INFO L168 Benchmark]: Boogie Preprocessor took 131.29 ms. Allocated memory was 136.8 MB in the beginning and 199.8 MB in the end (delta: 62.9 MB). Free memory was 91.0 MB in the beginning and 177.9 MB in the end (delta: -86.9 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. [2020-07-08 12:21:51,083 INFO L168 Benchmark]: RCFGBuilder took 531.11 ms. Allocated memory is still 199.8 MB. Free memory was 177.2 MB in the beginning and 151.3 MB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2020-07-08 12:21:51,083 INFO L168 Benchmark]: TraceAbstraction took 28180.24 ms. Allocated memory was 199.8 MB in the beginning and 489.2 MB in the end (delta: 289.4 MB). Free memory was 150.6 MB in the beginning and 421.5 MB in the end (delta: -270.8 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. [2020-07-08 12:21:51,085 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 354.66 ms. Allocated memory is still 136.8 MB. Free memory was 102.1 MB in the beginning and 91.0 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 131.29 ms. Allocated memory was 136.8 MB in the beginning and 199.8 MB in the end (delta: 62.9 MB). Free memory was 91.0 MB in the beginning and 177.9 MB in the end (delta: -86.9 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 531.11 ms. Allocated memory is still 199.8 MB. Free memory was 177.2 MB in the beginning and 151.3 MB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28180.24 ms. Allocated memory was 199.8 MB in the beginning and 489.2 MB in the end (delta: 289.4 MB). Free memory was 150.6 MB in the beginning and 421.5 MB in the end (delta: -270.8 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 133]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 28.0s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 17.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1573 SDtfs, 755 SDslu, 1056 SDs, 0 SdLazy, 121 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3016occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.4s AutomataMinimizationTime, 23 MinimizatonAttempts, 790 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 266 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 498 NumberOfCodeBlocks, 498 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 475 ConstructedInterpolants, 0 QuantifiedInterpolants, 19027 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...