/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/AutomizerC.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-fb55353 [2019-11-06 21:22:13,808 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 21:22:13,811 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 21:22:13,832 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 21:22:13,832 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 21:22:13,833 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 21:22:13,835 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 21:22:13,847 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 21:22:13,849 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 21:22:13,850 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 21:22:13,851 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 21:22:13,852 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 21:22:13,852 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 21:22:13,853 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 21:22:13,854 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 21:22:13,855 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 21:22:13,856 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 21:22:13,857 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 21:22:13,858 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 21:22:13,860 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 21:22:13,862 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 21:22:13,867 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 21:22:13,869 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 21:22:13,870 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 21:22:13,874 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 21:22:13,874 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 21:22:13,874 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 21:22:13,876 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 21:22:13,877 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 21:22:13,880 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 21:22:13,881 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 21:22:13,882 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 21:22:13,883 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 21:22:13,884 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 21:22:13,888 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 21:22:13,888 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 21:22:13,889 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 21:22:13,889 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 21:22:13,889 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 21:22:13,892 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 21:22:13,893 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 21:22:13,894 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-06 21:22:13,911 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 21:22:13,911 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 21:22:13,913 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 21:22:13,913 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 21:22:13,913 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 21:22:13,914 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 21:22:13,914 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 21:22:13,914 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 21:22:13,914 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 21:22:13,914 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 21:22:13,915 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 21:22:13,915 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 21:22:13,915 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 21:22:13,915 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 21:22:13,915 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 21:22:13,916 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 21:22:13,916 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 21:22:13,916 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 21:22:13,916 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 21:22:13,916 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 21:22:13,917 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 21:22:13,917 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 21:22:13,917 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 21:22:13,917 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 21:22:13,917 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 21:22:13,918 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 21:22:13,918 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 21:22:13,918 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 21:22:13,918 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 21:22:14,247 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 21:22:14,269 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 21:22:14,272 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 21:22:14,274 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 21:22:14,274 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 21:22:14,275 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-06 21:22:14,340 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df4780e71/1adab6d0f9c5401e877b6dd38b1f663f/FLAGb27cc759c [2019-11-06 21:22:14,799 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 21:22:14,800 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2019-11-06 21:22:14,808 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df4780e71/1adab6d0f9c5401e877b6dd38b1f663f/FLAGb27cc759c [2019-11-06 21:22:15,161 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df4780e71/1adab6d0f9c5401e877b6dd38b1f663f [2019-11-06 21:22:15,171 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 21:22:15,172 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 21:22:15,173 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 21:22:15,174 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 21:22:15,177 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 21:22:15,178 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:22:15" (1/1) ... [2019-11-06 21:22:15,181 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4334376c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:15, skipping insertion in model container [2019-11-06 21:22:15,182 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:22:15" (1/1) ... [2019-11-06 21:22:15,189 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 21:22:15,232 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 21:22:15,422 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:22:15,428 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 21:22:15,476 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:22:15,492 INFO L192 MainTranslator]: Completed translation [2019-11-06 21:22:15,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:15 WrapperNode [2019-11-06 21:22:15,493 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 21:22:15,494 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 21:22:15,494 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 21:22:15,494 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 21:22:15,596 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:15" (1/1) ... [2019-11-06 21:22:15,596 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:15" (1/1) ... [2019-11-06 21:22:15,602 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:15" (1/1) ... [2019-11-06 21:22:15,603 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:15" (1/1) ... [2019-11-06 21:22:15,611 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:15" (1/1) ... [2019-11-06 21:22:15,616 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:15" (1/1) ... [2019-11-06 21:22:15,618 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:15" (1/1) ... [2019-11-06 21:22:15,621 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 21:22:15,622 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 21:22:15,622 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 21:22:15,622 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 21:22:15,623 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:15" (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-06 21:22:15,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 21:22:15,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 21:22:15,681 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 21:22:15,681 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 21:22:15,681 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-06 21:22:15,682 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-06 21:22:15,682 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 21:22:15,682 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 21:22:15,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 21:22:15,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 21:22:16,151 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 21:22:16,152 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-06 21:22:16,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:22:16 BoogieIcfgContainer [2019-11-06 21:22:16,154 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 21:22:16,155 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 21:22:16,155 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 21:22:16,160 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 21:22:16,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:22:15" (1/3) ... [2019-11-06 21:22:16,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a493922 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:22:16, skipping insertion in model container [2019-11-06 21:22:16,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:15" (2/3) ... [2019-11-06 21:22:16,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a493922 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:22:16, skipping insertion in model container [2019-11-06 21:22:16,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:22:16" (3/3) ... [2019-11-06 21:22:16,165 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c [2019-11-06 21:22:16,177 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 21:22:16,189 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2019-11-06 21:22:16,201 INFO L249 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2019-11-06 21:22:16,245 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 21:22:16,246 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 21:22:16,246 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 21:22:16,248 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 21:22:16,248 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 21:22:16,248 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 21:22:16,249 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 21:22:16,249 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 21:22:16,292 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2019-11-06 21:22:16,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-06 21:22:16,301 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:16,302 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-06 21:22:16,304 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:16,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:16,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1637525138, now seen corresponding path program 1 times [2019-11-06 21:22:16,317 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:16,318 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791959792] [2019-11-06 21:22:16,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:16,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:16,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:16,525 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-06 21:22:16,526 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791959792] [2019-11-06 21:22:16,527 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:16,528 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 21:22:16,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253365975] [2019-11-06 21:22:16,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 21:22:16,537 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:16,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 21:22:16,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 21:22:16,554 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 4 states. [2019-11-06 21:22:16,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:16,705 INFO L93 Difference]: Finished difference Result 93 states and 129 transitions. [2019-11-06 21:22:16,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 21:22:16,707 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-11-06 21:22:16,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:16,717 INFO L225 Difference]: With dead ends: 93 [2019-11-06 21:22:16,718 INFO L226 Difference]: Without dead ends: 80 [2019-11-06 21:22:16,720 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-06 21:22:16,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-06 21:22:16,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-11-06 21:22:16,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-06 21:22:16,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2019-11-06 21:22:16,771 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 19 [2019-11-06 21:22:16,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:16,772 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2019-11-06 21:22:16,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 21:22:16,772 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2019-11-06 21:22:16,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-06 21:22:16,773 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:16,774 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] [2019-11-06 21:22:16,775 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:16,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:16,775 INFO L82 PathProgramCache]: Analyzing trace with hash 776331368, now seen corresponding path program 1 times [2019-11-06 21:22:16,776 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:16,776 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376679676] [2019-11-06 21:22:16,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:16,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:16,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:16,899 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-06 21:22:16,900 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376679676] [2019-11-06 21:22:16,900 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:16,900 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-06 21:22:16,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642733569] [2019-11-06 21:22:16,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 21:22:16,904 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:16,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 21:22:16,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-06 21:22:16,908 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 7 states. [2019-11-06 21:22:17,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:17,143 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2019-11-06 21:22:17,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 21:22:17,144 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-11-06 21:22:17,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:17,146 INFO L225 Difference]: With dead ends: 80 [2019-11-06 21:22:17,146 INFO L226 Difference]: Without dead ends: 78 [2019-11-06 21:22:17,147 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-11-06 21:22:17,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-06 21:22:17,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-11-06 21:22:17,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-06 21:22:17,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2019-11-06 21:22:17,171 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 20 [2019-11-06 21:22:17,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:17,171 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2019-11-06 21:22:17,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 21:22:17,172 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2019-11-06 21:22:17,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-06 21:22:17,173 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:17,173 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-06 21:22:17,173 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:17,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:17,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1269768629, now seen corresponding path program 1 times [2019-11-06 21:22:17,174 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:17,175 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821577045] [2019-11-06 21:22:17,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:17,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:17,248 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-06 21:22:17,248 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821577045] [2019-11-06 21:22:17,248 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:17,249 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 21:22:17,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113914009] [2019-11-06 21:22:17,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 21:22:17,255 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:17,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 21:22:17,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 21:22:17,256 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 5 states. [2019-11-06 21:22:17,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:17,474 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2019-11-06 21:22:17,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:22:17,474 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-06 21:22:17,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:17,476 INFO L225 Difference]: With dead ends: 101 [2019-11-06 21:22:17,476 INFO L226 Difference]: Without dead ends: 99 [2019-11-06 21:22:17,477 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-06 21:22:17,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-06 21:22:17,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 76. [2019-11-06 21:22:17,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-06 21:22:17,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2019-11-06 21:22:17,486 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 22 [2019-11-06 21:22:17,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:17,487 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2019-11-06 21:22:17,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 21:22:17,487 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2019-11-06 21:22:17,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-06 21:22:17,488 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:17,488 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-06 21:22:17,489 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:17,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:17,489 INFO L82 PathProgramCache]: Analyzing trace with hash -708118726, now seen corresponding path program 1 times [2019-11-06 21:22:17,490 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:17,490 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401620610] [2019-11-06 21:22:17,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:17,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:17,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:17,589 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-06 21:22:17,589 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401620610] [2019-11-06 21:22:17,589 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:17,590 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:17,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485802459] [2019-11-06 21:22:17,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:17,591 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:17,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:17,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:17,592 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 6 states. [2019-11-06 21:22:17,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:17,757 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-11-06 21:22:17,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:22:17,757 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-11-06 21:22:17,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:17,759 INFO L225 Difference]: With dead ends: 76 [2019-11-06 21:22:17,759 INFO L226 Difference]: Without dead ends: 74 [2019-11-06 21:22:17,759 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-06 21:22:17,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-06 21:22:17,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-06 21:22:17,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-06 21:22:17,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2019-11-06 21:22:17,778 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 23 [2019-11-06 21:22:17,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:17,778 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2019-11-06 21:22:17,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:17,782 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2019-11-06 21:22:17,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-06 21:22:17,783 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:17,783 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-06 21:22:17,785 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:17,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:17,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1317531748, now seen corresponding path program 1 times [2019-11-06 21:22:17,785 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:17,786 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775702655] [2019-11-06 21:22:17,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:17,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:17,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:17,867 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-06 21:22:17,868 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775702655] [2019-11-06 21:22:17,868 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:17,868 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:17,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553906044] [2019-11-06 21:22:17,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:17,869 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:17,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:17,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:17,870 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 6 states. [2019-11-06 21:22:18,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:18,326 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2019-11-06 21:22:18,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 21:22:18,326 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-11-06 21:22:18,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:18,328 INFO L225 Difference]: With dead ends: 141 [2019-11-06 21:22:18,328 INFO L226 Difference]: Without dead ends: 139 [2019-11-06 21:22:18,329 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-11-06 21:22:18,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-11-06 21:22:18,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 77. [2019-11-06 21:22:18,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-06 21:22:18,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2019-11-06 21:22:18,338 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 26 [2019-11-06 21:22:18,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:18,339 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2019-11-06 21:22:18,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:18,339 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2019-11-06 21:22:18,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-06 21:22:18,340 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:18,340 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-06 21:22:18,341 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:18,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:18,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1321265557, now seen corresponding path program 1 times [2019-11-06 21:22:18,342 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:18,342 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176516798] [2019-11-06 21:22:18,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:18,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:18,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:18,455 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-06 21:22:18,455 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176516798] [2019-11-06 21:22:18,456 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:18,456 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:18,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004726047] [2019-11-06 21:22:18,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:18,457 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:18,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:18,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:18,458 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 6 states. [2019-11-06 21:22:18,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:18,780 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2019-11-06 21:22:18,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 21:22:18,781 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-11-06 21:22:18,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:18,783 INFO L225 Difference]: With dead ends: 108 [2019-11-06 21:22:18,783 INFO L226 Difference]: Without dead ends: 106 [2019-11-06 21:22:18,784 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-11-06 21:22:18,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-06 21:22:18,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 79. [2019-11-06 21:22:18,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-06 21:22:18,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2019-11-06 21:22:18,792 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 26 [2019-11-06 21:22:18,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:18,793 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2019-11-06 21:22:18,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:18,793 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2019-11-06 21:22:18,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-06 21:22:18,794 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:18,794 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-06 21:22:18,795 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:18,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:18,795 INFO L82 PathProgramCache]: Analyzing trace with hash -2106185532, now seen corresponding path program 1 times [2019-11-06 21:22:18,795 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:18,796 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834746177] [2019-11-06 21:22:18,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:18,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:18,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:18,875 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-06 21:22:18,877 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834746177] [2019-11-06 21:22:18,877 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:18,877 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:18,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061103874] [2019-11-06 21:22:18,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:18,878 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:18,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:18,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:18,879 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 6 states. [2019-11-06 21:22:19,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:19,112 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2019-11-06 21:22:19,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:22:19,113 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-11-06 21:22:19,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:19,114 INFO L225 Difference]: With dead ends: 121 [2019-11-06 21:22:19,114 INFO L226 Difference]: Without dead ends: 119 [2019-11-06 21:22:19,115 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-06 21:22:19,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-11-06 21:22:19,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 77. [2019-11-06 21:22:19,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-06 21:22:19,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2019-11-06 21:22:19,123 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 27 [2019-11-06 21:22:19,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:19,123 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2019-11-06 21:22:19,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:19,123 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2019-11-06 21:22:19,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-06 21:22:19,124 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:19,124 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-06 21:22:19,125 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:19,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:19,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1990437563, now seen corresponding path program 1 times [2019-11-06 21:22:19,126 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:19,126 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656316496] [2019-11-06 21:22:19,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:19,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:19,222 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-06 21:22:19,223 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656316496] [2019-11-06 21:22:19,223 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:19,223 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:19,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474504972] [2019-11-06 21:22:19,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:19,227 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:19,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:19,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:19,227 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 6 states. [2019-11-06 21:22:19,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:19,421 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2019-11-06 21:22:19,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:22:19,422 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-11-06 21:22:19,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:19,423 INFO L225 Difference]: With dead ends: 77 [2019-11-06 21:22:19,424 INFO L226 Difference]: Without dead ends: 75 [2019-11-06 21:22:19,424 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-06 21:22:19,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-06 21:22:19,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-11-06 21:22:19,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-06 21:22:19,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2019-11-06 21:22:19,432 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 27 [2019-11-06 21:22:19,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:19,432 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2019-11-06 21:22:19,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:19,432 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2019-11-06 21:22:19,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-06 21:22:19,433 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:19,433 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] [2019-11-06 21:22:19,434 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:19,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:19,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1549950965, now seen corresponding path program 1 times [2019-11-06 21:22:19,435 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:19,435 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959682034] [2019-11-06 21:22:19,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:19,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:19,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:19,495 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-06 21:22:19,495 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959682034] [2019-11-06 21:22:19,496 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:19,496 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 21:22:19,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959378599] [2019-11-06 21:22:19,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 21:22:19,497 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:19,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 21:22:19,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 21:22:19,497 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 4 states. [2019-11-06 21:22:19,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:19,643 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2019-11-06 21:22:19,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 21:22:19,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-11-06 21:22:19,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:19,645 INFO L225 Difference]: With dead ends: 115 [2019-11-06 21:22:19,645 INFO L226 Difference]: Without dead ends: 75 [2019-11-06 21:22:19,646 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-06 21:22:19,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-06 21:22:19,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-11-06 21:22:19,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-06 21:22:19,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2019-11-06 21:22:19,652 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 29 [2019-11-06 21:22:19,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:19,652 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2019-11-06 21:22:19,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 21:22:19,652 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2019-11-06 21:22:19,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-06 21:22:19,653 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:19,654 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-06 21:22:19,654 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:19,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:19,655 INFO L82 PathProgramCache]: Analyzing trace with hash 54388864, now seen corresponding path program 1 times [2019-11-06 21:22:19,655 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:19,655 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630337678] [2019-11-06 21:22:19,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:19,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:19,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:19,740 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-06 21:22:19,740 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630337678] [2019-11-06 21:22:19,740 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:19,741 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:19,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651936160] [2019-11-06 21:22:19,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:19,742 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:19,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:19,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:19,743 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand 6 states. [2019-11-06 21:22:19,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:19,909 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-11-06 21:22:19,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 21:22:19,912 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-11-06 21:22:19,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:19,913 INFO L225 Difference]: With dead ends: 76 [2019-11-06 21:22:19,913 INFO L226 Difference]: Without dead ends: 74 [2019-11-06 21:22:19,914 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-11-06 21:22:19,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-06 21:22:19,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-11-06 21:22:19,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-06 21:22:19,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2019-11-06 21:22:19,919 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 30 [2019-11-06 21:22:19,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:19,920 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2019-11-06 21:22:19,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:19,920 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2019-11-06 21:22:19,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-06 21:22:19,921 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:19,921 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] [2019-11-06 21:22:19,922 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:19,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:19,922 INFO L82 PathProgramCache]: Analyzing trace with hash -196719107, now seen corresponding path program 1 times [2019-11-06 21:22:19,922 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:19,923 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254171731] [2019-11-06 21:22:19,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:19,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:19,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:19,998 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-06 21:22:19,999 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254171731] [2019-11-06 21:22:19,999 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933790216] [2019-11-06 21:22:19,999 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-06 21:22:20,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:20,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-06 21:22:20,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:22:20,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:22:20,146 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-06 21:22:20,147 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:22:20,147 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2019-11-06 21:22:20,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434826924] [2019-11-06 21:22:20,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-06 21:22:20,148 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:20,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-06 21:22:20,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-06 21:22:20,149 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 9 states. [2019-11-06 21:22:20,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:20,424 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2019-11-06 21:22:20,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 21:22:20,425 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2019-11-06 21:22:20,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:20,426 INFO L225 Difference]: With dead ends: 111 [2019-11-06 21:22:20,426 INFO L226 Difference]: Without dead ends: 109 [2019-11-06 21:22:20,427 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-11-06 21:22:20,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-06 21:22:20,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 70. [2019-11-06 21:22:20,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-06 21:22:20,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2019-11-06 21:22:20,433 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 30 [2019-11-06 21:22:20,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:20,433 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2019-11-06 21:22:20,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-06 21:22:20,433 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2019-11-06 21:22:20,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-06 21:22:20,434 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:20,434 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-06 21:22:20,645 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:22:20,646 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:20,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:20,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1686057932, now seen corresponding path program 1 times [2019-11-06 21:22:20,647 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:20,647 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484228448] [2019-11-06 21:22:20,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:20,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:20,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:20,701 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-06 21:22:20,701 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484228448] [2019-11-06 21:22:20,702 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:20,702 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:20,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259920719] [2019-11-06 21:22:20,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:20,703 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:20,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:20,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:20,703 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 6 states. [2019-11-06 21:22:20,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:20,838 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-11-06 21:22:20,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:22:20,838 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-11-06 21:22:20,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:20,839 INFO L225 Difference]: With dead ends: 70 [2019-11-06 21:22:20,839 INFO L226 Difference]: Without dead ends: 68 [2019-11-06 21:22:20,840 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-06 21:22:20,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-06 21:22:20,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-06 21:22:20,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-06 21:22:20,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2019-11-06 21:22:20,845 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 31 [2019-11-06 21:22:20,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:20,846 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2019-11-06 21:22:20,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:20,846 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2019-11-06 21:22:20,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-06 21:22:20,847 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:20,847 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, 1, 1, 1, 1] [2019-11-06 21:22:20,847 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:20,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:20,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1806773561, now seen corresponding path program 1 times [2019-11-06 21:22:20,848 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:20,848 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128335378] [2019-11-06 21:22:20,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:20,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:20,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:20,938 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-06 21:22:20,939 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128335378] [2019-11-06 21:22:20,939 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238734331] [2019-11-06 21:22:20,939 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-06 21:22:20,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:20,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-06 21:22:20,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:22:21,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:22:21,036 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-06 21:22:21,036 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:22:21,036 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2019-11-06 21:22:21,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960850416] [2019-11-06 21:22:21,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-06 21:22:21,037 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:21,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-06 21:22:21,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-06 21:22:21,038 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 9 states. [2019-11-06 21:22:21,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:21,253 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2019-11-06 21:22:21,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 21:22:21,256 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-11-06 21:22:21,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:21,257 INFO L225 Difference]: With dead ends: 69 [2019-11-06 21:22:21,257 INFO L226 Difference]: Without dead ends: 67 [2019-11-06 21:22:21,258 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-11-06 21:22:21,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-06 21:22:21,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2019-11-06 21:22:21,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-06 21:22:21,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2019-11-06 21:22:21,263 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 31 [2019-11-06 21:22:21,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:21,263 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2019-11-06 21:22:21,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-06 21:22:21,263 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2019-11-06 21:22:21,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-06 21:22:21,264 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:21,265 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-06 21:22:21,469 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:22:21,470 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:21,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:21,470 INFO L82 PathProgramCache]: Analyzing trace with hash -287576151, now seen corresponding path program 1 times [2019-11-06 21:22:21,470 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:21,471 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883001695] [2019-11-06 21:22:21,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:21,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:21,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:21,545 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-06 21:22:21,546 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883001695] [2019-11-06 21:22:21,546 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:21,546 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:21,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466649204] [2019-11-06 21:22:21,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:21,547 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:21,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:21,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:21,548 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 6 states. [2019-11-06 21:22:21,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:21,696 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2019-11-06 21:22:21,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 21:22:21,697 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-11-06 21:22:21,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:21,697 INFO L225 Difference]: With dead ends: 63 [2019-11-06 21:22:21,697 INFO L226 Difference]: Without dead ends: 61 [2019-11-06 21:22:21,698 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-11-06 21:22:21,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-06 21:22:21,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-11-06 21:22:21,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-06 21:22:21,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-11-06 21:22:21,702 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 34 [2019-11-06 21:22:21,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:21,703 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-11-06 21:22:21,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:21,703 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-11-06 21:22:21,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-06 21:22:21,703 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:21,704 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-06 21:22:21,704 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:21,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:21,705 INFO L82 PathProgramCache]: Analyzing trace with hash -324922921, now seen corresponding path program 1 times [2019-11-06 21:22:21,705 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:21,705 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865307782] [2019-11-06 21:22:21,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:21,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:21,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:21,769 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-06 21:22:21,769 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865307782] [2019-11-06 21:22:21,770 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:21,770 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-06 21:22:21,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426962407] [2019-11-06 21:22:21,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-06 21:22:21,771 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:21,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-06 21:22:21,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:22:21,771 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 8 states. [2019-11-06 21:22:21,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:21,944 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2019-11-06 21:22:21,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 21:22:21,944 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2019-11-06 21:22:21,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:21,945 INFO L225 Difference]: With dead ends: 71 [2019-11-06 21:22:21,945 INFO L226 Difference]: Without dead ends: 69 [2019-11-06 21:22:21,946 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-11-06 21:22:21,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-06 21:22:21,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2019-11-06 21:22:21,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-06 21:22:21,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2019-11-06 21:22:21,950 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 35 [2019-11-06 21:22:21,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:21,950 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2019-11-06 21:22:21,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-06 21:22:21,951 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2019-11-06 21:22:21,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-06 21:22:21,951 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:21,951 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-06 21:22:21,952 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:21,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:21,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1080633106, now seen corresponding path program 1 times [2019-11-06 21:22:21,952 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:21,953 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342625756] [2019-11-06 21:22:21,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:21,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:22,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:22,004 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-06 21:22:22,005 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342625756] [2019-11-06 21:22:22,005 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:22,005 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:22,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547155578] [2019-11-06 21:22:22,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:22,006 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:22,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:22,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:22,007 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 6 states. [2019-11-06 21:22:22,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:22,269 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2019-11-06 21:22:22,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 21:22:22,269 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-11-06 21:22:22,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:22,270 INFO L225 Difference]: With dead ends: 91 [2019-11-06 21:22:22,270 INFO L226 Difference]: Without dead ends: 89 [2019-11-06 21:22:22,271 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-11-06 21:22:22,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-06 21:22:22,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2019-11-06 21:22:22,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-06 21:22:22,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2019-11-06 21:22:22,276 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 38 [2019-11-06 21:22:22,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:22,276 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2019-11-06 21:22:22,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:22,276 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2019-11-06 21:22:22,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-06 21:22:22,277 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:22,277 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-06 21:22:22,278 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:22,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:22,278 INFO L82 PathProgramCache]: Analyzing trace with hash -860108895, now seen corresponding path program 1 times [2019-11-06 21:22:22,278 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:22,278 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481837999] [2019-11-06 21:22:22,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:22,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:22,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:22,327 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-06 21:22:22,327 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481837999] [2019-11-06 21:22:22,328 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:22,328 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:22,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878609001] [2019-11-06 21:22:22,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:22,329 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:22,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:22,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:22,329 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 6 states. [2019-11-06 21:22:22,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:22,513 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2019-11-06 21:22:22,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:22:22,514 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-11-06 21:22:22,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:22,515 INFO L225 Difference]: With dead ends: 61 [2019-11-06 21:22:22,515 INFO L226 Difference]: Without dead ends: 59 [2019-11-06 21:22:22,516 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-06 21:22:22,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-06 21:22:22,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-11-06 21:22:22,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-06 21:22:22,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2019-11-06 21:22:22,521 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 39 [2019-11-06 21:22:22,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:22,521 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2019-11-06 21:22:22,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:22,522 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2019-11-06 21:22:22,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-06 21:22:22,522 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:22,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, 1, 1] [2019-11-06 21:22:22,523 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:22,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:22,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1930828060, now seen corresponding path program 1 times [2019-11-06 21:22:22,523 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:22,523 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63143100] [2019-11-06 21:22:22,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:22,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:22,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:22,610 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-06 21:22:22,611 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63143100] [2019-11-06 21:22:22,611 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:22,611 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:22,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764908081] [2019-11-06 21:22:22,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:22,612 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:22,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:22,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:22,612 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 6 states. [2019-11-06 21:22:22,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:22,777 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-11-06 21:22:22,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:22:22,777 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-11-06 21:22:22,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:22,778 INFO L225 Difference]: With dead ends: 70 [2019-11-06 21:22:22,778 INFO L226 Difference]: Without dead ends: 68 [2019-11-06 21:22:22,779 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-06 21:22:22,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-06 21:22:22,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-11-06 21:22:22,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-06 21:22:22,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-11-06 21:22:22,785 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 41 [2019-11-06 21:22:22,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:22,785 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-11-06 21:22:22,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:22,786 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-11-06 21:22:22,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-06 21:22:22,786 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:22,786 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, 1, 1] [2019-11-06 21:22:22,787 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:22,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:22,787 INFO L82 PathProgramCache]: Analyzing trace with hash 273875486, now seen corresponding path program 1 times [2019-11-06 21:22:22,787 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:22,787 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601606026] [2019-11-06 21:22:22,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:22,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:22,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:22,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-06 21:22:22,840 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601606026] [2019-11-06 21:22:22,840 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:22,840 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:22,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093143404] [2019-11-06 21:22:22,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:22,841 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:22,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:22,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:22,842 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 6 states. [2019-11-06 21:22:23,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:23,012 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2019-11-06 21:22:23,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:22:23,012 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-11-06 21:22:23,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:23,013 INFO L225 Difference]: With dead ends: 68 [2019-11-06 21:22:23,013 INFO L226 Difference]: Without dead ends: 66 [2019-11-06 21:22:23,013 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-06 21:22:23,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-06 21:22:23,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-11-06 21:22:23,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-06 21:22:23,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-11-06 21:22:23,019 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 42 [2019-11-06 21:22:23,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:23,019 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-11-06 21:22:23,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:23,019 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-11-06 21:22:23,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-06 21:22:23,020 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:23,020 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, 1, 1, 1] [2019-11-06 21:22:23,020 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:23,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:23,021 INFO L82 PathProgramCache]: Analyzing trace with hash -99791318, now seen corresponding path program 1 times [2019-11-06 21:22:23,021 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:23,021 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482294595] [2019-11-06 21:22:23,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:23,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:23,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:23,081 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-06 21:22:23,082 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482294595] [2019-11-06 21:22:23,082 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:23,082 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:23,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058891661] [2019-11-06 21:22:23,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:23,083 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:23,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:23,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:23,083 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 6 states. [2019-11-06 21:22:23,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:23,386 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2019-11-06 21:22:23,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 21:22:23,387 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-11-06 21:22:23,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:23,388 INFO L225 Difference]: With dead ends: 90 [2019-11-06 21:22:23,388 INFO L226 Difference]: Without dead ends: 88 [2019-11-06 21:22:23,389 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-11-06 21:22:23,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-06 21:22:23,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 69. [2019-11-06 21:22:23,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-06 21:22:23,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2019-11-06 21:22:23,395 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 43 [2019-11-06 21:22:23,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:23,396 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2019-11-06 21:22:23,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:23,396 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2019-11-06 21:22:23,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-06 21:22:23,397 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:23,397 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, 1, 1, 1, 1] [2019-11-06 21:22:23,398 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:23,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:23,399 INFO L82 PathProgramCache]: Analyzing trace with hash 2020599801, now seen corresponding path program 1 times [2019-11-06 21:22:23,399 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:23,399 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018985946] [2019-11-06 21:22:23,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:23,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:23,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:23,551 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-06 21:22:23,552 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018985946] [2019-11-06 21:22:23,552 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540292484] [2019-11-06 21:22:23,552 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-06 21:22:23,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:23,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-06 21:22:23,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:22:23,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:22:23,718 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-06 21:22:23,718 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:22:23,718 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2019-11-06 21:22:23,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593392734] [2019-11-06 21:22:23,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-06 21:22:23,719 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:23,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-06 21:22:23,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-06 21:22:23,720 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 9 states. [2019-11-06 21:22:23,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:23,969 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2019-11-06 21:22:23,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 21:22:23,970 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2019-11-06 21:22:23,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:23,971 INFO L225 Difference]: With dead ends: 70 [2019-11-06 21:22:23,971 INFO L226 Difference]: Without dead ends: 68 [2019-11-06 21:22:23,971 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 41 SyntacticMatches, 9 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-11-06 21:22:23,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-06 21:22:23,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-11-06 21:22:23,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-06 21:22:23,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-11-06 21:22:23,977 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 44 [2019-11-06 21:22:23,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:23,977 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-11-06 21:22:23,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-06 21:22:23,978 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-11-06 21:22:23,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-06 21:22:23,978 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:23,978 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, 1, 1, 1, 1] [2019-11-06 21:22:24,186 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:22:24,187 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:24,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:24,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1201439652, now seen corresponding path program 1 times [2019-11-06 21:22:24,189 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:24,189 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919357127] [2019-11-06 21:22:24,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:24,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:24,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:24,254 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-06 21:22:24,254 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919357127] [2019-11-06 21:22:24,254 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:24,254 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:24,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565853318] [2019-11-06 21:22:24,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:24,255 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:24,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:24,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:24,256 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 6 states. [2019-11-06 21:22:24,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:24,436 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-11-06 21:22:24,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:22:24,439 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2019-11-06 21:22:24,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:24,439 INFO L225 Difference]: With dead ends: 71 [2019-11-06 21:22:24,440 INFO L226 Difference]: Without dead ends: 69 [2019-11-06 21:22:24,440 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-06 21:22:24,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-06 21:22:24,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2019-11-06 21:22:24,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-06 21:22:24,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-11-06 21:22:24,445 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 44 [2019-11-06 21:22:24,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:24,445 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-11-06 21:22:24,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:24,445 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-11-06 21:22:24,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-06 21:22:24,446 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:24,446 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, 1, 1, 1, 1] [2019-11-06 21:22:24,446 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:24,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:24,447 INFO L82 PathProgramCache]: Analyzing trace with hash 40764835, now seen corresponding path program 1 times [2019-11-06 21:22:24,447 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:24,447 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113405749] [2019-11-06 21:22:24,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:24,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:24,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:24,514 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-06 21:22:24,515 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113405749] [2019-11-06 21:22:24,515 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:24,515 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:24,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176342438] [2019-11-06 21:22:24,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:24,516 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:24,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:24,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:24,517 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 6 states. [2019-11-06 21:22:24,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:24,885 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2019-11-06 21:22:24,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 21:22:24,886 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2019-11-06 21:22:24,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:24,887 INFO L225 Difference]: With dead ends: 77 [2019-11-06 21:22:24,887 INFO L226 Difference]: Without dead ends: 75 [2019-11-06 21:22:24,887 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-11-06 21:22:24,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-06 21:22:24,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 55. [2019-11-06 21:22:24,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-06 21:22:24,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2019-11-06 21:22:24,894 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 49 [2019-11-06 21:22:24,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:24,894 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2019-11-06 21:22:24,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:24,894 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2019-11-06 21:22:24,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-06 21:22:24,895 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:24,895 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, 1, 1, 1, 1] [2019-11-06 21:22:24,896 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:24,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:24,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1664106253, now seen corresponding path program 1 times [2019-11-06 21:22:24,897 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:24,897 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309451174] [2019-11-06 21:22:24,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:24,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:25,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:25,052 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-06 21:22:25,052 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309451174] [2019-11-06 21:22:25,053 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67263069] [2019-11-06 21:22:25,053 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-06 21:22:25,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:25,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-06 21:22:25,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:22:25,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:22:25,200 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-06 21:22:25,201 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 21:22:25,201 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2019-11-06 21:22:25,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152792900] [2019-11-06 21:22:25,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 21:22:25,204 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:25,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 21:22:25,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-06 21:22:25,205 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 4 states. [2019-11-06 21:22:25,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:25,255 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2019-11-06 21:22:25,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 21:22:25,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-11-06 21:22:25,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:25,256 INFO L225 Difference]: With dead ends: 60 [2019-11-06 21:22:25,257 INFO L226 Difference]: Without dead ends: 0 [2019-11-06 21:22:25,258 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:22:25,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-06 21:22:25,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-06 21:22:25,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-06 21:22:25,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-06 21:22:25,259 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2019-11-06 21:22:25,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:25,259 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-06 21:22:25,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 21:22:25,259 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-06 21:22:25,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-06 21:22:25,465 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:22:25,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-06 21:22:25,762 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 112 [2019-11-06 21:22:26,271 WARN L191 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 76 [2019-11-06 21:22:26,527 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2019-11-06 21:22:26,945 WARN L191 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 73 [2019-11-06 21:22:27,124 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 33 [2019-11-06 21:22:27,135 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-11-06 21:22:27,135 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|)) [2019-11-06 21:22:27,136 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-06 21:22:27,136 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-06 21:22:27,136 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-11-06 21:22:27,136 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-06 21:22:27,136 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-06 21:22:27,136 INFO L443 ceAbstractionStarter]: For program point L60(lines 60 412) no Hoare annotation was computed. [2019-11-06 21:22:27,136 INFO L443 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2019-11-06 21:22:27,137 INFO L443 ceAbstractionStarter]: For program point L250(line 250) no Hoare annotation was computed. [2019-11-06 21:22:27,137 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 8 434) no Hoare annotation was computed. [2019-11-06 21:22:27,137 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-06 21:22:27,137 INFO L443 ceAbstractionStarter]: For program point L118(lines 118 398) no Hoare annotation was computed. [2019-11-06 21:22:27,137 INFO L443 ceAbstractionStarter]: For program point L209(line 209) no Hoare annotation was computed. [2019-11-06 21:22:27,137 INFO L443 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 303) no Hoare annotation was computed. [2019-11-06 21:22:27,137 INFO L443 ceAbstractionStarter]: For program point L267(line 267) no Hoare annotation was computed. [2019-11-06 21:22:27,137 INFO L443 ceAbstractionStarter]: For program point L36(lines 36 430) no Hoare annotation was computed. [2019-11-06 21:22:27,137 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 108) no Hoare annotation was computed. [2019-11-06 21:22:27,137 INFO L443 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2019-11-06 21:22:27,137 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 390) no Hoare annotation was computed. [2019-11-06 21:22:27,137 INFO L443 ceAbstractionStarter]: For program point L78(lines 78 409) no Hoare annotation was computed. [2019-11-06 21:22:27,137 INFO L443 ceAbstractionStarter]: For program point L301(lines 301 311) no Hoare annotation was computed. [2019-11-06 21:22:27,138 INFO L443 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 238) no Hoare annotation was computed. [2019-11-06 21:22:27,138 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 92) no Hoare annotation was computed. [2019-11-06 21:22:27,138 INFO L443 ceAbstractionStarter]: For program point L219(lines 219 339) no Hoare annotation was computed. [2019-11-06 21:22:27,138 INFO L443 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-11-06 21:22:27,138 INFO L443 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 221) no Hoare annotation was computed. [2019-11-06 21:22:27,138 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 427) no Hoare annotation was computed. [2019-11-06 21:22:27,138 INFO L439 ceAbstractionStarter]: At program point L310(lines 225 339) the Hoare annotation is: (let ((.cse5 (= 0 main_~main__c~0)) (.cse0 (<= 2 main_~main__cp~0)) (.cse4 (and (and (and (not (= main_~__VERIFIER_assert__cond~6 0)) (and (= main_~__VERIFIER_assert__cond~3 1) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~2 0)) (not (= main_~__VERIFIER_assert__cond~1 0)) (<= 0 main_~main__scheme~0) (not (= main_~__VERIFIER_assert__cond~0 0))) (not (= main_~__VERIFIER_assert__cond~5 0)) (<= (+ main_~main__cp~0 1) main_~main__urilen~0)) (= main_~__VERIFIER_assert__cond~4 1) (not (= main_~__VERIFIER_assert__cond~7 0))) (not (= main_~__VERIFIER_assert__cond~8 0)))) (.cse7 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse8 (= main_~__VERIFIER_assert__cond~10 1)) (.cse6 (= ~__return_375~0 |old(~__return_375~0)|)) (.cse1 (< 0 main_~main__scheme~0)) (.cse2 (= main_~__VERIFIER_assert__cond~9 1)) (.cse3 (= main_~__VERIFIER_assert__cond~0 1))) (or (and .cse0 .cse1 (<= (+ main_~main__cp~0 2) main_~main__urilen~0) .cse2 .cse3 .cse4 (= main_~__VERIFIER_assert__cond~8 1) .cse5 .cse6) (and .cse0 (<= (+ main_~main__c~0 2) main_~main__tokenlen~0) .cse4 .cse7 .cse8 .cse5 .cse6 .cse1 .cse2 .cse3) (and .cse0 (<= 1 main_~main__c~0) (not (= main_~__VERIFIER_assert__cond~15 0)) .cse4 .cse7 .cse8 (not (= main_~__VERIFIER_assert__cond~13 0)) .cse6 (not (= main_~__VERIFIER_assert__cond~14 0)) .cse1 .cse2 .cse3 (= main_~__VERIFIER_assert__cond~12 1)))) [2019-11-06 21:22:27,138 INFO L443 ceAbstractionStarter]: For program point L277(lines 277 315) no Hoare annotation was computed. [2019-11-06 21:22:27,138 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 8 434) no Hoare annotation was computed. [2019-11-06 21:22:27,138 INFO L443 ceAbstractionStarter]: For program point L236(lines 236 326) no Hoare annotation was computed. [2019-11-06 21:22:27,139 INFO L443 ceAbstractionStarter]: For program point L170(lines 170 352) no Hoare annotation was computed. [2019-11-06 21:22:27,139 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 431) no Hoare annotation was computed. [2019-11-06 21:22:27,139 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 8 434) the Hoare annotation is: (= ~__return_375~0 |old(~__return_375~0)|) [2019-11-06 21:22:27,139 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 140) no Hoare annotation was computed. [2019-11-06 21:22:27,139 INFO L443 ceAbstractionStarter]: For program point L369(line 369) no Hoare annotation was computed. [2019-11-06 21:22:27,139 INFO L443 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2019-11-06 21:22:27,139 INFO L443 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 267) no Hoare annotation was computed. [2019-11-06 21:22:27,139 INFO L443 ceAbstractionStarter]: For program point L303(line 303) no Hoare annotation was computed. [2019-11-06 21:22:27,140 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 357) no Hoare annotation was computed. [2019-11-06 21:22:27,140 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 333) no Hoare annotation was computed. [2019-11-06 21:22:27,140 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 392) no Hoare annotation was computed. [2019-11-06 21:22:27,140 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 120) no Hoare annotation was computed. [2019-11-06 21:22:27,140 INFO L443 ceAbstractionStarter]: For program point L221(line 221) no Hoare annotation was computed. [2019-11-06 21:22:27,140 INFO L443 ceAbstractionStarter]: For program point L56(lines 56 422) no Hoare annotation was computed. [2019-11-06 21:22:27,140 INFO L443 ceAbstractionStarter]: For program point L279(line 279) no Hoare annotation was computed. [2019-11-06 21:22:27,140 INFO L443 ceAbstractionStarter]: For program point L48(lines 48 428) no Hoare annotation was computed. [2019-11-06 21:22:27,140 INFO L443 ceAbstractionStarter]: For program point L238(line 238) no Hoare annotation was computed. [2019-11-06 21:22:27,140 INFO L443 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 250) no Hoare annotation was computed. [2019-11-06 21:22:27,140 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-06 21:22:27,140 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 400) no Hoare annotation was computed. [2019-11-06 21:22:27,141 INFO L439 ceAbstractionStarter]: At program point L387(lines 124 398) the Hoare annotation is: (and (let ((.cse0 (= main_~__VERIFIER_assert__cond~3 1)) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (< 0 main_~main__scheme~0)) (.cse3 (<= 1 main_~main__cp~0)) (.cse4 (= main_~__VERIFIER_assert__cond~0 1))) (or (and .cse0 (not (= main_~__VERIFIER_assert__cond~17 0)) (<= (+ main_~main__cp~0 1) main_~main__urilen~0) .cse1 (= main_~__VERIFIER_assert__cond~16 1) .cse2 .cse3 .cse4 (not (= main_~__VERIFIER_assert__cond~2 0))) (and .cse0 .cse1 .cse2 (= main_~__VERIFIER_assert__cond~2 1) .cse3 (< main_~main__cp~0 main_~main__urilen~0) .cse4))) (= ~__return_375~0 |old(~__return_375~0)|)) [2019-11-06 21:22:27,141 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 349) no Hoare annotation was computed. [2019-11-06 21:22:27,141 INFO L443 ceAbstractionStarter]: For program point L379(lines 379 388) no Hoare annotation was computed. [2019-11-06 21:22:27,141 INFO L443 ceAbstractionStarter]: For program point L90(lines 90 407) no Hoare annotation was computed. [2019-11-06 21:22:27,141 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2019-11-06 21:22:27,141 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 432) no Hoare annotation was computed. [2019-11-06 21:22:27,141 INFO L443 ceAbstractionStarter]: For program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 381) no Hoare annotation was computed. [2019-11-06 21:22:27,141 INFO L443 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 291) no Hoare annotation was computed. [2019-11-06 21:22:27,141 INFO L443 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2019-11-06 21:22:27,142 INFO L439 ceAbstractionStarter]: At program point L396(lines 126 397) the Hoare annotation is: (let ((.cse0 (and (= main_~__VERIFIER_assert__cond~3 1) (< main_~main__cp~0 main_~main__urilen~0) (let ((.cse2 (< 0 main_~main__scheme~0)) (.cse3 (<= 1 main_~main__cp~0)) (.cse4 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse5 (not (= main_~__VERIFIER_assert__cond~0 0)))) (or (and .cse2 (= main_~__VERIFIER_assert__cond~2 1) .cse3 .cse4 .cse5) (and (not (= main_~__VERIFIER_assert__cond~16 0)) .cse2 .cse3 (not (= main_~__VERIFIER_assert__cond~2 0)) .cse4 .cse5))))) (.cse1 (= ~__return_375~0 |old(~__return_375~0)|))) (or (and .cse0 (= main_~main__urilen~0 (+ main_~main__cp~0 1)) .cse1) (and (and .cse0 (= main_~__VERIFIER_assert__cond~0 1)) .cse1))) [2019-11-06 21:22:27,142 INFO L443 ceAbstractionStarter]: For program point L99(lines 99 406) no Hoare annotation was computed. [2019-11-06 21:22:27,142 INFO L443 ceAbstractionStarter]: For program point L66(lines 66 411) no Hoare annotation was computed. [2019-11-06 21:22:27,142 INFO L439 ceAbstractionStarter]: At program point L322(lines 257 323) the Hoare annotation is: (let ((.cse0 (= main_~__VERIFIER_assert__cond~9 1)) (.cse1 (= main_~__VERIFIER_assert__cond~10 1)) (.cse2 (and (<= 2 main_~main__cp~0) (< 0 main_~main__scheme~0) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (= main_~__VERIFIER_assert__cond~0 1) (not (= main_~__VERIFIER_assert__cond~10 0)) (not (= main_~__VERIFIER_assert__cond~8 0)) (= main_~__VERIFIER_assert__cond~4 1) (and (not (= main_~__VERIFIER_assert__cond~6 0)) (not (= main_~__VERIFIER_assert__cond~5 0)) (and (= main_~__VERIFIER_assert__cond~3 1) (not (= main_~__VERIFIER_assert__cond~2 0)) (not (= main_~__VERIFIER_assert__cond~1 0)))) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~9 0)))) (.cse3 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse4 (= ~__return_375~0 |old(~__return_375~0)|))) (or (and (not (= main_~__VERIFIER_assert__cond~15 0)) .cse0 (= main_~__VERIFIER_assert__cond~12 1) .cse1 (and (not (= main_~__VERIFIER_assert__cond~14 0)) (<= 1 main_~main__c~0) .cse2 .cse3 (not (= main_~__VERIFIER_assert__cond~13 0))) .cse4) (and .cse0 .cse1 (and (<= (+ main_~main__c~0 2) main_~main__tokenlen~0) .cse2 .cse3 (= 0 main_~main__c~0)) .cse4))) [2019-11-06 21:22:27,142 INFO L443 ceAbstractionStarter]: For program point L289(lines 289 313) no Hoare annotation was computed. [2019-11-06 21:22:27,142 INFO L443 ceAbstractionStarter]: For program point L157(lines 157 354) no Hoare annotation was computed. [2019-11-06 21:22:27,142 INFO L443 ceAbstractionStarter]: For program point L58(lines 58 417) no Hoare annotation was computed. [2019-11-06 21:22:27,142 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 152) no Hoare annotation was computed. [2019-11-06 21:22:27,142 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 324) no Hoare annotation was computed. [2019-11-06 21:22:27,142 INFO L443 ceAbstractionStarter]: For program point L182(lines 182 350) no Hoare annotation was computed. [2019-11-06 21:22:27,142 INFO L439 ceAbstractionStarter]: At program point L405(lines 99 406) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~0 0)) (= ~__return_375~0 |old(~__return_375~0)|)) [2019-11-06 21:22:27,143 INFO L443 ceAbstractionStarter]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 369) no Hoare annotation was computed. [2019-11-06 21:22:27,143 INFO L443 ceAbstractionStarter]: For program point L207(lines 207 341) no Hoare annotation was computed. [2019-11-06 21:22:27,143 INFO L443 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 279) no Hoare annotation was computed. [2019-11-06 21:22:27,143 INFO L443 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-11-06 21:22:27,143 INFO L443 ceAbstractionStarter]: For program point L42(lines 42 429) no Hoare annotation was computed. [2019-11-06 21:22:27,143 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 317) no Hoare annotation was computed. [2019-11-06 21:22:27,143 INFO L443 ceAbstractionStarter]: For program point L199(lines 199 348) no Hoare annotation was computed. [2019-11-06 21:22:27,143 INFO L443 ceAbstractionStarter]: For program point L257(lines 257 323) no Hoare annotation was computed. [2019-11-06 21:22:27,143 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2019-11-06 21:22:27,143 INFO L443 ceAbstractionStarter]: For program point L381(line 381) no Hoare annotation was computed. [2019-11-06 21:22:27,143 INFO L443 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2019-11-06 21:22:27,143 INFO L443 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 209) no Hoare annotation was computed. [2019-11-06 21:22:27,144 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 355) no Hoare annotation was computed. [2019-11-06 21:22:27,144 INFO L443 ceAbstractionStarter]: For program point L18(lines 18 433) no Hoare annotation was computed. [2019-11-06 21:22:27,144 INFO L443 ceAbstractionStarter]: For program point L291(line 291) no Hoare annotation was computed. [2019-11-06 21:22:27,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:22:27 BoogieIcfgContainer [2019-11-06 21:22:27,169 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-06 21:22:27,171 INFO L168 Benchmark]: Toolchain (without parser) took 11998.89 ms. Allocated memory was 146.8 MB in the beginning and 308.8 MB in the end (delta: 162.0 MB). Free memory was 103.3 MB in the beginning and 171.5 MB in the end (delta: -68.2 MB). Peak memory consumption was 167.1 MB. Max. memory is 7.1 GB. [2019-11-06 21:22:27,172 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 146.8 MB. Free memory was 121.7 MB in the beginning and 121.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-11-06 21:22:27,172 INFO L168 Benchmark]: CACSL2BoogieTranslator took 319.95 ms. Allocated memory is still 146.8 MB. Free memory was 102.9 MB in the beginning and 90.1 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 7.1 GB. [2019-11-06 21:22:27,173 INFO L168 Benchmark]: Boogie Preprocessor took 128.08 ms. Allocated memory was 146.8 MB in the beginning and 203.4 MB in the end (delta: 56.6 MB). Free memory was 90.1 MB in the beginning and 181.2 MB in the end (delta: -91.0 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2019-11-06 21:22:27,174 INFO L168 Benchmark]: RCFGBuilder took 531.89 ms. Allocated memory is still 203.4 MB. Free memory was 181.2 MB in the beginning and 154.7 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2019-11-06 21:22:27,175 INFO L168 Benchmark]: TraceAbstraction took 11014.47 ms. Allocated memory was 203.4 MB in the beginning and 308.8 MB in the end (delta: 105.4 MB). Free memory was 154.0 MB in the beginning and 171.5 MB in the end (delta: -17.4 MB). Peak memory consumption was 161.2 MB. Max. memory is 7.1 GB. [2019-11-06 21:22:27,178 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.49 ms. Allocated memory is still 146.8 MB. Free memory was 121.7 MB in the beginning and 121.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 319.95 ms. Allocated memory is still 146.8 MB. Free memory was 102.9 MB in the beginning and 90.1 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 128.08 ms. Allocated memory was 146.8 MB in the beginning and 203.4 MB in the end (delta: 56.6 MB). Free memory was 90.1 MB in the beginning and 181.2 MB in the end (delta: -91.0 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 531.89 ms. Allocated memory is still 203.4 MB. Free memory was 181.2 MB in the beginning and 154.7 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11014.47 ms. Allocated memory was 203.4 MB in the beginning and 308.8 MB in the end (delta: 105.4 MB). Free memory was 154.0 MB in the beginning and 171.5 MB in the end (delta: -17.4 MB). Peak memory consumption was 161.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 108]: 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 - PositiveResult [Line: 369]: 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: 92]: 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: 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: 279]: 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: 267]: 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: 250]: 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: 184]: 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 - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 225]: Loop Invariant Derived loop invariant: (((((((((2 <= main__cp && 0 < main__scheme) && main__cp + 2 <= main__urilen) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && (((((!(__VERIFIER_assert__cond == 0) && ((((__VERIFIER_assert__cond == 1 && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 <= main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 <= main__urilen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 0 == main__c) && __return_375 == \old(__return_375)) || (((((((((2 <= main__cp && main__c + 2 <= main__tokenlen) && (((((!(__VERIFIER_assert__cond == 0) && ((((__VERIFIER_assert__cond == 1 && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 <= main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 <= main__urilen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 0 == main__c) && __return_375 == \old(__return_375)) && 0 < main__scheme) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1)) || ((((((((((((2 <= main__cp && 1 <= main__c) && !(__VERIFIER_assert__cond == 0)) && (((((!(__VERIFIER_assert__cond == 0) && ((((__VERIFIER_assert__cond == 1 && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 <= main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 <= main__urilen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && __return_375 == \old(__return_375)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: ((((__VERIFIER_assert__cond == 1 && main__cp < main__urilen) && (((((0 < main__scheme && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || (((((!(__VERIFIER_assert__cond == 0) && 0 < main__scheme) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)))) && main__urilen == main__cp + 1) && __return_375 == \old(__return_375)) || ((((__VERIFIER_assert__cond == 1 && main__cp < main__urilen) && (((((0 < main__scheme && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || (((((!(__VERIFIER_assert__cond == 0) && 0 < main__scheme) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)))) && __VERIFIER_assert__cond == 1) && __return_375 == \old(__return_375)) - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: (((((!(__VERIFIER_assert__cond == 0) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && (((!(__VERIFIER_assert__cond == 0) && 1 <= main__c) && ((((((((2 <= main__cp && 0 < main__scheme) && main__cp + 1 < main__urilen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && (!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && (__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __return_375 == \old(__return_375)) || (((__VERIFIER_assert__cond == 1 && __VERIFIER_assert__cond == 1) && ((main__c + 2 <= main__tokenlen && ((((((((2 <= main__cp && 0 < main__scheme) && main__cp + 1 < main__urilen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && (!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && (__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 == main__c) && __return_375 == \old(__return_375)) - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: (((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 <= main__urilen) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 0 < main__scheme) && 1 <= main__cp) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) || ((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1)) && __return_375 == \old(__return_375) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: !(__VERIFIER_assert__cond == 0) && __return_375 == \old(__return_375) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 87 locations, 18 error locations. Result: SAFE, OverallTime: 10.9s, OverallIterations: 24, TraceHistogramMax: 2, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.6s, HoareTripleCheckerStatistics: 1389 SDtfs, 4056 SDslu, 453 SDs, 0 SdLazy, 2626 SolverSat, 219 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 430 GetRequests, 221 SyntacticMatches, 18 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred 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.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 287 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 17 NumberOfFragments, 611 HoareAnnotationTreeSize, 9 FomulaSimplifications, 40292 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 9 FomulaSimplificationsInter, 24127 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 957 NumberOfCodeBlocks, 957 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 929 ConstructedInterpolants, 0 QuantifiedInterpolants, 81955 SizeOfPredicates, 25 NumberOfNonLiveVariables, 547 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...