/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:10:44,034 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:10:44,039 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:10:44,053 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:10:44,054 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:10:44,055 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:10:44,056 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:10:44,058 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:10:44,059 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:10:44,060 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:10:44,061 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:10:44,062 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:10:44,062 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:10:44,063 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:10:44,064 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:10:44,065 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:10:44,066 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:10:44,067 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:10:44,068 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:10:44,070 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:10:44,071 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:10:44,072 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:10:44,073 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:10:44,074 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:10:44,076 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:10:44,076 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:10:44,077 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:10:44,077 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:10:44,078 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:10:44,079 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:10:44,079 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:10:44,080 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:10:44,080 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:10:44,081 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:10:44,082 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:10:44,082 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:10:44,083 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:10:44,083 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:10:44,083 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:10:44,084 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:10:44,085 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:10:44,086 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 [2019-11-23 22:10:44,103 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:10:44,103 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:10:44,105 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:10:44,105 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:10:44,105 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:10:44,105 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:10:44,106 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:10:44,106 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:10:44,106 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:10:44,106 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:10:44,107 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:10:44,107 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:10:44,108 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:10:44,108 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:10:44,108 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:10:44,108 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:10:44,109 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:10:44,109 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:10:44,109 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:10:44,109 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:10:44,110 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:10:44,110 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:10:44,110 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:10:44,110 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:10:44,110 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:10:44,111 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:10:44,111 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:10:44,111 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:10:44,111 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:10:44,111 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:10:44,389 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:10:44,398 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:10:44,401 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:10:44,406 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:10:44,406 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:10:44,407 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2019-11-23 22:10:44,467 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a537eefe/9e58593f40054c2b9aec66f9333e4768/FLAG7b23103d3 [2019-11-23 22:10:44,938 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:10:44,938 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2019-11-23 22:10:44,952 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a537eefe/9e58593f40054c2b9aec66f9333e4768/FLAG7b23103d3 [2019-11-23 22:10:45,266 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a537eefe/9e58593f40054c2b9aec66f9333e4768 [2019-11-23 22:10:45,276 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:10:45,278 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:10:45,279 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:10:45,279 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:10:45,282 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:10:45,283 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:10:45" (1/1) ... [2019-11-23 22:10:45,286 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c891e33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:10:45, skipping insertion in model container [2019-11-23 22:10:45,286 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:10:45" (1/1) ... [2019-11-23 22:10:45,293 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:10:45,348 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:10:45,544 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:10:45,550 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:10:45,612 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:10:45,707 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:10:45,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:10:45 WrapperNode [2019-11-23 22:10:45,707 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:10:45,714 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:10:45,714 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:10:45,714 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:10:45,721 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:10:45" (1/1) ... [2019-11-23 22:10:45,728 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:10:45" (1/1) ... [2019-11-23 22:10:45,758 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:10:45,758 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:10:45,758 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:10:45,758 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:10:45,768 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:10:45" (1/1) ... [2019-11-23 22:10:45,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:10:45" (1/1) ... [2019-11-23 22:10:45,770 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:10:45" (1/1) ... [2019-11-23 22:10:45,770 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:10:45" (1/1) ... [2019-11-23 22:10:45,775 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:10:45" (1/1) ... [2019-11-23 22:10:45,779 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:10:45" (1/1) ... [2019-11-23 22:10:45,781 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:10:45" (1/1) ... [2019-11-23 22:10:45,784 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:10:45,784 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:10:45,785 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:10:45,785 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:10:45,786 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:10:45" (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 [2019-11-23 22:10:45,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:10:45,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:10:46,259 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:10:46,260 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-23 22:10:46,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:10:46 BoogieIcfgContainer [2019-11-23 22:10:46,262 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:10:46,263 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:10:46,263 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:10:46,266 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:10:46,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:10:45" (1/3) ... [2019-11-23 22:10:46,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e7c6ca8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:10:46, skipping insertion in model container [2019-11-23 22:10:46,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:10:45" (2/3) ... [2019-11-23 22:10:46,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e7c6ca8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:10:46, skipping insertion in model container [2019-11-23 22:10:46,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:10:46" (3/3) ... [2019-11-23 22:10:46,272 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c [2019-11-23 22:10:46,282 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:10:46,289 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2019-11-23 22:10:46,300 INFO L249 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2019-11-23 22:10:46,329 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:10:46,329 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:10:46,330 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:10:46,330 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:10:46,330 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:10:46,330 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:10:46,330 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:10:46,330 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:10:46,350 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2019-11-23 22:10:46,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-23 22:10:46,356 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:10:46,357 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:10:46,358 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:10:46,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:10:46,364 INFO L82 PathProgramCache]: Analyzing trace with hash -2034435078, now seen corresponding path program 1 times [2019-11-23 22:10:46,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:10:46,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17327998] [2019-11-23 22:10:46,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:10:46,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:10:46,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:10:46,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17327998] [2019-11-23 22:10:46,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:10:46,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:10:46,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588651926] [2019-11-23 22:10:46,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:10:46,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:10:46,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:10:46,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:10:46,568 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 3 states. [2019-11-23 22:10:46,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:10:46,622 INFO L93 Difference]: Finished difference Result 88 states and 123 transitions. [2019-11-23 22:10:46,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:10:46,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-23 22:10:46,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:10:46,642 INFO L225 Difference]: With dead ends: 88 [2019-11-23 22:10:46,642 INFO L226 Difference]: Without dead ends: 76 [2019-11-23 22:10:46,650 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:10:46,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-23 22:10:46,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-11-23 22:10:46,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-23 22:10:46,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2019-11-23 22:10:46,713 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 15 [2019-11-23 22:10:46,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:10:46,714 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2019-11-23 22:10:46,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:10:46,714 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2019-11-23 22:10:46,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-23 22:10:46,715 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:10:46,715 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:10:46,717 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:10:46,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:10:46,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1357026114, now seen corresponding path program 1 times [2019-11-23 22:10:46,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:10:46,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836636487] [2019-11-23 22:10:46,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:10:46,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:10:46,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:10:46,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836636487] [2019-11-23 22:10:46,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:10:46,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 22:10:46,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506842875] [2019-11-23 22:10:46,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:10:46,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:10:46,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:10:46,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:10:46,844 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 6 states. [2019-11-23 22:10:46,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:10:46,945 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-11-23 22:10:46,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:10:46,946 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-23 22:10:46,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:10:46,947 INFO L225 Difference]: With dead ends: 76 [2019-11-23 22:10:46,948 INFO L226 Difference]: Without dead ends: 74 [2019-11-23 22:10:46,949 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:10:46,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-23 22:10:46,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-23 22:10:46,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-23 22:10:46,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2019-11-23 22:10:46,958 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 16 [2019-11-23 22:10:46,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:10:46,958 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2019-11-23 22:10:46,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 22:10:46,960 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2019-11-23 22:10:46,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-23 22:10:46,961 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:10:46,961 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:10:46,962 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:10:46,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:10:46,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1567835227, now seen corresponding path program 1 times [2019-11-23 22:10:46,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:10:46,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998512880] [2019-11-23 22:10:46,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:10:46,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:10:47,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:10:47,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998512880] [2019-11-23 22:10:47,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:10:47,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:10:47,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964880801] [2019-11-23 22:10:47,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:10:47,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:10:47,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:10:47,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:10:47,026 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 4 states. [2019-11-23 22:10:47,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:10:47,137 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2019-11-23 22:10:47,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:10:47,139 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-23 22:10:47,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:10:47,142 INFO L225 Difference]: With dead ends: 97 [2019-11-23 22:10:47,142 INFO L226 Difference]: Without dead ends: 95 [2019-11-23 22:10:47,142 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:10:47,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-23 22:10:47,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 72. [2019-11-23 22:10:47,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-23 22:10:47,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2019-11-23 22:10:47,153 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 18 [2019-11-23 22:10:47,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:10:47,154 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2019-11-23 22:10:47,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:10:47,155 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2019-11-23 22:10:47,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-23 22:10:47,156 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:10:47,156 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:10:47,157 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:10:47,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:10:47,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1358247672, now seen corresponding path program 1 times [2019-11-23 22:10:47,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:10:47,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602790154] [2019-11-23 22:10:47,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:10:47,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:10:47,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:10:47,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602790154] [2019-11-23 22:10:47,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:10:47,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:10:47,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498628846] [2019-11-23 22:10:47,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:10:47,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:10:47,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:10:47,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:10:47,249 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand 5 states. [2019-11-23 22:10:47,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:10:47,342 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2019-11-23 22:10:47,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:10:47,343 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-23 22:10:47,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:10:47,344 INFO L225 Difference]: With dead ends: 72 [2019-11-23 22:10:47,344 INFO L226 Difference]: Without dead ends: 70 [2019-11-23 22:10:47,345 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:10:47,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-23 22:10:47,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-11-23 22:10:47,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-23 22:10:47,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2019-11-23 22:10:47,352 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 19 [2019-11-23 22:10:47,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:10:47,352 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2019-11-23 22:10:47,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:10:47,353 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2019-11-23 22:10:47,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-23 22:10:47,353 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:10:47,353 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:10:47,354 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:10:47,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:10:47,354 INFO L82 PathProgramCache]: Analyzing trace with hash -665385716, now seen corresponding path program 1 times [2019-11-23 22:10:47,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:10:47,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627791192] [2019-11-23 22:10:47,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:10:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:10:47,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:10:47,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627791192] [2019-11-23 22:10:47,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:10:47,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:10:47,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017579699] [2019-11-23 22:10:47,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:10:47,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:10:47,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:10:47,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:10:47,434 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 5 states. [2019-11-23 22:10:47,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:10:47,609 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2019-11-23 22:10:47,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 22:10:47,609 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-23 22:10:47,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:10:47,611 INFO L225 Difference]: With dead ends: 137 [2019-11-23 22:10:47,611 INFO L226 Difference]: Without dead ends: 135 [2019-11-23 22:10:47,612 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:10:47,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-23 22:10:47,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 73. [2019-11-23 22:10:47,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-23 22:10:47,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2019-11-23 22:10:47,629 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 22 [2019-11-23 22:10:47,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:10:47,629 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2019-11-23 22:10:47,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:10:47,630 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2019-11-23 22:10:47,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-23 22:10:47,631 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:10:47,631 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:10:47,631 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:10:47,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:10:47,632 INFO L82 PathProgramCache]: Analyzing trace with hash -661217951, now seen corresponding path program 1 times [2019-11-23 22:10:47,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:10:47,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23352355] [2019-11-23 22:10:47,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:10:47,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:10:47,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:10:47,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23352355] [2019-11-23 22:10:47,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:10:47,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:10:47,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255244140] [2019-11-23 22:10:47,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:10:47,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:10:47,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:10:47,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:10:47,705 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 5 states. [2019-11-23 22:10:47,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:10:47,845 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2019-11-23 22:10:47,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 22:10:47,846 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-23 22:10:47,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:10:47,847 INFO L225 Difference]: With dead ends: 104 [2019-11-23 22:10:47,848 INFO L226 Difference]: Without dead ends: 102 [2019-11-23 22:10:47,848 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:10:47,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-23 22:10:47,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 75. [2019-11-23 22:10:47,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-23 22:10:47,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2019-11-23 22:10:47,862 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 22 [2019-11-23 22:10:47,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:10:47,862 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2019-11-23 22:10:47,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:10:47,862 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2019-11-23 22:10:47,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-23 22:10:47,864 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:10:47,864 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:10:47,864 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:10:47,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:10:47,865 INFO L82 PathProgramCache]: Analyzing trace with hash 847883539, now seen corresponding path program 1 times [2019-11-23 22:10:47,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:10:47,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547775907] [2019-11-23 22:10:47,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:10:47,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:10:47,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:10:47,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547775907] [2019-11-23 22:10:47,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:10:47,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:10:47,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35253619] [2019-11-23 22:10:47,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:10:47,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:10:47,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:10:47,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:10:47,943 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 5 states. [2019-11-23 22:10:48,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:10:48,065 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2019-11-23 22:10:48,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:10:48,067 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-11-23 22:10:48,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:10:48,068 INFO L225 Difference]: With dead ends: 117 [2019-11-23 22:10:48,068 INFO L226 Difference]: Without dead ends: 115 [2019-11-23 22:10:48,071 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:10:48,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-23 22:10:48,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 73. [2019-11-23 22:10:48,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-23 22:10:48,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2019-11-23 22:10:48,088 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 23 [2019-11-23 22:10:48,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:10:48,088 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2019-11-23 22:10:48,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:10:48,089 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2019-11-23 22:10:48,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-23 22:10:48,090 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:10:48,091 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:10:48,091 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:10:48,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:10:48,092 INFO L82 PathProgramCache]: Analyzing trace with hash 977084131, now seen corresponding path program 1 times [2019-11-23 22:10:48,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:10:48,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336797719] [2019-11-23 22:10:48,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:10:48,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:10:48,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:10:48,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336797719] [2019-11-23 22:10:48,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:10:48,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:10:48,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124663014] [2019-11-23 22:10:48,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:10:48,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:10:48,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:10:48,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:10:48,183 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 5 states. [2019-11-23 22:10:48,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:10:48,282 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2019-11-23 22:10:48,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:10:48,283 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-11-23 22:10:48,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:10:48,284 INFO L225 Difference]: With dead ends: 73 [2019-11-23 22:10:48,284 INFO L226 Difference]: Without dead ends: 71 [2019-11-23 22:10:48,285 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:10:48,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-23 22:10:48,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-23 22:10:48,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-23 22:10:48,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2019-11-23 22:10:48,294 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 23 [2019-11-23 22:10:48,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:10:48,294 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2019-11-23 22:10:48,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:10:48,298 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2019-11-23 22:10:48,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-23 22:10:48,298 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:10:48,299 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:10:48,299 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:10:48,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:10:48,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1619855478, now seen corresponding path program 1 times [2019-11-23 22:10:48,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:10:48,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109309223] [2019-11-23 22:10:48,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:10:48,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:10:48,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:10:48,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109309223] [2019-11-23 22:10:48,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:10:48,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:10:48,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912087849] [2019-11-23 22:10:48,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:10:48,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:10:48,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:10:48,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:10:48,340 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand 3 states. [2019-11-23 22:10:48,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:10:48,387 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2019-11-23 22:10:48,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:10:48,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-23 22:10:48,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:10:48,388 INFO L225 Difference]: With dead ends: 111 [2019-11-23 22:10:48,389 INFO L226 Difference]: Without dead ends: 71 [2019-11-23 22:10:48,389 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:10:48,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-23 22:10:48,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-23 22:10:48,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-23 22:10:48,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2019-11-23 22:10:48,402 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 25 [2019-11-23 22:10:48,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:10:48,402 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2019-11-23 22:10:48,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:10:48,402 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2019-11-23 22:10:48,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-23 22:10:48,403 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:10:48,403 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:10:48,403 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:10:48,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:10:48,407 INFO L82 PathProgramCache]: Analyzing trace with hash 595608307, now seen corresponding path program 1 times [2019-11-23 22:10:48,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:10:48,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426806018] [2019-11-23 22:10:48,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:10:48,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:10:48,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 22:10:48,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426806018] [2019-11-23 22:10:48,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878460249] [2019-11-23 22:10:48,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:10:48,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:10:48,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-23 22:10:48,530 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:10:48,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:10:48,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 22:10:48,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:10:48,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 7 [2019-11-23 22:10:48,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195501038] [2019-11-23 22:10:48,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 22:10:48,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:10:48,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 22:10:48,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:10:48,620 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand 7 states. [2019-11-23 22:10:48,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:10:48,769 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2019-11-23 22:10:48,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:10:48,769 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-11-23 22:10:48,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:10:48,770 INFO L225 Difference]: With dead ends: 111 [2019-11-23 22:10:48,771 INFO L226 Difference]: Without dead ends: 109 [2019-11-23 22:10:48,771 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-23 22:10:48,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-23 22:10:48,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 68. [2019-11-23 22:10:48,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-23 22:10:48,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2019-11-23 22:10:48,782 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 26 [2019-11-23 22:10:48,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:10:48,786 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2019-11-23 22:10:48,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 22:10:48,786 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2019-11-23 22:10:48,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-23 22:10:48,787 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:10:48,787 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:10:48,987 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:10:48,988 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:10:48,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:10:48,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1780382557, now seen corresponding path program 1 times [2019-11-23 22:10:48,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:10:48,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907994488] [2019-11-23 22:10:48,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:10:48,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:10:49,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:10:49,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907994488] [2019-11-23 22:10:49,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:10:49,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:10:49,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591001793] [2019-11-23 22:10:49,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:10:49,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:10:49,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:10:49,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:10:49,035 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 5 states. [2019-11-23 22:10:49,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:10:49,097 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2019-11-23 22:10:49,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:10:49,099 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-23 22:10:49,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:10:49,099 INFO L225 Difference]: With dead ends: 69 [2019-11-23 22:10:49,100 INFO L226 Difference]: Without dead ends: 67 [2019-11-23 22:10:49,100 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:10:49,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-23 22:10:49,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-11-23 22:10:49,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-23 22:10:49,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2019-11-23 22:10:49,112 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 26 [2019-11-23 22:10:49,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:10:49,112 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2019-11-23 22:10:49,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:10:49,112 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2019-11-23 22:10:49,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-23 22:10:49,113 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:10:49,113 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:10:49,114 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:10:49,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:10:49,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1280139623, now seen corresponding path program 1 times [2019-11-23 22:10:49,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:10:49,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439266852] [2019-11-23 22:10:49,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:10:49,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:10:49,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 22:10:49,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439266852] [2019-11-23 22:10:49,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237992009] [2019-11-23 22:10:49,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:10:49,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:10:49,238 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-23 22:10:49,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:10:49,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:10:49,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 22:10:49,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:10:49,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 7 [2019-11-23 22:10:49,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719213442] [2019-11-23 22:10:49,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 22:10:49,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:10:49,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 22:10:49,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:10:49,286 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 7 states. [2019-11-23 22:10:49,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:10:49,384 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-11-23 22:10:49,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:10:49,384 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-11-23 22:10:49,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:10:49,385 INFO L225 Difference]: With dead ends: 67 [2019-11-23 22:10:49,385 INFO L226 Difference]: Without dead ends: 65 [2019-11-23 22:10:49,386 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-23 22:10:49,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-23 22:10:49,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2019-11-23 22:10:49,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-23 22:10:49,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-11-23 22:10:49,390 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 27 [2019-11-23 22:10:49,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:10:49,391 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-11-23 22:10:49,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 22:10:49,391 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-11-23 22:10:49,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-23 22:10:49,394 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:10:49,394 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:10:49,598 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:10:49,598 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:10:49,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:10:49,599 INFO L82 PathProgramCache]: Analyzing trace with hash -642711428, now seen corresponding path program 1 times [2019-11-23 22:10:49,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:10:49,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829189198] [2019-11-23 22:10:49,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:10:49,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:10:49,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:10:49,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829189198] [2019-11-23 22:10:49,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:10:49,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:10:49,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083482967] [2019-11-23 22:10:49,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:10:49,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:10:49,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:10:49,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:10:49,637 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 5 states. [2019-11-23 22:10:49,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:10:49,697 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2019-11-23 22:10:49,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:10:49,697 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-23 22:10:49,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:10:49,698 INFO L225 Difference]: With dead ends: 60 [2019-11-23 22:10:49,698 INFO L226 Difference]: Without dead ends: 58 [2019-11-23 22:10:49,698 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:10:49,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-23 22:10:49,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-11-23 22:10:49,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-23 22:10:49,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2019-11-23 22:10:49,705 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 27 [2019-11-23 22:10:49,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:10:49,706 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2019-11-23 22:10:49,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:10:49,706 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2019-11-23 22:10:49,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-23 22:10:49,706 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:10:49,707 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:10:49,707 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:10:49,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:10:49,709 INFO L82 PathProgramCache]: Analyzing trace with hash -47880409, now seen corresponding path program 1 times [2019-11-23 22:10:49,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:10:49,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975526109] [2019-11-23 22:10:49,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:10:49,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:10:49,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:10:49,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975526109] [2019-11-23 22:10:49,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:10:49,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:10:49,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786955624] [2019-11-23 22:10:49,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:10:49,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:10:49,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:10:49,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:10:49,788 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 5 states. [2019-11-23 22:10:49,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:10:49,854 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2019-11-23 22:10:49,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:10:49,854 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-23 22:10:49,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:10:49,855 INFO L225 Difference]: With dead ends: 59 [2019-11-23 22:10:49,855 INFO L226 Difference]: Without dead ends: 57 [2019-11-23 22:10:49,855 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:10:49,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-23 22:10:49,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-11-23 22:10:49,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-23 22:10:49,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2019-11-23 22:10:49,859 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 30 [2019-11-23 22:10:49,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:10:49,859 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2019-11-23 22:10:49,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:10:49,860 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2019-11-23 22:10:49,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-23 22:10:49,862 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:10:49,863 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:10:49,864 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:10:49,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:10:49,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1484288504, now seen corresponding path program 1 times [2019-11-23 22:10:49,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:10:49,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933670857] [2019-11-23 22:10:49,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:10:49,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:10:49,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:10:49,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933670857] [2019-11-23 22:10:49,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:10:49,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 22:10:49,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488517411] [2019-11-23 22:10:49,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:10:49,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:10:49,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:10:49,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:10:49,927 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 6 states. [2019-11-23 22:10:50,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:10:50,027 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-11-23 22:10:50,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:10:50,028 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-11-23 22:10:50,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:10:50,029 INFO L225 Difference]: With dead ends: 67 [2019-11-23 22:10:50,029 INFO L226 Difference]: Without dead ends: 65 [2019-11-23 22:10:50,029 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:10:50,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-23 22:10:50,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 54. [2019-11-23 22:10:50,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-23 22:10:50,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2019-11-23 22:10:50,035 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 31 [2019-11-23 22:10:50,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:10:50,035 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2019-11-23 22:10:50,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 22:10:50,035 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2019-11-23 22:10:50,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-23 22:10:50,037 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:10:50,037 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:10:50,037 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:10:50,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:10:50,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1746453711, now seen corresponding path program 1 times [2019-11-23 22:10:50,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:10:50,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533280128] [2019-11-23 22:10:50,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:10:50,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:10:50,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:10:50,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533280128] [2019-11-23 22:10:50,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:10:50,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:10:50,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185214756] [2019-11-23 22:10:50,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:10:50,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:10:50,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:10:50,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:10:50,092 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 5 states. [2019-11-23 22:10:50,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:10:50,204 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2019-11-23 22:10:50,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 22:10:50,204 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-11-23 22:10:50,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:10:50,205 INFO L225 Difference]: With dead ends: 87 [2019-11-23 22:10:50,205 INFO L226 Difference]: Without dead ends: 85 [2019-11-23 22:10:50,206 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:10:50,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-23 22:10:50,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 57. [2019-11-23 22:10:50,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-23 22:10:50,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2019-11-23 22:10:50,210 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 34 [2019-11-23 22:10:50,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:10:50,210 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2019-11-23 22:10:50,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:10:50,211 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2019-11-23 22:10:50,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-23 22:10:50,214 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:10:50,214 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:10:50,214 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:10:50,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:10:50,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1694514003, now seen corresponding path program 1 times [2019-11-23 22:10:50,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:10:50,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579739042] [2019-11-23 22:10:50,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:10:50,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:10:50,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:10:50,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579739042] [2019-11-23 22:10:50,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:10:50,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:10:50,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42234297] [2019-11-23 22:10:50,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:10:50,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:10:50,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:10:50,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:10:50,267 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 5 states. [2019-11-23 22:10:50,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:10:50,344 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2019-11-23 22:10:50,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:10:50,345 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-11-23 22:10:50,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:10:50,346 INFO L225 Difference]: With dead ends: 57 [2019-11-23 22:10:50,346 INFO L226 Difference]: Without dead ends: 55 [2019-11-23 22:10:50,346 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:10:50,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-23 22:10:50,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-11-23 22:10:50,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-23 22:10:50,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2019-11-23 22:10:50,354 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 35 [2019-11-23 22:10:50,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:10:50,354 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2019-11-23 22:10:50,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:10:50,354 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2019-11-23 22:10:50,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-23 22:10:50,355 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:10:50,355 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:10:50,355 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:10:50,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:10:50,355 INFO L82 PathProgramCache]: Analyzing trace with hash 635482230, now seen corresponding path program 1 times [2019-11-23 22:10:50,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:10:50,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206538956] [2019-11-23 22:10:50,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:10:50,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:10:50,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:10:50,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206538956] [2019-11-23 22:10:50,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:10:50,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:10:50,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305277505] [2019-11-23 22:10:50,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:10:50,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:10:50,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:10:50,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:10:50,400 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 5 states. [2019-11-23 22:10:50,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:10:50,420 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2019-11-23 22:10:50,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:10:50,420 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-11-23 22:10:50,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:10:50,421 INFO L225 Difference]: With dead ends: 66 [2019-11-23 22:10:50,421 INFO L226 Difference]: Without dead ends: 64 [2019-11-23 22:10:50,422 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:10:50,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-23 22:10:50,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2019-11-23 22:10:50,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-23 22:10:50,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2019-11-23 22:10:50,426 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 37 [2019-11-23 22:10:50,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:10:50,427 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2019-11-23 22:10:50,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:10:50,427 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2019-11-23 22:10:50,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-23 22:10:50,427 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:10:50,428 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:10:50,428 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:10:50,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:10:50,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1774883137, now seen corresponding path program 1 times [2019-11-23 22:10:50,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:10:50,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036182735] [2019-11-23 22:10:50,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:10:50,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:10:50,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:10:50,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036182735] [2019-11-23 22:10:50,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:10:50,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:10:50,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962227115] [2019-11-23 22:10:50,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:10:50,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:10:50,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:10:50,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:10:50,487 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 5 states. [2019-11-23 22:10:50,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:10:50,514 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2019-11-23 22:10:50,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:10:50,515 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-11-23 22:10:50,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:10:50,516 INFO L225 Difference]: With dead ends: 64 [2019-11-23 22:10:50,516 INFO L226 Difference]: Without dead ends: 62 [2019-11-23 22:10:50,516 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:10:50,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-23 22:10:50,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2019-11-23 22:10:50,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-23 22:10:50,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2019-11-23 22:10:50,521 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 38 [2019-11-23 22:10:50,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:10:50,521 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2019-11-23 22:10:50,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:10:50,522 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2019-11-23 22:10:50,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-23 22:10:50,522 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:10:50,522 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:10:50,523 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:10:50,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:10:50,523 INFO L82 PathProgramCache]: Analyzing trace with hash 813201821, now seen corresponding path program 1 times [2019-11-23 22:10:50,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:10:50,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493683411] [2019-11-23 22:10:50,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:10:50,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:10:50,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:10:50,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493683411] [2019-11-23 22:10:50,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:10:50,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:10:50,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135637028] [2019-11-23 22:10:50,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:10:50,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:10:50,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:10:50,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:10:50,581 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 5 states. [2019-11-23 22:10:50,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:10:50,701 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2019-11-23 22:10:50,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 22:10:50,701 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-11-23 22:10:50,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:10:50,702 INFO L225 Difference]: With dead ends: 86 [2019-11-23 22:10:50,702 INFO L226 Difference]: Without dead ends: 84 [2019-11-23 22:10:50,703 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:10:50,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-23 22:10:50,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 65. [2019-11-23 22:10:50,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-23 22:10:50,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2019-11-23 22:10:50,708 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 39 [2019-11-23 22:10:50,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:10:50,708 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2019-11-23 22:10:50,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:10:50,708 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2019-11-23 22:10:50,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-23 22:10:50,708 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:10:50,709 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:10:50,709 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:10:50,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:10:50,709 INFO L82 PathProgramCache]: Analyzing trace with hash -560543098, now seen corresponding path program 1 times [2019-11-23 22:10:50,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:10:50,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524125453] [2019-11-23 22:10:50,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:10:50,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:10:50,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:10:50,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524125453] [2019-11-23 22:10:50,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:10:50,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:10:50,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277817933] [2019-11-23 22:10:50,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:10:50,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:10:50,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:10:50,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:10:50,759 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 5 states. [2019-11-23 22:10:50,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:10:50,856 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-11-23 22:10:50,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:10:50,856 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-11-23 22:10:50,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:10:50,857 INFO L225 Difference]: With dead ends: 71 [2019-11-23 22:10:50,857 INFO L226 Difference]: Without dead ends: 69 [2019-11-23 22:10:50,858 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:10:50,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-23 22:10:50,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2019-11-23 22:10:50,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-23 22:10:50,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2019-11-23 22:10:50,862 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 40 [2019-11-23 22:10:50,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:10:50,862 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2019-11-23 22:10:50,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:10:50,863 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2019-11-23 22:10:50,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-23 22:10:50,863 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:10:50,863 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:10:50,863 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:10:50,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:10:50,864 INFO L82 PathProgramCache]: Analyzing trace with hash 375780089, now seen corresponding path program 1 times [2019-11-23 22:10:50,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:10:50,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571679234] [2019-11-23 22:10:50,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:10:50,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:10:50,930 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:10:50,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571679234] [2019-11-23 22:10:50,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056175915] [2019-11-23 22:10:50,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:10:50,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:10:50,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-23 22:10:50,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:10:51,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:10:51,035 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:10:51,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:10:51,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-11-23 22:10:51,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494125018] [2019-11-23 22:10:51,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 22:10:51,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:10:51,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 22:10:51,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:10:51,037 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 8 states. [2019-11-23 22:10:51,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:10:51,216 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2019-11-23 22:10:51,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-23 22:10:51,218 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2019-11-23 22:10:51,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:10:51,219 INFO L225 Difference]: With dead ends: 64 [2019-11-23 22:10:51,219 INFO L226 Difference]: Without dead ends: 62 [2019-11-23 22:10:51,219 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 7 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-11-23 22:10:51,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-23 22:10:51,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-11-23 22:10:51,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-23 22:10:51,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2019-11-23 22:10:51,224 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 40 [2019-11-23 22:10:51,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:10:51,224 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2019-11-23 22:10:51,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 22:10:51,224 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2019-11-23 22:10:51,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-23 22:10:51,225 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:10:51,225 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:10:51,428 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:10:51,429 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:10:51,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:10:51,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1394778411, now seen corresponding path program 1 times [2019-11-23 22:10:51,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:10:51,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623485758] [2019-11-23 22:10:51,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:10:51,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:10:51,477 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 22:10:51,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623485758] [2019-11-23 22:10:51,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:10:51,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:10:51,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086960960] [2019-11-23 22:10:51,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:10:51,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:10:51,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:10:51,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:10:51,479 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 5 states. [2019-11-23 22:10:51,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:10:51,593 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2019-11-23 22:10:51,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-23 22:10:51,593 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-23 22:10:51,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:10:51,594 INFO L225 Difference]: With dead ends: 73 [2019-11-23 22:10:51,594 INFO L226 Difference]: Without dead ends: 71 [2019-11-23 22:10:51,595 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:10:51,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-23 22:10:51,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 51. [2019-11-23 22:10:51,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-23 22:10:51,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2019-11-23 22:10:51,600 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 45 [2019-11-23 22:10:51,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:10:51,600 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2019-11-23 22:10:51,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:10:51,600 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2019-11-23 22:10:51,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-23 22:10:51,601 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:10:51,601 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:10:51,601 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:10:51,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:10:51,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1932282916, now seen corresponding path program 1 times [2019-11-23 22:10:51,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:10:51,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825097404] [2019-11-23 22:10:51,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:10:51,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:10:51,648 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:10:51,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825097404] [2019-11-23 22:10:51,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124366208] [2019-11-23 22:10:51,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:10:51,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:10:51,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-23 22:10:51,720 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:10:51,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 22:10:51,753 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 22:10:51,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 22:10:51,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2019-11-23 22:10:51,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271957749] [2019-11-23 22:10:51,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:10:51,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:10:51,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:10:51,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:10:51,755 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 4 states. [2019-11-23 22:10:51,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:10:51,783 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2019-11-23 22:10:51,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:10:51,784 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-11-23 22:10:51,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:10:51,784 INFO L225 Difference]: With dead ends: 56 [2019-11-23 22:10:51,784 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 22:10:51,785 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:10:51,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 22:10:51,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 22:10:51,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 22:10:51,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 22:10:51,787 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2019-11-23 22:10:51,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:10:51,787 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 22:10:51,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:10:51,788 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 22:10:51,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 22:10:51,988 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:10:51,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 22:10:52,325 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 29 [2019-11-23 22:10:52,717 WARN L192 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 62 [2019-11-23 22:10:52,957 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 36 [2019-11-23 22:10:53,379 WARN L192 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 68 [2019-11-23 22:10:53,388 INFO L444 ceAbstractionStarter]: For program point L250(line 250) no Hoare annotation was computed. [2019-11-23 22:10:53,388 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 92) no Hoare annotation was computed. [2019-11-23 22:10:53,388 INFO L444 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-23 22:10:53,388 INFO L444 ceAbstractionStarter]: For program point L118(lines 118 398) no Hoare annotation was computed. [2019-11-23 22:10:53,388 INFO L444 ceAbstractionStarter]: For program point L267(line 267) no Hoare annotation was computed. [2019-11-23 22:10:53,388 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 267) no Hoare annotation was computed. [2019-11-23 22:10:53,389 INFO L444 ceAbstractionStarter]: For program point L36(lines 36 430) no Hoare annotation was computed. [2019-11-23 22:10:53,389 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 22:10:53,389 INFO L444 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2019-11-23 22:10:53,389 INFO L444 ceAbstractionStarter]: For program point L367(lines 367 390) no Hoare annotation was computed. [2019-11-23 22:10:53,389 INFO L444 ceAbstractionStarter]: For program point L301(lines 301 311) no Hoare annotation was computed. [2019-11-23 22:10:53,389 INFO L444 ceAbstractionStarter]: For program point L219(lines 219 339) no Hoare annotation was computed. [2019-11-23 22:10:53,389 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 250) no Hoare annotation was computed. [2019-11-23 22:10:53,390 INFO L444 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-11-23 22:10:53,390 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 427) no Hoare annotation was computed. [2019-11-23 22:10:53,390 INFO L444 ceAbstractionStarter]: For program point L236(lines 236 326) no Hoare annotation was computed. [2019-11-23 22:10:53,390 INFO L444 ceAbstractionStarter]: For program point L170(lines 170 352) no Hoare annotation was computed. [2019-11-23 22:10:53,390 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2019-11-23 22:10:53,390 INFO L444 ceAbstractionStarter]: For program point L369(line 369) no Hoare annotation was computed. [2019-11-23 22:10:53,390 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 381) no Hoare annotation was computed. [2019-11-23 22:10:53,391 INFO L444 ceAbstractionStarter]: For program point L303(line 303) no Hoare annotation was computed. [2019-11-23 22:10:53,391 INFO L444 ceAbstractionStarter]: For program point L138(lines 138 357) no Hoare annotation was computed. [2019-11-23 22:10:53,391 INFO L444 ceAbstractionStarter]: For program point L221(line 221) no Hoare annotation was computed. [2019-11-23 22:10:53,391 INFO L444 ceAbstractionStarter]: For program point L56(lines 56 422) no Hoare annotation was computed. [2019-11-23 22:10:53,391 INFO L444 ceAbstractionStarter]: For program point L238(line 238) no Hoare annotation was computed. [2019-11-23 22:10:53,391 INFO L444 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-23 22:10:53,391 INFO L444 ceAbstractionStarter]: For program point L106(lines 106 400) no Hoare annotation was computed. [2019-11-23 22:10:53,391 INFO L440 ceAbstractionStarter]: At program point L387(lines 124 398) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~main__cp~0 1) ULTIMATE.start_main_~main__urilen~0) (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0) (let ((.cse0 (<= 1 ULTIMATE.start_main_~main__cp~0)) (.cse1 (< 0 ULTIMATE.start_main_~main__scheme~0)) (.cse2 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~1))) (.cse3 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~3))) (or (and (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~2) .cse0 .cse1 .cse2 .cse3) (and (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~2)) .cse0 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~17)) .cse1 .cse2 .cse3 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~16))))) [2019-11-23 22:10:53,391 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 349) no Hoare annotation was computed. [2019-11-23 22:10:53,391 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 209) no Hoare annotation was computed. [2019-11-23 22:10:53,392 INFO L444 ceAbstractionStarter]: For program point L90(lines 90 407) no Hoare annotation was computed. [2019-11-23 22:10:53,392 INFO L444 ceAbstractionStarter]: For program point L24(lines 24 432) no Hoare annotation was computed. [2019-11-23 22:10:53,392 INFO L444 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2019-11-23 22:10:53,392 INFO L440 ceAbstractionStarter]: At program point L322(lines 257 323) the Hoare annotation is: (let ((.cse0 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~6))) (.cse1 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~5))) (.cse2 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~10)) (.cse3 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~7))) (.cse4 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~4)) (.cse5 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~8))) (.cse6 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~2))) (.cse7 (<= 1 ULTIMATE.start_main_~main__cp~0)) (.cse8 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~11))) (.cse9 (< 0 ULTIMATE.start_main_~main__scheme~0)) (.cse10 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~1))) (.cse11 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~3)) (.cse13 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)) (.cse12 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~9)) (.cse14 (< (+ ULTIMATE.start_main_~main__cp~0 1) ULTIMATE.start_main_~main__urilen~0))) (or (and .cse0 .cse1 .cse2 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~12) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~13)) (<= 1 ULTIMATE.start_main_~main__c~0) .cse3 .cse4 .cse5 .cse6 .cse7 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~14)) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~15)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 (<= (+ ULTIMATE.start_main_~main__c~0 2) ULTIMATE.start_main_~main__tokenlen~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse12 .cse14 (= ULTIMATE.start_main_~main__c~0 0)))) [2019-11-23 22:10:53,392 INFO L444 ceAbstractionStarter]: For program point L289(lines 289 313) no Hoare annotation was computed. [2019-11-23 22:10:53,392 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 22:10:53,392 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2019-11-23 22:10:53,392 INFO L444 ceAbstractionStarter]: For program point L157(lines 157 354) no Hoare annotation was computed. [2019-11-23 22:10:53,392 INFO L444 ceAbstractionStarter]: For program point L58(lines 58 417) no Hoare annotation was computed. [2019-11-23 22:10:53,392 INFO L440 ceAbstractionStarter]: At program point L405(lines 99 406) the Hoare annotation is: (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)) [2019-11-23 22:10:53,393 INFO L444 ceAbstractionStarter]: For program point L207(lines 207 341) no Hoare annotation was computed. [2019-11-23 22:10:53,393 INFO L444 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-11-23 22:10:53,393 INFO L444 ceAbstractionStarter]: For program point L42(lines 42 429) no Hoare annotation was computed. [2019-11-23 22:10:53,393 INFO L444 ceAbstractionStarter]: For program point L257(lines 257 323) no Hoare annotation was computed. [2019-11-23 22:10:53,393 INFO L444 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2019-11-23 22:10:53,393 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 108) no Hoare annotation was computed. [2019-11-23 22:10:53,393 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 279) no Hoare annotation was computed. [2019-11-23 22:10:53,393 INFO L444 ceAbstractionStarter]: For program point L291(line 291) no Hoare annotation was computed. [2019-11-23 22:10:53,393 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 221) no Hoare annotation was computed. [2019-11-23 22:10:53,394 INFO L444 ceAbstractionStarter]: For program point L60(lines 60 412) no Hoare annotation was computed. [2019-11-23 22:10:53,394 INFO L444 ceAbstractionStarter]: For program point L209(line 209) no Hoare annotation was computed. [2019-11-23 22:10:53,394 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 140) no Hoare annotation was computed. [2019-11-23 22:10:53,394 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 22:10:53,394 INFO L444 ceAbstractionStarter]: For program point L78(lines 78 409) no Hoare annotation was computed. [2019-11-23 22:10:53,394 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 303) no Hoare annotation was computed. [2019-11-23 22:10:53,394 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 120) no Hoare annotation was computed. [2019-11-23 22:10:53,394 INFO L440 ceAbstractionStarter]: At program point L310(lines 225 339) the Hoare annotation is: (let ((.cse2 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~10)) (.cse8 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~11))) (.cse0 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~6))) (.cse1 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~5))) (.cse3 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~7))) (.cse4 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~4)) (.cse5 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~8))) (.cse6 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~2))) (.cse7 (<= 1 ULTIMATE.start_main_~main__cp~0)) (.cse9 (< 0 ULTIMATE.start_main_~main__scheme~0)) (.cse10 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~1))) (.cse11 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~3)) (.cse12 (<= (+ ULTIMATE.start_main_~main__cp~0 1) ULTIMATE.start_main_~main__urilen~0)) (.cse13 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~9)) (.cse14 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)) (.cse15 (= ULTIMATE.start_main_~main__c~0 0))) (or (and .cse0 .cse1 .cse2 (<= (+ ULTIMATE.start_main_~main__c~0 2) ULTIMATE.start_main_~main__tokenlen~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~12) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~13)) (<= 1 ULTIMATE.start_main_~main__c~0) .cse3 .cse4 .cse5 .cse6 .cse7 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~14)) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~15)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 (<= (+ ULTIMATE.start_main_~main__cp~0 2) ULTIMATE.start_main_~main__urilen~0) .cse9 .cse10 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~8) .cse11 .cse12 .cse13 .cse14 .cse15))) [2019-11-23 22:10:53,395 INFO L444 ceAbstractionStarter]: For program point L277(lines 277 315) no Hoare annotation was computed. [2019-11-23 22:10:53,395 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 291) no Hoare annotation was computed. [2019-11-23 22:10:53,395 INFO L447 ceAbstractionStarter]: At program point L426(lines 8 434) the Hoare annotation is: true [2019-11-23 22:10:53,395 INFO L444 ceAbstractionStarter]: For program point L30(lines 30 431) no Hoare annotation was computed. [2019-11-23 22:10:53,395 INFO L444 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2019-11-23 22:10:53,395 INFO L444 ceAbstractionStarter]: For program point L229(lines 229 333) no Hoare annotation was computed. [2019-11-23 22:10:53,395 INFO L444 ceAbstractionStarter]: For program point L130(lines 130 392) no Hoare annotation was computed. [2019-11-23 22:10:53,395 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 152) no Hoare annotation was computed. [2019-11-23 22:10:53,395 INFO L444 ceAbstractionStarter]: For program point L279(line 279) no Hoare annotation was computed. [2019-11-23 22:10:53,396 INFO L444 ceAbstractionStarter]: For program point L48(lines 48 428) no Hoare annotation was computed. [2019-11-23 22:10:53,396 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 369) no Hoare annotation was computed. [2019-11-23 22:10:53,396 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-23 22:10:53,396 INFO L444 ceAbstractionStarter]: For program point L379(lines 379 388) no Hoare annotation was computed. [2019-11-23 22:10:53,396 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2019-11-23 22:10:53,396 INFO L440 ceAbstractionStarter]: At program point L396(lines 126 397) the Hoare annotation is: (let ((.cse0 (< ULTIMATE.start_main_~main__cp~0 ULTIMATE.start_main_~main__urilen~0)) (.cse1 (let ((.cse3 (<= 1 ULTIMATE.start_main_~main__cp~0)) (.cse4 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~0))) (.cse5 (< 0 ULTIMATE.start_main_~main__scheme~0)) (.cse6 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~3))) (.cse7 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~1)))) (or (and (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~2) .cse3 .cse4 .cse5 .cse6 .cse7) (and (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~16)) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~2)) .cse3 .cse4 .cse5 .cse6 .cse7)))) (.cse2 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~3))) (or (and (= (+ ULTIMATE.start_main_~main__cp~0 1) ULTIMATE.start_main_~main__urilen~0) .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse2 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)))) [2019-11-23 22:10:53,396 INFO L444 ceAbstractionStarter]: For program point L99(lines 99 406) no Hoare annotation was computed. [2019-11-23 22:10:53,396 INFO L444 ceAbstractionStarter]: For program point L66(lines 66 411) no Hoare annotation was computed. [2019-11-23 22:10:53,397 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 324) no Hoare annotation was computed. [2019-11-23 22:10:53,397 INFO L444 ceAbstractionStarter]: For program point L182(lines 182 350) no Hoare annotation was computed. [2019-11-23 22:10:53,397 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 317) no Hoare annotation was computed. [2019-11-23 22:10:53,397 INFO L444 ceAbstractionStarter]: For program point L199(lines 199 348) no Hoare annotation was computed. [2019-11-23 22:10:53,397 INFO L444 ceAbstractionStarter]: For program point L381(line 381) no Hoare annotation was computed. [2019-11-23 22:10:53,397 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 238) no Hoare annotation was computed. [2019-11-23 22:10:53,397 INFO L444 ceAbstractionStarter]: For program point L150(lines 150 355) no Hoare annotation was computed. [2019-11-23 22:10:53,397 INFO L444 ceAbstractionStarter]: For program point L18(lines 18 433) no Hoare annotation was computed. [2019-11-23 22:10:53,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:10:53 BoogieIcfgContainer [2019-11-23 22:10:53,423 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 22:10:53,424 INFO L168 Benchmark]: Toolchain (without parser) took 8147.15 ms. Allocated memory was 137.9 MB in the beginning and 301.5 MB in the end (delta: 163.6 MB). Free memory was 102.3 MB in the beginning and 158.1 MB in the end (delta: -55.8 MB). Peak memory consumption was 153.4 MB. Max. memory is 7.1 GB. [2019-11-23 22:10:53,425 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-23 22:10:53,426 INFO L168 Benchmark]: CACSL2BoogieTranslator took 434.84 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 101.9 MB in the beginning and 180.0 MB in the end (delta: -78.1 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2019-11-23 22:10:53,426 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.17 ms. Allocated memory is still 201.9 MB. Free memory was 180.0 MB in the beginning and 178.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-11-23 22:10:53,427 INFO L168 Benchmark]: Boogie Preprocessor took 26.06 ms. Allocated memory is still 201.9 MB. Free memory was 178.0 MB in the beginning and 176.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2019-11-23 22:10:53,427 INFO L168 Benchmark]: RCFGBuilder took 477.80 ms. Allocated memory is still 201.9 MB. Free memory was 176.6 MB in the beginning and 149.7 MB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 7.1 GB. [2019-11-23 22:10:53,428 INFO L168 Benchmark]: TraceAbstraction took 7159.87 ms. Allocated memory was 201.9 MB in the beginning and 301.5 MB in the end (delta: 99.6 MB). Free memory was 149.0 MB in the beginning and 158.1 MB in the end (delta: -9.1 MB). Peak memory consumption was 136.2 MB. Max. memory is 7.1 GB. [2019-11-23 22:10:53,431 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.45 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 434.84 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 101.9 MB in the beginning and 180.0 MB in the end (delta: -78.1 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.17 ms. Allocated memory is still 201.9 MB. Free memory was 180.0 MB in the beginning and 178.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.06 ms. Allocated memory is still 201.9 MB. Free memory was 178.0 MB in the beginning and 176.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 477.80 ms. Allocated memory is still 201.9 MB. Free memory was 176.6 MB in the beginning and 149.7 MB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7159.87 ms. Allocated memory was 201.9 MB in the beginning and 301.5 MB in the end (delta: 99.6 MB). Free memory was 149.0 MB in the beginning and 158.1 MB in the end (delta: -9.1 MB). Peak memory consumption was 136.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 92]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 209]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 184]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 369]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 303]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 381]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 120]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 108]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 267]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 140]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 152]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 238]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 291]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 279]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 250]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 221]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: (main__cp + 1 <= main__urilen && 1 == __VERIFIER_assert__cond) && (((((1 == __VERIFIER_assert__cond && 1 <= main__cp) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) || ((((((!(0 == __VERIFIER_assert__cond) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond)) - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(0 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__c) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) && main__cp + 1 < main__urilen) || ((((((((((((((((!(0 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && main__c + 2 <= main__tokenlen) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) && main__cp + 1 < main__urilen) && main__c == 0) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (((main__cp + 1 == main__urilen && main__cp < main__urilen) && ((((((1 == __VERIFIER_assert__cond && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) || ((((((!(0 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)))) && 1 == __VERIFIER_assert__cond) || (((main__cp < main__urilen && ((((((1 == __VERIFIER_assert__cond && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) || ((((((!(0 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)))) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) - InvariantResult [Line: 225]: Loop Invariant Derived loop invariant: (((((((((((((((((!(0 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && main__c + 2 <= main__tokenlen) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && main__cp + 1 <= main__urilen) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) && main__c == 0) || (((((((((((((((((((!(0 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__c) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && main__cp + 1 <= main__urilen) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond)) || (((((((((((((((!(0 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && main__cp + 2 <= main__urilen) && 0 < main__scheme) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) && main__cp + 1 <= main__urilen) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) && main__c == 0) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: !(0 == __VERIFIER_assert__cond) - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 82 locations, 18 error locations. Result: SAFE, OverallTime: 7.0s, OverallIterations: 24, TraceHistogramMax: 2, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.3s, HoareTripleCheckerStatistics: 1307 SDtfs, 2367 SDslu, 1508 SDs, 0 SdLazy, 1173 SolverSat, 131 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 319 GetRequests, 179 SyntacticMatches, 15 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 291 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 16 NumberOfFragments, 513 HoareAnnotationTreeSize, 6 FomulaSimplifications, 56097 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 6 FomulaSimplificationsInter, 4363 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 845 NumberOfCodeBlocks, 845 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 817 ConstructedInterpolants, 0 QuantifiedInterpolants, 57314 SizeOfPredicates, 25 NumberOfNonLiveVariables, 483 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 28 InterpolantComputations, 21 PerfectInterpolantSequences, 16/33 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...