/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_6.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:03:53,100 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:03:53,103 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:03:53,115 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:03:53,116 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:03:53,117 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:03:53,118 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:03:53,120 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:03:53,122 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:03:53,123 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:03:53,124 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:03:53,125 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:03:53,125 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:03:53,126 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:03:53,127 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:03:53,129 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:03:53,129 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:03:53,130 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:03:53,132 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:03:53,135 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:03:53,137 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:03:53,138 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:03:53,139 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:03:53,140 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:03:53,144 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:03:53,144 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:03:53,144 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:03:53,146 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:03:53,146 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:03:53,147 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:03:53,148 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:03:53,149 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:03:53,150 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:03:53,151 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:03:53,152 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:03:53,153 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:03:53,154 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:03:53,154 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:03:53,154 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:03:53,155 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:03:53,156 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:03:53,157 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:03:53,173 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:03:53,173 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:03:53,175 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:03:53,175 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:03:53,175 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:03:53,175 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:03:53,176 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:03:53,176 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:03:53,176 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:03:53,178 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:03:53,178 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:03:53,179 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:03:53,179 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:03:53,179 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:03:53,179 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:03:53,179 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:03:53,179 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:03:53,180 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:03:53,180 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:03:53,180 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:03:53,180 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:03:53,180 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:03:53,181 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:03:53,181 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:03:53,181 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:03:53,181 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:03:53,181 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:03:53,182 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:03:53,182 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:03:53,182 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:03:53,450 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:03:53,464 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:03:53,467 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:03:53,469 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:03:53,469 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:03:53,470 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_6.c [2020-07-10 15:03:53,554 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00cd9e6ce/3ed5fdd84d4d4703a612804d1f4537d8/FLAG6fb3dcccb [2020-07-10 15:03:54,029 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:03:54,030 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c [2020-07-10 15:03:54,038 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00cd9e6ce/3ed5fdd84d4d4703a612804d1f4537d8/FLAG6fb3dcccb [2020-07-10 15:03:54,418 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00cd9e6ce/3ed5fdd84d4d4703a612804d1f4537d8 [2020-07-10 15:03:54,426 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:03:54,427 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:03:54,428 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:03:54,429 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:03:54,432 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:03:54,434 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:03:54" (1/1) ... [2020-07-10 15:03:54,437 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55ae2c75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:54, skipping insertion in model container [2020-07-10 15:03:54,437 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:03:54" (1/1) ... [2020-07-10 15:03:54,445 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:03:54,469 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:03:54,675 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:03:54,683 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:03:54,725 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:03:54,741 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:03:54,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:54 WrapperNode [2020-07-10 15:03:54,741 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:03:54,742 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:03:54,743 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:03:54,743 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:03:54,838 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:54" (1/1) ... [2020-07-10 15:03:54,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:54" (1/1) ... [2020-07-10 15:03:54,844 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:54" (1/1) ... [2020-07-10 15:03:54,844 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:54" (1/1) ... [2020-07-10 15:03:54,850 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:54" (1/1) ... [2020-07-10 15:03:54,859 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:54" (1/1) ... [2020-07-10 15:03:54,860 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:54" (1/1) ... [2020-07-10 15:03:54,862 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:03:54,863 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:03:54,863 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:03:54,863 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:03:54,864 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:03:54,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:03:54,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:03:54,932 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:03:54,932 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:03:54,932 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:03:54,933 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:03:54,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:03:54,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:03:55,301 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:03:55,301 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 15:03:55,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:03:55 BoogieIcfgContainer [2020-07-10 15:03:55,305 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:03:55,306 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:03:55,307 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:03:55,310 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:03:55,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:03:54" (1/3) ... [2020-07-10 15:03:55,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b352f55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:03:55, skipping insertion in model container [2020-07-10 15:03:55,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:03:54" (2/3) ... [2020-07-10 15:03:55,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b352f55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:03:55, skipping insertion in model container [2020-07-10 15:03:55,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:03:55" (3/3) ... [2020-07-10 15:03:55,313 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2020-07-10 15:03:55,324 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:03:55,332 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:03:55,347 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:03:55,369 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:03:55,370 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:03:55,370 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:03:55,370 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:03:55,370 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:03:55,370 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:03:55,371 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:03:55,371 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:03:55,390 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2020-07-10 15:03:55,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-10 15:03:55,396 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:55,397 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:03:55,397 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:55,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:55,402 INFO L82 PathProgramCache]: Analyzing trace with hash 429652513, now seen corresponding path program 1 times [2020-07-10 15:03:55,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:55,411 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479140907] [2020-07-10 15:03:55,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:55,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:55,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:55,678 INFO L280 TraceCheckUtils]: 0: Hoare triple {35#true} assume true; {35#true} is VALID [2020-07-10 15:03:55,679 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {35#true} {35#true} #129#return; {35#true} is VALID [2020-07-10 15:03:55,681 INFO L263 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {35#true} is VALID [2020-07-10 15:03:55,682 INFO L280 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2020-07-10 15:03:55,684 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #129#return; {35#true} is VALID [2020-07-10 15:03:55,684 INFO L263 TraceCheckUtils]: 3: Hoare triple {35#true} call #t~ret7 := main(); {35#true} is VALID [2020-07-10 15:03:55,686 INFO L280 TraceCheckUtils]: 4: Hoare triple {35#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;havoc ~cond~0; {35#true} is VALID [2020-07-10 15:03:55,687 INFO L280 TraceCheckUtils]: 5: Hoare triple {35#true} assume !false;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~cond~0 := #t~nondet6;havoc #t~nondet6; {35#true} is VALID [2020-07-10 15:03:55,687 INFO L280 TraceCheckUtils]: 6: Hoare triple {35#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {35#true} is VALID [2020-07-10 15:03:55,689 INFO L280 TraceCheckUtils]: 7: Hoare triple {35#true} assume 0 != ~p1~0;~lk1~0 := 1; {39#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:55,691 INFO L280 TraceCheckUtils]: 8: Hoare triple {39#(= 1 main_~lk1~0)} assume 0 != ~p2~0;~lk2~0 := 1; {39#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:55,692 INFO L280 TraceCheckUtils]: 9: Hoare triple {39#(= 1 main_~lk1~0)} assume 0 != ~p3~0;~lk3~0 := 1; {39#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:55,694 INFO L280 TraceCheckUtils]: 10: Hoare triple {39#(= 1 main_~lk1~0)} assume 0 != ~p4~0;~lk4~0 := 1; {39#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:55,696 INFO L280 TraceCheckUtils]: 11: Hoare triple {39#(= 1 main_~lk1~0)} assume 0 != ~p5~0;~lk5~0 := 1; {39#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:55,697 INFO L280 TraceCheckUtils]: 12: Hoare triple {39#(= 1 main_~lk1~0)} assume 0 != ~p6~0;~lk6~0 := 1; {39#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:55,698 INFO L280 TraceCheckUtils]: 13: Hoare triple {39#(= 1 main_~lk1~0)} assume 0 != ~p1~0; {39#(= 1 main_~lk1~0)} is VALID [2020-07-10 15:03:55,699 INFO L280 TraceCheckUtils]: 14: Hoare triple {39#(= 1 main_~lk1~0)} assume 1 != ~lk1~0; {36#false} is VALID [2020-07-10 15:03:55,700 INFO L280 TraceCheckUtils]: 15: Hoare triple {36#false} assume !false; {36#false} is VALID [2020-07-10 15:03:55,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:55,704 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479140907] [2020-07-10 15:03:55,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:55,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:55,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502371297] [2020-07-10 15:03:55,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-07-10 15:03:55,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:55,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:55,808 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-10 15:03:55,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:55,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:55,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:55,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:55,827 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2020-07-10 15:03:56,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:56,097 INFO L93 Difference]: Finished difference Result 63 states and 102 transitions. [2020-07-10 15:03:56,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:56,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-07-10 15:03:56,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:56,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:56,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2020-07-10 15:03:56,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:56,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2020-07-10 15:03:56,133 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 102 transitions. [2020-07-10 15:03:56,275 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:56,290 INFO L225 Difference]: With dead ends: 63 [2020-07-10 15:03:56,291 INFO L226 Difference]: Without dead ends: 48 [2020-07-10 15:03:56,295 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:56,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-10 15:03:56,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2020-07-10 15:03:56,340 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:56,340 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 34 states. [2020-07-10 15:03:56,341 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 34 states. [2020-07-10 15:03:56,342 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 34 states. [2020-07-10 15:03:56,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:56,348 INFO L93 Difference]: Finished difference Result 48 states and 80 transitions. [2020-07-10 15:03:56,349 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 80 transitions. [2020-07-10 15:03:56,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:56,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:56,350 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 48 states. [2020-07-10 15:03:56,350 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 48 states. [2020-07-10 15:03:56,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:56,357 INFO L93 Difference]: Finished difference Result 48 states and 80 transitions. [2020-07-10 15:03:56,357 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 80 transitions. [2020-07-10 15:03:56,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:56,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:56,370 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:56,370 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:56,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-10 15:03:56,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2020-07-10 15:03:56,376 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 16 [2020-07-10 15:03:56,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:56,376 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 57 transitions. [2020-07-10 15:03:56,376 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:56,377 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 57 transitions. [2020-07-10 15:03:56,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-10 15:03:56,378 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:56,378 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:03:56,378 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:03:56,378 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:56,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:56,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1109710883, now seen corresponding path program 1 times [2020-07-10 15:03:56,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:56,380 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689443031] [2020-07-10 15:03:56,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:56,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:56,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:56,443 INFO L280 TraceCheckUtils]: 0: Hoare triple {253#true} assume true; {253#true} is VALID [2020-07-10 15:03:56,444 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {253#true} {253#true} #129#return; {253#true} is VALID [2020-07-10 15:03:56,444 INFO L263 TraceCheckUtils]: 0: Hoare triple {253#true} call ULTIMATE.init(); {253#true} is VALID [2020-07-10 15:03:56,444 INFO L280 TraceCheckUtils]: 1: Hoare triple {253#true} assume true; {253#true} is VALID [2020-07-10 15:03:56,445 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {253#true} {253#true} #129#return; {253#true} is VALID [2020-07-10 15:03:56,445 INFO L263 TraceCheckUtils]: 3: Hoare triple {253#true} call #t~ret7 := main(); {253#true} is VALID [2020-07-10 15:03:56,445 INFO L280 TraceCheckUtils]: 4: Hoare triple {253#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;havoc ~cond~0; {253#true} is VALID [2020-07-10 15:03:56,446 INFO L280 TraceCheckUtils]: 5: Hoare triple {253#true} assume !false;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~cond~0 := #t~nondet6;havoc #t~nondet6; {253#true} is VALID [2020-07-10 15:03:56,446 INFO L280 TraceCheckUtils]: 6: Hoare triple {253#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {253#true} is VALID [2020-07-10 15:03:56,447 INFO L280 TraceCheckUtils]: 7: Hoare triple {253#true} assume !(0 != ~p1~0); {257#(= 0 main_~p1~0)} is VALID [2020-07-10 15:03:56,450 INFO L280 TraceCheckUtils]: 8: Hoare triple {257#(= 0 main_~p1~0)} assume 0 != ~p2~0;~lk2~0 := 1; {257#(= 0 main_~p1~0)} is VALID [2020-07-10 15:03:56,452 INFO L280 TraceCheckUtils]: 9: Hoare triple {257#(= 0 main_~p1~0)} assume 0 != ~p3~0;~lk3~0 := 1; {257#(= 0 main_~p1~0)} is VALID [2020-07-10 15:03:56,452 INFO L280 TraceCheckUtils]: 10: Hoare triple {257#(= 0 main_~p1~0)} assume 0 != ~p4~0;~lk4~0 := 1; {257#(= 0 main_~p1~0)} is VALID [2020-07-10 15:03:56,453 INFO L280 TraceCheckUtils]: 11: Hoare triple {257#(= 0 main_~p1~0)} assume 0 != ~p5~0;~lk5~0 := 1; {257#(= 0 main_~p1~0)} is VALID [2020-07-10 15:03:56,454 INFO L280 TraceCheckUtils]: 12: Hoare triple {257#(= 0 main_~p1~0)} assume 0 != ~p6~0;~lk6~0 := 1; {257#(= 0 main_~p1~0)} is VALID [2020-07-10 15:03:56,455 INFO L280 TraceCheckUtils]: 13: Hoare triple {257#(= 0 main_~p1~0)} assume 0 != ~p1~0; {254#false} is VALID [2020-07-10 15:03:56,455 INFO L280 TraceCheckUtils]: 14: Hoare triple {254#false} assume 1 != ~lk1~0; {254#false} is VALID [2020-07-10 15:03:56,456 INFO L280 TraceCheckUtils]: 15: Hoare triple {254#false} assume !false; {254#false} is VALID [2020-07-10 15:03:56,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:56,458 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689443031] [2020-07-10 15:03:56,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:56,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:56,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6299466] [2020-07-10 15:03:56,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-07-10 15:03:56,461 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:56,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:56,483 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-10 15:03:56,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:56,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:56,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:56,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:56,485 INFO L87 Difference]: Start difference. First operand 34 states and 57 transitions. Second operand 3 states. [2020-07-10 15:03:56,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:56,601 INFO L93 Difference]: Finished difference Result 77 states and 132 transitions. [2020-07-10 15:03:56,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:56,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-07-10 15:03:56,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:56,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:56,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2020-07-10 15:03:56,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:56,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2020-07-10 15:03:56,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 119 transitions. [2020-07-10 15:03:56,769 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:56,771 INFO L225 Difference]: With dead ends: 77 [2020-07-10 15:03:56,772 INFO L226 Difference]: Without dead ends: 48 [2020-07-10 15:03:56,773 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:56,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-10 15:03:56,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2020-07-10 15:03:56,783 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:56,783 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 46 states. [2020-07-10 15:03:56,783 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 46 states. [2020-07-10 15:03:56,783 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 46 states. [2020-07-10 15:03:56,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:56,787 INFO L93 Difference]: Finished difference Result 48 states and 78 transitions. [2020-07-10 15:03:56,788 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 78 transitions. [2020-07-10 15:03:56,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:56,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:56,789 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 48 states. [2020-07-10 15:03:56,789 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 48 states. [2020-07-10 15:03:56,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:56,793 INFO L93 Difference]: Finished difference Result 48 states and 78 transitions. [2020-07-10 15:03:56,793 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 78 transitions. [2020-07-10 15:03:56,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:56,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:56,794 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:56,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:56,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-10 15:03:56,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 77 transitions. [2020-07-10 15:03:56,798 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 77 transitions. Word has length 16 [2020-07-10 15:03:56,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:56,798 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 77 transitions. [2020-07-10 15:03:56,798 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:56,798 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 77 transitions. [2020-07-10 15:03:56,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-10 15:03:56,799 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:56,800 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:03:56,800 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:03:56,800 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:56,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:56,801 INFO L82 PathProgramCache]: Analyzing trace with hash 434540691, now seen corresponding path program 1 times [2020-07-10 15:03:56,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:56,801 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042521282] [2020-07-10 15:03:56,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:56,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:56,852 INFO L280 TraceCheckUtils]: 0: Hoare triple {496#true} assume true; {496#true} is VALID [2020-07-10 15:03:56,852 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {496#true} {496#true} #129#return; {496#true} is VALID [2020-07-10 15:03:56,853 INFO L263 TraceCheckUtils]: 0: Hoare triple {496#true} call ULTIMATE.init(); {496#true} is VALID [2020-07-10 15:03:56,853 INFO L280 TraceCheckUtils]: 1: Hoare triple {496#true} assume true; {496#true} is VALID [2020-07-10 15:03:56,853 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {496#true} {496#true} #129#return; {496#true} is VALID [2020-07-10 15:03:56,854 INFO L263 TraceCheckUtils]: 3: Hoare triple {496#true} call #t~ret7 := main(); {496#true} is VALID [2020-07-10 15:03:56,854 INFO L280 TraceCheckUtils]: 4: Hoare triple {496#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;havoc ~cond~0; {496#true} is VALID [2020-07-10 15:03:56,854 INFO L280 TraceCheckUtils]: 5: Hoare triple {496#true} assume !false;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~cond~0 := #t~nondet6;havoc #t~nondet6; {496#true} is VALID [2020-07-10 15:03:56,854 INFO L280 TraceCheckUtils]: 6: Hoare triple {496#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {496#true} is VALID [2020-07-10 15:03:56,855 INFO L280 TraceCheckUtils]: 7: Hoare triple {496#true} assume 0 != ~p1~0;~lk1~0 := 1; {500#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:03:56,857 INFO L280 TraceCheckUtils]: 8: Hoare triple {500#(not (= 0 main_~p1~0))} assume 0 != ~p2~0;~lk2~0 := 1; {500#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:03:56,858 INFO L280 TraceCheckUtils]: 9: Hoare triple {500#(not (= 0 main_~p1~0))} assume 0 != ~p3~0;~lk3~0 := 1; {500#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:03:56,859 INFO L280 TraceCheckUtils]: 10: Hoare triple {500#(not (= 0 main_~p1~0))} assume 0 != ~p4~0;~lk4~0 := 1; {500#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:03:56,860 INFO L280 TraceCheckUtils]: 11: Hoare triple {500#(not (= 0 main_~p1~0))} assume 0 != ~p5~0;~lk5~0 := 1; {500#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:03:56,862 INFO L280 TraceCheckUtils]: 12: Hoare triple {500#(not (= 0 main_~p1~0))} assume 0 != ~p6~0;~lk6~0 := 1; {500#(not (= 0 main_~p1~0))} is VALID [2020-07-10 15:03:56,863 INFO L280 TraceCheckUtils]: 13: Hoare triple {500#(not (= 0 main_~p1~0))} assume !(0 != ~p1~0); {497#false} is VALID [2020-07-10 15:03:56,864 INFO L280 TraceCheckUtils]: 14: Hoare triple {497#false} assume 0 != ~p2~0; {497#false} is VALID [2020-07-10 15:03:56,864 INFO L280 TraceCheckUtils]: 15: Hoare triple {497#false} assume 1 != ~lk2~0; {497#false} is VALID [2020-07-10 15:03:56,864 INFO L280 TraceCheckUtils]: 16: Hoare triple {497#false} assume !false; {497#false} is VALID [2020-07-10 15:03:56,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:56,865 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042521282] [2020-07-10 15:03:56,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:56,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:56,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851497064] [2020-07-10 15:03:56,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-07-10 15:03:56,867 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:56,867 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:56,892 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-10 15:03:56,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:56,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:56,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:56,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:56,894 INFO L87 Difference]: Start difference. First operand 46 states and 77 transitions. Second operand 3 states. [2020-07-10 15:03:56,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:56,993 INFO L93 Difference]: Finished difference Result 72 states and 117 transitions. [2020-07-10 15:03:56,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:56,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-07-10 15:03:56,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:56,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:56,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2020-07-10 15:03:56,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:57,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2020-07-10 15:03:57,001 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 114 transitions. [2020-07-10 15:03:57,134 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:57,136 INFO L225 Difference]: With dead ends: 72 [2020-07-10 15:03:57,136 INFO L226 Difference]: Without dead ends: 51 [2020-07-10 15:03:57,137 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:57,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-07-10 15:03:57,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2020-07-10 15:03:57,148 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:57,148 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 49 states. [2020-07-10 15:03:57,149 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 49 states. [2020-07-10 15:03:57,149 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 49 states. [2020-07-10 15:03:57,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:57,152 INFO L93 Difference]: Finished difference Result 51 states and 80 transitions. [2020-07-10 15:03:57,153 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 80 transitions. [2020-07-10 15:03:57,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:57,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:57,154 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 51 states. [2020-07-10 15:03:57,154 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 51 states. [2020-07-10 15:03:57,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:57,158 INFO L93 Difference]: Finished difference Result 51 states and 80 transitions. [2020-07-10 15:03:57,158 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 80 transitions. [2020-07-10 15:03:57,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:57,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:57,159 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:57,159 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:57,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-10 15:03:57,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 79 transitions. [2020-07-10 15:03:57,162 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 79 transitions. Word has length 17 [2020-07-10 15:03:57,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:57,163 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 79 transitions. [2020-07-10 15:03:57,163 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:57,163 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 79 transitions. [2020-07-10 15:03:57,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-10 15:03:57,164 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:57,164 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:03:57,165 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 15:03:57,165 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:57,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:57,165 INFO L82 PathProgramCache]: Analyzing trace with hash 41513681, now seen corresponding path program 1 times [2020-07-10 15:03:57,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:57,166 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390352768] [2020-07-10 15:03:57,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:57,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:57,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:57,212 INFO L280 TraceCheckUtils]: 0: Hoare triple {745#true} assume true; {745#true} is VALID [2020-07-10 15:03:57,212 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {745#true} {745#true} #129#return; {745#true} is VALID [2020-07-10 15:03:57,213 INFO L263 TraceCheckUtils]: 0: Hoare triple {745#true} call ULTIMATE.init(); {745#true} is VALID [2020-07-10 15:03:57,213 INFO L280 TraceCheckUtils]: 1: Hoare triple {745#true} assume true; {745#true} is VALID [2020-07-10 15:03:57,213 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {745#true} {745#true} #129#return; {745#true} is VALID [2020-07-10 15:03:57,214 INFO L263 TraceCheckUtils]: 3: Hoare triple {745#true} call #t~ret7 := main(); {745#true} is VALID [2020-07-10 15:03:57,214 INFO L280 TraceCheckUtils]: 4: Hoare triple {745#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;havoc ~cond~0; {745#true} is VALID [2020-07-10 15:03:57,214 INFO L280 TraceCheckUtils]: 5: Hoare triple {745#true} assume !false;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~cond~0 := #t~nondet6;havoc #t~nondet6; {745#true} is VALID [2020-07-10 15:03:57,215 INFO L280 TraceCheckUtils]: 6: Hoare triple {745#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {745#true} is VALID [2020-07-10 15:03:57,215 INFO L280 TraceCheckUtils]: 7: Hoare triple {745#true} assume !(0 != ~p1~0); {745#true} is VALID [2020-07-10 15:03:57,216 INFO L280 TraceCheckUtils]: 8: Hoare triple {745#true} assume 0 != ~p2~0;~lk2~0 := 1; {749#(= 1 main_~lk2~0)} is VALID [2020-07-10 15:03:57,217 INFO L280 TraceCheckUtils]: 9: Hoare triple {749#(= 1 main_~lk2~0)} assume 0 != ~p3~0;~lk3~0 := 1; {749#(= 1 main_~lk2~0)} is VALID [2020-07-10 15:03:57,218 INFO L280 TraceCheckUtils]: 10: Hoare triple {749#(= 1 main_~lk2~0)} assume 0 != ~p4~0;~lk4~0 := 1; {749#(= 1 main_~lk2~0)} is VALID [2020-07-10 15:03:57,219 INFO L280 TraceCheckUtils]: 11: Hoare triple {749#(= 1 main_~lk2~0)} assume 0 != ~p5~0;~lk5~0 := 1; {749#(= 1 main_~lk2~0)} is VALID [2020-07-10 15:03:57,219 INFO L280 TraceCheckUtils]: 12: Hoare triple {749#(= 1 main_~lk2~0)} assume 0 != ~p6~0;~lk6~0 := 1; {749#(= 1 main_~lk2~0)} is VALID [2020-07-10 15:03:57,220 INFO L280 TraceCheckUtils]: 13: Hoare triple {749#(= 1 main_~lk2~0)} assume !(0 != ~p1~0); {749#(= 1 main_~lk2~0)} is VALID [2020-07-10 15:03:57,221 INFO L280 TraceCheckUtils]: 14: Hoare triple {749#(= 1 main_~lk2~0)} assume 0 != ~p2~0; {749#(= 1 main_~lk2~0)} is VALID [2020-07-10 15:03:57,222 INFO L280 TraceCheckUtils]: 15: Hoare triple {749#(= 1 main_~lk2~0)} assume 1 != ~lk2~0; {746#false} is VALID [2020-07-10 15:03:57,222 INFO L280 TraceCheckUtils]: 16: Hoare triple {746#false} assume !false; {746#false} is VALID [2020-07-10 15:03:57,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:57,224 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390352768] [2020-07-10 15:03:57,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:57,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:57,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364360072] [2020-07-10 15:03:57,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-07-10 15:03:57,225 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:57,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:57,248 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-10 15:03:57,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:57,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:57,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:57,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:57,250 INFO L87 Difference]: Start difference. First operand 49 states and 79 transitions. Second operand 3 states. [2020-07-10 15:03:57,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:57,347 INFO L93 Difference]: Finished difference Result 88 states and 144 transitions. [2020-07-10 15:03:57,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:57,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-07-10 15:03:57,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:57,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:57,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2020-07-10 15:03:57,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:57,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2020-07-10 15:03:57,353 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 78 transitions. [2020-07-10 15:03:57,439 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:57,441 INFO L225 Difference]: With dead ends: 88 [2020-07-10 15:03:57,442 INFO L226 Difference]: Without dead ends: 86 [2020-07-10 15:03:57,442 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:57,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-07-10 15:03:57,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 64. [2020-07-10 15:03:57,455 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:57,455 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 64 states. [2020-07-10 15:03:57,455 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 64 states. [2020-07-10 15:03:57,455 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 64 states. [2020-07-10 15:03:57,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:57,460 INFO L93 Difference]: Finished difference Result 86 states and 141 transitions. [2020-07-10 15:03:57,460 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 141 transitions. [2020-07-10 15:03:57,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:57,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:57,461 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 86 states. [2020-07-10 15:03:57,461 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 86 states. [2020-07-10 15:03:57,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:57,467 INFO L93 Difference]: Finished difference Result 86 states and 141 transitions. [2020-07-10 15:03:57,467 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 141 transitions. [2020-07-10 15:03:57,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:57,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:57,468 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:57,468 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:57,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-07-10 15:03:57,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 104 transitions. [2020-07-10 15:03:57,472 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 104 transitions. Word has length 17 [2020-07-10 15:03:57,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:57,472 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 104 transitions. [2020-07-10 15:03:57,472 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:57,472 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 104 transitions. [2020-07-10 15:03:57,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-10 15:03:57,473 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:57,473 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:03:57,474 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 15:03:57,474 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:57,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:57,474 INFO L82 PathProgramCache]: Analyzing trace with hash 721572051, now seen corresponding path program 1 times [2020-07-10 15:03:57,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:57,475 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881975145] [2020-07-10 15:03:57,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:57,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:57,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:57,527 INFO L280 TraceCheckUtils]: 0: Hoare triple {1096#true} assume true; {1096#true} is VALID [2020-07-10 15:03:57,528 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1096#true} {1096#true} #129#return; {1096#true} is VALID [2020-07-10 15:03:57,528 INFO L263 TraceCheckUtils]: 0: Hoare triple {1096#true} call ULTIMATE.init(); {1096#true} is VALID [2020-07-10 15:03:57,528 INFO L280 TraceCheckUtils]: 1: Hoare triple {1096#true} assume true; {1096#true} is VALID [2020-07-10 15:03:57,529 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1096#true} {1096#true} #129#return; {1096#true} is VALID [2020-07-10 15:03:57,529 INFO L263 TraceCheckUtils]: 3: Hoare triple {1096#true} call #t~ret7 := main(); {1096#true} is VALID [2020-07-10 15:03:57,529 INFO L280 TraceCheckUtils]: 4: Hoare triple {1096#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;havoc ~cond~0; {1096#true} is VALID [2020-07-10 15:03:57,530 INFO L280 TraceCheckUtils]: 5: Hoare triple {1096#true} assume !false;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~cond~0 := #t~nondet6;havoc #t~nondet6; {1096#true} is VALID [2020-07-10 15:03:57,530 INFO L280 TraceCheckUtils]: 6: Hoare triple {1096#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {1096#true} is VALID [2020-07-10 15:03:57,530 INFO L280 TraceCheckUtils]: 7: Hoare triple {1096#true} assume !(0 != ~p1~0); {1096#true} is VALID [2020-07-10 15:03:57,534 INFO L280 TraceCheckUtils]: 8: Hoare triple {1096#true} assume !(0 != ~p2~0); {1100#(= 0 main_~p2~0)} is VALID [2020-07-10 15:03:57,536 INFO L280 TraceCheckUtils]: 9: Hoare triple {1100#(= 0 main_~p2~0)} assume 0 != ~p3~0;~lk3~0 := 1; {1100#(= 0 main_~p2~0)} is VALID [2020-07-10 15:03:57,537 INFO L280 TraceCheckUtils]: 10: Hoare triple {1100#(= 0 main_~p2~0)} assume 0 != ~p4~0;~lk4~0 := 1; {1100#(= 0 main_~p2~0)} is VALID [2020-07-10 15:03:57,539 INFO L280 TraceCheckUtils]: 11: Hoare triple {1100#(= 0 main_~p2~0)} assume 0 != ~p5~0;~lk5~0 := 1; {1100#(= 0 main_~p2~0)} is VALID [2020-07-10 15:03:57,540 INFO L280 TraceCheckUtils]: 12: Hoare triple {1100#(= 0 main_~p2~0)} assume 0 != ~p6~0;~lk6~0 := 1; {1100#(= 0 main_~p2~0)} is VALID [2020-07-10 15:03:57,541 INFO L280 TraceCheckUtils]: 13: Hoare triple {1100#(= 0 main_~p2~0)} assume !(0 != ~p1~0); {1100#(= 0 main_~p2~0)} is VALID [2020-07-10 15:03:57,541 INFO L280 TraceCheckUtils]: 14: Hoare triple {1100#(= 0 main_~p2~0)} assume 0 != ~p2~0; {1097#false} is VALID [2020-07-10 15:03:57,542 INFO L280 TraceCheckUtils]: 15: Hoare triple {1097#false} assume 1 != ~lk2~0; {1097#false} is VALID [2020-07-10 15:03:57,542 INFO L280 TraceCheckUtils]: 16: Hoare triple {1097#false} assume !false; {1097#false} is VALID [2020-07-10 15:03:57,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:57,543 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881975145] [2020-07-10 15:03:57,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:57,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:57,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279014484] [2020-07-10 15:03:57,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-07-10 15:03:57,544 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:57,545 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:57,564 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-10 15:03:57,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:57,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:57,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:57,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:57,566 INFO L87 Difference]: Start difference. First operand 64 states and 104 transitions. Second operand 3 states. [2020-07-10 15:03:57,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:57,658 INFO L93 Difference]: Finished difference Result 144 states and 238 transitions. [2020-07-10 15:03:57,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:57,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-07-10 15:03:57,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:57,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:57,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2020-07-10 15:03:57,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:57,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2020-07-10 15:03:57,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 116 transitions. [2020-07-10 15:03:57,781 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:57,783 INFO L225 Difference]: With dead ends: 144 [2020-07-10 15:03:57,784 INFO L226 Difference]: Without dead ends: 88 [2020-07-10 15:03:57,784 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:57,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-07-10 15:03:57,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2020-07-10 15:03:57,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:57,803 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 86 states. [2020-07-10 15:03:57,804 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 86 states. [2020-07-10 15:03:57,804 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 86 states. [2020-07-10 15:03:57,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:57,808 INFO L93 Difference]: Finished difference Result 88 states and 139 transitions. [2020-07-10 15:03:57,809 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 139 transitions. [2020-07-10 15:03:57,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:57,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:57,810 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 88 states. [2020-07-10 15:03:57,810 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 88 states. [2020-07-10 15:03:57,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:57,814 INFO L93 Difference]: Finished difference Result 88 states and 139 transitions. [2020-07-10 15:03:57,815 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 139 transitions. [2020-07-10 15:03:57,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:57,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:57,815 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:57,816 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:57,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-07-10 15:03:57,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 138 transitions. [2020-07-10 15:03:57,820 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 138 transitions. Word has length 17 [2020-07-10 15:03:57,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:57,820 INFO L479 AbstractCegarLoop]: Abstraction has 86 states and 138 transitions. [2020-07-10 15:03:57,820 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:57,821 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 138 transitions. [2020-07-10 15:03:57,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-10 15:03:57,821 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:57,821 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-10 15:03:57,821 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 15:03:57,822 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:57,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:57,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1287139128, now seen corresponding path program 1 times [2020-07-10 15:03:57,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:57,823 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771162754] [2020-07-10 15:03:57,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:57,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:57,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:57,863 INFO L280 TraceCheckUtils]: 0: Hoare triple {1533#true} assume true; {1533#true} is VALID [2020-07-10 15:03:57,864 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1533#true} {1533#true} #129#return; {1533#true} is VALID [2020-07-10 15:03:57,864 INFO L263 TraceCheckUtils]: 0: Hoare triple {1533#true} call ULTIMATE.init(); {1533#true} is VALID [2020-07-10 15:03:57,865 INFO L280 TraceCheckUtils]: 1: Hoare triple {1533#true} assume true; {1533#true} is VALID [2020-07-10 15:03:57,865 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1533#true} {1533#true} #129#return; {1533#true} is VALID [2020-07-10 15:03:57,865 INFO L263 TraceCheckUtils]: 3: Hoare triple {1533#true} call #t~ret7 := main(); {1533#true} is VALID [2020-07-10 15:03:57,865 INFO L280 TraceCheckUtils]: 4: Hoare triple {1533#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;havoc ~cond~0; {1533#true} is VALID [2020-07-10 15:03:57,866 INFO L280 TraceCheckUtils]: 5: Hoare triple {1533#true} assume !false;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~cond~0 := #t~nondet6;havoc #t~nondet6; {1533#true} is VALID [2020-07-10 15:03:57,866 INFO L280 TraceCheckUtils]: 6: Hoare triple {1533#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {1533#true} is VALID [2020-07-10 15:03:57,866 INFO L280 TraceCheckUtils]: 7: Hoare triple {1533#true} assume !(0 != ~p1~0); {1533#true} is VALID [2020-07-10 15:03:57,867 INFO L280 TraceCheckUtils]: 8: Hoare triple {1533#true} assume 0 != ~p2~0;~lk2~0 := 1; {1537#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:03:57,869 INFO L280 TraceCheckUtils]: 9: Hoare triple {1537#(not (= 0 main_~p2~0))} assume 0 != ~p3~0;~lk3~0 := 1; {1537#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:03:57,871 INFO L280 TraceCheckUtils]: 10: Hoare triple {1537#(not (= 0 main_~p2~0))} assume 0 != ~p4~0;~lk4~0 := 1; {1537#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:03:57,873 INFO L280 TraceCheckUtils]: 11: Hoare triple {1537#(not (= 0 main_~p2~0))} assume 0 != ~p5~0;~lk5~0 := 1; {1537#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:03:57,874 INFO L280 TraceCheckUtils]: 12: Hoare triple {1537#(not (= 0 main_~p2~0))} assume 0 != ~p6~0;~lk6~0 := 1; {1537#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:03:57,875 INFO L280 TraceCheckUtils]: 13: Hoare triple {1537#(not (= 0 main_~p2~0))} assume !(0 != ~p1~0); {1537#(not (= 0 main_~p2~0))} is VALID [2020-07-10 15:03:57,876 INFO L280 TraceCheckUtils]: 14: Hoare triple {1537#(not (= 0 main_~p2~0))} assume !(0 != ~p2~0); {1534#false} is VALID [2020-07-10 15:03:57,876 INFO L280 TraceCheckUtils]: 15: Hoare triple {1534#false} assume 0 != ~p3~0; {1534#false} is VALID [2020-07-10 15:03:57,876 INFO L280 TraceCheckUtils]: 16: Hoare triple {1534#false} assume 1 != ~lk3~0; {1534#false} is VALID [2020-07-10 15:03:57,876 INFO L280 TraceCheckUtils]: 17: Hoare triple {1534#false} assume !false; {1534#false} is VALID [2020-07-10 15:03:57,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:57,878 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771162754] [2020-07-10 15:03:57,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:57,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:57,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501300177] [2020-07-10 15:03:57,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-10 15:03:57,879 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:57,879 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:57,899 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-10 15:03:57,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:57,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:57,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:57,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:57,901 INFO L87 Difference]: Start difference. First operand 86 states and 138 transitions. Second operand 3 states. [2020-07-10 15:03:57,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:57,996 INFO L93 Difference]: Finished difference Result 129 states and 205 transitions. [2020-07-10 15:03:57,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:57,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-10 15:03:57,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:57,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:57,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2020-07-10 15:03:57,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:58,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2020-07-10 15:03:58,002 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 111 transitions. [2020-07-10 15:03:58,125 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:58,127 INFO L225 Difference]: With dead ends: 129 [2020-07-10 15:03:58,127 INFO L226 Difference]: Without dead ends: 90 [2020-07-10 15:03:58,128 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:58,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-07-10 15:03:58,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2020-07-10 15:03:58,146 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:58,147 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 88 states. [2020-07-10 15:03:58,147 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 88 states. [2020-07-10 15:03:58,147 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 88 states. [2020-07-10 15:03:58,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:58,150 INFO L93 Difference]: Finished difference Result 90 states and 139 transitions. [2020-07-10 15:03:58,151 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 139 transitions. [2020-07-10 15:03:58,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:58,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:58,151 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 90 states. [2020-07-10 15:03:58,152 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 90 states. [2020-07-10 15:03:58,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:58,156 INFO L93 Difference]: Finished difference Result 90 states and 139 transitions. [2020-07-10 15:03:58,156 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 139 transitions. [2020-07-10 15:03:58,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:58,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:58,157 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:58,157 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:58,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-07-10 15:03:58,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 138 transitions. [2020-07-10 15:03:58,161 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 138 transitions. Word has length 18 [2020-07-10 15:03:58,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:58,161 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 138 transitions. [2020-07-10 15:03:58,162 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:58,162 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 138 transitions. [2020-07-10 15:03:58,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-10 15:03:58,162 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:58,162 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-10 15:03:58,163 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-10 15:03:58,163 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:58,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:58,163 INFO L82 PathProgramCache]: Analyzing trace with hash 894112118, now seen corresponding path program 1 times [2020-07-10 15:03:58,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:58,164 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723083861] [2020-07-10 15:03:58,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:58,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:58,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:58,196 INFO L280 TraceCheckUtils]: 0: Hoare triple {1961#true} assume true; {1961#true} is VALID [2020-07-10 15:03:58,197 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1961#true} {1961#true} #129#return; {1961#true} is VALID [2020-07-10 15:03:58,197 INFO L263 TraceCheckUtils]: 0: Hoare triple {1961#true} call ULTIMATE.init(); {1961#true} is VALID [2020-07-10 15:03:58,197 INFO L280 TraceCheckUtils]: 1: Hoare triple {1961#true} assume true; {1961#true} is VALID [2020-07-10 15:03:58,197 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1961#true} {1961#true} #129#return; {1961#true} is VALID [2020-07-10 15:03:58,198 INFO L263 TraceCheckUtils]: 3: Hoare triple {1961#true} call #t~ret7 := main(); {1961#true} is VALID [2020-07-10 15:03:58,198 INFO L280 TraceCheckUtils]: 4: Hoare triple {1961#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;havoc ~cond~0; {1961#true} is VALID [2020-07-10 15:03:58,198 INFO L280 TraceCheckUtils]: 5: Hoare triple {1961#true} assume !false;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~cond~0 := #t~nondet6;havoc #t~nondet6; {1961#true} is VALID [2020-07-10 15:03:58,198 INFO L280 TraceCheckUtils]: 6: Hoare triple {1961#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {1961#true} is VALID [2020-07-10 15:03:58,199 INFO L280 TraceCheckUtils]: 7: Hoare triple {1961#true} assume !(0 != ~p1~0); {1961#true} is VALID [2020-07-10 15:03:58,199 INFO L280 TraceCheckUtils]: 8: Hoare triple {1961#true} assume !(0 != ~p2~0); {1961#true} is VALID [2020-07-10 15:03:58,200 INFO L280 TraceCheckUtils]: 9: Hoare triple {1961#true} assume 0 != ~p3~0;~lk3~0 := 1; {1965#(= 1 main_~lk3~0)} is VALID [2020-07-10 15:03:58,200 INFO L280 TraceCheckUtils]: 10: Hoare triple {1965#(= 1 main_~lk3~0)} assume 0 != ~p4~0;~lk4~0 := 1; {1965#(= 1 main_~lk3~0)} is VALID [2020-07-10 15:03:58,201 INFO L280 TraceCheckUtils]: 11: Hoare triple {1965#(= 1 main_~lk3~0)} assume 0 != ~p5~0;~lk5~0 := 1; {1965#(= 1 main_~lk3~0)} is VALID [2020-07-10 15:03:58,202 INFO L280 TraceCheckUtils]: 12: Hoare triple {1965#(= 1 main_~lk3~0)} assume 0 != ~p6~0;~lk6~0 := 1; {1965#(= 1 main_~lk3~0)} is VALID [2020-07-10 15:03:58,202 INFO L280 TraceCheckUtils]: 13: Hoare triple {1965#(= 1 main_~lk3~0)} assume !(0 != ~p1~0); {1965#(= 1 main_~lk3~0)} is VALID [2020-07-10 15:03:58,203 INFO L280 TraceCheckUtils]: 14: Hoare triple {1965#(= 1 main_~lk3~0)} assume !(0 != ~p2~0); {1965#(= 1 main_~lk3~0)} is VALID [2020-07-10 15:03:58,204 INFO L280 TraceCheckUtils]: 15: Hoare triple {1965#(= 1 main_~lk3~0)} assume 0 != ~p3~0; {1965#(= 1 main_~lk3~0)} is VALID [2020-07-10 15:03:58,204 INFO L280 TraceCheckUtils]: 16: Hoare triple {1965#(= 1 main_~lk3~0)} assume 1 != ~lk3~0; {1962#false} is VALID [2020-07-10 15:03:58,205 INFO L280 TraceCheckUtils]: 17: Hoare triple {1962#false} assume !false; {1962#false} is VALID [2020-07-10 15:03:58,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:58,206 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723083861] [2020-07-10 15:03:58,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:58,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:58,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794784160] [2020-07-10 15:03:58,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-10 15:03:58,207 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:58,207 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:58,227 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-10 15:03:58,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:58,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:58,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:58,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:58,229 INFO L87 Difference]: Start difference. First operand 88 states and 138 transitions. Second operand 3 states. [2020-07-10 15:03:58,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:58,320 INFO L93 Difference]: Finished difference Result 156 states and 248 transitions. [2020-07-10 15:03:58,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:58,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-10 15:03:58,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:58,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:58,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2020-07-10 15:03:58,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:58,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2020-07-10 15:03:58,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 74 transitions. [2020-07-10 15:03:58,398 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:58,402 INFO L225 Difference]: With dead ends: 156 [2020-07-10 15:03:58,403 INFO L226 Difference]: Without dead ends: 154 [2020-07-10 15:03:58,403 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:58,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2020-07-10 15:03:58,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 120. [2020-07-10 15:03:58,427 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:58,428 INFO L82 GeneralOperation]: Start isEquivalent. First operand 154 states. Second operand 120 states. [2020-07-10 15:03:58,428 INFO L74 IsIncluded]: Start isIncluded. First operand 154 states. Second operand 120 states. [2020-07-10 15:03:58,428 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 120 states. [2020-07-10 15:03:58,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:58,435 INFO L93 Difference]: Finished difference Result 154 states and 243 transitions. [2020-07-10 15:03:58,435 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 243 transitions. [2020-07-10 15:03:58,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:58,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:58,436 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 154 states. [2020-07-10 15:03:58,436 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 154 states. [2020-07-10 15:03:58,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:58,444 INFO L93 Difference]: Finished difference Result 154 states and 243 transitions. [2020-07-10 15:03:58,444 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 243 transitions. [2020-07-10 15:03:58,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:58,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:58,445 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:58,445 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:58,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-07-10 15:03:58,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 186 transitions. [2020-07-10 15:03:58,451 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 186 transitions. Word has length 18 [2020-07-10 15:03:58,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:58,451 INFO L479 AbstractCegarLoop]: Abstraction has 120 states and 186 transitions. [2020-07-10 15:03:58,451 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:58,451 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 186 transitions. [2020-07-10 15:03:58,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-10 15:03:58,452 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:58,452 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-10 15:03:58,452 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-10 15:03:58,453 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:58,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:58,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1574170488, now seen corresponding path program 1 times [2020-07-10 15:03:58,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:58,454 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130384531] [2020-07-10 15:03:58,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:58,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:58,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:58,481 INFO L280 TraceCheckUtils]: 0: Hoare triple {2578#true} assume true; {2578#true} is VALID [2020-07-10 15:03:58,482 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2578#true} {2578#true} #129#return; {2578#true} is VALID [2020-07-10 15:03:58,482 INFO L263 TraceCheckUtils]: 0: Hoare triple {2578#true} call ULTIMATE.init(); {2578#true} is VALID [2020-07-10 15:03:58,482 INFO L280 TraceCheckUtils]: 1: Hoare triple {2578#true} assume true; {2578#true} is VALID [2020-07-10 15:03:58,483 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2578#true} {2578#true} #129#return; {2578#true} is VALID [2020-07-10 15:03:58,483 INFO L263 TraceCheckUtils]: 3: Hoare triple {2578#true} call #t~ret7 := main(); {2578#true} is VALID [2020-07-10 15:03:58,483 INFO L280 TraceCheckUtils]: 4: Hoare triple {2578#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;havoc ~cond~0; {2578#true} is VALID [2020-07-10 15:03:58,483 INFO L280 TraceCheckUtils]: 5: Hoare triple {2578#true} assume !false;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~cond~0 := #t~nondet6;havoc #t~nondet6; {2578#true} is VALID [2020-07-10 15:03:58,484 INFO L280 TraceCheckUtils]: 6: Hoare triple {2578#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {2578#true} is VALID [2020-07-10 15:03:58,484 INFO L280 TraceCheckUtils]: 7: Hoare triple {2578#true} assume !(0 != ~p1~0); {2578#true} is VALID [2020-07-10 15:03:58,484 INFO L280 TraceCheckUtils]: 8: Hoare triple {2578#true} assume !(0 != ~p2~0); {2578#true} is VALID [2020-07-10 15:03:58,485 INFO L280 TraceCheckUtils]: 9: Hoare triple {2578#true} assume !(0 != ~p3~0); {2582#(= 0 main_~p3~0)} is VALID [2020-07-10 15:03:58,486 INFO L280 TraceCheckUtils]: 10: Hoare triple {2582#(= 0 main_~p3~0)} assume 0 != ~p4~0;~lk4~0 := 1; {2582#(= 0 main_~p3~0)} is VALID [2020-07-10 15:03:58,486 INFO L280 TraceCheckUtils]: 11: Hoare triple {2582#(= 0 main_~p3~0)} assume 0 != ~p5~0;~lk5~0 := 1; {2582#(= 0 main_~p3~0)} is VALID [2020-07-10 15:03:58,487 INFO L280 TraceCheckUtils]: 12: Hoare triple {2582#(= 0 main_~p3~0)} assume 0 != ~p6~0;~lk6~0 := 1; {2582#(= 0 main_~p3~0)} is VALID [2020-07-10 15:03:58,487 INFO L280 TraceCheckUtils]: 13: Hoare triple {2582#(= 0 main_~p3~0)} assume !(0 != ~p1~0); {2582#(= 0 main_~p3~0)} is VALID [2020-07-10 15:03:58,488 INFO L280 TraceCheckUtils]: 14: Hoare triple {2582#(= 0 main_~p3~0)} assume !(0 != ~p2~0); {2582#(= 0 main_~p3~0)} is VALID [2020-07-10 15:03:58,488 INFO L280 TraceCheckUtils]: 15: Hoare triple {2582#(= 0 main_~p3~0)} assume 0 != ~p3~0; {2579#false} is VALID [2020-07-10 15:03:58,489 INFO L280 TraceCheckUtils]: 16: Hoare triple {2579#false} assume 1 != ~lk3~0; {2579#false} is VALID [2020-07-10 15:03:58,489 INFO L280 TraceCheckUtils]: 17: Hoare triple {2579#false} assume !false; {2579#false} is VALID [2020-07-10 15:03:58,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:58,490 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130384531] [2020-07-10 15:03:58,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:58,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:58,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476154003] [2020-07-10 15:03:58,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-10 15:03:58,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:58,491 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:58,509 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-10 15:03:58,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:58,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:58,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:58,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:58,511 INFO L87 Difference]: Start difference. First operand 120 states and 186 transitions. Second operand 3 states. [2020-07-10 15:03:58,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:58,625 INFO L93 Difference]: Finished difference Result 272 states and 424 transitions. [2020-07-10 15:03:58,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:58,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-10 15:03:58,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:58,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:58,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2020-07-10 15:03:58,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:58,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2020-07-10 15:03:58,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 113 transitions. [2020-07-10 15:03:58,736 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:58,747 INFO L225 Difference]: With dead ends: 272 [2020-07-10 15:03:58,747 INFO L226 Difference]: Without dead ends: 162 [2020-07-10 15:03:58,748 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:58,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-07-10 15:03:58,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2020-07-10 15:03:58,796 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:58,796 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand 160 states. [2020-07-10 15:03:58,796 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand 160 states. [2020-07-10 15:03:58,797 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 160 states. [2020-07-10 15:03:58,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:58,804 INFO L93 Difference]: Finished difference Result 162 states and 243 transitions. [2020-07-10 15:03:58,805 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 243 transitions. [2020-07-10 15:03:58,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:58,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:58,805 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 162 states. [2020-07-10 15:03:58,805 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 162 states. [2020-07-10 15:03:58,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:58,811 INFO L93 Difference]: Finished difference Result 162 states and 243 transitions. [2020-07-10 15:03:58,812 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 243 transitions. [2020-07-10 15:03:58,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:58,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:58,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:58,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:58,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2020-07-10 15:03:58,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 242 transitions. [2020-07-10 15:03:58,818 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 242 transitions. Word has length 18 [2020-07-10 15:03:58,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:58,818 INFO L479 AbstractCegarLoop]: Abstraction has 160 states and 242 transitions. [2020-07-10 15:03:58,818 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:58,819 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 242 transitions. [2020-07-10 15:03:58,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-10 15:03:58,819 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:58,819 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-10 15:03:58,820 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-10 15:03:58,820 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:58,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:58,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1947887240, now seen corresponding path program 1 times [2020-07-10 15:03:58,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:58,821 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791161151] [2020-07-10 15:03:58,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:58,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:58,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:58,847 INFO L280 TraceCheckUtils]: 0: Hoare triple {3375#true} assume true; {3375#true} is VALID [2020-07-10 15:03:58,847 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3375#true} {3375#true} #129#return; {3375#true} is VALID [2020-07-10 15:03:58,848 INFO L263 TraceCheckUtils]: 0: Hoare triple {3375#true} call ULTIMATE.init(); {3375#true} is VALID [2020-07-10 15:03:58,848 INFO L280 TraceCheckUtils]: 1: Hoare triple {3375#true} assume true; {3375#true} is VALID [2020-07-10 15:03:58,848 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3375#true} {3375#true} #129#return; {3375#true} is VALID [2020-07-10 15:03:58,848 INFO L263 TraceCheckUtils]: 3: Hoare triple {3375#true} call #t~ret7 := main(); {3375#true} is VALID [2020-07-10 15:03:58,849 INFO L280 TraceCheckUtils]: 4: Hoare triple {3375#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;havoc ~cond~0; {3375#true} is VALID [2020-07-10 15:03:58,849 INFO L280 TraceCheckUtils]: 5: Hoare triple {3375#true} assume !false;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~cond~0 := #t~nondet6;havoc #t~nondet6; {3375#true} is VALID [2020-07-10 15:03:58,849 INFO L280 TraceCheckUtils]: 6: Hoare triple {3375#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {3375#true} is VALID [2020-07-10 15:03:58,849 INFO L280 TraceCheckUtils]: 7: Hoare triple {3375#true} assume !(0 != ~p1~0); {3375#true} is VALID [2020-07-10 15:03:58,849 INFO L280 TraceCheckUtils]: 8: Hoare triple {3375#true} assume !(0 != ~p2~0); {3375#true} is VALID [2020-07-10 15:03:58,850 INFO L280 TraceCheckUtils]: 9: Hoare triple {3375#true} assume 0 != ~p3~0;~lk3~0 := 1; {3379#(not (= 0 main_~p3~0))} is VALID [2020-07-10 15:03:58,851 INFO L280 TraceCheckUtils]: 10: Hoare triple {3379#(not (= 0 main_~p3~0))} assume 0 != ~p4~0;~lk4~0 := 1; {3379#(not (= 0 main_~p3~0))} is VALID [2020-07-10 15:03:58,851 INFO L280 TraceCheckUtils]: 11: Hoare triple {3379#(not (= 0 main_~p3~0))} assume 0 != ~p5~0;~lk5~0 := 1; {3379#(not (= 0 main_~p3~0))} is VALID [2020-07-10 15:03:58,852 INFO L280 TraceCheckUtils]: 12: Hoare triple {3379#(not (= 0 main_~p3~0))} assume 0 != ~p6~0;~lk6~0 := 1; {3379#(not (= 0 main_~p3~0))} is VALID [2020-07-10 15:03:58,852 INFO L280 TraceCheckUtils]: 13: Hoare triple {3379#(not (= 0 main_~p3~0))} assume !(0 != ~p1~0); {3379#(not (= 0 main_~p3~0))} is VALID [2020-07-10 15:03:58,853 INFO L280 TraceCheckUtils]: 14: Hoare triple {3379#(not (= 0 main_~p3~0))} assume !(0 != ~p2~0); {3379#(not (= 0 main_~p3~0))} is VALID [2020-07-10 15:03:58,854 INFO L280 TraceCheckUtils]: 15: Hoare triple {3379#(not (= 0 main_~p3~0))} assume !(0 != ~p3~0); {3376#false} is VALID [2020-07-10 15:03:58,854 INFO L280 TraceCheckUtils]: 16: Hoare triple {3376#false} assume 0 != ~p4~0; {3376#false} is VALID [2020-07-10 15:03:58,854 INFO L280 TraceCheckUtils]: 17: Hoare triple {3376#false} assume 1 != ~lk4~0; {3376#false} is VALID [2020-07-10 15:03:58,854 INFO L280 TraceCheckUtils]: 18: Hoare triple {3376#false} assume !false; {3376#false} is VALID [2020-07-10 15:03:58,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:58,855 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791161151] [2020-07-10 15:03:58,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:58,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:58,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999832506] [2020-07-10 15:03:58,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-10 15:03:58,856 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:58,857 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:58,874 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-10 15:03:58,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:58,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:58,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:58,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:58,875 INFO L87 Difference]: Start difference. First operand 160 states and 242 transitions. Second operand 3 states. [2020-07-10 15:03:58,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:58,983 INFO L93 Difference]: Finished difference Result 240 states and 360 transitions. [2020-07-10 15:03:58,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:58,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-10 15:03:58,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:58,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:58,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2020-07-10 15:03:58,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:58,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2020-07-10 15:03:58,989 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 108 transitions. [2020-07-10 15:03:59,092 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:59,096 INFO L225 Difference]: With dead ends: 240 [2020-07-10 15:03:59,097 INFO L226 Difference]: Without dead ends: 166 [2020-07-10 15:03:59,097 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:59,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2020-07-10 15:03:59,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2020-07-10 15:03:59,125 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:59,126 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand 164 states. [2020-07-10 15:03:59,126 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand 164 states. [2020-07-10 15:03:59,126 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 164 states. [2020-07-10 15:03:59,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:59,133 INFO L93 Difference]: Finished difference Result 166 states and 243 transitions. [2020-07-10 15:03:59,133 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 243 transitions. [2020-07-10 15:03:59,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:59,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:59,134 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand 166 states. [2020-07-10 15:03:59,134 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 166 states. [2020-07-10 15:03:59,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:59,141 INFO L93 Difference]: Finished difference Result 166 states and 243 transitions. [2020-07-10 15:03:59,141 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 243 transitions. [2020-07-10 15:03:59,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:59,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:59,142 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:59,142 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:59,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-07-10 15:03:59,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 242 transitions. [2020-07-10 15:03:59,146 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 242 transitions. Word has length 19 [2020-07-10 15:03:59,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:59,147 INFO L479 AbstractCegarLoop]: Abstraction has 164 states and 242 transitions. [2020-07-10 15:03:59,147 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:59,147 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 242 transitions. [2020-07-10 15:03:59,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-10 15:03:59,148 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:59,148 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:03:59,148 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-10 15:03:59,148 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:59,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:59,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1554860230, now seen corresponding path program 1 times [2020-07-10 15:03:59,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:59,149 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804114365] [2020-07-10 15:03:59,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:59,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:59,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:59,175 INFO L280 TraceCheckUtils]: 0: Hoare triple {4152#true} assume true; {4152#true} is VALID [2020-07-10 15:03:59,176 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {4152#true} {4152#true} #129#return; {4152#true} is VALID [2020-07-10 15:03:59,176 INFO L263 TraceCheckUtils]: 0: Hoare triple {4152#true} call ULTIMATE.init(); {4152#true} is VALID [2020-07-10 15:03:59,176 INFO L280 TraceCheckUtils]: 1: Hoare triple {4152#true} assume true; {4152#true} is VALID [2020-07-10 15:03:59,177 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4152#true} {4152#true} #129#return; {4152#true} is VALID [2020-07-10 15:03:59,177 INFO L263 TraceCheckUtils]: 3: Hoare triple {4152#true} call #t~ret7 := main(); {4152#true} is VALID [2020-07-10 15:03:59,177 INFO L280 TraceCheckUtils]: 4: Hoare triple {4152#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;havoc ~cond~0; {4152#true} is VALID [2020-07-10 15:03:59,177 INFO L280 TraceCheckUtils]: 5: Hoare triple {4152#true} assume !false;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~cond~0 := #t~nondet6;havoc #t~nondet6; {4152#true} is VALID [2020-07-10 15:03:59,178 INFO L280 TraceCheckUtils]: 6: Hoare triple {4152#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {4152#true} is VALID [2020-07-10 15:03:59,178 INFO L280 TraceCheckUtils]: 7: Hoare triple {4152#true} assume !(0 != ~p1~0); {4152#true} is VALID [2020-07-10 15:03:59,178 INFO L280 TraceCheckUtils]: 8: Hoare triple {4152#true} assume !(0 != ~p2~0); {4152#true} is VALID [2020-07-10 15:03:59,178 INFO L280 TraceCheckUtils]: 9: Hoare triple {4152#true} assume !(0 != ~p3~0); {4152#true} is VALID [2020-07-10 15:03:59,179 INFO L280 TraceCheckUtils]: 10: Hoare triple {4152#true} assume 0 != ~p4~0;~lk4~0 := 1; {4156#(= 1 main_~lk4~0)} is VALID [2020-07-10 15:03:59,180 INFO L280 TraceCheckUtils]: 11: Hoare triple {4156#(= 1 main_~lk4~0)} assume 0 != ~p5~0;~lk5~0 := 1; {4156#(= 1 main_~lk4~0)} is VALID [2020-07-10 15:03:59,180 INFO L280 TraceCheckUtils]: 12: Hoare triple {4156#(= 1 main_~lk4~0)} assume 0 != ~p6~0;~lk6~0 := 1; {4156#(= 1 main_~lk4~0)} is VALID [2020-07-10 15:03:59,181 INFO L280 TraceCheckUtils]: 13: Hoare triple {4156#(= 1 main_~lk4~0)} assume !(0 != ~p1~0); {4156#(= 1 main_~lk4~0)} is VALID [2020-07-10 15:03:59,181 INFO L280 TraceCheckUtils]: 14: Hoare triple {4156#(= 1 main_~lk4~0)} assume !(0 != ~p2~0); {4156#(= 1 main_~lk4~0)} is VALID [2020-07-10 15:03:59,182 INFO L280 TraceCheckUtils]: 15: Hoare triple {4156#(= 1 main_~lk4~0)} assume !(0 != ~p3~0); {4156#(= 1 main_~lk4~0)} is VALID [2020-07-10 15:03:59,183 INFO L280 TraceCheckUtils]: 16: Hoare triple {4156#(= 1 main_~lk4~0)} assume 0 != ~p4~0; {4156#(= 1 main_~lk4~0)} is VALID [2020-07-10 15:03:59,183 INFO L280 TraceCheckUtils]: 17: Hoare triple {4156#(= 1 main_~lk4~0)} assume 1 != ~lk4~0; {4153#false} is VALID [2020-07-10 15:03:59,183 INFO L280 TraceCheckUtils]: 18: Hoare triple {4153#false} assume !false; {4153#false} is VALID [2020-07-10 15:03:59,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:59,184 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804114365] [2020-07-10 15:03:59,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:59,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:59,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268113114] [2020-07-10 15:03:59,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-10 15:03:59,185 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:59,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:59,204 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-10 15:03:59,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:59,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:59,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:59,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:59,205 INFO L87 Difference]: Start difference. First operand 164 states and 242 transitions. Second operand 3 states. [2020-07-10 15:03:59,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:59,349 INFO L93 Difference]: Finished difference Result 284 states and 424 transitions. [2020-07-10 15:03:59,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:59,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-10 15:03:59,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:59,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:59,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2020-07-10 15:03:59,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:59,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2020-07-10 15:03:59,355 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2020-07-10 15:03:59,442 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:59,451 INFO L225 Difference]: With dead ends: 284 [2020-07-10 15:03:59,451 INFO L226 Difference]: Without dead ends: 282 [2020-07-10 15:03:59,452 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:59,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-07-10 15:03:59,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 232. [2020-07-10 15:03:59,483 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:59,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 282 states. Second operand 232 states. [2020-07-10 15:03:59,483 INFO L74 IsIncluded]: Start isIncluded. First operand 282 states. Second operand 232 states. [2020-07-10 15:03:59,483 INFO L87 Difference]: Start difference. First operand 282 states. Second operand 232 states. [2020-07-10 15:03:59,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:59,492 INFO L93 Difference]: Finished difference Result 282 states and 415 transitions. [2020-07-10 15:03:59,492 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 415 transitions. [2020-07-10 15:03:59,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:59,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:59,493 INFO L74 IsIncluded]: Start isIncluded. First operand 232 states. Second operand 282 states. [2020-07-10 15:03:59,493 INFO L87 Difference]: Start difference. First operand 232 states. Second operand 282 states. [2020-07-10 15:03:59,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:59,501 INFO L93 Difference]: Finished difference Result 282 states and 415 transitions. [2020-07-10 15:03:59,501 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 415 transitions. [2020-07-10 15:03:59,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:59,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:59,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:59,502 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:59,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2020-07-10 15:03:59,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 334 transitions. [2020-07-10 15:03:59,509 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 334 transitions. Word has length 19 [2020-07-10 15:03:59,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:59,510 INFO L479 AbstractCegarLoop]: Abstraction has 232 states and 334 transitions. [2020-07-10 15:03:59,510 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:59,510 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 334 transitions. [2020-07-10 15:03:59,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-10 15:03:59,511 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:59,511 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-10 15:03:59,511 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-10 15:03:59,511 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:59,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:59,512 INFO L82 PathProgramCache]: Analyzing trace with hash -2060048696, now seen corresponding path program 1 times [2020-07-10 15:03:59,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:59,512 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441713177] [2020-07-10 15:03:59,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:59,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:59,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:03:59,537 INFO L280 TraceCheckUtils]: 0: Hoare triple {5277#true} assume true; {5277#true} is VALID [2020-07-10 15:03:59,538 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {5277#true} {5277#true} #129#return; {5277#true} is VALID [2020-07-10 15:03:59,538 INFO L263 TraceCheckUtils]: 0: Hoare triple {5277#true} call ULTIMATE.init(); {5277#true} is VALID [2020-07-10 15:03:59,538 INFO L280 TraceCheckUtils]: 1: Hoare triple {5277#true} assume true; {5277#true} is VALID [2020-07-10 15:03:59,538 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5277#true} {5277#true} #129#return; {5277#true} is VALID [2020-07-10 15:03:59,539 INFO L263 TraceCheckUtils]: 3: Hoare triple {5277#true} call #t~ret7 := main(); {5277#true} is VALID [2020-07-10 15:03:59,539 INFO L280 TraceCheckUtils]: 4: Hoare triple {5277#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;havoc ~cond~0; {5277#true} is VALID [2020-07-10 15:03:59,539 INFO L280 TraceCheckUtils]: 5: Hoare triple {5277#true} assume !false;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~cond~0 := #t~nondet6;havoc #t~nondet6; {5277#true} is VALID [2020-07-10 15:03:59,539 INFO L280 TraceCheckUtils]: 6: Hoare triple {5277#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {5277#true} is VALID [2020-07-10 15:03:59,539 INFO L280 TraceCheckUtils]: 7: Hoare triple {5277#true} assume !(0 != ~p1~0); {5277#true} is VALID [2020-07-10 15:03:59,540 INFO L280 TraceCheckUtils]: 8: Hoare triple {5277#true} assume !(0 != ~p2~0); {5277#true} is VALID [2020-07-10 15:03:59,540 INFO L280 TraceCheckUtils]: 9: Hoare triple {5277#true} assume !(0 != ~p3~0); {5277#true} is VALID [2020-07-10 15:03:59,541 INFO L280 TraceCheckUtils]: 10: Hoare triple {5277#true} assume !(0 != ~p4~0); {5281#(= 0 main_~p4~0)} is VALID [2020-07-10 15:03:59,541 INFO L280 TraceCheckUtils]: 11: Hoare triple {5281#(= 0 main_~p4~0)} assume 0 != ~p5~0;~lk5~0 := 1; {5281#(= 0 main_~p4~0)} is VALID [2020-07-10 15:03:59,542 INFO L280 TraceCheckUtils]: 12: Hoare triple {5281#(= 0 main_~p4~0)} assume 0 != ~p6~0;~lk6~0 := 1; {5281#(= 0 main_~p4~0)} is VALID [2020-07-10 15:03:59,542 INFO L280 TraceCheckUtils]: 13: Hoare triple {5281#(= 0 main_~p4~0)} assume !(0 != ~p1~0); {5281#(= 0 main_~p4~0)} is VALID [2020-07-10 15:03:59,543 INFO L280 TraceCheckUtils]: 14: Hoare triple {5281#(= 0 main_~p4~0)} assume !(0 != ~p2~0); {5281#(= 0 main_~p4~0)} is VALID [2020-07-10 15:03:59,543 INFO L280 TraceCheckUtils]: 15: Hoare triple {5281#(= 0 main_~p4~0)} assume !(0 != ~p3~0); {5281#(= 0 main_~p4~0)} is VALID [2020-07-10 15:03:59,544 INFO L280 TraceCheckUtils]: 16: Hoare triple {5281#(= 0 main_~p4~0)} assume 0 != ~p4~0; {5278#false} is VALID [2020-07-10 15:03:59,544 INFO L280 TraceCheckUtils]: 17: Hoare triple {5278#false} assume 1 != ~lk4~0; {5278#false} is VALID [2020-07-10 15:03:59,545 INFO L280 TraceCheckUtils]: 18: Hoare triple {5278#false} assume !false; {5278#false} is VALID [2020-07-10 15:03:59,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:03:59,546 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441713177] [2020-07-10 15:03:59,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:03:59,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:03:59,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389350765] [2020-07-10 15:03:59,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-10 15:03:59,547 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:03:59,547 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:03:59,569 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-10 15:03:59,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:03:59,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:03:59,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:03:59,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:59,571 INFO L87 Difference]: Start difference. First operand 232 states and 334 transitions. Second operand 3 states. [2020-07-10 15:03:59,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:59,749 INFO L93 Difference]: Finished difference Result 524 states and 752 transitions. [2020-07-10 15:03:59,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:03:59,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-10 15:03:59,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:03:59,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:59,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2020-07-10 15:03:59,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:03:59,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2020-07-10 15:03:59,757 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 110 transitions. [2020-07-10 15:03:59,864 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:03:59,873 INFO L225 Difference]: With dead ends: 524 [2020-07-10 15:03:59,874 INFO L226 Difference]: Without dead ends: 306 [2020-07-10 15:03:59,875 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:03:59,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2020-07-10 15:03:59,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2020-07-10 15:03:59,938 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:03:59,939 INFO L82 GeneralOperation]: Start isEquivalent. First operand 306 states. Second operand 304 states. [2020-07-10 15:03:59,939 INFO L74 IsIncluded]: Start isIncluded. First operand 306 states. Second operand 304 states. [2020-07-10 15:03:59,939 INFO L87 Difference]: Start difference. First operand 306 states. Second operand 304 states. [2020-07-10 15:03:59,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:59,951 INFO L93 Difference]: Finished difference Result 306 states and 423 transitions. [2020-07-10 15:03:59,951 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 423 transitions. [2020-07-10 15:03:59,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:59,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:59,952 INFO L74 IsIncluded]: Start isIncluded. First operand 304 states. Second operand 306 states. [2020-07-10 15:03:59,952 INFO L87 Difference]: Start difference. First operand 304 states. Second operand 306 states. [2020-07-10 15:03:59,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:03:59,961 INFO L93 Difference]: Finished difference Result 306 states and 423 transitions. [2020-07-10 15:03:59,961 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 423 transitions. [2020-07-10 15:03:59,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:03:59,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:03:59,962 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:03:59,962 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:03:59,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2020-07-10 15:03:59,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 422 transitions. [2020-07-10 15:03:59,971 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 422 transitions. Word has length 19 [2020-07-10 15:03:59,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:03:59,971 INFO L479 AbstractCegarLoop]: Abstraction has 304 states and 422 transitions. [2020-07-10 15:03:59,971 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:03:59,971 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 422 transitions. [2020-07-10 15:03:59,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-10 15:03:59,972 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:03:59,972 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:03:59,973 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-10 15:03:59,973 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:03:59,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:03:59,973 INFO L82 PathProgramCache]: Analyzing trace with hash 956242573, now seen corresponding path program 1 times [2020-07-10 15:03:59,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:03:59,974 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222796795] [2020-07-10 15:03:59,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:03:59,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:00,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:00,025 INFO L280 TraceCheckUtils]: 0: Hoare triple {6778#true} assume true; {6778#true} is VALID [2020-07-10 15:04:00,025 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {6778#true} {6778#true} #129#return; {6778#true} is VALID [2020-07-10 15:04:00,026 INFO L263 TraceCheckUtils]: 0: Hoare triple {6778#true} call ULTIMATE.init(); {6778#true} is VALID [2020-07-10 15:04:00,026 INFO L280 TraceCheckUtils]: 1: Hoare triple {6778#true} assume true; {6778#true} is VALID [2020-07-10 15:04:00,026 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {6778#true} {6778#true} #129#return; {6778#true} is VALID [2020-07-10 15:04:00,026 INFO L263 TraceCheckUtils]: 3: Hoare triple {6778#true} call #t~ret7 := main(); {6778#true} is VALID [2020-07-10 15:04:00,027 INFO L280 TraceCheckUtils]: 4: Hoare triple {6778#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;havoc ~cond~0; {6778#true} is VALID [2020-07-10 15:04:00,027 INFO L280 TraceCheckUtils]: 5: Hoare triple {6778#true} assume !false;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~cond~0 := #t~nondet6;havoc #t~nondet6; {6778#true} is VALID [2020-07-10 15:04:00,027 INFO L280 TraceCheckUtils]: 6: Hoare triple {6778#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {6778#true} is VALID [2020-07-10 15:04:00,027 INFO L280 TraceCheckUtils]: 7: Hoare triple {6778#true} assume !(0 != ~p1~0); {6778#true} is VALID [2020-07-10 15:04:00,027 INFO L280 TraceCheckUtils]: 8: Hoare triple {6778#true} assume !(0 != ~p2~0); {6778#true} is VALID [2020-07-10 15:04:00,028 INFO L280 TraceCheckUtils]: 9: Hoare triple {6778#true} assume !(0 != ~p3~0); {6778#true} is VALID [2020-07-10 15:04:00,029 INFO L280 TraceCheckUtils]: 10: Hoare triple {6778#true} assume 0 != ~p4~0;~lk4~0 := 1; {6782#(not (= 0 main_~p4~0))} is VALID [2020-07-10 15:04:00,030 INFO L280 TraceCheckUtils]: 11: Hoare triple {6782#(not (= 0 main_~p4~0))} assume 0 != ~p5~0;~lk5~0 := 1; {6782#(not (= 0 main_~p4~0))} is VALID [2020-07-10 15:04:00,030 INFO L280 TraceCheckUtils]: 12: Hoare triple {6782#(not (= 0 main_~p4~0))} assume 0 != ~p6~0;~lk6~0 := 1; {6782#(not (= 0 main_~p4~0))} is VALID [2020-07-10 15:04:00,032 INFO L280 TraceCheckUtils]: 13: Hoare triple {6782#(not (= 0 main_~p4~0))} assume !(0 != ~p1~0); {6782#(not (= 0 main_~p4~0))} is VALID [2020-07-10 15:04:00,032 INFO L280 TraceCheckUtils]: 14: Hoare triple {6782#(not (= 0 main_~p4~0))} assume !(0 != ~p2~0); {6782#(not (= 0 main_~p4~0))} is VALID [2020-07-10 15:04:00,033 INFO L280 TraceCheckUtils]: 15: Hoare triple {6782#(not (= 0 main_~p4~0))} assume !(0 != ~p3~0); {6782#(not (= 0 main_~p4~0))} is VALID [2020-07-10 15:04:00,033 INFO L280 TraceCheckUtils]: 16: Hoare triple {6782#(not (= 0 main_~p4~0))} assume !(0 != ~p4~0); {6779#false} is VALID [2020-07-10 15:04:00,033 INFO L280 TraceCheckUtils]: 17: Hoare triple {6779#false} assume 0 != ~p5~0; {6779#false} is VALID [2020-07-10 15:04:00,034 INFO L280 TraceCheckUtils]: 18: Hoare triple {6779#false} assume 1 != ~lk5~0; {6779#false} is VALID [2020-07-10 15:04:00,034 INFO L280 TraceCheckUtils]: 19: Hoare triple {6779#false} assume !false; {6779#false} is VALID [2020-07-10 15:04:00,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:04:00,035 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222796795] [2020-07-10 15:04:00,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:00,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:00,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143706078] [2020-07-10 15:04:00,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-10 15:04:00,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:00,038 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:00,056 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:00,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:00,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:00,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:00,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:00,057 INFO L87 Difference]: Start difference. First operand 304 states and 422 transitions. Second operand 3 states. [2020-07-10 15:04:00,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:00,194 INFO L93 Difference]: Finished difference Result 456 states and 628 transitions. [2020-07-10 15:04:00,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:00,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-10 15:04:00,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:00,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:00,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2020-07-10 15:04:00,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:00,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2020-07-10 15:04:00,200 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 105 transitions. [2020-07-10 15:04:00,297 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:00,308 INFO L225 Difference]: With dead ends: 456 [2020-07-10 15:04:00,308 INFO L226 Difference]: Without dead ends: 314 [2020-07-10 15:04:00,311 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:00,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2020-07-10 15:04:00,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 312. [2020-07-10 15:04:00,373 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:00,373 INFO L82 GeneralOperation]: Start isEquivalent. First operand 314 states. Second operand 312 states. [2020-07-10 15:04:00,373 INFO L74 IsIncluded]: Start isIncluded. First operand 314 states. Second operand 312 states. [2020-07-10 15:04:00,373 INFO L87 Difference]: Start difference. First operand 314 states. Second operand 312 states. [2020-07-10 15:04:00,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:00,383 INFO L93 Difference]: Finished difference Result 314 states and 423 transitions. [2020-07-10 15:04:00,383 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 423 transitions. [2020-07-10 15:04:00,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:00,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:00,384 INFO L74 IsIncluded]: Start isIncluded. First operand 312 states. Second operand 314 states. [2020-07-10 15:04:00,384 INFO L87 Difference]: Start difference. First operand 312 states. Second operand 314 states. [2020-07-10 15:04:00,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:00,394 INFO L93 Difference]: Finished difference Result 314 states and 423 transitions. [2020-07-10 15:04:00,394 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 423 transitions. [2020-07-10 15:04:00,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:00,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:00,395 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:00,396 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:00,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2020-07-10 15:04:00,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 422 transitions. [2020-07-10 15:04:00,406 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 422 transitions. Word has length 20 [2020-07-10 15:04:00,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:00,406 INFO L479 AbstractCegarLoop]: Abstraction has 312 states and 422 transitions. [2020-07-10 15:04:00,407 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:00,407 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 422 transitions. [2020-07-10 15:04:00,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-10 15:04:00,408 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:00,408 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:04:00,408 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-10 15:04:00,408 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:00,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:00,409 INFO L82 PathProgramCache]: Analyzing trace with hash 563215563, now seen corresponding path program 1 times [2020-07-10 15:04:00,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:00,410 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225065218] [2020-07-10 15:04:00,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:00,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:00,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:00,457 INFO L280 TraceCheckUtils]: 0: Hoare triple {8235#true} assume true; {8235#true} is VALID [2020-07-10 15:04:00,460 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {8235#true} {8235#true} #129#return; {8235#true} is VALID [2020-07-10 15:04:00,460 INFO L263 TraceCheckUtils]: 0: Hoare triple {8235#true} call ULTIMATE.init(); {8235#true} is VALID [2020-07-10 15:04:00,461 INFO L280 TraceCheckUtils]: 1: Hoare triple {8235#true} assume true; {8235#true} is VALID [2020-07-10 15:04:00,461 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {8235#true} {8235#true} #129#return; {8235#true} is VALID [2020-07-10 15:04:00,461 INFO L263 TraceCheckUtils]: 3: Hoare triple {8235#true} call #t~ret7 := main(); {8235#true} is VALID [2020-07-10 15:04:00,462 INFO L280 TraceCheckUtils]: 4: Hoare triple {8235#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;havoc ~cond~0; {8235#true} is VALID [2020-07-10 15:04:00,462 INFO L280 TraceCheckUtils]: 5: Hoare triple {8235#true} assume !false;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~cond~0 := #t~nondet6;havoc #t~nondet6; {8235#true} is VALID [2020-07-10 15:04:00,462 INFO L280 TraceCheckUtils]: 6: Hoare triple {8235#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {8235#true} is VALID [2020-07-10 15:04:00,462 INFO L280 TraceCheckUtils]: 7: Hoare triple {8235#true} assume !(0 != ~p1~0); {8235#true} is VALID [2020-07-10 15:04:00,463 INFO L280 TraceCheckUtils]: 8: Hoare triple {8235#true} assume !(0 != ~p2~0); {8235#true} is VALID [2020-07-10 15:04:00,463 INFO L280 TraceCheckUtils]: 9: Hoare triple {8235#true} assume !(0 != ~p3~0); {8235#true} is VALID [2020-07-10 15:04:00,463 INFO L280 TraceCheckUtils]: 10: Hoare triple {8235#true} assume !(0 != ~p4~0); {8235#true} is VALID [2020-07-10 15:04:00,471 INFO L280 TraceCheckUtils]: 11: Hoare triple {8235#true} assume 0 != ~p5~0;~lk5~0 := 1; {8239#(= 1 main_~lk5~0)} is VALID [2020-07-10 15:04:00,472 INFO L280 TraceCheckUtils]: 12: Hoare triple {8239#(= 1 main_~lk5~0)} assume 0 != ~p6~0;~lk6~0 := 1; {8239#(= 1 main_~lk5~0)} is VALID [2020-07-10 15:04:00,475 INFO L280 TraceCheckUtils]: 13: Hoare triple {8239#(= 1 main_~lk5~0)} assume !(0 != ~p1~0); {8239#(= 1 main_~lk5~0)} is VALID [2020-07-10 15:04:00,477 INFO L280 TraceCheckUtils]: 14: Hoare triple {8239#(= 1 main_~lk5~0)} assume !(0 != ~p2~0); {8239#(= 1 main_~lk5~0)} is VALID [2020-07-10 15:04:00,480 INFO L280 TraceCheckUtils]: 15: Hoare triple {8239#(= 1 main_~lk5~0)} assume !(0 != ~p3~0); {8239#(= 1 main_~lk5~0)} is VALID [2020-07-10 15:04:00,482 INFO L280 TraceCheckUtils]: 16: Hoare triple {8239#(= 1 main_~lk5~0)} assume !(0 != ~p4~0); {8239#(= 1 main_~lk5~0)} is VALID [2020-07-10 15:04:00,482 INFO L280 TraceCheckUtils]: 17: Hoare triple {8239#(= 1 main_~lk5~0)} assume 0 != ~p5~0; {8239#(= 1 main_~lk5~0)} is VALID [2020-07-10 15:04:00,483 INFO L280 TraceCheckUtils]: 18: Hoare triple {8239#(= 1 main_~lk5~0)} assume 1 != ~lk5~0; {8236#false} is VALID [2020-07-10 15:04:00,483 INFO L280 TraceCheckUtils]: 19: Hoare triple {8236#false} assume !false; {8236#false} is VALID [2020-07-10 15:04:00,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:04:00,484 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225065218] [2020-07-10 15:04:00,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:00,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:00,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024704733] [2020-07-10 15:04:00,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-10 15:04:00,485 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:00,485 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:00,519 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:00,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:00,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:00,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:00,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:00,520 INFO L87 Difference]: Start difference. First operand 312 states and 422 transitions. Second operand 3 states. [2020-07-10 15:04:00,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:00,752 INFO L93 Difference]: Finished difference Result 524 states and 712 transitions. [2020-07-10 15:04:00,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:00,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-10 15:04:00,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:00,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:00,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2020-07-10 15:04:00,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:00,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2020-07-10 15:04:00,755 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 66 transitions. [2020-07-10 15:04:00,818 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-10 15:04:00,838 INFO L225 Difference]: With dead ends: 524 [2020-07-10 15:04:00,838 INFO L226 Difference]: Without dead ends: 522 [2020-07-10 15:04:00,839 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:00,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2020-07-10 15:04:00,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 456. [2020-07-10 15:04:00,915 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:00,915 INFO L82 GeneralOperation]: Start isEquivalent. First operand 522 states. Second operand 456 states. [2020-07-10 15:04:00,915 INFO L74 IsIncluded]: Start isIncluded. First operand 522 states. Second operand 456 states. [2020-07-10 15:04:00,915 INFO L87 Difference]: Start difference. First operand 522 states. Second operand 456 states. [2020-07-10 15:04:00,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:00,938 INFO L93 Difference]: Finished difference Result 522 states and 695 transitions. [2020-07-10 15:04:00,938 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 695 transitions. [2020-07-10 15:04:00,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:00,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:00,940 INFO L74 IsIncluded]: Start isIncluded. First operand 456 states. Second operand 522 states. [2020-07-10 15:04:00,940 INFO L87 Difference]: Start difference. First operand 456 states. Second operand 522 states. [2020-07-10 15:04:00,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:00,966 INFO L93 Difference]: Finished difference Result 522 states and 695 transitions. [2020-07-10 15:04:00,966 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 695 transitions. [2020-07-10 15:04:00,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:00,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:00,967 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:00,968 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:00,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2020-07-10 15:04:00,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 598 transitions. [2020-07-10 15:04:00,984 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 598 transitions. Word has length 20 [2020-07-10 15:04:00,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:00,984 INFO L479 AbstractCegarLoop]: Abstraction has 456 states and 598 transitions. [2020-07-10 15:04:00,984 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:00,985 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 598 transitions. [2020-07-10 15:04:00,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-10 15:04:00,986 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:00,986 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:04:00,986 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-10 15:04:00,986 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:00,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:00,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1243273933, now seen corresponding path program 1 times [2020-07-10 15:04:00,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:00,987 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280698525] [2020-07-10 15:04:00,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:00,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:01,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:01,007 INFO L280 TraceCheckUtils]: 0: Hoare triple {10328#true} assume true; {10328#true} is VALID [2020-07-10 15:04:01,008 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {10328#true} {10328#true} #129#return; {10328#true} is VALID [2020-07-10 15:04:01,008 INFO L263 TraceCheckUtils]: 0: Hoare triple {10328#true} call ULTIMATE.init(); {10328#true} is VALID [2020-07-10 15:04:01,008 INFO L280 TraceCheckUtils]: 1: Hoare triple {10328#true} assume true; {10328#true} is VALID [2020-07-10 15:04:01,008 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {10328#true} {10328#true} #129#return; {10328#true} is VALID [2020-07-10 15:04:01,008 INFO L263 TraceCheckUtils]: 3: Hoare triple {10328#true} call #t~ret7 := main(); {10328#true} is VALID [2020-07-10 15:04:01,009 INFO L280 TraceCheckUtils]: 4: Hoare triple {10328#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;havoc ~cond~0; {10328#true} is VALID [2020-07-10 15:04:01,009 INFO L280 TraceCheckUtils]: 5: Hoare triple {10328#true} assume !false;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~cond~0 := #t~nondet6;havoc #t~nondet6; {10328#true} is VALID [2020-07-10 15:04:01,009 INFO L280 TraceCheckUtils]: 6: Hoare triple {10328#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {10328#true} is VALID [2020-07-10 15:04:01,009 INFO L280 TraceCheckUtils]: 7: Hoare triple {10328#true} assume !(0 != ~p1~0); {10328#true} is VALID [2020-07-10 15:04:01,009 INFO L280 TraceCheckUtils]: 8: Hoare triple {10328#true} assume !(0 != ~p2~0); {10328#true} is VALID [2020-07-10 15:04:01,010 INFO L280 TraceCheckUtils]: 9: Hoare triple {10328#true} assume !(0 != ~p3~0); {10328#true} is VALID [2020-07-10 15:04:01,010 INFO L280 TraceCheckUtils]: 10: Hoare triple {10328#true} assume !(0 != ~p4~0); {10328#true} is VALID [2020-07-10 15:04:01,010 INFO L280 TraceCheckUtils]: 11: Hoare triple {10328#true} assume !(0 != ~p5~0); {10332#(= 0 main_~p5~0)} is VALID [2020-07-10 15:04:01,011 INFO L280 TraceCheckUtils]: 12: Hoare triple {10332#(= 0 main_~p5~0)} assume 0 != ~p6~0;~lk6~0 := 1; {10332#(= 0 main_~p5~0)} is VALID [2020-07-10 15:04:01,012 INFO L280 TraceCheckUtils]: 13: Hoare triple {10332#(= 0 main_~p5~0)} assume !(0 != ~p1~0); {10332#(= 0 main_~p5~0)} is VALID [2020-07-10 15:04:01,012 INFO L280 TraceCheckUtils]: 14: Hoare triple {10332#(= 0 main_~p5~0)} assume !(0 != ~p2~0); {10332#(= 0 main_~p5~0)} is VALID [2020-07-10 15:04:01,013 INFO L280 TraceCheckUtils]: 15: Hoare triple {10332#(= 0 main_~p5~0)} assume !(0 != ~p3~0); {10332#(= 0 main_~p5~0)} is VALID [2020-07-10 15:04:01,013 INFO L280 TraceCheckUtils]: 16: Hoare triple {10332#(= 0 main_~p5~0)} assume !(0 != ~p4~0); {10332#(= 0 main_~p5~0)} is VALID [2020-07-10 15:04:01,014 INFO L280 TraceCheckUtils]: 17: Hoare triple {10332#(= 0 main_~p5~0)} assume 0 != ~p5~0; {10329#false} is VALID [2020-07-10 15:04:01,014 INFO L280 TraceCheckUtils]: 18: Hoare triple {10329#false} assume 1 != ~lk5~0; {10329#false} is VALID [2020-07-10 15:04:01,014 INFO L280 TraceCheckUtils]: 19: Hoare triple {10329#false} assume !false; {10329#false} is VALID [2020-07-10 15:04:01,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:04:01,015 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280698525] [2020-07-10 15:04:01,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:01,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:01,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608019773] [2020-07-10 15:04:01,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-10 15:04:01,016 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:01,016 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:01,036 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:01,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:01,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:01,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:01,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:01,037 INFO L87 Difference]: Start difference. First operand 456 states and 598 transitions. Second operand 3 states. [2020-07-10 15:04:01,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:01,316 INFO L93 Difference]: Finished difference Result 1020 states and 1320 transitions. [2020-07-10 15:04:01,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:01,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-10 15:04:01,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:01,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:01,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2020-07-10 15:04:01,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:01,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2020-07-10 15:04:01,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 107 transitions. [2020-07-10 15:04:01,421 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:01,447 INFO L225 Difference]: With dead ends: 1020 [2020-07-10 15:04:01,447 INFO L226 Difference]: Without dead ends: 586 [2020-07-10 15:04:01,449 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:01,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-07-10 15:04:01,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 584. [2020-07-10 15:04:01,615 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:01,615 INFO L82 GeneralOperation]: Start isEquivalent. First operand 586 states. Second operand 584 states. [2020-07-10 15:04:01,615 INFO L74 IsIncluded]: Start isIncluded. First operand 586 states. Second operand 584 states. [2020-07-10 15:04:01,615 INFO L87 Difference]: Start difference. First operand 586 states. Second operand 584 states. [2020-07-10 15:04:01,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:01,640 INFO L93 Difference]: Finished difference Result 586 states and 727 transitions. [2020-07-10 15:04:01,640 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 727 transitions. [2020-07-10 15:04:01,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:01,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:01,642 INFO L74 IsIncluded]: Start isIncluded. First operand 584 states. Second operand 586 states. [2020-07-10 15:04:01,642 INFO L87 Difference]: Start difference. First operand 584 states. Second operand 586 states. [2020-07-10 15:04:01,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:01,664 INFO L93 Difference]: Finished difference Result 586 states and 727 transitions. [2020-07-10 15:04:01,664 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 727 transitions. [2020-07-10 15:04:01,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:01,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:01,666 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:01,666 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:01,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2020-07-10 15:04:01,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 726 transitions. [2020-07-10 15:04:01,689 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 726 transitions. Word has length 20 [2020-07-10 15:04:01,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:01,690 INFO L479 AbstractCegarLoop]: Abstraction has 584 states and 726 transitions. [2020-07-10 15:04:01,690 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:01,690 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 726 transitions. [2020-07-10 15:04:01,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-10 15:04:01,691 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:01,691 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:04:01,691 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-10 15:04:01,692 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:01,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:01,692 INFO L82 PathProgramCache]: Analyzing trace with hash 280029309, now seen corresponding path program 1 times [2020-07-10 15:04:01,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:01,692 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768021066] [2020-07-10 15:04:01,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:01,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:01,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:01,714 INFO L280 TraceCheckUtils]: 0: Hoare triple {13205#true} assume true; {13205#true} is VALID [2020-07-10 15:04:01,714 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {13205#true} {13205#true} #129#return; {13205#true} is VALID [2020-07-10 15:04:01,714 INFO L263 TraceCheckUtils]: 0: Hoare triple {13205#true} call ULTIMATE.init(); {13205#true} is VALID [2020-07-10 15:04:01,714 INFO L280 TraceCheckUtils]: 1: Hoare triple {13205#true} assume true; {13205#true} is VALID [2020-07-10 15:04:01,715 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {13205#true} {13205#true} #129#return; {13205#true} is VALID [2020-07-10 15:04:01,715 INFO L263 TraceCheckUtils]: 3: Hoare triple {13205#true} call #t~ret7 := main(); {13205#true} is VALID [2020-07-10 15:04:01,715 INFO L280 TraceCheckUtils]: 4: Hoare triple {13205#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;havoc ~cond~0; {13205#true} is VALID [2020-07-10 15:04:01,715 INFO L280 TraceCheckUtils]: 5: Hoare triple {13205#true} assume !false;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~cond~0 := #t~nondet6;havoc #t~nondet6; {13205#true} is VALID [2020-07-10 15:04:01,715 INFO L280 TraceCheckUtils]: 6: Hoare triple {13205#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {13205#true} is VALID [2020-07-10 15:04:01,716 INFO L280 TraceCheckUtils]: 7: Hoare triple {13205#true} assume !(0 != ~p1~0); {13205#true} is VALID [2020-07-10 15:04:01,716 INFO L280 TraceCheckUtils]: 8: Hoare triple {13205#true} assume !(0 != ~p2~0); {13205#true} is VALID [2020-07-10 15:04:01,716 INFO L280 TraceCheckUtils]: 9: Hoare triple {13205#true} assume !(0 != ~p3~0); {13205#true} is VALID [2020-07-10 15:04:01,716 INFO L280 TraceCheckUtils]: 10: Hoare triple {13205#true} assume !(0 != ~p4~0); {13205#true} is VALID [2020-07-10 15:04:01,717 INFO L280 TraceCheckUtils]: 11: Hoare triple {13205#true} assume 0 != ~p5~0;~lk5~0 := 1; {13209#(not (= 0 main_~p5~0))} is VALID [2020-07-10 15:04:01,717 INFO L280 TraceCheckUtils]: 12: Hoare triple {13209#(not (= 0 main_~p5~0))} assume 0 != ~p6~0;~lk6~0 := 1; {13209#(not (= 0 main_~p5~0))} is VALID [2020-07-10 15:04:01,718 INFO L280 TraceCheckUtils]: 13: Hoare triple {13209#(not (= 0 main_~p5~0))} assume !(0 != ~p1~0); {13209#(not (= 0 main_~p5~0))} is VALID [2020-07-10 15:04:01,719 INFO L280 TraceCheckUtils]: 14: Hoare triple {13209#(not (= 0 main_~p5~0))} assume !(0 != ~p2~0); {13209#(not (= 0 main_~p5~0))} is VALID [2020-07-10 15:04:01,719 INFO L280 TraceCheckUtils]: 15: Hoare triple {13209#(not (= 0 main_~p5~0))} assume !(0 != ~p3~0); {13209#(not (= 0 main_~p5~0))} is VALID [2020-07-10 15:04:01,720 INFO L280 TraceCheckUtils]: 16: Hoare triple {13209#(not (= 0 main_~p5~0))} assume !(0 != ~p4~0); {13209#(not (= 0 main_~p5~0))} is VALID [2020-07-10 15:04:01,720 INFO L280 TraceCheckUtils]: 17: Hoare triple {13209#(not (= 0 main_~p5~0))} assume !(0 != ~p5~0); {13206#false} is VALID [2020-07-10 15:04:01,720 INFO L280 TraceCheckUtils]: 18: Hoare triple {13206#false} assume 0 != ~p6~0; {13206#false} is VALID [2020-07-10 15:04:01,721 INFO L280 TraceCheckUtils]: 19: Hoare triple {13206#false} assume 1 != ~lk6~0; {13206#false} is VALID [2020-07-10 15:04:01,721 INFO L280 TraceCheckUtils]: 20: Hoare triple {13206#false} assume !false; {13206#false} is VALID [2020-07-10 15:04:01,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:04:01,722 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768021066] [2020-07-10 15:04:01,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:01,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:01,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917236853] [2020-07-10 15:04:01,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-10 15:04:01,723 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:01,723 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:01,744 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:01,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:01,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:01,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:01,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:01,745 INFO L87 Difference]: Start difference. First operand 584 states and 726 transitions. Second operand 3 states. [2020-07-10 15:04:02,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:02,001 INFO L93 Difference]: Finished difference Result 876 states and 1080 transitions. [2020-07-10 15:04:02,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:02,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-10 15:04:02,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:02,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:02,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2020-07-10 15:04:02,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:02,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2020-07-10 15:04:02,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 102 transitions. [2020-07-10 15:04:02,102 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:02,127 INFO L225 Difference]: With dead ends: 876 [2020-07-10 15:04:02,128 INFO L226 Difference]: Without dead ends: 602 [2020-07-10 15:04:02,129 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:02,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-07-10 15:04:02,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600. [2020-07-10 15:04:02,290 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:02,290 INFO L82 GeneralOperation]: Start isEquivalent. First operand 602 states. Second operand 600 states. [2020-07-10 15:04:02,290 INFO L74 IsIncluded]: Start isIncluded. First operand 602 states. Second operand 600 states. [2020-07-10 15:04:02,291 INFO L87 Difference]: Start difference. First operand 602 states. Second operand 600 states. [2020-07-10 15:04:02,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:02,316 INFO L93 Difference]: Finished difference Result 602 states and 727 transitions. [2020-07-10 15:04:02,316 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 727 transitions. [2020-07-10 15:04:02,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:02,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:02,318 INFO L74 IsIncluded]: Start isIncluded. First operand 600 states. Second operand 602 states. [2020-07-10 15:04:02,318 INFO L87 Difference]: Start difference. First operand 600 states. Second operand 602 states. [2020-07-10 15:04:02,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:02,344 INFO L93 Difference]: Finished difference Result 602 states and 727 transitions. [2020-07-10 15:04:02,344 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 727 transitions. [2020-07-10 15:04:02,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:02,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:02,346 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:02,346 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:02,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2020-07-10 15:04:02,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 726 transitions. [2020-07-10 15:04:02,374 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 726 transitions. Word has length 21 [2020-07-10 15:04:02,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:02,374 INFO L479 AbstractCegarLoop]: Abstraction has 600 states and 726 transitions. [2020-07-10 15:04:02,374 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:02,374 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 726 transitions. [2020-07-10 15:04:02,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-10 15:04:02,376 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:02,376 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:04:02,376 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-10 15:04:02,376 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:02,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:02,377 INFO L82 PathProgramCache]: Analyzing trace with hash -112997701, now seen corresponding path program 1 times [2020-07-10 15:04:02,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:02,377 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722698875] [2020-07-10 15:04:02,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:02,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:02,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:02,410 INFO L280 TraceCheckUtils]: 0: Hoare triple {15986#true} assume true; {15986#true} is VALID [2020-07-10 15:04:02,411 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {15986#true} {15986#true} #129#return; {15986#true} is VALID [2020-07-10 15:04:02,411 INFO L263 TraceCheckUtils]: 0: Hoare triple {15986#true} call ULTIMATE.init(); {15986#true} is VALID [2020-07-10 15:04:02,411 INFO L280 TraceCheckUtils]: 1: Hoare triple {15986#true} assume true; {15986#true} is VALID [2020-07-10 15:04:02,412 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {15986#true} {15986#true} #129#return; {15986#true} is VALID [2020-07-10 15:04:02,412 INFO L263 TraceCheckUtils]: 3: Hoare triple {15986#true} call #t~ret7 := main(); {15986#true} is VALID [2020-07-10 15:04:02,412 INFO L280 TraceCheckUtils]: 4: Hoare triple {15986#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;havoc ~cond~0; {15986#true} is VALID [2020-07-10 15:04:02,412 INFO L280 TraceCheckUtils]: 5: Hoare triple {15986#true} assume !false;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~cond~0 := #t~nondet6;havoc #t~nondet6; {15986#true} is VALID [2020-07-10 15:04:02,412 INFO L280 TraceCheckUtils]: 6: Hoare triple {15986#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {15986#true} is VALID [2020-07-10 15:04:02,413 INFO L280 TraceCheckUtils]: 7: Hoare triple {15986#true} assume !(0 != ~p1~0); {15986#true} is VALID [2020-07-10 15:04:02,413 INFO L280 TraceCheckUtils]: 8: Hoare triple {15986#true} assume !(0 != ~p2~0); {15986#true} is VALID [2020-07-10 15:04:02,413 INFO L280 TraceCheckUtils]: 9: Hoare triple {15986#true} assume !(0 != ~p3~0); {15986#true} is VALID [2020-07-10 15:04:02,413 INFO L280 TraceCheckUtils]: 10: Hoare triple {15986#true} assume !(0 != ~p4~0); {15986#true} is VALID [2020-07-10 15:04:02,414 INFO L280 TraceCheckUtils]: 11: Hoare triple {15986#true} assume !(0 != ~p5~0); {15986#true} is VALID [2020-07-10 15:04:02,416 INFO L280 TraceCheckUtils]: 12: Hoare triple {15986#true} assume 0 != ~p6~0;~lk6~0 := 1; {15990#(= 1 main_~lk6~0)} is VALID [2020-07-10 15:04:02,419 INFO L280 TraceCheckUtils]: 13: Hoare triple {15990#(= 1 main_~lk6~0)} assume !(0 != ~p1~0); {15990#(= 1 main_~lk6~0)} is VALID [2020-07-10 15:04:02,419 INFO L280 TraceCheckUtils]: 14: Hoare triple {15990#(= 1 main_~lk6~0)} assume !(0 != ~p2~0); {15990#(= 1 main_~lk6~0)} is VALID [2020-07-10 15:04:02,420 INFO L280 TraceCheckUtils]: 15: Hoare triple {15990#(= 1 main_~lk6~0)} assume !(0 != ~p3~0); {15990#(= 1 main_~lk6~0)} is VALID [2020-07-10 15:04:02,421 INFO L280 TraceCheckUtils]: 16: Hoare triple {15990#(= 1 main_~lk6~0)} assume !(0 != ~p4~0); {15990#(= 1 main_~lk6~0)} is VALID [2020-07-10 15:04:02,421 INFO L280 TraceCheckUtils]: 17: Hoare triple {15990#(= 1 main_~lk6~0)} assume !(0 != ~p5~0); {15990#(= 1 main_~lk6~0)} is VALID [2020-07-10 15:04:02,422 INFO L280 TraceCheckUtils]: 18: Hoare triple {15990#(= 1 main_~lk6~0)} assume 0 != ~p6~0; {15990#(= 1 main_~lk6~0)} is VALID [2020-07-10 15:04:02,422 INFO L280 TraceCheckUtils]: 19: Hoare triple {15990#(= 1 main_~lk6~0)} assume 1 != ~lk6~0; {15987#false} is VALID [2020-07-10 15:04:02,423 INFO L280 TraceCheckUtils]: 20: Hoare triple {15987#false} assume !false; {15987#false} is VALID [2020-07-10 15:04:02,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:04:02,424 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722698875] [2020-07-10 15:04:02,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:02,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:02,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499993268] [2020-07-10 15:04:02,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-10 15:04:02,425 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:02,425 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:02,449 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:02,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:02,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:02,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:02,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:02,450 INFO L87 Difference]: Start difference. First operand 600 states and 726 transitions. Second operand 3 states. [2020-07-10 15:04:02,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:02,847 INFO L93 Difference]: Finished difference Result 970 states and 1159 transitions. [2020-07-10 15:04:02,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:02,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-10 15:04:02,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:02,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:02,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2020-07-10 15:04:02,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:02,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2020-07-10 15:04:02,852 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2020-07-10 15:04:02,906 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:02,955 INFO L225 Difference]: With dead ends: 970 [2020-07-10 15:04:02,956 INFO L226 Difference]: Without dead ends: 968 [2020-07-10 15:04:02,956 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:02,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2020-07-10 15:04:03,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 904. [2020-07-10 15:04:03,143 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:03,143 INFO L82 GeneralOperation]: Start isEquivalent. First operand 968 states. Second operand 904 states. [2020-07-10 15:04:03,143 INFO L74 IsIncluded]: Start isIncluded. First operand 968 states. Second operand 904 states. [2020-07-10 15:04:03,143 INFO L87 Difference]: Start difference. First operand 968 states. Second operand 904 states. [2020-07-10 15:04:03,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:03,194 INFO L93 Difference]: Finished difference Result 968 states and 1126 transitions. [2020-07-10 15:04:03,195 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1126 transitions. [2020-07-10 15:04:03,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:03,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:03,197 INFO L74 IsIncluded]: Start isIncluded. First operand 904 states. Second operand 968 states. [2020-07-10 15:04:03,197 INFO L87 Difference]: Start difference. First operand 904 states. Second operand 968 states. [2020-07-10 15:04:03,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:03,248 INFO L93 Difference]: Finished difference Result 968 states and 1126 transitions. [2020-07-10 15:04:03,248 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1126 transitions. [2020-07-10 15:04:03,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:03,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:03,251 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:03,251 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:03,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2020-07-10 15:04:03,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1062 transitions. [2020-07-10 15:04:03,294 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1062 transitions. Word has length 21 [2020-07-10 15:04:03,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:03,294 INFO L479 AbstractCegarLoop]: Abstraction has 904 states and 1062 transitions. [2020-07-10 15:04:03,294 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:03,294 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1062 transitions. [2020-07-10 15:04:03,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-10 15:04:03,296 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:04:03,296 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:04:03,296 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-10 15:04:03,296 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:04:03,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:04:03,297 INFO L82 PathProgramCache]: Analyzing trace with hash 567060669, now seen corresponding path program 1 times [2020-07-10 15:04:03,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:04:03,297 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529788210] [2020-07-10 15:04:03,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:04:03,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:03,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:04:03,321 INFO L280 TraceCheckUtils]: 0: Hoare triple {19912#true} assume true; {19912#true} is VALID [2020-07-10 15:04:03,321 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {19912#true} {19912#true} #129#return; {19912#true} is VALID [2020-07-10 15:04:03,322 INFO L263 TraceCheckUtils]: 0: Hoare triple {19912#true} call ULTIMATE.init(); {19912#true} is VALID [2020-07-10 15:04:03,322 INFO L280 TraceCheckUtils]: 1: Hoare triple {19912#true} assume true; {19912#true} is VALID [2020-07-10 15:04:03,322 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {19912#true} {19912#true} #129#return; {19912#true} is VALID [2020-07-10 15:04:03,322 INFO L263 TraceCheckUtils]: 3: Hoare triple {19912#true} call #t~ret7 := main(); {19912#true} is VALID [2020-07-10 15:04:03,323 INFO L280 TraceCheckUtils]: 4: Hoare triple {19912#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;havoc ~cond~0; {19912#true} is VALID [2020-07-10 15:04:03,323 INFO L280 TraceCheckUtils]: 5: Hoare triple {19912#true} assume !false;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~cond~0 := #t~nondet6;havoc #t~nondet6; {19912#true} is VALID [2020-07-10 15:04:03,323 INFO L280 TraceCheckUtils]: 6: Hoare triple {19912#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {19912#true} is VALID [2020-07-10 15:04:03,323 INFO L280 TraceCheckUtils]: 7: Hoare triple {19912#true} assume !(0 != ~p1~0); {19912#true} is VALID [2020-07-10 15:04:03,324 INFO L280 TraceCheckUtils]: 8: Hoare triple {19912#true} assume !(0 != ~p2~0); {19912#true} is VALID [2020-07-10 15:04:03,324 INFO L280 TraceCheckUtils]: 9: Hoare triple {19912#true} assume !(0 != ~p3~0); {19912#true} is VALID [2020-07-10 15:04:03,324 INFO L280 TraceCheckUtils]: 10: Hoare triple {19912#true} assume !(0 != ~p4~0); {19912#true} is VALID [2020-07-10 15:04:03,324 INFO L280 TraceCheckUtils]: 11: Hoare triple {19912#true} assume !(0 != ~p5~0); {19912#true} is VALID [2020-07-10 15:04:03,326 INFO L280 TraceCheckUtils]: 12: Hoare triple {19912#true} assume !(0 != ~p6~0); {19916#(= 0 main_~p6~0)} is VALID [2020-07-10 15:04:03,328 INFO L280 TraceCheckUtils]: 13: Hoare triple {19916#(= 0 main_~p6~0)} assume !(0 != ~p1~0); {19916#(= 0 main_~p6~0)} is VALID [2020-07-10 15:04:03,330 INFO L280 TraceCheckUtils]: 14: Hoare triple {19916#(= 0 main_~p6~0)} assume !(0 != ~p2~0); {19916#(= 0 main_~p6~0)} is VALID [2020-07-10 15:04:03,332 INFO L280 TraceCheckUtils]: 15: Hoare triple {19916#(= 0 main_~p6~0)} assume !(0 != ~p3~0); {19916#(= 0 main_~p6~0)} is VALID [2020-07-10 15:04:03,333 INFO L280 TraceCheckUtils]: 16: Hoare triple {19916#(= 0 main_~p6~0)} assume !(0 != ~p4~0); {19916#(= 0 main_~p6~0)} is VALID [2020-07-10 15:04:03,334 INFO L280 TraceCheckUtils]: 17: Hoare triple {19916#(= 0 main_~p6~0)} assume !(0 != ~p5~0); {19916#(= 0 main_~p6~0)} is VALID [2020-07-10 15:04:03,334 INFO L280 TraceCheckUtils]: 18: Hoare triple {19916#(= 0 main_~p6~0)} assume 0 != ~p6~0; {19913#false} is VALID [2020-07-10 15:04:03,335 INFO L280 TraceCheckUtils]: 19: Hoare triple {19913#false} assume 1 != ~lk6~0; {19913#false} is VALID [2020-07-10 15:04:03,335 INFO L280 TraceCheckUtils]: 20: Hoare triple {19913#false} assume !false; {19913#false} is VALID [2020-07-10 15:04:03,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:04:03,336 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529788210] [2020-07-10 15:04:03,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:04:03,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:04:03,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81858037] [2020-07-10 15:04:03,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-10 15:04:03,337 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:04:03,337 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:04:03,357 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:03,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:04:03,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:04:03,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:04:03,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:03,358 INFO L87 Difference]: Start difference. First operand 904 states and 1062 transitions. Second operand 3 states. [2020-07-10 15:04:03,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:03,991 INFO L93 Difference]: Finished difference Result 1992 states and 2278 transitions. [2020-07-10 15:04:03,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:04:03,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-10 15:04:03,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:04:03,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:03,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2020-07-10 15:04:03,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:04:03,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2020-07-10 15:04:03,994 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 102 transitions. [2020-07-10 15:04:04,106 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:04:04,106 INFO L225 Difference]: With dead ends: 1992 [2020-07-10 15:04:04,106 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 15:04:04,109 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:04:04,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 15:04:04,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 15:04:04,110 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:04:04,110 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 15:04:04,110 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:04:04,111 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:04:04,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:04,112 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:04:04,112 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:04:04,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:04,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:04,112 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:04:04,112 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:04:04,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:04:04,113 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:04:04,113 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:04:04,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:04,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:04:04,113 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:04:04,113 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:04:04,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 15:04:04,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 15:04:04,114 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2020-07-10 15:04:04,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:04:04,114 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 15:04:04,114 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:04:04,115 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:04:04,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:04:04,115 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-10 15:04:04,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 15:04:04,149 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 15:04:04,149 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:04:04,149 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:04:04,149 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 15:04:04,149 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 15:04:04,150 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:04:04,150 INFO L268 CegarLoopResult]: For program point L93(line 93) no Hoare annotation was computed. [2020-07-10 15:04:04,150 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 4 107) no Hoare annotation was computed. [2020-07-10 15:04:04,150 INFO L268 CegarLoopResult]: For program point L77-1(lines 27 102) no Hoare annotation was computed. [2020-07-10 15:04:04,150 INFO L268 CegarLoopResult]: For program point L78(line 78) no Hoare annotation was computed. [2020-07-10 15:04:04,150 INFO L271 CegarLoopResult]: At program point L103(lines 5 107) the Hoare annotation is: true [2020-07-10 15:04:04,150 INFO L268 CegarLoopResult]: For program point L29(lines 29 31) no Hoare annotation was computed. [2020-07-10 15:04:04,150 INFO L268 CegarLoopResult]: For program point L62-1(lines 27 102) no Hoare annotation was computed. [2020-07-10 15:04:04,150 INFO L268 CegarLoopResult]: For program point L87-1(lines 27 102) no Hoare annotation was computed. [2020-07-10 15:04:04,150 INFO L268 CegarLoopResult]: For program point L54-1(lines 27 102) no Hoare annotation was computed. [2020-07-10 15:04:04,150 INFO L268 CegarLoopResult]: For program point L46(lines 46 48) no Hoare annotation was computed. [2020-07-10 15:04:04,150 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 4 107) no Hoare annotation was computed. [2020-07-10 15:04:04,151 INFO L268 CegarLoopResult]: For program point L46-2(lines 27 102) no Hoare annotation was computed. [2020-07-10 15:04:04,151 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2020-07-10 15:04:04,151 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 107) the Hoare annotation is: true [2020-07-10 15:04:04,151 INFO L268 CegarLoopResult]: For program point L88(line 88) no Hoare annotation was computed. [2020-07-10 15:04:04,151 INFO L268 CegarLoopResult]: For program point L72-1(lines 27 102) no Hoare annotation was computed. [2020-07-10 15:04:04,151 INFO L271 CegarLoopResult]: At program point L97-1(lines 27 102) the Hoare annotation is: true [2020-07-10 15:04:04,151 INFO L268 CegarLoopResult]: For program point L73(line 73) no Hoare annotation was computed. [2020-07-10 15:04:04,151 INFO L268 CegarLoopResult]: For program point L98(line 98) no Hoare annotation was computed. [2020-07-10 15:04:04,151 INFO L264 CegarLoopResult]: At program point L98-1(lines 5 107) the Hoare annotation is: false [2020-07-10 15:04:04,152 INFO L268 CegarLoopResult]: For program point L82-1(lines 27 102) no Hoare annotation was computed. [2020-07-10 15:04:04,152 INFO L268 CegarLoopResult]: For program point L66-1(lines 27 102) no Hoare annotation was computed. [2020-07-10 15:04:04,152 INFO L268 CegarLoopResult]: For program point L58-1(lines 27 102) no Hoare annotation was computed. [2020-07-10 15:04:04,152 INFO L268 CegarLoopResult]: For program point L83(line 83) no Hoare annotation was computed. [2020-07-10 15:04:04,152 INFO L268 CegarLoopResult]: For program point L50-1(lines 27 102) no Hoare annotation was computed. [2020-07-10 15:04:04,152 INFO L268 CegarLoopResult]: For program point L92-1(lines 27 102) no Hoare annotation was computed. [2020-07-10 15:04:04,156 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:04:04,156 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:04:04,157 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:04:04,157 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-10 15:04:04,157 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:04:04,157 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:04:04,157 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-10 15:04:04,157 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-10 15:04:04,157 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:04:04,157 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-10 15:04:04,157 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-10 15:04:04,157 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:04:04,157 WARN L170 areAnnotationChecker]: L46-2 has no Hoare annotation [2020-07-10 15:04:04,157 WARN L170 areAnnotationChecker]: L46-2 has no Hoare annotation [2020-07-10 15:04:04,157 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2020-07-10 15:04:04,158 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2020-07-10 15:04:04,158 WARN L170 areAnnotationChecker]: L54-1 has no Hoare annotation [2020-07-10 15:04:04,158 WARN L170 areAnnotationChecker]: L54-1 has no Hoare annotation [2020-07-10 15:04:04,158 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2020-07-10 15:04:04,158 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2020-07-10 15:04:04,158 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2020-07-10 15:04:04,158 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2020-07-10 15:04:04,158 WARN L170 areAnnotationChecker]: L66-1 has no Hoare annotation [2020-07-10 15:04:04,158 WARN L170 areAnnotationChecker]: L66-1 has no Hoare annotation [2020-07-10 15:04:04,158 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2020-07-10 15:04:04,158 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2020-07-10 15:04:04,158 WARN L170 areAnnotationChecker]: L72-1 has no Hoare annotation [2020-07-10 15:04:04,158 WARN L170 areAnnotationChecker]: L72-1 has no Hoare annotation [2020-07-10 15:04:04,159 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2020-07-10 15:04:04,159 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:04:04,159 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2020-07-10 15:04:04,159 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2020-07-10 15:04:04,159 WARN L170 areAnnotationChecker]: L77-1 has no Hoare annotation [2020-07-10 15:04:04,159 WARN L170 areAnnotationChecker]: L77-1 has no Hoare annotation [2020-07-10 15:04:04,159 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2020-07-10 15:04:04,159 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2020-07-10 15:04:04,159 WARN L170 areAnnotationChecker]: L82-1 has no Hoare annotation [2020-07-10 15:04:04,159 WARN L170 areAnnotationChecker]: L82-1 has no Hoare annotation [2020-07-10 15:04:04,159 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2020-07-10 15:04:04,159 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2020-07-10 15:04:04,160 WARN L170 areAnnotationChecker]: L87-1 has no Hoare annotation [2020-07-10 15:04:04,160 WARN L170 areAnnotationChecker]: L87-1 has no Hoare annotation [2020-07-10 15:04:04,160 WARN L170 areAnnotationChecker]: L93 has no Hoare annotation [2020-07-10 15:04:04,160 WARN L170 areAnnotationChecker]: L93 has no Hoare annotation [2020-07-10 15:04:04,160 WARN L170 areAnnotationChecker]: L92-1 has no Hoare annotation [2020-07-10 15:04:04,160 WARN L170 areAnnotationChecker]: L92-1 has no Hoare annotation [2020-07-10 15:04:04,160 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2020-07-10 15:04:04,160 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2020-07-10 15:04:04,160 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:04:04,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:04:04 BoogieIcfgContainer [2020-07-10 15:04:04,171 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:04:04,174 INFO L168 Benchmark]: Toolchain (without parser) took 9746.02 ms. Allocated memory was 138.9 MB in the beginning and 321.9 MB in the end (delta: 183.0 MB). Free memory was 102.8 MB in the beginning and 216.5 MB in the end (delta: -113.8 MB). Peak memory consumption was 69.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:04:04,174 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 138.9 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-10 15:04:04,175 INFO L168 Benchmark]: CACSL2BoogieTranslator took 313.38 ms. Allocated memory is still 138.9 MB. Free memory was 102.5 MB in the beginning and 92.2 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2020-07-10 15:04:04,176 INFO L168 Benchmark]: Boogie Preprocessor took 119.99 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 92.2 MB in the beginning and 181.2 MB in the end (delta: -89.0 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. [2020-07-10 15:04:04,176 INFO L168 Benchmark]: RCFGBuilder took 442.49 ms. Allocated memory is still 202.9 MB. Free memory was 180.5 MB in the beginning and 158.2 MB in the end (delta: 22.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2020-07-10 15:04:04,177 INFO L168 Benchmark]: TraceAbstraction took 8864.36 ms. Allocated memory was 202.9 MB in the beginning and 321.9 MB in the end (delta: 119.0 MB). Free memory was 157.6 MB in the beginning and 216.5 MB in the end (delta: -58.9 MB). Peak memory consumption was 60.1 MB. Max. memory is 7.1 GB. [2020-07-10 15:04:04,179 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 138.9 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 313.38 ms. Allocated memory is still 138.9 MB. Free memory was 102.5 MB in the beginning and 92.2 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 119.99 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 92.2 MB in the beginning and 181.2 MB in the end (delta: -89.0 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 442.49 ms. Allocated memory is still 202.9 MB. Free memory was 180.5 MB in the beginning and 158.2 MB in the end (delta: 22.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8864.36 ms. Allocated memory was 202.9 MB in the beginning and 321.9 MB in the end (delta: 119.0 MB). Free memory was 157.6 MB in the beginning and 216.5 MB in the end (delta: -58.9 MB). Peak memory consumption was 60.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 105]: 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: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 8.7s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 923 SDtfs, 417 SDslu, 612 SDs, 0 SdLazy, 91 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=904occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 17 MinimizatonAttempts, 270 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 74 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, 317 NumberOfCodeBlocks, 317 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 300 ConstructedInterpolants, 0 QuantifiedInterpolants, 9690 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...