/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_5.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:26:13,042 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:26:13,045 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:26:13,063 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:26:13,064 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:26:13,065 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:26:13,067 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:26:13,077 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:26:13,080 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:26:13,084 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:26:13,086 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:26:13,090 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:26:13,090 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:26:13,093 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:26:13,096 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:26:13,097 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:26:13,099 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:26:13,099 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:26:13,101 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:26:13,106 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:26:13,113 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:26:13,117 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:26:13,118 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:26:13,119 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:26:13,122 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:26:13,122 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:26:13,122 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:26:13,124 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:26:13,125 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:26:13,127 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:26:13,127 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:26:13,128 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:26:13,129 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:26:13,129 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:26:13,131 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:26:13,131 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:26:13,131 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:26:13,132 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:26:13,132 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:26:13,133 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:26:13,134 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:26:13,135 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:26:13,172 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:26:13,172 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:26:13,173 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:26:13,174 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:26:13,174 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:26:13,174 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:26:13,174 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:26:13,174 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:26:13,175 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:26:13,175 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:26:13,175 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:26:13,175 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:26:13,175 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:26:13,176 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:26:13,176 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:26:13,176 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:26:13,178 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:26:13,178 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:26:13,178 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:26:13,179 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:26:13,179 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:26:13,179 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:26:13,179 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:26:13,179 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:26:13,180 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:26:13,180 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:26:13,180 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:26:13,180 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:26:13,180 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:26:13,181 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:26:13,477 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:26:13,491 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:26:13,495 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:26:13,497 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:26:13,497 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:26:13,498 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_5.c [2020-07-17 22:26:13,560 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a96999247/c4ec47e4199b435c97baade0b52a3e2a/FLAG3c36318f3 [2020-07-17 22:26:14,032 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:26:14,033 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_5.c [2020-07-17 22:26:14,041 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a96999247/c4ec47e4199b435c97baade0b52a3e2a/FLAG3c36318f3 [2020-07-17 22:26:14,380 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a96999247/c4ec47e4199b435c97baade0b52a3e2a [2020-07-17 22:26:14,388 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:26:14,391 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:26:14,392 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:26:14,392 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:26:14,395 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:26:14,397 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:26:14" (1/1) ... [2020-07-17 22:26:14,402 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@527465e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:14, skipping insertion in model container [2020-07-17 22:26:14,402 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:26:14" (1/1) ... [2020-07-17 22:26:14,411 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:26:14,431 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:26:14,610 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:26:14,616 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:26:14,639 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:26:14,652 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:26:14,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:14 WrapperNode [2020-07-17 22:26:14,653 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:26:14,653 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:26:14,653 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:26:14,653 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:26:14,663 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:14" (1/1) ... [2020-07-17 22:26:14,663 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:14" (1/1) ... [2020-07-17 22:26:14,669 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:14" (1/1) ... [2020-07-17 22:26:14,669 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:14" (1/1) ... [2020-07-17 22:26:14,675 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:14" (1/1) ... [2020-07-17 22:26:14,762 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:14" (1/1) ... [2020-07-17 22:26:14,763 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:14" (1/1) ... [2020-07-17 22:26:14,765 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:26:14,766 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:26:14,766 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:26:14,766 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:26:14,767 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:26:14,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:26:14,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:26:14,835 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:26:14,835 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:26:14,835 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:26:14,836 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:26:14,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:26:14,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:26:15,241 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:26:15,242 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-17 22:26:15,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:26:15 BoogieIcfgContainer [2020-07-17 22:26:15,246 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:26:15,247 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:26:15,247 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:26:15,251 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:26:15,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:26:14" (1/3) ... [2020-07-17 22:26:15,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c3b4430 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:26:15, skipping insertion in model container [2020-07-17 22:26:15,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:26:14" (2/3) ... [2020-07-17 22:26:15,253 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c3b4430 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:26:15, skipping insertion in model container [2020-07-17 22:26:15,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:26:15" (3/3) ... [2020-07-17 22:26:15,255 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_5.c [2020-07-17 22:26:15,266 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:26:15,274 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:26:15,289 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:26:15,314 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:26:15,315 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:26:15,315 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:26:15,315 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:26:15,315 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:26:15,316 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:26:15,316 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:26:15,316 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:26:15,336 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2020-07-17 22:26:15,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-17 22:26:15,343 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:15,344 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:15,345 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:15,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:15,351 INFO L82 PathProgramCache]: Analyzing trace with hash 316328318, now seen corresponding path program 1 times [2020-07-17 22:26:15,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:15,360 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190749492] [2020-07-17 22:26:15,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:15,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:15,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:15,572 INFO L280 TraceCheckUtils]: 0: Hoare triple {32#true} assume true; {32#true} is VALID [2020-07-17 22:26:15,572 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {32#true} {32#true} #112#return; {32#true} is VALID [2020-07-17 22:26:15,574 INFO L263 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2020-07-17 22:26:15,575 INFO L280 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2020-07-17 22:26:15,575 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #112#return; {32#true} is VALID [2020-07-17 22:26:15,575 INFO L263 TraceCheckUtils]: 3: Hoare triple {32#true} call #t~ret6 := main(); {32#true} is VALID [2020-07-17 22:26:15,576 INFO L280 TraceCheckUtils]: 4: Hoare triple {32#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;havoc ~cond~0; {32#true} is VALID [2020-07-17 22:26:15,577 INFO L280 TraceCheckUtils]: 5: Hoare triple {32#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {32#true} is VALID [2020-07-17 22:26:15,577 INFO L280 TraceCheckUtils]: 6: Hoare triple {32#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {32#true} is VALID [2020-07-17 22:26:15,578 INFO L280 TraceCheckUtils]: 7: Hoare triple {32#true} assume 0 != ~p1~0;~lk1~0 := 1; {36#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:15,579 INFO L280 TraceCheckUtils]: 8: Hoare triple {36#(= 1 main_~lk1~0)} assume 0 != ~p2~0;~lk2~0 := 1; {36#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:15,580 INFO L280 TraceCheckUtils]: 9: Hoare triple {36#(= 1 main_~lk1~0)} assume 0 != ~p3~0;~lk3~0 := 1; {36#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:15,581 INFO L280 TraceCheckUtils]: 10: Hoare triple {36#(= 1 main_~lk1~0)} assume 0 != ~p4~0;~lk4~0 := 1; {36#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:15,585 INFO L280 TraceCheckUtils]: 11: Hoare triple {36#(= 1 main_~lk1~0)} assume 0 != ~p5~0;~lk5~0 := 1; {36#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:15,588 INFO L280 TraceCheckUtils]: 12: Hoare triple {36#(= 1 main_~lk1~0)} assume 0 != ~p1~0; {36#(= 1 main_~lk1~0)} is VALID [2020-07-17 22:26:15,589 INFO L280 TraceCheckUtils]: 13: Hoare triple {36#(= 1 main_~lk1~0)} assume 1 != ~lk1~0; {33#false} is VALID [2020-07-17 22:26:15,590 INFO L280 TraceCheckUtils]: 14: Hoare triple {33#false} assume !false; {33#false} is VALID [2020-07-17 22:26:15,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:15,593 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190749492] [2020-07-17 22:26:15,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:15,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:15,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071756303] [2020-07-17 22:26:15,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-07-17 22:26:15,604 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:15,608 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:15,642 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:15,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:15,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:15,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:15,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:15,653 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2020-07-17 22:26:15,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:15,870 INFO L93 Difference]: Finished difference Result 57 states and 90 transitions. [2020-07-17 22:26:15,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:15,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-07-17 22:26:15,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:15,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:15,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2020-07-17 22:26:15,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:15,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2020-07-17 22:26:15,908 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 90 transitions. [2020-07-17 22:26:16,059 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-17 22:26:16,072 INFO L225 Difference]: With dead ends: 57 [2020-07-17 22:26:16,073 INFO L226 Difference]: Without dead ends: 42 [2020-07-17 22:26:16,076 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:16,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-17 22:26:16,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2020-07-17 22:26:16,114 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:16,114 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 30 states. [2020-07-17 22:26:16,115 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 30 states. [2020-07-17 22:26:16,115 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 30 states. [2020-07-17 22:26:16,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:16,122 INFO L93 Difference]: Finished difference Result 42 states and 68 transitions. [2020-07-17 22:26:16,122 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 68 transitions. [2020-07-17 22:26:16,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:16,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:16,123 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 42 states. [2020-07-17 22:26:16,124 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 42 states. [2020-07-17 22:26:16,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:16,130 INFO L93 Difference]: Finished difference Result 42 states and 68 transitions. [2020-07-17 22:26:16,130 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 68 transitions. [2020-07-17 22:26:16,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:16,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:16,131 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:16,131 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:16,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-17 22:26:16,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 49 transitions. [2020-07-17 22:26:16,136 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 49 transitions. Word has length 15 [2020-07-17 22:26:16,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:16,137 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 49 transitions. [2020-07-17 22:26:16,137 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:16,137 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 49 transitions. [2020-07-17 22:26:16,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-17 22:26:16,138 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:16,138 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:16,139 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:26:16,139 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:16,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:16,140 INFO L82 PathProgramCache]: Analyzing trace with hash -493018308, now seen corresponding path program 1 times [2020-07-17 22:26:16,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:16,140 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401136083] [2020-07-17 22:26:16,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:16,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:16,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:16,194 INFO L280 TraceCheckUtils]: 0: Hoare triple {228#true} assume true; {228#true} is VALID [2020-07-17 22:26:16,195 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {228#true} {228#true} #112#return; {228#true} is VALID [2020-07-17 22:26:16,195 INFO L263 TraceCheckUtils]: 0: Hoare triple {228#true} call ULTIMATE.init(); {228#true} is VALID [2020-07-17 22:26:16,196 INFO L280 TraceCheckUtils]: 1: Hoare triple {228#true} assume true; {228#true} is VALID [2020-07-17 22:26:16,196 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {228#true} {228#true} #112#return; {228#true} is VALID [2020-07-17 22:26:16,196 INFO L263 TraceCheckUtils]: 3: Hoare triple {228#true} call #t~ret6 := main(); {228#true} is VALID [2020-07-17 22:26:16,197 INFO L280 TraceCheckUtils]: 4: Hoare triple {228#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;havoc ~cond~0; {228#true} is VALID [2020-07-17 22:26:16,197 INFO L280 TraceCheckUtils]: 5: Hoare triple {228#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {228#true} is VALID [2020-07-17 22:26:16,197 INFO L280 TraceCheckUtils]: 6: Hoare triple {228#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {228#true} is VALID [2020-07-17 22:26:16,199 INFO L280 TraceCheckUtils]: 7: Hoare triple {228#true} assume !(0 != ~p1~0); {232#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:16,199 INFO L280 TraceCheckUtils]: 8: Hoare triple {232#(= 0 main_~p1~0)} assume 0 != ~p2~0;~lk2~0 := 1; {232#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:16,200 INFO L280 TraceCheckUtils]: 9: Hoare triple {232#(= 0 main_~p1~0)} assume 0 != ~p3~0;~lk3~0 := 1; {232#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:16,201 INFO L280 TraceCheckUtils]: 10: Hoare triple {232#(= 0 main_~p1~0)} assume 0 != ~p4~0;~lk4~0 := 1; {232#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:16,202 INFO L280 TraceCheckUtils]: 11: Hoare triple {232#(= 0 main_~p1~0)} assume 0 != ~p5~0;~lk5~0 := 1; {232#(= 0 main_~p1~0)} is VALID [2020-07-17 22:26:16,203 INFO L280 TraceCheckUtils]: 12: Hoare triple {232#(= 0 main_~p1~0)} assume 0 != ~p1~0; {229#false} is VALID [2020-07-17 22:26:16,203 INFO L280 TraceCheckUtils]: 13: Hoare triple {229#false} assume 1 != ~lk1~0; {229#false} is VALID [2020-07-17 22:26:16,204 INFO L280 TraceCheckUtils]: 14: Hoare triple {229#false} assume !false; {229#false} is VALID [2020-07-17 22:26:16,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:16,214 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401136083] [2020-07-17 22:26:16,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:16,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:16,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106123426] [2020-07-17 22:26:16,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-07-17 22:26:16,219 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:16,219 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:16,240 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:16,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:16,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:16,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:16,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:16,242 INFO L87 Difference]: Start difference. First operand 30 states and 49 transitions. Second operand 3 states. [2020-07-17 22:26:16,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:16,333 INFO L93 Difference]: Finished difference Result 67 states and 112 transitions. [2020-07-17 22:26:16,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:16,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-07-17 22:26:16,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:16,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:16,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2020-07-17 22:26:16,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:16,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2020-07-17 22:26:16,340 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2020-07-17 22:26:16,461 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:16,463 INFO L225 Difference]: With dead ends: 67 [2020-07-17 22:26:16,463 INFO L226 Difference]: Without dead ends: 42 [2020-07-17 22:26:16,464 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:16,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-17 22:26:16,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2020-07-17 22:26:16,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:16,474 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 40 states. [2020-07-17 22:26:16,474 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 40 states. [2020-07-17 22:26:16,475 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 40 states. [2020-07-17 22:26:16,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:16,478 INFO L93 Difference]: Finished difference Result 42 states and 66 transitions. [2020-07-17 22:26:16,479 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 66 transitions. [2020-07-17 22:26:16,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:16,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:16,480 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 42 states. [2020-07-17 22:26:16,480 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 42 states. [2020-07-17 22:26:16,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:16,484 INFO L93 Difference]: Finished difference Result 42 states and 66 transitions. [2020-07-17 22:26:16,484 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 66 transitions. [2020-07-17 22:26:16,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:16,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:16,485 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:16,485 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:16,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-17 22:26:16,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 65 transitions. [2020-07-17 22:26:16,489 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 65 transitions. Word has length 15 [2020-07-17 22:26:16,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:16,489 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 65 transitions. [2020-07-17 22:26:16,489 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:16,490 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 65 transitions. [2020-07-17 22:26:16,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-17 22:26:16,490 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:16,491 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:16,491 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:26:16,491 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:16,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:16,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1216458266, now seen corresponding path program 1 times [2020-07-17 22:26:16,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:16,492 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74749415] [2020-07-17 22:26:16,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:16,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:16,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:16,556 INFO L280 TraceCheckUtils]: 0: Hoare triple {443#true} assume true; {443#true} is VALID [2020-07-17 22:26:16,556 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {443#true} {443#true} #112#return; {443#true} is VALID [2020-07-17 22:26:16,557 INFO L263 TraceCheckUtils]: 0: Hoare triple {443#true} call ULTIMATE.init(); {443#true} is VALID [2020-07-17 22:26:16,557 INFO L280 TraceCheckUtils]: 1: Hoare triple {443#true} assume true; {443#true} is VALID [2020-07-17 22:26:16,557 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {443#true} {443#true} #112#return; {443#true} is VALID [2020-07-17 22:26:16,558 INFO L263 TraceCheckUtils]: 3: Hoare triple {443#true} call #t~ret6 := main(); {443#true} is VALID [2020-07-17 22:26:16,558 INFO L280 TraceCheckUtils]: 4: Hoare triple {443#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;havoc ~cond~0; {443#true} is VALID [2020-07-17 22:26:16,558 INFO L280 TraceCheckUtils]: 5: Hoare triple {443#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {443#true} is VALID [2020-07-17 22:26:16,559 INFO L280 TraceCheckUtils]: 6: Hoare triple {443#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {443#true} is VALID [2020-07-17 22:26:16,560 INFO L280 TraceCheckUtils]: 7: Hoare triple {443#true} assume 0 != ~p1~0;~lk1~0 := 1; {447#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:16,560 INFO L280 TraceCheckUtils]: 8: Hoare triple {447#(not (= 0 main_~p1~0))} assume 0 != ~p2~0;~lk2~0 := 1; {447#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:16,561 INFO L280 TraceCheckUtils]: 9: Hoare triple {447#(not (= 0 main_~p1~0))} assume 0 != ~p3~0;~lk3~0 := 1; {447#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:16,562 INFO L280 TraceCheckUtils]: 10: Hoare triple {447#(not (= 0 main_~p1~0))} assume 0 != ~p4~0;~lk4~0 := 1; {447#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:16,563 INFO L280 TraceCheckUtils]: 11: Hoare triple {447#(not (= 0 main_~p1~0))} assume 0 != ~p5~0;~lk5~0 := 1; {447#(not (= 0 main_~p1~0))} is VALID [2020-07-17 22:26:16,563 INFO L280 TraceCheckUtils]: 12: Hoare triple {447#(not (= 0 main_~p1~0))} assume !(0 != ~p1~0); {444#false} is VALID [2020-07-17 22:26:16,564 INFO L280 TraceCheckUtils]: 13: Hoare triple {444#false} assume 0 != ~p2~0; {444#false} is VALID [2020-07-17 22:26:16,564 INFO L280 TraceCheckUtils]: 14: Hoare triple {444#false} assume 1 != ~lk2~0; {444#false} is VALID [2020-07-17 22:26:16,564 INFO L280 TraceCheckUtils]: 15: Hoare triple {444#false} assume !false; {444#false} is VALID [2020-07-17 22:26:16,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:16,565 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74749415] [2020-07-17 22:26:16,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:16,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:16,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878375196] [2020-07-17 22:26:16,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-07-17 22:26:16,567 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:16,567 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:16,585 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:16,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:16,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:16,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:16,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:16,586 INFO L87 Difference]: Start difference. First operand 40 states and 65 transitions. Second operand 3 states. [2020-07-17 22:26:16,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:16,672 INFO L93 Difference]: Finished difference Result 63 states and 99 transitions. [2020-07-17 22:26:16,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:16,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-07-17 22:26:16,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:16,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:16,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2020-07-17 22:26:16,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:16,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2020-07-17 22:26:16,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 96 transitions. [2020-07-17 22:26:16,785 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:16,787 INFO L225 Difference]: With dead ends: 63 [2020-07-17 22:26:16,787 INFO L226 Difference]: Without dead ends: 45 [2020-07-17 22:26:16,788 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:16,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-17 22:26:16,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2020-07-17 22:26:16,800 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:16,800 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 43 states. [2020-07-17 22:26:16,801 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 43 states. [2020-07-17 22:26:16,801 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 43 states. [2020-07-17 22:26:16,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:16,807 INFO L93 Difference]: Finished difference Result 45 states and 68 transitions. [2020-07-17 22:26:16,807 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 68 transitions. [2020-07-17 22:26:16,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:16,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:16,813 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 45 states. [2020-07-17 22:26:16,814 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 45 states. [2020-07-17 22:26:16,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:16,822 INFO L93 Difference]: Finished difference Result 45 states and 68 transitions. [2020-07-17 22:26:16,822 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 68 transitions. [2020-07-17 22:26:16,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:16,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:16,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:16,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:16,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-17 22:26:16,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 67 transitions. [2020-07-17 22:26:16,828 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 67 transitions. Word has length 16 [2020-07-17 22:26:16,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:16,828 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 67 transitions. [2020-07-17 22:26:16,829 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:16,829 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 67 transitions. [2020-07-17 22:26:16,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-17 22:26:16,830 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:16,830 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:16,830 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 22:26:16,831 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:16,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:16,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1896516636, now seen corresponding path program 1 times [2020-07-17 22:26:16,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:16,832 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252630167] [2020-07-17 22:26:16,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:16,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:16,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:16,917 INFO L280 TraceCheckUtils]: 0: Hoare triple {665#true} assume true; {665#true} is VALID [2020-07-17 22:26:16,918 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {665#true} {665#true} #112#return; {665#true} is VALID [2020-07-17 22:26:16,918 INFO L263 TraceCheckUtils]: 0: Hoare triple {665#true} call ULTIMATE.init(); {665#true} is VALID [2020-07-17 22:26:16,919 INFO L280 TraceCheckUtils]: 1: Hoare triple {665#true} assume true; {665#true} is VALID [2020-07-17 22:26:16,919 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {665#true} {665#true} #112#return; {665#true} is VALID [2020-07-17 22:26:16,920 INFO L263 TraceCheckUtils]: 3: Hoare triple {665#true} call #t~ret6 := main(); {665#true} is VALID [2020-07-17 22:26:16,920 INFO L280 TraceCheckUtils]: 4: Hoare triple {665#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;havoc ~cond~0; {665#true} is VALID [2020-07-17 22:26:16,920 INFO L280 TraceCheckUtils]: 5: Hoare triple {665#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {665#true} is VALID [2020-07-17 22:26:16,921 INFO L280 TraceCheckUtils]: 6: Hoare triple {665#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {665#true} is VALID [2020-07-17 22:26:16,921 INFO L280 TraceCheckUtils]: 7: Hoare triple {665#true} assume !(0 != ~p1~0); {665#true} is VALID [2020-07-17 22:26:16,925 INFO L280 TraceCheckUtils]: 8: Hoare triple {665#true} assume 0 != ~p2~0;~lk2~0 := 1; {669#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:16,928 INFO L280 TraceCheckUtils]: 9: Hoare triple {669#(= 1 main_~lk2~0)} assume 0 != ~p3~0;~lk3~0 := 1; {669#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:16,929 INFO L280 TraceCheckUtils]: 10: Hoare triple {669#(= 1 main_~lk2~0)} assume 0 != ~p4~0;~lk4~0 := 1; {669#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:16,930 INFO L280 TraceCheckUtils]: 11: Hoare triple {669#(= 1 main_~lk2~0)} assume 0 != ~p5~0;~lk5~0 := 1; {669#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:16,931 INFO L280 TraceCheckUtils]: 12: Hoare triple {669#(= 1 main_~lk2~0)} assume !(0 != ~p1~0); {669#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:16,931 INFO L280 TraceCheckUtils]: 13: Hoare triple {669#(= 1 main_~lk2~0)} assume 0 != ~p2~0; {669#(= 1 main_~lk2~0)} is VALID [2020-07-17 22:26:16,932 INFO L280 TraceCheckUtils]: 14: Hoare triple {669#(= 1 main_~lk2~0)} assume 1 != ~lk2~0; {666#false} is VALID [2020-07-17 22:26:16,933 INFO L280 TraceCheckUtils]: 15: Hoare triple {666#false} assume !false; {666#false} is VALID [2020-07-17 22:26:16,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:16,934 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252630167] [2020-07-17 22:26:16,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:16,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:16,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455925853] [2020-07-17 22:26:16,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-07-17 22:26:16,937 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:16,937 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:16,956 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:16,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:16,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:16,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:16,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:16,958 INFO L87 Difference]: Start difference. First operand 43 states and 67 transitions. Second operand 3 states. [2020-07-17 22:26:17,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:17,055 INFO L93 Difference]: Finished difference Result 76 states and 120 transitions. [2020-07-17 22:26:17,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:17,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-07-17 22:26:17,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:17,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:17,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2020-07-17 22:26:17,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:17,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2020-07-17 22:26:17,061 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 66 transitions. [2020-07-17 22:26:17,144 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:17,146 INFO L225 Difference]: With dead ends: 76 [2020-07-17 22:26:17,146 INFO L226 Difference]: Without dead ends: 74 [2020-07-17 22:26:17,147 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:17,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-07-17 22:26:17,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 56. [2020-07-17 22:26:17,163 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:17,163 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 56 states. [2020-07-17 22:26:17,163 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 56 states. [2020-07-17 22:26:17,163 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 56 states. [2020-07-17 22:26:17,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:17,167 INFO L93 Difference]: Finished difference Result 74 states and 117 transitions. [2020-07-17 22:26:17,168 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 117 transitions. [2020-07-17 22:26:17,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:17,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:17,169 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 74 states. [2020-07-17 22:26:17,169 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 74 states. [2020-07-17 22:26:17,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:17,174 INFO L93 Difference]: Finished difference Result 74 states and 117 transitions. [2020-07-17 22:26:17,174 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 117 transitions. [2020-07-17 22:26:17,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:17,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:17,175 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:17,175 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:17,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-17 22:26:17,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 88 transitions. [2020-07-17 22:26:17,179 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 88 transitions. Word has length 16 [2020-07-17 22:26:17,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:17,179 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 88 transitions. [2020-07-17 22:26:17,179 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:17,179 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 88 transitions. [2020-07-17 22:26:17,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-17 22:26:17,180 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:17,180 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:17,181 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-17 22:26:17,181 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:17,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:17,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1087170010, now seen corresponding path program 1 times [2020-07-17 22:26:17,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:17,182 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396978368] [2020-07-17 22:26:17,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:17,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:17,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:17,218 INFO L280 TraceCheckUtils]: 0: Hoare triple {972#true} assume true; {972#true} is VALID [2020-07-17 22:26:17,218 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {972#true} {972#true} #112#return; {972#true} is VALID [2020-07-17 22:26:17,219 INFO L263 TraceCheckUtils]: 0: Hoare triple {972#true} call ULTIMATE.init(); {972#true} is VALID [2020-07-17 22:26:17,219 INFO L280 TraceCheckUtils]: 1: Hoare triple {972#true} assume true; {972#true} is VALID [2020-07-17 22:26:17,219 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {972#true} {972#true} #112#return; {972#true} is VALID [2020-07-17 22:26:17,219 INFO L263 TraceCheckUtils]: 3: Hoare triple {972#true} call #t~ret6 := main(); {972#true} is VALID [2020-07-17 22:26:17,220 INFO L280 TraceCheckUtils]: 4: Hoare triple {972#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;havoc ~cond~0; {972#true} is VALID [2020-07-17 22:26:17,220 INFO L280 TraceCheckUtils]: 5: Hoare triple {972#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {972#true} is VALID [2020-07-17 22:26:17,220 INFO L280 TraceCheckUtils]: 6: Hoare triple {972#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {972#true} is VALID [2020-07-17 22:26:17,220 INFO L280 TraceCheckUtils]: 7: Hoare triple {972#true} assume !(0 != ~p1~0); {972#true} is VALID [2020-07-17 22:26:17,221 INFO L280 TraceCheckUtils]: 8: Hoare triple {972#true} assume !(0 != ~p2~0); {976#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:17,222 INFO L280 TraceCheckUtils]: 9: Hoare triple {976#(= 0 main_~p2~0)} assume 0 != ~p3~0;~lk3~0 := 1; {976#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:17,222 INFO L280 TraceCheckUtils]: 10: Hoare triple {976#(= 0 main_~p2~0)} assume 0 != ~p4~0;~lk4~0 := 1; {976#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:17,226 INFO L280 TraceCheckUtils]: 11: Hoare triple {976#(= 0 main_~p2~0)} assume 0 != ~p5~0;~lk5~0 := 1; {976#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:17,226 INFO L280 TraceCheckUtils]: 12: Hoare triple {976#(= 0 main_~p2~0)} assume !(0 != ~p1~0); {976#(= 0 main_~p2~0)} is VALID [2020-07-17 22:26:17,229 INFO L280 TraceCheckUtils]: 13: Hoare triple {976#(= 0 main_~p2~0)} assume 0 != ~p2~0; {973#false} is VALID [2020-07-17 22:26:17,229 INFO L280 TraceCheckUtils]: 14: Hoare triple {973#false} assume 1 != ~lk2~0; {973#false} is VALID [2020-07-17 22:26:17,230 INFO L280 TraceCheckUtils]: 15: Hoare triple {973#false} assume !false; {973#false} is VALID [2020-07-17 22:26:17,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:17,231 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396978368] [2020-07-17 22:26:17,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:17,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:17,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507131598] [2020-07-17 22:26:17,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-07-17 22:26:17,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:17,232 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:17,267 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:17,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:17,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:17,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:17,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:17,268 INFO L87 Difference]: Start difference. First operand 56 states and 88 transitions. Second operand 3 states. [2020-07-17 22:26:17,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:17,379 INFO L93 Difference]: Finished difference Result 124 states and 198 transitions. [2020-07-17 22:26:17,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:17,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-07-17 22:26:17,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:17,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:17,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2020-07-17 22:26:17,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:17,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2020-07-17 22:26:17,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 98 transitions. [2020-07-17 22:26:17,487 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:17,489 INFO L225 Difference]: With dead ends: 124 [2020-07-17 22:26:17,489 INFO L226 Difference]: Without dead ends: 76 [2020-07-17 22:26:17,490 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:17,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-07-17 22:26:17,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2020-07-17 22:26:17,515 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:17,515 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 74 states. [2020-07-17 22:26:17,515 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 74 states. [2020-07-17 22:26:17,515 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 74 states. [2020-07-17 22:26:17,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:17,519 INFO L93 Difference]: Finished difference Result 76 states and 115 transitions. [2020-07-17 22:26:17,519 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 115 transitions. [2020-07-17 22:26:17,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:17,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:17,520 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 76 states. [2020-07-17 22:26:17,520 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 76 states. [2020-07-17 22:26:17,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:17,529 INFO L93 Difference]: Finished difference Result 76 states and 115 transitions. [2020-07-17 22:26:17,530 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 115 transitions. [2020-07-17 22:26:17,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:17,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:17,534 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:17,534 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:17,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-07-17 22:26:17,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 114 transitions. [2020-07-17 22:26:17,539 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 114 transitions. Word has length 16 [2020-07-17 22:26:17,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:17,540 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 114 transitions. [2020-07-17 22:26:17,540 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:17,540 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 114 transitions. [2020-07-17 22:26:17,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-17 22:26:17,541 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:17,541 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:17,541 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-17 22:26:17,541 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:17,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:17,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1337311087, now seen corresponding path program 1 times [2020-07-17 22:26:17,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:17,542 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366455928] [2020-07-17 22:26:17,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:17,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:17,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:17,615 INFO L280 TraceCheckUtils]: 0: Hoare triple {1353#true} assume true; {1353#true} is VALID [2020-07-17 22:26:17,615 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1353#true} {1353#true} #112#return; {1353#true} is VALID [2020-07-17 22:26:17,615 INFO L263 TraceCheckUtils]: 0: Hoare triple {1353#true} call ULTIMATE.init(); {1353#true} is VALID [2020-07-17 22:26:17,616 INFO L280 TraceCheckUtils]: 1: Hoare triple {1353#true} assume true; {1353#true} is VALID [2020-07-17 22:26:17,616 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1353#true} {1353#true} #112#return; {1353#true} is VALID [2020-07-17 22:26:17,617 INFO L263 TraceCheckUtils]: 3: Hoare triple {1353#true} call #t~ret6 := main(); {1353#true} is VALID [2020-07-17 22:26:17,618 INFO L280 TraceCheckUtils]: 4: Hoare triple {1353#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;havoc ~cond~0; {1353#true} is VALID [2020-07-17 22:26:17,618 INFO L280 TraceCheckUtils]: 5: Hoare triple {1353#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {1353#true} is VALID [2020-07-17 22:26:17,618 INFO L280 TraceCheckUtils]: 6: Hoare triple {1353#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {1353#true} is VALID [2020-07-17 22:26:17,618 INFO L280 TraceCheckUtils]: 7: Hoare triple {1353#true} assume !(0 != ~p1~0); {1353#true} is VALID [2020-07-17 22:26:17,623 INFO L280 TraceCheckUtils]: 8: Hoare triple {1353#true} assume 0 != ~p2~0;~lk2~0 := 1; {1357#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:17,624 INFO L280 TraceCheckUtils]: 9: Hoare triple {1357#(not (= 0 main_~p2~0))} assume 0 != ~p3~0;~lk3~0 := 1; {1357#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:17,625 INFO L280 TraceCheckUtils]: 10: Hoare triple {1357#(not (= 0 main_~p2~0))} assume 0 != ~p4~0;~lk4~0 := 1; {1357#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:17,625 INFO L280 TraceCheckUtils]: 11: Hoare triple {1357#(not (= 0 main_~p2~0))} assume 0 != ~p5~0;~lk5~0 := 1; {1357#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:17,626 INFO L280 TraceCheckUtils]: 12: Hoare triple {1357#(not (= 0 main_~p2~0))} assume !(0 != ~p1~0); {1357#(not (= 0 main_~p2~0))} is VALID [2020-07-17 22:26:17,627 INFO L280 TraceCheckUtils]: 13: Hoare triple {1357#(not (= 0 main_~p2~0))} assume !(0 != ~p2~0); {1354#false} is VALID [2020-07-17 22:26:17,627 INFO L280 TraceCheckUtils]: 14: Hoare triple {1354#false} assume 0 != ~p3~0; {1354#false} is VALID [2020-07-17 22:26:17,628 INFO L280 TraceCheckUtils]: 15: Hoare triple {1354#false} assume 1 != ~lk3~0; {1354#false} is VALID [2020-07-17 22:26:17,628 INFO L280 TraceCheckUtils]: 16: Hoare triple {1354#false} assume !false; {1354#false} is VALID [2020-07-17 22:26:17,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:17,629 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366455928] [2020-07-17 22:26:17,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:17,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:17,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736229224] [2020-07-17 22:26:17,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-07-17 22:26:17,634 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:17,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:17,654 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:17,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:17,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:17,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:17,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:17,655 INFO L87 Difference]: Start difference. First operand 74 states and 114 transitions. Second operand 3 states. [2020-07-17 22:26:17,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:17,739 INFO L93 Difference]: Finished difference Result 111 states and 169 transitions. [2020-07-17 22:26:17,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:17,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-07-17 22:26:17,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:17,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:17,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2020-07-17 22:26:17,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:17,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2020-07-17 22:26:17,744 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 93 transitions. [2020-07-17 22:26:17,824 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:17,826 INFO L225 Difference]: With dead ends: 111 [2020-07-17 22:26:17,826 INFO L226 Difference]: Without dead ends: 78 [2020-07-17 22:26:17,827 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:17,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-17 22:26:17,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2020-07-17 22:26:17,843 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:17,843 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 76 states. [2020-07-17 22:26:17,844 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 76 states. [2020-07-17 22:26:17,844 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 76 states. [2020-07-17 22:26:17,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:17,847 INFO L93 Difference]: Finished difference Result 78 states and 115 transitions. [2020-07-17 22:26:17,847 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 115 transitions. [2020-07-17 22:26:17,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:17,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:17,848 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 78 states. [2020-07-17 22:26:17,848 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 78 states. [2020-07-17 22:26:17,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:17,852 INFO L93 Difference]: Finished difference Result 78 states and 115 transitions. [2020-07-17 22:26:17,852 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 115 transitions. [2020-07-17 22:26:17,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:17,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:17,853 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:17,853 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:17,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-17 22:26:17,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 114 transitions. [2020-07-17 22:26:17,856 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 114 transitions. Word has length 17 [2020-07-17 22:26:17,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:17,856 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 114 transitions. [2020-07-17 22:26:17,857 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:17,857 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 114 transitions. [2020-07-17 22:26:17,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-17 22:26:17,857 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:17,857 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:17,858 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-17 22:26:17,858 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:17,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:17,858 INFO L82 PathProgramCache]: Analyzing trace with hash -657252717, now seen corresponding path program 1 times [2020-07-17 22:26:17,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:17,859 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15095966] [2020-07-17 22:26:17,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:17,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:17,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:17,887 INFO L280 TraceCheckUtils]: 0: Hoare triple {1727#true} assume true; {1727#true} is VALID [2020-07-17 22:26:17,887 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1727#true} {1727#true} #112#return; {1727#true} is VALID [2020-07-17 22:26:17,888 INFO L263 TraceCheckUtils]: 0: Hoare triple {1727#true} call ULTIMATE.init(); {1727#true} is VALID [2020-07-17 22:26:17,888 INFO L280 TraceCheckUtils]: 1: Hoare triple {1727#true} assume true; {1727#true} is VALID [2020-07-17 22:26:17,888 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1727#true} {1727#true} #112#return; {1727#true} is VALID [2020-07-17 22:26:17,888 INFO L263 TraceCheckUtils]: 3: Hoare triple {1727#true} call #t~ret6 := main(); {1727#true} is VALID [2020-07-17 22:26:17,889 INFO L280 TraceCheckUtils]: 4: Hoare triple {1727#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;havoc ~cond~0; {1727#true} is VALID [2020-07-17 22:26:17,889 INFO L280 TraceCheckUtils]: 5: Hoare triple {1727#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {1727#true} is VALID [2020-07-17 22:26:17,889 INFO L280 TraceCheckUtils]: 6: Hoare triple {1727#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {1727#true} is VALID [2020-07-17 22:26:17,890 INFO L280 TraceCheckUtils]: 7: Hoare triple {1727#true} assume !(0 != ~p1~0); {1727#true} is VALID [2020-07-17 22:26:17,890 INFO L280 TraceCheckUtils]: 8: Hoare triple {1727#true} assume !(0 != ~p2~0); {1727#true} is VALID [2020-07-17 22:26:17,891 INFO L280 TraceCheckUtils]: 9: Hoare triple {1727#true} assume 0 != ~p3~0;~lk3~0 := 1; {1731#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:17,891 INFO L280 TraceCheckUtils]: 10: Hoare triple {1731#(= 1 main_~lk3~0)} assume 0 != ~p4~0;~lk4~0 := 1; {1731#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:17,892 INFO L280 TraceCheckUtils]: 11: Hoare triple {1731#(= 1 main_~lk3~0)} assume 0 != ~p5~0;~lk5~0 := 1; {1731#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:17,892 INFO L280 TraceCheckUtils]: 12: Hoare triple {1731#(= 1 main_~lk3~0)} assume !(0 != ~p1~0); {1731#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:17,893 INFO L280 TraceCheckUtils]: 13: Hoare triple {1731#(= 1 main_~lk3~0)} assume !(0 != ~p2~0); {1731#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:17,894 INFO L280 TraceCheckUtils]: 14: Hoare triple {1731#(= 1 main_~lk3~0)} assume 0 != ~p3~0; {1731#(= 1 main_~lk3~0)} is VALID [2020-07-17 22:26:17,894 INFO L280 TraceCheckUtils]: 15: Hoare triple {1731#(= 1 main_~lk3~0)} assume 1 != ~lk3~0; {1728#false} is VALID [2020-07-17 22:26:17,895 INFO L280 TraceCheckUtils]: 16: Hoare triple {1728#false} assume !false; {1728#false} is VALID [2020-07-17 22:26:17,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:17,896 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15095966] [2020-07-17 22:26:17,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:17,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:17,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272106504] [2020-07-17 22:26:17,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-07-17 22:26:17,897 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:17,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:17,920 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:17,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:17,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:17,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:17,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:17,921 INFO L87 Difference]: Start difference. First operand 76 states and 114 transitions. Second operand 3 states. [2020-07-17 22:26:18,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:18,013 INFO L93 Difference]: Finished difference Result 132 states and 200 transitions. [2020-07-17 22:26:18,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:18,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-07-17 22:26:18,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:18,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:18,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2020-07-17 22:26:18,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:18,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2020-07-17 22:26:18,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 62 transitions. [2020-07-17 22:26:18,084 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:18,087 INFO L225 Difference]: With dead ends: 132 [2020-07-17 22:26:18,087 INFO L226 Difference]: Without dead ends: 130 [2020-07-17 22:26:18,088 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:18,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-07-17 22:26:18,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 104. [2020-07-17 22:26:18,108 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:18,109 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand 104 states. [2020-07-17 22:26:18,109 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand 104 states. [2020-07-17 22:26:18,109 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 104 states. [2020-07-17 22:26:18,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:18,114 INFO L93 Difference]: Finished difference Result 130 states and 195 transitions. [2020-07-17 22:26:18,114 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 195 transitions. [2020-07-17 22:26:18,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:18,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:18,115 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 130 states. [2020-07-17 22:26:18,115 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 130 states. [2020-07-17 22:26:18,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:18,121 INFO L93 Difference]: Finished difference Result 130 states and 195 transitions. [2020-07-17 22:26:18,121 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 195 transitions. [2020-07-17 22:26:18,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:18,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:18,122 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:18,122 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:18,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-07-17 22:26:18,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 154 transitions. [2020-07-17 22:26:18,126 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 154 transitions. Word has length 17 [2020-07-17 22:26:18,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:18,127 INFO L479 AbstractCegarLoop]: Abstraction has 104 states and 154 transitions. [2020-07-17 22:26:18,127 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:18,127 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 154 transitions. [2020-07-17 22:26:18,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-17 22:26:18,128 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:18,128 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:26:18,128 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-17 22:26:18,128 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:18,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:18,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1466599343, now seen corresponding path program 1 times [2020-07-17 22:26:18,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:18,129 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818119632] [2020-07-17 22:26:18,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:18,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:18,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:18,166 INFO L280 TraceCheckUtils]: 0: Hoare triple {2256#true} assume true; {2256#true} is VALID [2020-07-17 22:26:18,166 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2256#true} {2256#true} #112#return; {2256#true} is VALID [2020-07-17 22:26:18,166 INFO L263 TraceCheckUtils]: 0: Hoare triple {2256#true} call ULTIMATE.init(); {2256#true} is VALID [2020-07-17 22:26:18,167 INFO L280 TraceCheckUtils]: 1: Hoare triple {2256#true} assume true; {2256#true} is VALID [2020-07-17 22:26:18,167 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2256#true} {2256#true} #112#return; {2256#true} is VALID [2020-07-17 22:26:18,167 INFO L263 TraceCheckUtils]: 3: Hoare triple {2256#true} call #t~ret6 := main(); {2256#true} is VALID [2020-07-17 22:26:18,168 INFO L280 TraceCheckUtils]: 4: Hoare triple {2256#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;havoc ~cond~0; {2256#true} is VALID [2020-07-17 22:26:18,168 INFO L280 TraceCheckUtils]: 5: Hoare triple {2256#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {2256#true} is VALID [2020-07-17 22:26:18,168 INFO L280 TraceCheckUtils]: 6: Hoare triple {2256#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {2256#true} is VALID [2020-07-17 22:26:18,168 INFO L280 TraceCheckUtils]: 7: Hoare triple {2256#true} assume !(0 != ~p1~0); {2256#true} is VALID [2020-07-17 22:26:18,168 INFO L280 TraceCheckUtils]: 8: Hoare triple {2256#true} assume !(0 != ~p2~0); {2256#true} is VALID [2020-07-17 22:26:18,169 INFO L280 TraceCheckUtils]: 9: Hoare triple {2256#true} assume !(0 != ~p3~0); {2260#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:18,170 INFO L280 TraceCheckUtils]: 10: Hoare triple {2260#(= 0 main_~p3~0)} assume 0 != ~p4~0;~lk4~0 := 1; {2260#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:18,170 INFO L280 TraceCheckUtils]: 11: Hoare triple {2260#(= 0 main_~p3~0)} assume 0 != ~p5~0;~lk5~0 := 1; {2260#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:18,172 INFO L280 TraceCheckUtils]: 12: Hoare triple {2260#(= 0 main_~p3~0)} assume !(0 != ~p1~0); {2260#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:18,173 INFO L280 TraceCheckUtils]: 13: Hoare triple {2260#(= 0 main_~p3~0)} assume !(0 != ~p2~0); {2260#(= 0 main_~p3~0)} is VALID [2020-07-17 22:26:18,174 INFO L280 TraceCheckUtils]: 14: Hoare triple {2260#(= 0 main_~p3~0)} assume 0 != ~p3~0; {2257#false} is VALID [2020-07-17 22:26:18,174 INFO L280 TraceCheckUtils]: 15: Hoare triple {2257#false} assume 1 != ~lk3~0; {2257#false} is VALID [2020-07-17 22:26:18,174 INFO L280 TraceCheckUtils]: 16: Hoare triple {2257#false} assume !false; {2257#false} is VALID [2020-07-17 22:26:18,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:18,175 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818119632] [2020-07-17 22:26:18,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:18,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:18,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304090612] [2020-07-17 22:26:18,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-07-17 22:26:18,176 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:18,177 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:18,193 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:18,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:18,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:18,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:18,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:18,194 INFO L87 Difference]: Start difference. First operand 104 states and 154 transitions. Second operand 3 states. [2020-07-17 22:26:18,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:18,328 INFO L93 Difference]: Finished difference Result 232 states and 344 transitions. [2020-07-17 22:26:18,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:18,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-07-17 22:26:18,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:18,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:18,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2020-07-17 22:26:18,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:18,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2020-07-17 22:26:18,333 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2020-07-17 22:26:18,412 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:18,415 INFO L225 Difference]: With dead ends: 232 [2020-07-17 22:26:18,415 INFO L226 Difference]: Without dead ends: 138 [2020-07-17 22:26:18,416 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:18,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-07-17 22:26:18,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2020-07-17 22:26:18,455 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:18,455 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand 136 states. [2020-07-17 22:26:18,455 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 136 states. [2020-07-17 22:26:18,455 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 136 states. [2020-07-17 22:26:18,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:18,461 INFO L93 Difference]: Finished difference Result 138 states and 195 transitions. [2020-07-17 22:26:18,461 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 195 transitions. [2020-07-17 22:26:18,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:18,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:18,462 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 138 states. [2020-07-17 22:26:18,462 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 138 states. [2020-07-17 22:26:18,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:18,467 INFO L93 Difference]: Finished difference Result 138 states and 195 transitions. [2020-07-17 22:26:18,467 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 195 transitions. [2020-07-17 22:26:18,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:18,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:18,468 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:18,468 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:18,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2020-07-17 22:26:18,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 194 transitions. [2020-07-17 22:26:18,473 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 194 transitions. Word has length 17 [2020-07-17 22:26:18,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:18,473 INFO L479 AbstractCegarLoop]: Abstraction has 136 states and 194 transitions. [2020-07-17 22:26:18,474 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:18,474 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 194 transitions. [2020-07-17 22:26:18,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-17 22:26:18,474 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:18,474 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-17 22:26:18,475 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-17 22:26:18,475 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:18,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:18,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1100217935, now seen corresponding path program 1 times [2020-07-17 22:26:18,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:18,476 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260615954] [2020-07-17 22:26:18,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:18,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:18,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:18,509 INFO L280 TraceCheckUtils]: 0: Hoare triple {2941#true} assume true; {2941#true} is VALID [2020-07-17 22:26:18,509 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2941#true} {2941#true} #112#return; {2941#true} is VALID [2020-07-17 22:26:18,509 INFO L263 TraceCheckUtils]: 0: Hoare triple {2941#true} call ULTIMATE.init(); {2941#true} is VALID [2020-07-17 22:26:18,510 INFO L280 TraceCheckUtils]: 1: Hoare triple {2941#true} assume true; {2941#true} is VALID [2020-07-17 22:26:18,510 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2941#true} {2941#true} #112#return; {2941#true} is VALID [2020-07-17 22:26:18,510 INFO L263 TraceCheckUtils]: 3: Hoare triple {2941#true} call #t~ret6 := main(); {2941#true} is VALID [2020-07-17 22:26:18,511 INFO L280 TraceCheckUtils]: 4: Hoare triple {2941#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;havoc ~cond~0; {2941#true} is VALID [2020-07-17 22:26:18,511 INFO L280 TraceCheckUtils]: 5: Hoare triple {2941#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {2941#true} is VALID [2020-07-17 22:26:18,512 INFO L280 TraceCheckUtils]: 6: Hoare triple {2941#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {2941#true} is VALID [2020-07-17 22:26:18,512 INFO L280 TraceCheckUtils]: 7: Hoare triple {2941#true} assume !(0 != ~p1~0); {2941#true} is VALID [2020-07-17 22:26:18,512 INFO L280 TraceCheckUtils]: 8: Hoare triple {2941#true} assume !(0 != ~p2~0); {2941#true} is VALID [2020-07-17 22:26:18,514 INFO L280 TraceCheckUtils]: 9: Hoare triple {2941#true} assume 0 != ~p3~0;~lk3~0 := 1; {2945#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:18,515 INFO L280 TraceCheckUtils]: 10: Hoare triple {2945#(not (= 0 main_~p3~0))} assume 0 != ~p4~0;~lk4~0 := 1; {2945#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:18,515 INFO L280 TraceCheckUtils]: 11: Hoare triple {2945#(not (= 0 main_~p3~0))} assume 0 != ~p5~0;~lk5~0 := 1; {2945#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:18,516 INFO L280 TraceCheckUtils]: 12: Hoare triple {2945#(not (= 0 main_~p3~0))} assume !(0 != ~p1~0); {2945#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:18,516 INFO L280 TraceCheckUtils]: 13: Hoare triple {2945#(not (= 0 main_~p3~0))} assume !(0 != ~p2~0); {2945#(not (= 0 main_~p3~0))} is VALID [2020-07-17 22:26:18,517 INFO L280 TraceCheckUtils]: 14: Hoare triple {2945#(not (= 0 main_~p3~0))} assume !(0 != ~p3~0); {2942#false} is VALID [2020-07-17 22:26:18,517 INFO L280 TraceCheckUtils]: 15: Hoare triple {2942#false} assume 0 != ~p4~0; {2942#false} is VALID [2020-07-17 22:26:18,518 INFO L280 TraceCheckUtils]: 16: Hoare triple {2942#false} assume 1 != ~lk4~0; {2942#false} is VALID [2020-07-17 22:26:18,518 INFO L280 TraceCheckUtils]: 17: Hoare triple {2942#false} assume !false; {2942#false} is VALID [2020-07-17 22:26:18,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:18,519 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260615954] [2020-07-17 22:26:18,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:18,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:18,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929074341] [2020-07-17 22:26:18,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-17 22:26:18,520 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:18,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:18,538 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-17 22:26:18,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:18,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:18,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:18,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:18,539 INFO L87 Difference]: Start difference. First operand 136 states and 194 transitions. Second operand 3 states. [2020-07-17 22:26:18,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:18,668 INFO L93 Difference]: Finished difference Result 204 states and 288 transitions. [2020-07-17 22:26:18,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:18,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-17 22:26:18,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:18,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:18,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2020-07-17 22:26:18,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:18,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2020-07-17 22:26:18,673 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 90 transitions. [2020-07-17 22:26:18,766 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-17 22:26:18,769 INFO L225 Difference]: With dead ends: 204 [2020-07-17 22:26:18,770 INFO L226 Difference]: Without dead ends: 142 [2020-07-17 22:26:18,772 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:18,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-07-17 22:26:18,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2020-07-17 22:26:18,821 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:18,821 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand 140 states. [2020-07-17 22:26:18,821 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 140 states. [2020-07-17 22:26:18,821 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 140 states. [2020-07-17 22:26:18,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:18,826 INFO L93 Difference]: Finished difference Result 142 states and 195 transitions. [2020-07-17 22:26:18,826 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 195 transitions. [2020-07-17 22:26:18,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:18,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:18,827 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand 142 states. [2020-07-17 22:26:18,827 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 142 states. [2020-07-17 22:26:18,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:18,831 INFO L93 Difference]: Finished difference Result 142 states and 195 transitions. [2020-07-17 22:26:18,831 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 195 transitions. [2020-07-17 22:26:18,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:18,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:18,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:18,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:18,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-07-17 22:26:18,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 194 transitions. [2020-07-17 22:26:18,836 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 194 transitions. Word has length 18 [2020-07-17 22:26:18,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:18,836 INFO L479 AbstractCegarLoop]: Abstraction has 140 states and 194 transitions. [2020-07-17 22:26:18,836 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:18,836 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 194 transitions. [2020-07-17 22:26:18,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-17 22:26:18,837 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:18,837 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-17 22:26:18,837 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-17 22:26:18,838 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:18,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:18,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1780276305, now seen corresponding path program 1 times [2020-07-17 22:26:18,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:18,839 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175220297] [2020-07-17 22:26:18,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:18,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:18,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:18,871 INFO L280 TraceCheckUtils]: 0: Hoare triple {3610#true} assume true; {3610#true} is VALID [2020-07-17 22:26:18,871 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3610#true} {3610#true} #112#return; {3610#true} is VALID [2020-07-17 22:26:18,871 INFO L263 TraceCheckUtils]: 0: Hoare triple {3610#true} call ULTIMATE.init(); {3610#true} is VALID [2020-07-17 22:26:18,872 INFO L280 TraceCheckUtils]: 1: Hoare triple {3610#true} assume true; {3610#true} is VALID [2020-07-17 22:26:18,872 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3610#true} {3610#true} #112#return; {3610#true} is VALID [2020-07-17 22:26:18,872 INFO L263 TraceCheckUtils]: 3: Hoare triple {3610#true} call #t~ret6 := main(); {3610#true} is VALID [2020-07-17 22:26:18,872 INFO L280 TraceCheckUtils]: 4: Hoare triple {3610#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;havoc ~cond~0; {3610#true} is VALID [2020-07-17 22:26:18,873 INFO L280 TraceCheckUtils]: 5: Hoare triple {3610#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {3610#true} is VALID [2020-07-17 22:26:18,873 INFO L280 TraceCheckUtils]: 6: Hoare triple {3610#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {3610#true} is VALID [2020-07-17 22:26:18,873 INFO L280 TraceCheckUtils]: 7: Hoare triple {3610#true} assume !(0 != ~p1~0); {3610#true} is VALID [2020-07-17 22:26:18,873 INFO L280 TraceCheckUtils]: 8: Hoare triple {3610#true} assume !(0 != ~p2~0); {3610#true} is VALID [2020-07-17 22:26:18,873 INFO L280 TraceCheckUtils]: 9: Hoare triple {3610#true} assume !(0 != ~p3~0); {3610#true} is VALID [2020-07-17 22:26:18,874 INFO L280 TraceCheckUtils]: 10: Hoare triple {3610#true} assume 0 != ~p4~0;~lk4~0 := 1; {3614#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:18,875 INFO L280 TraceCheckUtils]: 11: Hoare triple {3614#(= 1 main_~lk4~0)} assume 0 != ~p5~0;~lk5~0 := 1; {3614#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:18,875 INFO L280 TraceCheckUtils]: 12: Hoare triple {3614#(= 1 main_~lk4~0)} assume !(0 != ~p1~0); {3614#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:18,876 INFO L280 TraceCheckUtils]: 13: Hoare triple {3614#(= 1 main_~lk4~0)} assume !(0 != ~p2~0); {3614#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:18,876 INFO L280 TraceCheckUtils]: 14: Hoare triple {3614#(= 1 main_~lk4~0)} assume !(0 != ~p3~0); {3614#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:18,877 INFO L280 TraceCheckUtils]: 15: Hoare triple {3614#(= 1 main_~lk4~0)} assume 0 != ~p4~0; {3614#(= 1 main_~lk4~0)} is VALID [2020-07-17 22:26:18,878 INFO L280 TraceCheckUtils]: 16: Hoare triple {3614#(= 1 main_~lk4~0)} assume 1 != ~lk4~0; {3611#false} is VALID [2020-07-17 22:26:18,878 INFO L280 TraceCheckUtils]: 17: Hoare triple {3611#false} assume !false; {3611#false} is VALID [2020-07-17 22:26:18,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:18,879 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175220297] [2020-07-17 22:26:18,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:18,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:18,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894053619] [2020-07-17 22:26:18,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-17 22:26:18,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:18,880 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:18,897 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-17 22:26:18,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:18,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:18,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:18,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:18,898 INFO L87 Difference]: Start difference. First operand 140 states and 194 transitions. Second operand 3 states. [2020-07-17 22:26:19,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:19,026 INFO L93 Difference]: Finished difference Result 236 states and 328 transitions. [2020-07-17 22:26:19,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:19,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-17 22:26:19,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:19,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:19,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2020-07-17 22:26:19,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:19,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2020-07-17 22:26:19,030 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 58 transitions. [2020-07-17 22:26:19,094 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:19,101 INFO L225 Difference]: With dead ends: 236 [2020-07-17 22:26:19,101 INFO L226 Difference]: Without dead ends: 234 [2020-07-17 22:26:19,102 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:19,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2020-07-17 22:26:19,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 200. [2020-07-17 22:26:19,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:19,135 INFO L82 GeneralOperation]: Start isEquivalent. First operand 234 states. Second operand 200 states. [2020-07-17 22:26:19,135 INFO L74 IsIncluded]: Start isIncluded. First operand 234 states. Second operand 200 states. [2020-07-17 22:26:19,135 INFO L87 Difference]: Start difference. First operand 234 states. Second operand 200 states. [2020-07-17 22:26:19,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:19,142 INFO L93 Difference]: Finished difference Result 234 states and 319 transitions. [2020-07-17 22:26:19,142 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 319 transitions. [2020-07-17 22:26:19,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:19,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:19,143 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand 234 states. [2020-07-17 22:26:19,144 INFO L87 Difference]: Start difference. First operand 200 states. Second operand 234 states. [2020-07-17 22:26:19,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:19,150 INFO L93 Difference]: Finished difference Result 234 states and 319 transitions. [2020-07-17 22:26:19,151 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 319 transitions. [2020-07-17 22:26:19,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:19,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:19,152 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:19,152 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:19,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-07-17 22:26:19,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 270 transitions. [2020-07-17 22:26:19,158 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 270 transitions. Word has length 18 [2020-07-17 22:26:19,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:19,158 INFO L479 AbstractCegarLoop]: Abstraction has 200 states and 270 transitions. [2020-07-17 22:26:19,158 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:19,158 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 270 transitions. [2020-07-17 22:26:19,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-17 22:26:19,159 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:19,160 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-17 22:26:19,160 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-17 22:26:19,160 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:19,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:19,160 INFO L82 PathProgramCache]: Analyzing trace with hash 970929679, now seen corresponding path program 1 times [2020-07-17 22:26:19,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:19,161 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116105806] [2020-07-17 22:26:19,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:19,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:19,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:19,186 INFO L280 TraceCheckUtils]: 0: Hoare triple {4559#true} assume true; {4559#true} is VALID [2020-07-17 22:26:19,187 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {4559#true} {4559#true} #112#return; {4559#true} is VALID [2020-07-17 22:26:19,187 INFO L263 TraceCheckUtils]: 0: Hoare triple {4559#true} call ULTIMATE.init(); {4559#true} is VALID [2020-07-17 22:26:19,187 INFO L280 TraceCheckUtils]: 1: Hoare triple {4559#true} assume true; {4559#true} is VALID [2020-07-17 22:26:19,188 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4559#true} {4559#true} #112#return; {4559#true} is VALID [2020-07-17 22:26:19,188 INFO L263 TraceCheckUtils]: 3: Hoare triple {4559#true} call #t~ret6 := main(); {4559#true} is VALID [2020-07-17 22:26:19,188 INFO L280 TraceCheckUtils]: 4: Hoare triple {4559#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;havoc ~cond~0; {4559#true} is VALID [2020-07-17 22:26:19,188 INFO L280 TraceCheckUtils]: 5: Hoare triple {4559#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {4559#true} is VALID [2020-07-17 22:26:19,189 INFO L280 TraceCheckUtils]: 6: Hoare triple {4559#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {4559#true} is VALID [2020-07-17 22:26:19,189 INFO L280 TraceCheckUtils]: 7: Hoare triple {4559#true} assume !(0 != ~p1~0); {4559#true} is VALID [2020-07-17 22:26:19,189 INFO L280 TraceCheckUtils]: 8: Hoare triple {4559#true} assume !(0 != ~p2~0); {4559#true} is VALID [2020-07-17 22:26:19,189 INFO L280 TraceCheckUtils]: 9: Hoare triple {4559#true} assume !(0 != ~p3~0); {4559#true} is VALID [2020-07-17 22:26:19,190 INFO L280 TraceCheckUtils]: 10: Hoare triple {4559#true} assume !(0 != ~p4~0); {4563#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:19,191 INFO L280 TraceCheckUtils]: 11: Hoare triple {4563#(= 0 main_~p4~0)} assume 0 != ~p5~0;~lk5~0 := 1; {4563#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:19,191 INFO L280 TraceCheckUtils]: 12: Hoare triple {4563#(= 0 main_~p4~0)} assume !(0 != ~p1~0); {4563#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:19,192 INFO L280 TraceCheckUtils]: 13: Hoare triple {4563#(= 0 main_~p4~0)} assume !(0 != ~p2~0); {4563#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:19,192 INFO L280 TraceCheckUtils]: 14: Hoare triple {4563#(= 0 main_~p4~0)} assume !(0 != ~p3~0); {4563#(= 0 main_~p4~0)} is VALID [2020-07-17 22:26:19,193 INFO L280 TraceCheckUtils]: 15: Hoare triple {4563#(= 0 main_~p4~0)} assume 0 != ~p4~0; {4560#false} is VALID [2020-07-17 22:26:19,193 INFO L280 TraceCheckUtils]: 16: Hoare triple {4560#false} assume 1 != ~lk4~0; {4560#false} is VALID [2020-07-17 22:26:19,193 INFO L280 TraceCheckUtils]: 17: Hoare triple {4560#false} assume !false; {4560#false} is VALID [2020-07-17 22:26:19,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:19,194 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116105806] [2020-07-17 22:26:19,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:19,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:19,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063871155] [2020-07-17 22:26:19,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-17 22:26:19,195 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:19,195 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:19,212 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-17 22:26:19,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:19,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:19,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:19,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:19,213 INFO L87 Difference]: Start difference. First operand 200 states and 270 transitions. Second operand 3 states. [2020-07-17 22:26:19,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:19,345 INFO L93 Difference]: Finished difference Result 444 states and 592 transitions. [2020-07-17 22:26:19,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:19,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-17 22:26:19,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:19,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:19,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2020-07-17 22:26:19,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:19,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2020-07-17 22:26:19,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 92 transitions. [2020-07-17 22:26:19,424 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:19,432 INFO L225 Difference]: With dead ends: 444 [2020-07-17 22:26:19,432 INFO L226 Difference]: Without dead ends: 258 [2020-07-17 22:26:19,433 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:19,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2020-07-17 22:26:19,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2020-07-17 22:26:19,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:19,508 INFO L82 GeneralOperation]: Start isEquivalent. First operand 258 states. Second operand 256 states. [2020-07-17 22:26:19,508 INFO L74 IsIncluded]: Start isIncluded. First operand 258 states. Second operand 256 states. [2020-07-17 22:26:19,508 INFO L87 Difference]: Start difference. First operand 258 states. Second operand 256 states. [2020-07-17 22:26:19,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:19,517 INFO L93 Difference]: Finished difference Result 258 states and 327 transitions. [2020-07-17 22:26:19,517 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 327 transitions. [2020-07-17 22:26:19,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:19,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:19,518 INFO L74 IsIncluded]: Start isIncluded. First operand 256 states. Second operand 258 states. [2020-07-17 22:26:19,518 INFO L87 Difference]: Start difference. First operand 256 states. Second operand 258 states. [2020-07-17 22:26:19,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:19,527 INFO L93 Difference]: Finished difference Result 258 states and 327 transitions. [2020-07-17 22:26:19,527 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 327 transitions. [2020-07-17 22:26:19,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:19,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:19,528 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:19,528 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:19,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2020-07-17 22:26:19,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 326 transitions. [2020-07-17 22:26:19,536 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 326 transitions. Word has length 18 [2020-07-17 22:26:19,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:19,537 INFO L479 AbstractCegarLoop]: Abstraction has 256 states and 326 transitions. [2020-07-17 22:26:19,537 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:19,537 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 326 transitions. [2020-07-17 22:26:19,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-17 22:26:19,538 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:19,538 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-17 22:26:19,538 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-17 22:26:19,539 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:19,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:19,539 INFO L82 PathProgramCache]: Analyzing trace with hash -645793370, now seen corresponding path program 1 times [2020-07-17 22:26:19,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:19,540 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741800000] [2020-07-17 22:26:19,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:19,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:19,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:19,566 INFO L280 TraceCheckUtils]: 0: Hoare triple {5836#true} assume true; {5836#true} is VALID [2020-07-17 22:26:19,566 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {5836#true} {5836#true} #112#return; {5836#true} is VALID [2020-07-17 22:26:19,566 INFO L263 TraceCheckUtils]: 0: Hoare triple {5836#true} call ULTIMATE.init(); {5836#true} is VALID [2020-07-17 22:26:19,567 INFO L280 TraceCheckUtils]: 1: Hoare triple {5836#true} assume true; {5836#true} is VALID [2020-07-17 22:26:19,567 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5836#true} {5836#true} #112#return; {5836#true} is VALID [2020-07-17 22:26:19,567 INFO L263 TraceCheckUtils]: 3: Hoare triple {5836#true} call #t~ret6 := main(); {5836#true} is VALID [2020-07-17 22:26:19,568 INFO L280 TraceCheckUtils]: 4: Hoare triple {5836#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;havoc ~cond~0; {5836#true} is VALID [2020-07-17 22:26:19,568 INFO L280 TraceCheckUtils]: 5: Hoare triple {5836#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {5836#true} is VALID [2020-07-17 22:26:19,568 INFO L280 TraceCheckUtils]: 6: Hoare triple {5836#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {5836#true} is VALID [2020-07-17 22:26:19,568 INFO L280 TraceCheckUtils]: 7: Hoare triple {5836#true} assume !(0 != ~p1~0); {5836#true} is VALID [2020-07-17 22:26:19,569 INFO L280 TraceCheckUtils]: 8: Hoare triple {5836#true} assume !(0 != ~p2~0); {5836#true} is VALID [2020-07-17 22:26:19,569 INFO L280 TraceCheckUtils]: 9: Hoare triple {5836#true} assume !(0 != ~p3~0); {5836#true} is VALID [2020-07-17 22:26:19,570 INFO L280 TraceCheckUtils]: 10: Hoare triple {5836#true} assume 0 != ~p4~0;~lk4~0 := 1; {5840#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:19,571 INFO L280 TraceCheckUtils]: 11: Hoare triple {5840#(not (= 0 main_~p4~0))} assume 0 != ~p5~0;~lk5~0 := 1; {5840#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:19,581 INFO L280 TraceCheckUtils]: 12: Hoare triple {5840#(not (= 0 main_~p4~0))} assume !(0 != ~p1~0); {5840#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:19,587 INFO L280 TraceCheckUtils]: 13: Hoare triple {5840#(not (= 0 main_~p4~0))} assume !(0 != ~p2~0); {5840#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:19,588 INFO L280 TraceCheckUtils]: 14: Hoare triple {5840#(not (= 0 main_~p4~0))} assume !(0 != ~p3~0); {5840#(not (= 0 main_~p4~0))} is VALID [2020-07-17 22:26:19,589 INFO L280 TraceCheckUtils]: 15: Hoare triple {5840#(not (= 0 main_~p4~0))} assume !(0 != ~p4~0); {5837#false} is VALID [2020-07-17 22:26:19,589 INFO L280 TraceCheckUtils]: 16: Hoare triple {5837#false} assume 0 != ~p5~0; {5837#false} is VALID [2020-07-17 22:26:19,590 INFO L280 TraceCheckUtils]: 17: Hoare triple {5837#false} assume 1 != ~lk5~0; {5837#false} is VALID [2020-07-17 22:26:19,590 INFO L280 TraceCheckUtils]: 18: Hoare triple {5837#false} assume !false; {5837#false} is VALID [2020-07-17 22:26:19,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:19,591 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741800000] [2020-07-17 22:26:19,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:19,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:19,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142048988] [2020-07-17 22:26:19,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-17 22:26:19,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:19,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:19,612 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-17 22:26:19,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:19,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:19,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:19,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:19,613 INFO L87 Difference]: Start difference. First operand 256 states and 326 transitions. Second operand 3 states. [2020-07-17 22:26:19,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:19,739 INFO L93 Difference]: Finished difference Result 384 states and 484 transitions. [2020-07-17 22:26:19,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:19,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-17 22:26:19,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:19,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:19,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2020-07-17 22:26:19,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:19,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2020-07-17 22:26:19,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 87 transitions. [2020-07-17 22:26:19,821 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:19,828 INFO L225 Difference]: With dead ends: 384 [2020-07-17 22:26:19,828 INFO L226 Difference]: Without dead ends: 266 [2020-07-17 22:26:19,829 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:19,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2020-07-17 22:26:19,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 264. [2020-07-17 22:26:19,900 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:19,900 INFO L82 GeneralOperation]: Start isEquivalent. First operand 266 states. Second operand 264 states. [2020-07-17 22:26:19,901 INFO L74 IsIncluded]: Start isIncluded. First operand 266 states. Second operand 264 states. [2020-07-17 22:26:19,901 INFO L87 Difference]: Start difference. First operand 266 states. Second operand 264 states. [2020-07-17 22:26:19,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:19,909 INFO L93 Difference]: Finished difference Result 266 states and 327 transitions. [2020-07-17 22:26:19,909 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 327 transitions. [2020-07-17 22:26:19,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:19,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:19,910 INFO L74 IsIncluded]: Start isIncluded. First operand 264 states. Second operand 266 states. [2020-07-17 22:26:19,910 INFO L87 Difference]: Start difference. First operand 264 states. Second operand 266 states. [2020-07-17 22:26:19,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:19,918 INFO L93 Difference]: Finished difference Result 266 states and 327 transitions. [2020-07-17 22:26:19,918 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 327 transitions. [2020-07-17 22:26:19,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:19,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:19,919 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:19,919 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:19,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2020-07-17 22:26:19,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 326 transitions. [2020-07-17 22:26:19,927 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 326 transitions. Word has length 19 [2020-07-17 22:26:19,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:19,928 INFO L479 AbstractCegarLoop]: Abstraction has 264 states and 326 transitions. [2020-07-17 22:26:19,928 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:19,928 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 326 transitions. [2020-07-17 22:26:19,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-17 22:26:19,929 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:19,930 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-17 22:26:19,930 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-17 22:26:19,930 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:19,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:19,931 INFO L82 PathProgramCache]: Analyzing trace with hash 34265000, now seen corresponding path program 1 times [2020-07-17 22:26:19,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:19,931 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277331772] [2020-07-17 22:26:19,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:19,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:19,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:19,987 INFO L280 TraceCheckUtils]: 0: Hoare triple {7077#true} assume true; {7077#true} is VALID [2020-07-17 22:26:19,987 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {7077#true} {7077#true} #112#return; {7077#true} is VALID [2020-07-17 22:26:19,987 INFO L263 TraceCheckUtils]: 0: Hoare triple {7077#true} call ULTIMATE.init(); {7077#true} is VALID [2020-07-17 22:26:19,988 INFO L280 TraceCheckUtils]: 1: Hoare triple {7077#true} assume true; {7077#true} is VALID [2020-07-17 22:26:19,988 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {7077#true} {7077#true} #112#return; {7077#true} is VALID [2020-07-17 22:26:19,988 INFO L263 TraceCheckUtils]: 3: Hoare triple {7077#true} call #t~ret6 := main(); {7077#true} is VALID [2020-07-17 22:26:19,988 INFO L280 TraceCheckUtils]: 4: Hoare triple {7077#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;havoc ~cond~0; {7077#true} is VALID [2020-07-17 22:26:19,988 INFO L280 TraceCheckUtils]: 5: Hoare triple {7077#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {7077#true} is VALID [2020-07-17 22:26:19,989 INFO L280 TraceCheckUtils]: 6: Hoare triple {7077#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {7077#true} is VALID [2020-07-17 22:26:19,989 INFO L280 TraceCheckUtils]: 7: Hoare triple {7077#true} assume !(0 != ~p1~0); {7077#true} is VALID [2020-07-17 22:26:19,989 INFO L280 TraceCheckUtils]: 8: Hoare triple {7077#true} assume !(0 != ~p2~0); {7077#true} is VALID [2020-07-17 22:26:19,989 INFO L280 TraceCheckUtils]: 9: Hoare triple {7077#true} assume !(0 != ~p3~0); {7077#true} is VALID [2020-07-17 22:26:19,990 INFO L280 TraceCheckUtils]: 10: Hoare triple {7077#true} assume !(0 != ~p4~0); {7077#true} is VALID [2020-07-17 22:26:19,996 INFO L280 TraceCheckUtils]: 11: Hoare triple {7077#true} assume 0 != ~p5~0;~lk5~0 := 1; {7081#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:20,000 INFO L280 TraceCheckUtils]: 12: Hoare triple {7081#(= 1 main_~lk5~0)} assume !(0 != ~p1~0); {7081#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:20,001 INFO L280 TraceCheckUtils]: 13: Hoare triple {7081#(= 1 main_~lk5~0)} assume !(0 != ~p2~0); {7081#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:20,001 INFO L280 TraceCheckUtils]: 14: Hoare triple {7081#(= 1 main_~lk5~0)} assume !(0 != ~p3~0); {7081#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:20,002 INFO L280 TraceCheckUtils]: 15: Hoare triple {7081#(= 1 main_~lk5~0)} assume !(0 != ~p4~0); {7081#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:20,003 INFO L280 TraceCheckUtils]: 16: Hoare triple {7081#(= 1 main_~lk5~0)} assume 0 != ~p5~0; {7081#(= 1 main_~lk5~0)} is VALID [2020-07-17 22:26:20,003 INFO L280 TraceCheckUtils]: 17: Hoare triple {7081#(= 1 main_~lk5~0)} assume 1 != ~lk5~0; {7078#false} is VALID [2020-07-17 22:26:20,004 INFO L280 TraceCheckUtils]: 18: Hoare triple {7078#false} assume !false; {7078#false} is VALID [2020-07-17 22:26:20,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:20,005 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277331772] [2020-07-17 22:26:20,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:20,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:20,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105505172] [2020-07-17 22:26:20,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-17 22:26:20,007 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:20,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:20,029 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-17 22:26:20,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:20,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:20,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:20,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:20,031 INFO L87 Difference]: Start difference. First operand 264 states and 326 transitions. Second operand 3 states. [2020-07-17 22:26:20,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:20,227 INFO L93 Difference]: Finished difference Result 426 states and 519 transitions. [2020-07-17 22:26:20,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:20,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-17 22:26:20,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:20,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:20,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2020-07-17 22:26:20,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:20,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2020-07-17 22:26:20,233 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 53 transitions. [2020-07-17 22:26:20,285 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:20,299 INFO L225 Difference]: With dead ends: 426 [2020-07-17 22:26:20,299 INFO L226 Difference]: Without dead ends: 424 [2020-07-17 22:26:20,300 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:20,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2020-07-17 22:26:20,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 392. [2020-07-17 22:26:20,381 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:20,381 INFO L82 GeneralOperation]: Start isEquivalent. First operand 424 states. Second operand 392 states. [2020-07-17 22:26:20,381 INFO L74 IsIncluded]: Start isIncluded. First operand 424 states. Second operand 392 states. [2020-07-17 22:26:20,381 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 392 states. [2020-07-17 22:26:20,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:20,395 INFO L93 Difference]: Finished difference Result 424 states and 502 transitions. [2020-07-17 22:26:20,395 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 502 transitions. [2020-07-17 22:26:20,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:20,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:20,397 INFO L74 IsIncluded]: Start isIncluded. First operand 392 states. Second operand 424 states. [2020-07-17 22:26:20,397 INFO L87 Difference]: Start difference. First operand 392 states. Second operand 424 states. [2020-07-17 22:26:20,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:20,425 INFO L93 Difference]: Finished difference Result 424 states and 502 transitions. [2020-07-17 22:26:20,426 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 502 transitions. [2020-07-17 22:26:20,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:20,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:20,427 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:20,427 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:20,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-07-17 22:26:20,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 470 transitions. [2020-07-17 22:26:20,440 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 470 transitions. Word has length 19 [2020-07-17 22:26:20,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:20,441 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 470 transitions. [2020-07-17 22:26:20,441 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:20,441 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 470 transitions. [2020-07-17 22:26:20,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-17 22:26:20,442 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:26:20,442 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-17 22:26:20,442 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-17 22:26:20,443 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:26:20,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:26:20,443 INFO L82 PathProgramCache]: Analyzing trace with hash -775081626, now seen corresponding path program 1 times [2020-07-17 22:26:20,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:26:20,448 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555906793] [2020-07-17 22:26:20,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:26:20,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:20,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:26:20,495 INFO L280 TraceCheckUtils]: 0: Hoare triple {8811#true} assume true; {8811#true} is VALID [2020-07-17 22:26:20,495 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {8811#true} {8811#true} #112#return; {8811#true} is VALID [2020-07-17 22:26:20,496 INFO L263 TraceCheckUtils]: 0: Hoare triple {8811#true} call ULTIMATE.init(); {8811#true} is VALID [2020-07-17 22:26:20,496 INFO L280 TraceCheckUtils]: 1: Hoare triple {8811#true} assume true; {8811#true} is VALID [2020-07-17 22:26:20,497 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {8811#true} {8811#true} #112#return; {8811#true} is VALID [2020-07-17 22:26:20,497 INFO L263 TraceCheckUtils]: 3: Hoare triple {8811#true} call #t~ret6 := main(); {8811#true} is VALID [2020-07-17 22:26:20,497 INFO L280 TraceCheckUtils]: 4: Hoare triple {8811#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;havoc ~cond~0; {8811#true} is VALID [2020-07-17 22:26:20,498 INFO L280 TraceCheckUtils]: 5: Hoare triple {8811#true} assume !false;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~cond~0 := #t~nondet5;havoc #t~nondet5; {8811#true} is VALID [2020-07-17 22:26:20,498 INFO L280 TraceCheckUtils]: 6: Hoare triple {8811#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {8811#true} is VALID [2020-07-17 22:26:20,498 INFO L280 TraceCheckUtils]: 7: Hoare triple {8811#true} assume !(0 != ~p1~0); {8811#true} is VALID [2020-07-17 22:26:20,501 INFO L280 TraceCheckUtils]: 8: Hoare triple {8811#true} assume !(0 != ~p2~0); {8811#true} is VALID [2020-07-17 22:26:20,502 INFO L280 TraceCheckUtils]: 9: Hoare triple {8811#true} assume !(0 != ~p3~0); {8811#true} is VALID [2020-07-17 22:26:20,502 INFO L280 TraceCheckUtils]: 10: Hoare triple {8811#true} assume !(0 != ~p4~0); {8811#true} is VALID [2020-07-17 22:26:20,504 INFO L280 TraceCheckUtils]: 11: Hoare triple {8811#true} assume !(0 != ~p5~0); {8815#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:20,505 INFO L280 TraceCheckUtils]: 12: Hoare triple {8815#(= 0 main_~p5~0)} assume !(0 != ~p1~0); {8815#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:20,505 INFO L280 TraceCheckUtils]: 13: Hoare triple {8815#(= 0 main_~p5~0)} assume !(0 != ~p2~0); {8815#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:20,506 INFO L280 TraceCheckUtils]: 14: Hoare triple {8815#(= 0 main_~p5~0)} assume !(0 != ~p3~0); {8815#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:20,506 INFO L280 TraceCheckUtils]: 15: Hoare triple {8815#(= 0 main_~p5~0)} assume !(0 != ~p4~0); {8815#(= 0 main_~p5~0)} is VALID [2020-07-17 22:26:20,507 INFO L280 TraceCheckUtils]: 16: Hoare triple {8815#(= 0 main_~p5~0)} assume 0 != ~p5~0; {8812#false} is VALID [2020-07-17 22:26:20,507 INFO L280 TraceCheckUtils]: 17: Hoare triple {8812#false} assume 1 != ~lk5~0; {8812#false} is VALID [2020-07-17 22:26:20,507 INFO L280 TraceCheckUtils]: 18: Hoare triple {8812#false} assume !false; {8812#false} is VALID [2020-07-17 22:26:20,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:26:20,508 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555906793] [2020-07-17 22:26:20,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:26:20,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:26:20,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829621328] [2020-07-17 22:26:20,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-17 22:26:20,509 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:26:20,510 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:26:20,529 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-17 22:26:20,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:26:20,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:26:20,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:26:20,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:20,531 INFO L87 Difference]: Start difference. First operand 392 states and 470 transitions. Second operand 3 states. [2020-07-17 22:26:20,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:20,763 INFO L93 Difference]: Finished difference Result 856 states and 998 transitions. [2020-07-17 22:26:20,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:26:20,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-17 22:26:20,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:26:20,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:20,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2020-07-17 22:26:20,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:26:20,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2020-07-17 22:26:20,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 87 transitions. [2020-07-17 22:26:20,855 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:26:20,855 INFO L225 Difference]: With dead ends: 856 [2020-07-17 22:26:20,855 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 22:26:20,857 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:26:20,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 22:26:20,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 22:26:20,858 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:26:20,858 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-17 22:26:20,858 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:26:20,858 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:26:20,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:20,859 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:26:20,859 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:26:20,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:20,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:20,859 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:26:20,859 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:26:20,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:26:20,860 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:26:20,860 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:26:20,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:20,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:26:20,860 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:26:20,861 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:26:20,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 22:26:20,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 22:26:20,861 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2020-07-17 22:26:20,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:26:20,861 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 22:26:20,861 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:26:20,861 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:26:20,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:26:20,862 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-17 22:26:20,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 22:26:20,893 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-17 22:26:20,893 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:26:20,893 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:26:20,894 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 22:26:20,894 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 22:26:20,894 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-17 22:26:20,894 INFO L268 CegarLoopResult]: For program point L64(line 64) no Hoare annotation was computed. [2020-07-17 22:26:20,894 INFO L271 CegarLoopResult]: At program point L89(lines 5 93) the Hoare annotation is: true [2020-07-17 22:26:20,894 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 4 93) no Hoare annotation was computed. [2020-07-17 22:26:20,894 INFO L268 CegarLoopResult]: For program point L73-1(lines 24 88) no Hoare annotation was computed. [2020-07-17 22:26:20,894 INFO L268 CegarLoopResult]: For program point L69(line 69) no Hoare annotation was computed. [2020-07-17 22:26:20,895 INFO L268 CegarLoopResult]: For program point L57-1(lines 24 88) no Hoare annotation was computed. [2020-07-17 22:26:20,895 INFO L268 CegarLoopResult]: For program point L53-1(lines 24 88) no Hoare annotation was computed. [2020-07-17 22:26:20,895 INFO L268 CegarLoopResult]: For program point L49-1(lines 24 88) no Hoare annotation was computed. [2020-07-17 22:26:20,895 INFO L268 CegarLoopResult]: For program point L78-1(lines 24 88) no Hoare annotation was computed. [2020-07-17 22:26:20,895 INFO L268 CegarLoopResult]: For program point L45-1(lines 24 88) no Hoare annotation was computed. [2020-07-17 22:26:20,895 INFO L268 CegarLoopResult]: For program point L74(line 74) no Hoare annotation was computed. [2020-07-17 22:26:20,895 INFO L268 CegarLoopResult]: For program point L41(lines 41 43) no Hoare annotation was computed. [2020-07-17 22:26:20,895 INFO L268 CegarLoopResult]: For program point L41-2(lines 24 88) no Hoare annotation was computed. [2020-07-17 22:26:20,896 INFO L271 CegarLoopResult]: At program point L83-1(lines 24 88) the Hoare annotation is: true [2020-07-17 22:26:20,896 INFO L268 CegarLoopResult]: For program point L79(line 79) no Hoare annotation was computed. [2020-07-17 22:26:20,896 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 4 93) no Hoare annotation was computed. [2020-07-17 22:26:20,896 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 91) no Hoare annotation was computed. [2020-07-17 22:26:20,896 INFO L268 CegarLoopResult]: For program point L63-1(lines 24 88) no Hoare annotation was computed. [2020-07-17 22:26:20,896 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 93) the Hoare annotation is: true [2020-07-17 22:26:20,896 INFO L268 CegarLoopResult]: For program point L26(lines 26 28) no Hoare annotation was computed. [2020-07-17 22:26:20,897 INFO L268 CegarLoopResult]: For program point L84(line 84) no Hoare annotation was computed. [2020-07-17 22:26:20,897 INFO L264 CegarLoopResult]: At program point L84-1(lines 5 93) the Hoare annotation is: false [2020-07-17 22:26:20,897 INFO L268 CegarLoopResult]: For program point L68-1(lines 24 88) no Hoare annotation was computed. [2020-07-17 22:26:20,902 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:26:20,902 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:26:20,902 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:26:20,902 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-17 22:26:20,903 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:26:20,903 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:26:20,903 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-17 22:26:20,903 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-17 22:26:20,903 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:26:20,903 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-17 22:26:20,903 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-17 22:26:20,903 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:26:20,904 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2020-07-17 22:26:20,904 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2020-07-17 22:26:20,904 WARN L170 areAnnotationChecker]: L45-1 has no Hoare annotation [2020-07-17 22:26:20,904 WARN L170 areAnnotationChecker]: L45-1 has no Hoare annotation [2020-07-17 22:26:20,904 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2020-07-17 22:26:20,904 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2020-07-17 22:26:20,904 WARN L170 areAnnotationChecker]: L53-1 has no Hoare annotation [2020-07-17 22:26:20,904 WARN L170 areAnnotationChecker]: L53-1 has no Hoare annotation [2020-07-17 22:26:20,904 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2020-07-17 22:26:20,905 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2020-07-17 22:26:20,905 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2020-07-17 22:26:20,905 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2020-07-17 22:26:20,905 WARN L170 areAnnotationChecker]: L63-1 has no Hoare annotation [2020-07-17 22:26:20,905 WARN L170 areAnnotationChecker]: L63-1 has no Hoare annotation [2020-07-17 22:26:20,905 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2020-07-17 22:26:20,905 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:26:20,905 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2020-07-17 22:26:20,906 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2020-07-17 22:26:20,906 WARN L170 areAnnotationChecker]: L68-1 has no Hoare annotation [2020-07-17 22:26:20,906 WARN L170 areAnnotationChecker]: L68-1 has no Hoare annotation [2020-07-17 22:26:20,906 WARN L170 areAnnotationChecker]: L74 has no Hoare annotation [2020-07-17 22:26:20,906 WARN L170 areAnnotationChecker]: L74 has no Hoare annotation [2020-07-17 22:26:20,906 WARN L170 areAnnotationChecker]: L73-1 has no Hoare annotation [2020-07-17 22:26:20,906 WARN L170 areAnnotationChecker]: L73-1 has no Hoare annotation [2020-07-17 22:26:20,906 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2020-07-17 22:26:20,906 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2020-07-17 22:26:20,907 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2020-07-17 22:26:20,907 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2020-07-17 22:26:20,907 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2020-07-17 22:26:20,907 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2020-07-17 22:26:20,907 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-17 22:26:20,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:26:20 BoogieIcfgContainer [2020-07-17 22:26:20,916 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:26:20,920 INFO L168 Benchmark]: Toolchain (without parser) took 6529.16 ms. Allocated memory was 139.5 MB in the beginning and 298.8 MB in the end (delta: 159.4 MB). Free memory was 104.8 MB in the beginning and 187.6 MB in the end (delta: -82.8 MB). Peak memory consumption was 76.6 MB. Max. memory is 7.1 GB. [2020-07-17 22:26:20,920 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-17 22:26:20,921 INFO L168 Benchmark]: CACSL2BoogieTranslator took 261.27 ms. Allocated memory is still 139.5 MB. Free memory was 104.5 MB in the beginning and 94.2 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2020-07-17 22:26:20,922 INFO L168 Benchmark]: Boogie Preprocessor took 112.32 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 94.2 MB in the beginning and 183.1 MB in the end (delta: -88.8 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:26:20,922 INFO L168 Benchmark]: RCFGBuilder took 480.31 ms. Allocated memory is still 203.9 MB. Free memory was 183.1 MB in the beginning and 161.1 MB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2020-07-17 22:26:20,923 INFO L168 Benchmark]: TraceAbstraction took 5669.26 ms. Allocated memory was 203.9 MB in the beginning and 298.8 MB in the end (delta: 94.9 MB). Free memory was 161.1 MB in the beginning and 187.6 MB in the end (delta: -26.4 MB). Peak memory consumption was 68.5 MB. Max. memory is 7.1 GB. [2020-07-17 22:26:20,925 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.24 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 261.27 ms. Allocated memory is still 139.5 MB. Free memory was 104.5 MB in the beginning and 94.2 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 112.32 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 94.2 MB in the beginning and 183.1 MB in the end (delta: -88.8 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 480.31 ms. Allocated memory is still 203.9 MB. Free memory was 183.1 MB in the beginning and 161.1 MB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5669.26 ms. Allocated memory was 203.9 MB in the beginning and 298.8 MB in the end (delta: 94.9 MB). Free memory was 161.1 MB in the beginning and 187.6 MB in the end (delta: -26.4 MB). Peak memory consumption was 68.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 91]: 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: 24]: 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, 29 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 5.5s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 654 SDtfs, 285 SDslu, 428 SDs, 0 SdLazy, 75 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=392occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 14 MinimizatonAttempts, 138 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 42 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 240 NumberOfCodeBlocks, 240 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 226 ConstructedInterpolants, 0 QuantifiedInterpolants, 6424 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...