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-f4eb214f-m [2019-10-13 19:16:10,931 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:16:10,933 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:16:10,945 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:16:10,945 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:16:10,946 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:16:10,948 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:16:10,949 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:16:10,951 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:16:10,952 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:16:10,953 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:16:10,954 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:16:10,954 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:16:10,955 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:16:10,956 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:16:10,957 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:16:10,958 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:16:10,959 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:16:10,961 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:16:10,963 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:16:10,964 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:16:10,965 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:16:10,967 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:16:10,967 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:16:10,970 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:16:10,970 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:16:10,970 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:16:10,971 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:16:10,971 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:16:10,972 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:16:10,973 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:16:10,973 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:16:10,974 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:16:10,975 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:16:10,976 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:16:10,976 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:16:10,977 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:16:10,977 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:16:10,977 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:16:10,978 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:16:10,979 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:16:10,979 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-10-13 19:16:11,003 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:16:11,004 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:16:11,005 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:16:11,005 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:16:11,006 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:16:11,006 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:16:11,006 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:16:11,007 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:16:11,007 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:16:11,007 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:16:11,007 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:16:11,007 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:16:11,008 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:16:11,008 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:16:11,008 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:16:11,008 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:16:11,008 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:16:11,009 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:16:11,009 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:16:11,009 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:16:11,009 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:16:11,009 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:16:11,010 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:16:11,010 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:16:11,010 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:16:11,011 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:16:11,012 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:16:11,012 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:16:11,012 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:16:11,284 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:16:11,298 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:16:11,302 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:16:11,303 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:16:11,304 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:16:11,304 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-10-13 19:16:11,364 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7e427502/4ea13c96d7e6415ba0424a7bdb6df369/FLAG83801b57e [2019-10-13 19:16:11,857 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:16:11,859 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2019-10-13 19:16:11,875 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7e427502/4ea13c96d7e6415ba0424a7bdb6df369/FLAG83801b57e [2019-10-13 19:16:12,207 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7e427502/4ea13c96d7e6415ba0424a7bdb6df369 [2019-10-13 19:16:12,218 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:16:12,219 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:16:12,221 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:16:12,221 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:16:12,224 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:16:12,225 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:16:12" (1/1) ... [2019-10-13 19:16:12,228 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d01eef6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:16:12, skipping insertion in model container [2019-10-13 19:16:12,229 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:16:12" (1/1) ... [2019-10-13 19:16:12,237 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:16:12,288 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:16:12,490 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:16:12,498 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:16:12,559 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:16:12,666 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:16:12,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:16:12 WrapperNode [2019-10-13 19:16:12,667 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:16:12,670 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:16:12,670 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:16:12,670 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:16:12,682 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:16:12" (1/1) ... [2019-10-13 19:16:12,682 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:16:12" (1/1) ... [2019-10-13 19:16:12,688 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:16:12" (1/1) ... [2019-10-13 19:16:12,688 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:16:12" (1/1) ... [2019-10-13 19:16:12,695 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:16:12" (1/1) ... [2019-10-13 19:16:12,700 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:16:12" (1/1) ... [2019-10-13 19:16:12,702 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:16:12" (1/1) ... [2019-10-13 19:16:12,705 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:16:12,706 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:16:12,706 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:16:12,706 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:16:12,707 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:16:12" (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-10-13 19:16:12,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:16:12,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:16:12,761 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:16:12,761 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:16:12,761 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 19:16:12,762 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 19:16:12,762 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 19:16:12,762 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:16:12,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:16:12,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:16:13,202 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:16:13,203 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 19:16:13,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:16:13 BoogieIcfgContainer [2019-10-13 19:16:13,205 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:16:13,206 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:16:13,206 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:16:13,209 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:16:13,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:16:12" (1/3) ... [2019-10-13 19:16:13,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53ff901e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:16:13, skipping insertion in model container [2019-10-13 19:16:13,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:16:12" (2/3) ... [2019-10-13 19:16:13,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53ff901e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:16:13, skipping insertion in model container [2019-10-13 19:16:13,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:16:13" (3/3) ... [2019-10-13 19:16:13,213 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c [2019-10-13 19:16:13,227 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:16:13,241 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2019-10-13 19:16:13,253 INFO L249 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2019-10-13 19:16:13,305 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:16:13,305 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:16:13,305 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:16:13,307 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:16:13,308 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:16:13,308 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:16:13,308 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:16:13,309 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:16:13,346 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2019-10-13 19:16:13,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 19:16:13,357 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:13,358 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:16:13,361 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:13,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:13,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1637525138, now seen corresponding path program 1 times [2019-10-13 19:16:13,373 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:13,373 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697879875] [2019-10-13 19:16:13,374 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:13,374 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:13,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:13,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:13,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:13,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:13,580 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697879875] [2019-10-13 19:16:13,581 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:13,582 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:16:13,582 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397427679] [2019-10-13 19:16:13,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:16:13,587 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:13,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:16:13,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:16:13,606 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 4 states. [2019-10-13 19:16:13,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:13,753 INFO L93 Difference]: Finished difference Result 93 states and 129 transitions. [2019-10-13 19:16:13,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:16:13,755 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-10-13 19:16:13,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:13,769 INFO L225 Difference]: With dead ends: 93 [2019-10-13 19:16:13,769 INFO L226 Difference]: Without dead ends: 80 [2019-10-13 19:16:13,774 INFO L600 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-10-13 19:16:13,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-10-13 19:16:13,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-10-13 19:16:13,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-10-13 19:16:13,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2019-10-13 19:16:13,833 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 19 [2019-10-13 19:16:13,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:13,834 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2019-10-13 19:16:13,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:16:13,835 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2019-10-13 19:16:13,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 19:16:13,836 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:13,836 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:16:13,837 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:13,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:13,838 INFO L82 PathProgramCache]: Analyzing trace with hash 776331368, now seen corresponding path program 1 times [2019-10-13 19:16:13,838 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:13,838 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143493417] [2019-10-13 19:16:13,838 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:13,839 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:13,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:13,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:13,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:13,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:13,971 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143493417] [2019-10-13 19:16:13,972 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:13,972 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 19:16:13,972 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054396590] [2019-10-13 19:16:13,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 19:16:13,974 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:13,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 19:16:13,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-13 19:16:13,975 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 7 states. [2019-10-13 19:16:14,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:14,213 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2019-10-13 19:16:14,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 19:16:14,215 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-10-13 19:16:14,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:14,218 INFO L225 Difference]: With dead ends: 80 [2019-10-13 19:16:14,218 INFO L226 Difference]: Without dead ends: 78 [2019-10-13 19:16:14,220 INFO L600 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-10-13 19:16:14,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-13 19:16:14,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-10-13 19:16:14,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-10-13 19:16:14,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2019-10-13 19:16:14,236 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 20 [2019-10-13 19:16:14,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:14,236 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2019-10-13 19:16:14,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 19:16:14,237 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2019-10-13 19:16:14,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 19:16:14,238 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:14,239 INFO L380 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-10-13 19:16:14,239 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:14,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:14,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1269768629, now seen corresponding path program 1 times [2019-10-13 19:16:14,241 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:14,241 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590302817] [2019-10-13 19:16:14,241 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:14,241 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:14,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:14,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:14,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:14,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:14,332 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590302817] [2019-10-13 19:16:14,333 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:14,333 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:16:14,333 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588255365] [2019-10-13 19:16:14,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:16:14,334 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:14,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:16:14,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:16:14,335 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 5 states. [2019-10-13 19:16:14,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:14,515 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2019-10-13 19:16:14,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:16:14,515 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-10-13 19:16:14,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:14,517 INFO L225 Difference]: With dead ends: 101 [2019-10-13 19:16:14,517 INFO L226 Difference]: Without dead ends: 99 [2019-10-13 19:16:14,518 INFO L600 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-10-13 19:16:14,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-10-13 19:16:14,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 76. [2019-10-13 19:16:14,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-13 19:16:14,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2019-10-13 19:16:14,527 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 22 [2019-10-13 19:16:14,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:14,527 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2019-10-13 19:16:14,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:16:14,528 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2019-10-13 19:16:14,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 19:16:14,529 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:14,529 INFO L380 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-10-13 19:16:14,529 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:14,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:14,530 INFO L82 PathProgramCache]: Analyzing trace with hash -708118726, now seen corresponding path program 1 times [2019-10-13 19:16:14,530 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:14,530 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367388009] [2019-10-13 19:16:14,531 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:14,531 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:14,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:14,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:14,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:14,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:14,607 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367388009] [2019-10-13 19:16:14,607 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:14,607 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:16:14,608 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324763071] [2019-10-13 19:16:14,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:16:14,608 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:14,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:16:14,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:16:14,611 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 6 states. [2019-10-13 19:16:14,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:14,731 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-10-13 19:16:14,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:16:14,731 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-10-13 19:16:14,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:14,732 INFO L225 Difference]: With dead ends: 76 [2019-10-13 19:16:14,733 INFO L226 Difference]: Without dead ends: 74 [2019-10-13 19:16:14,733 INFO L600 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-10-13 19:16:14,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-13 19:16:14,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-10-13 19:16:14,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-10-13 19:16:14,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2019-10-13 19:16:14,741 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 23 [2019-10-13 19:16:14,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:14,741 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2019-10-13 19:16:14,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:16:14,741 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2019-10-13 19:16:14,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 19:16:14,742 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:14,742 INFO L380 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-10-13 19:16:14,743 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:14,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:14,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1317531748, now seen corresponding path program 1 times [2019-10-13 19:16:14,744 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:14,744 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31818778] [2019-10-13 19:16:14,744 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:14,744 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:14,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:14,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:14,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:14,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:14,857 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31818778] [2019-10-13 19:16:14,857 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:14,857 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:16:14,858 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999500409] [2019-10-13 19:16:14,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:16:14,860 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:14,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:16:14,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:16:14,861 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 6 states. [2019-10-13 19:16:15,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:15,311 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2019-10-13 19:16:15,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 19:16:15,312 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-10-13 19:16:15,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:15,314 INFO L225 Difference]: With dead ends: 141 [2019-10-13 19:16:15,315 INFO L226 Difference]: Without dead ends: 139 [2019-10-13 19:16:15,315 INFO L600 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-10-13 19:16:15,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-10-13 19:16:15,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 77. [2019-10-13 19:16:15,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-13 19:16:15,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2019-10-13 19:16:15,325 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 26 [2019-10-13 19:16:15,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:15,326 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2019-10-13 19:16:15,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:16:15,326 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2019-10-13 19:16:15,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 19:16:15,327 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:15,327 INFO L380 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-10-13 19:16:15,328 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:15,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:15,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1321265557, now seen corresponding path program 1 times [2019-10-13 19:16:15,329 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:15,329 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065762873] [2019-10-13 19:16:15,329 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:15,330 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:15,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:15,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:15,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:15,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:15,416 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065762873] [2019-10-13 19:16:15,416 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:15,416 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:16:15,416 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426362393] [2019-10-13 19:16:15,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:16:15,417 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:15,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:16:15,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:16:15,418 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 6 states. [2019-10-13 19:16:15,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:15,686 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2019-10-13 19:16:15,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 19:16:15,687 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-10-13 19:16:15,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:15,688 INFO L225 Difference]: With dead ends: 108 [2019-10-13 19:16:15,688 INFO L226 Difference]: Without dead ends: 106 [2019-10-13 19:16:15,689 INFO L600 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-10-13 19:16:15,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-10-13 19:16:15,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 79. [2019-10-13 19:16:15,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-10-13 19:16:15,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2019-10-13 19:16:15,697 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 26 [2019-10-13 19:16:15,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:15,697 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2019-10-13 19:16:15,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:16:15,698 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2019-10-13 19:16:15,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 19:16:15,699 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:15,699 INFO L380 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-10-13 19:16:15,699 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:15,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:15,700 INFO L82 PathProgramCache]: Analyzing trace with hash -2106185532, now seen corresponding path program 1 times [2019-10-13 19:16:15,700 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:15,700 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729704814] [2019-10-13 19:16:15,701 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:15,701 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:15,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:15,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:15,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:15,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:15,756 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729704814] [2019-10-13 19:16:15,756 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:15,756 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:16:15,757 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256756798] [2019-10-13 19:16:15,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:16:15,757 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:15,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:16:15,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:16:15,758 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 6 states. [2019-10-13 19:16:16,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:16,005 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2019-10-13 19:16:16,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:16:16,005 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-10-13 19:16:16,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:16,006 INFO L225 Difference]: With dead ends: 121 [2019-10-13 19:16:16,007 INFO L226 Difference]: Without dead ends: 119 [2019-10-13 19:16:16,007 INFO L600 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-10-13 19:16:16,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-10-13 19:16:16,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 77. [2019-10-13 19:16:16,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-13 19:16:16,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2019-10-13 19:16:16,015 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 27 [2019-10-13 19:16:16,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:16,015 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2019-10-13 19:16:16,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:16:16,015 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2019-10-13 19:16:16,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 19:16:16,016 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:16,016 INFO L380 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-10-13 19:16:16,017 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:16,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:16,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1990437563, now seen corresponding path program 1 times [2019-10-13 19:16:16,018 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:16,018 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604389656] [2019-10-13 19:16:16,018 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:16,018 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:16,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:16,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:16,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:16,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:16,069 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604389656] [2019-10-13 19:16:16,069 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:16,069 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:16:16,070 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174597508] [2019-10-13 19:16:16,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:16:16,070 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:16,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:16:16,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:16:16,071 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 6 states. [2019-10-13 19:16:16,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:16,257 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2019-10-13 19:16:16,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:16:16,258 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-10-13 19:16:16,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:16,259 INFO L225 Difference]: With dead ends: 77 [2019-10-13 19:16:16,259 INFO L226 Difference]: Without dead ends: 75 [2019-10-13 19:16:16,259 INFO L600 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-10-13 19:16:16,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-10-13 19:16:16,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-10-13 19:16:16,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-13 19:16:16,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2019-10-13 19:16:16,268 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 27 [2019-10-13 19:16:16,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:16,268 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2019-10-13 19:16:16,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:16:16,269 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2019-10-13 19:16:16,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 19:16:16,270 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:16,270 INFO L380 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-10-13 19:16:16,272 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:16,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:16,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1549950965, now seen corresponding path program 1 times [2019-10-13 19:16:16,273 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:16,273 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602493081] [2019-10-13 19:16:16,273 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:16,273 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:16,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:16,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:16,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:16,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:16,324 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602493081] [2019-10-13 19:16:16,325 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:16,325 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:16:16,325 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279607259] [2019-10-13 19:16:16,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:16:16,326 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:16,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:16:16,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:16:16,326 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 4 states. [2019-10-13 19:16:16,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:16,463 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2019-10-13 19:16:16,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:16:16,464 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-10-13 19:16:16,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:16,465 INFO L225 Difference]: With dead ends: 115 [2019-10-13 19:16:16,465 INFO L226 Difference]: Without dead ends: 75 [2019-10-13 19:16:16,466 INFO L600 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-10-13 19:16:16,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-10-13 19:16:16,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-10-13 19:16:16,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-13 19:16:16,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2019-10-13 19:16:16,478 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 29 [2019-10-13 19:16:16,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:16,478 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2019-10-13 19:16:16,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:16:16,479 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2019-10-13 19:16:16,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 19:16:16,479 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:16,480 INFO L380 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-10-13 19:16:16,480 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:16,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:16,481 INFO L82 PathProgramCache]: Analyzing trace with hash 54388864, now seen corresponding path program 1 times [2019-10-13 19:16:16,481 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:16,481 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403790870] [2019-10-13 19:16:16,481 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:16,481 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:16,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:16,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:16,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:16,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:16,573 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403790870] [2019-10-13 19:16:16,573 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:16,573 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:16:16,574 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276483487] [2019-10-13 19:16:16,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:16:16,576 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:16,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:16:16,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:16:16,577 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand 6 states. [2019-10-13 19:16:16,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:16,713 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-10-13 19:16:16,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 19:16:16,714 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-10-13 19:16:16,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:16,715 INFO L225 Difference]: With dead ends: 76 [2019-10-13 19:16:16,715 INFO L226 Difference]: Without dead ends: 74 [2019-10-13 19:16:16,715 INFO L600 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-10-13 19:16:16,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-13 19:16:16,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-10-13 19:16:16,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-13 19:16:16,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2019-10-13 19:16:16,721 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 30 [2019-10-13 19:16:16,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:16,721 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2019-10-13 19:16:16,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:16:16,722 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2019-10-13 19:16:16,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 19:16:16,723 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:16,723 INFO L380 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-10-13 19:16:16,723 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:16,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:16,724 INFO L82 PathProgramCache]: Analyzing trace with hash -196719107, now seen corresponding path program 1 times [2019-10-13 19:16:16,724 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:16,724 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629307825] [2019-10-13 19:16:16,725 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:16,725 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:16,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:16,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:16,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:16,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 19:16:16,835 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629307825] [2019-10-13 19:16:16,841 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831971219] [2019-10-13 19:16:16,842 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-10-13 19:16:16,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:16,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-13 19:16:16,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:16:16,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:16:16,984 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 19:16:16,985 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:16:16,985 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2019-10-13 19:16:16,985 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237856803] [2019-10-13 19:16:16,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 19:16:16,986 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:16,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 19:16:16,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-13 19:16:16,987 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 9 states. [2019-10-13 19:16:17,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:17,240 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2019-10-13 19:16:17,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 19:16:17,241 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2019-10-13 19:16:17,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:17,243 INFO L225 Difference]: With dead ends: 111 [2019-10-13 19:16:17,243 INFO L226 Difference]: Without dead ends: 109 [2019-10-13 19:16:17,244 INFO L600 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-10-13 19:16:17,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-10-13 19:16:17,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 70. [2019-10-13 19:16:17,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-13 19:16:17,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2019-10-13 19:16:17,258 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 30 [2019-10-13 19:16:17,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:17,258 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2019-10-13 19:16:17,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 19:16:17,258 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2019-10-13 19:16:17,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-13 19:16:17,261 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:17,261 INFO L380 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-10-13 19:16:17,465 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:16:17,467 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:17,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:17,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1686057932, now seen corresponding path program 1 times [2019-10-13 19:16:17,468 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:17,468 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059281106] [2019-10-13 19:16:17,468 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:17,468 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:17,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:17,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:17,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:17,518 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059281106] [2019-10-13 19:16:17,518 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:17,518 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:16:17,519 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259129989] [2019-10-13 19:16:17,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:16:17,519 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:17,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:16:17,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:16:17,520 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 6 states. [2019-10-13 19:16:17,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:17,651 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-10-13 19:16:17,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:16:17,652 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-10-13 19:16:17,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:17,653 INFO L225 Difference]: With dead ends: 70 [2019-10-13 19:16:17,653 INFO L226 Difference]: Without dead ends: 68 [2019-10-13 19:16:17,653 INFO L600 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-10-13 19:16:17,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-13 19:16:17,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-10-13 19:16:17,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-13 19:16:17,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2019-10-13 19:16:17,659 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 31 [2019-10-13 19:16:17,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:17,659 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2019-10-13 19:16:17,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:16:17,660 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2019-10-13 19:16:17,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-13 19:16:17,660 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:17,661 INFO L380 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-10-13 19:16:17,661 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:17,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:17,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1806773561, now seen corresponding path program 1 times [2019-10-13 19:16:17,662 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:17,662 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241950865] [2019-10-13 19:16:17,662 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:17,663 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:17,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:17,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:17,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:17,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 19:16:17,764 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241950865] [2019-10-13 19:16:17,765 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173921041] [2019-10-13 19:16:17,765 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-10-13 19:16:17,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:17,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-13 19:16:17,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:16:17,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:16:17,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 19:16:17,862 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:16:17,863 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2019-10-13 19:16:17,863 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859119790] [2019-10-13 19:16:17,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 19:16:17,863 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:17,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 19:16:17,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-13 19:16:17,864 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 9 states. [2019-10-13 19:16:18,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:18,063 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2019-10-13 19:16:18,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 19:16:18,064 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-10-13 19:16:18,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:18,064 INFO L225 Difference]: With dead ends: 69 [2019-10-13 19:16:18,065 INFO L226 Difference]: Without dead ends: 67 [2019-10-13 19:16:18,065 INFO L600 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-10-13 19:16:18,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-10-13 19:16:18,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2019-10-13 19:16:18,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-13 19:16:18,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2019-10-13 19:16:18,069 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 31 [2019-10-13 19:16:18,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:18,070 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2019-10-13 19:16:18,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 19:16:18,070 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2019-10-13 19:16:18,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-13 19:16:18,071 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:18,071 INFO L380 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-10-13 19:16:18,272 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:16:18,272 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:18,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:18,273 INFO L82 PathProgramCache]: Analyzing trace with hash -287576151, now seen corresponding path program 1 times [2019-10-13 19:16:18,273 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:18,273 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803797374] [2019-10-13 19:16:18,274 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:18,274 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:18,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:18,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:18,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:18,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:18,344 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803797374] [2019-10-13 19:16:18,344 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:18,344 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:16:18,344 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983166045] [2019-10-13 19:16:18,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:16:18,347 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:18,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:16:18,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:16:18,348 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 6 states. [2019-10-13 19:16:18,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:18,468 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2019-10-13 19:16:18,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 19:16:18,468 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-10-13 19:16:18,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:18,469 INFO L225 Difference]: With dead ends: 63 [2019-10-13 19:16:18,469 INFO L226 Difference]: Without dead ends: 61 [2019-10-13 19:16:18,469 INFO L600 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-10-13 19:16:18,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-13 19:16:18,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-10-13 19:16:18,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-13 19:16:18,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-10-13 19:16:18,473 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 34 [2019-10-13 19:16:18,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:18,473 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-10-13 19:16:18,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:16:18,473 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-10-13 19:16:18,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-13 19:16:18,474 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:18,474 INFO L380 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-10-13 19:16:18,475 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:18,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:18,475 INFO L82 PathProgramCache]: Analyzing trace with hash -324922921, now seen corresponding path program 1 times [2019-10-13 19:16:18,475 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:18,475 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698985682] [2019-10-13 19:16:18,476 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:18,476 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:18,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:18,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:18,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:18,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:18,534 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698985682] [2019-10-13 19:16:18,535 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:18,535 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 19:16:18,535 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807652504] [2019-10-13 19:16:18,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 19:16:18,536 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:18,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 19:16:18,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-13 19:16:18,537 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 8 states. [2019-10-13 19:16:18,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:18,721 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2019-10-13 19:16:18,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 19:16:18,722 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2019-10-13 19:16:18,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:18,723 INFO L225 Difference]: With dead ends: 71 [2019-10-13 19:16:18,723 INFO L226 Difference]: Without dead ends: 69 [2019-10-13 19:16:18,723 INFO L600 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-10-13 19:16:18,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-13 19:16:18,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2019-10-13 19:16:18,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-13 19:16:18,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2019-10-13 19:16:18,728 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 35 [2019-10-13 19:16:18,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:18,728 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2019-10-13 19:16:18,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 19:16:18,728 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2019-10-13 19:16:18,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-13 19:16:18,729 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:18,729 INFO L380 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-10-13 19:16:18,730 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:18,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:18,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1080633106, now seen corresponding path program 1 times [2019-10-13 19:16:18,730 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:18,731 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650784122] [2019-10-13 19:16:18,731 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:18,731 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:18,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:18,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:18,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:18,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:18,778 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650784122] [2019-10-13 19:16:18,778 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:18,778 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:16:18,778 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385549202] [2019-10-13 19:16:18,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:16:18,779 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:18,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:16:18,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:16:18,779 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 6 states. [2019-10-13 19:16:19,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:19,001 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2019-10-13 19:16:19,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 19:16:19,002 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-10-13 19:16:19,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:19,002 INFO L225 Difference]: With dead ends: 91 [2019-10-13 19:16:19,003 INFO L226 Difference]: Without dead ends: 89 [2019-10-13 19:16:19,003 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-10-13 19:16:19,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-10-13 19:16:19,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2019-10-13 19:16:19,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-13 19:16:19,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2019-10-13 19:16:19,008 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 38 [2019-10-13 19:16:19,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:19,008 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2019-10-13 19:16:19,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:16:19,008 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2019-10-13 19:16:19,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-13 19:16:19,009 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:19,009 INFO L380 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-10-13 19:16:19,010 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:19,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:19,010 INFO L82 PathProgramCache]: Analyzing trace with hash -860108895, now seen corresponding path program 1 times [2019-10-13 19:16:19,010 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:19,010 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670441169] [2019-10-13 19:16:19,011 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:19,011 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:19,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:19,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:19,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:19,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:19,057 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670441169] [2019-10-13 19:16:19,057 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:19,057 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:16:19,057 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164376974] [2019-10-13 19:16:19,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:16:19,058 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:19,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:16:19,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:16:19,059 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 6 states. [2019-10-13 19:16:19,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:19,221 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2019-10-13 19:16:19,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:16:19,222 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-10-13 19:16:19,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:19,222 INFO L225 Difference]: With dead ends: 61 [2019-10-13 19:16:19,223 INFO L226 Difference]: Without dead ends: 59 [2019-10-13 19:16:19,223 INFO L600 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-10-13 19:16:19,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-13 19:16:19,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-10-13 19:16:19,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-13 19:16:19,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2019-10-13 19:16:19,227 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 39 [2019-10-13 19:16:19,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:19,228 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2019-10-13 19:16:19,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:16:19,228 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2019-10-13 19:16:19,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-13 19:16:19,229 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:19,229 INFO L380 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-10-13 19:16:19,229 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:19,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:19,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1930828060, now seen corresponding path program 1 times [2019-10-13 19:16:19,230 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:19,230 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406170476] [2019-10-13 19:16:19,230 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:19,230 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:19,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:19,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:19,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:19,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:19,277 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406170476] [2019-10-13 19:16:19,277 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:19,278 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:16:19,278 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589932139] [2019-10-13 19:16:19,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:16:19,278 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:19,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:16:19,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:16:19,279 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 6 states. [2019-10-13 19:16:19,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:19,411 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-10-13 19:16:19,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:16:19,412 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-10-13 19:16:19,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:19,413 INFO L225 Difference]: With dead ends: 70 [2019-10-13 19:16:19,413 INFO L226 Difference]: Without dead ends: 68 [2019-10-13 19:16:19,413 INFO L600 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-10-13 19:16:19,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-13 19:16:19,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-10-13 19:16:19,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-13 19:16:19,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-10-13 19:16:19,418 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 41 [2019-10-13 19:16:19,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:19,419 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-10-13 19:16:19,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:16:19,419 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-10-13 19:16:19,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-13 19:16:19,419 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:19,420 INFO L380 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-10-13 19:16:19,420 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:19,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:19,420 INFO L82 PathProgramCache]: Analyzing trace with hash 273875486, now seen corresponding path program 1 times [2019-10-13 19:16:19,421 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:19,421 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530842455] [2019-10-13 19:16:19,421 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:19,421 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:19,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:19,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:19,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:19,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:19,469 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530842455] [2019-10-13 19:16:19,470 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:19,470 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:16:19,470 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353428095] [2019-10-13 19:16:19,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:16:19,471 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:19,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:16:19,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:16:19,471 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 6 states. [2019-10-13 19:16:19,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:19,656 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2019-10-13 19:16:19,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:16:19,657 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-10-13 19:16:19,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:19,658 INFO L225 Difference]: With dead ends: 68 [2019-10-13 19:16:19,658 INFO L226 Difference]: Without dead ends: 66 [2019-10-13 19:16:19,658 INFO L600 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-10-13 19:16:19,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-13 19:16:19,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-10-13 19:16:19,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-13 19:16:19,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-10-13 19:16:19,664 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 42 [2019-10-13 19:16:19,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:19,665 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-10-13 19:16:19,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:16:19,665 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-10-13 19:16:19,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-13 19:16:19,665 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:19,666 INFO L380 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-10-13 19:16:19,666 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:19,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:19,667 INFO L82 PathProgramCache]: Analyzing trace with hash -99791318, now seen corresponding path program 1 times [2019-10-13 19:16:19,667 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:19,667 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118277545] [2019-10-13 19:16:19,668 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:19,668 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:19,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:19,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:19,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:19,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:19,755 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118277545] [2019-10-13 19:16:19,756 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:19,756 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:16:19,756 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734998867] [2019-10-13 19:16:19,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:16:19,757 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:19,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:16:19,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:16:19,757 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 6 states. [2019-10-13 19:16:20,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:20,028 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2019-10-13 19:16:20,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 19:16:20,028 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-10-13 19:16:20,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:20,029 INFO L225 Difference]: With dead ends: 90 [2019-10-13 19:16:20,029 INFO L226 Difference]: Without dead ends: 88 [2019-10-13 19:16:20,030 INFO L600 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-10-13 19:16:20,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-10-13 19:16:20,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 69. [2019-10-13 19:16:20,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-13 19:16:20,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2019-10-13 19:16:20,041 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 43 [2019-10-13 19:16:20,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:20,041 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2019-10-13 19:16:20,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:16:20,041 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2019-10-13 19:16:20,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-13 19:16:20,042 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:20,042 INFO L380 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-10-13 19:16:20,042 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:20,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:20,043 INFO L82 PathProgramCache]: Analyzing trace with hash 2020599801, now seen corresponding path program 1 times [2019-10-13 19:16:20,043 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:20,046 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422272590] [2019-10-13 19:16:20,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:20,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:20,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:20,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:20,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:20,158 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:20,159 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422272590] [2019-10-13 19:16:20,159 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061390061] [2019-10-13 19:16:20,159 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-10-13 19:16:20,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:20,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-13 19:16:20,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:16:20,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:16:20,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:20,296 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:16:20,296 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2019-10-13 19:16:20,296 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696730598] [2019-10-13 19:16:20,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 19:16:20,297 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:20,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 19:16:20,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-10-13 19:16:20,298 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 9 states. [2019-10-13 19:16:20,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:20,536 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2019-10-13 19:16:20,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 19:16:20,537 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2019-10-13 19:16:20,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:20,538 INFO L225 Difference]: With dead ends: 70 [2019-10-13 19:16:20,538 INFO L226 Difference]: Without dead ends: 68 [2019-10-13 19:16:20,538 INFO L600 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-10-13 19:16:20,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-13 19:16:20,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-10-13 19:16:20,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-13 19:16:20,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-10-13 19:16:20,543 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 44 [2019-10-13 19:16:20,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:20,544 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-10-13 19:16:20,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 19:16:20,544 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-10-13 19:16:20,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-13 19:16:20,545 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:20,545 INFO L380 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-10-13 19:16:20,745 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:16:20,747 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:20,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:20,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1201439652, now seen corresponding path program 1 times [2019-10-13 19:16:20,748 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:20,748 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779848920] [2019-10-13 19:16:20,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:20,749 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:20,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:20,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:20,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:20,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:20,805 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779848920] [2019-10-13 19:16:20,806 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:20,806 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:16:20,806 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336150419] [2019-10-13 19:16:20,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:16:20,807 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:20,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:16:20,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:16:20,808 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 6 states. [2019-10-13 19:16:20,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:20,993 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-10-13 19:16:20,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:16:20,996 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2019-10-13 19:16:20,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:20,997 INFO L225 Difference]: With dead ends: 71 [2019-10-13 19:16:20,997 INFO L226 Difference]: Without dead ends: 69 [2019-10-13 19:16:20,997 INFO L600 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-10-13 19:16:20,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-13 19:16:21,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2019-10-13 19:16:21,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-13 19:16:21,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-10-13 19:16:21,005 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 44 [2019-10-13 19:16:21,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:21,005 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-10-13 19:16:21,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:16:21,006 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-10-13 19:16:21,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-13 19:16:21,008 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:21,008 INFO L380 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-10-13 19:16:21,008 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:21,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:21,009 INFO L82 PathProgramCache]: Analyzing trace with hash 40764835, now seen corresponding path program 1 times [2019-10-13 19:16:21,009 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:21,009 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531361918] [2019-10-13 19:16:21,009 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:21,009 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:21,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:21,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:21,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:21,066 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 19:16:21,067 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531361918] [2019-10-13 19:16:21,067 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:21,067 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:16:21,067 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51668803] [2019-10-13 19:16:21,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:16:21,068 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:21,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:16:21,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:16:21,068 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 6 states. [2019-10-13 19:16:21,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:21,299 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2019-10-13 19:16:21,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 19:16:21,300 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2019-10-13 19:16:21,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:21,301 INFO L225 Difference]: With dead ends: 77 [2019-10-13 19:16:21,301 INFO L226 Difference]: Without dead ends: 75 [2019-10-13 19:16:21,302 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-10-13 19:16:21,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-10-13 19:16:21,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 55. [2019-10-13 19:16:21,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-13 19:16:21,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2019-10-13 19:16:21,306 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 49 [2019-10-13 19:16:21,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:21,306 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2019-10-13 19:16:21,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:16:21,306 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2019-10-13 19:16:21,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-13 19:16:21,307 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:21,307 INFO L380 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-10-13 19:16:21,307 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:21,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:21,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1664106253, now seen corresponding path program 1 times [2019-10-13 19:16:21,308 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:21,308 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354610962] [2019-10-13 19:16:21,308 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:21,309 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:21,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:21,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:21,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:21,360 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:21,361 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354610962] [2019-10-13 19:16:21,361 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018945938] [2019-10-13 19:16:21,361 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-10-13 19:16:21,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:21,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-13 19:16:21,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:16:21,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:16:21,457 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 19:16:21,457 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:16:21,458 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2019-10-13 19:16:21,458 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401968501] [2019-10-13 19:16:21,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:16:21,460 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:21,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:16:21,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-13 19:16:21,461 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 4 states. [2019-10-13 19:16:21,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:21,500 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2019-10-13 19:16:21,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:16:21,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-10-13 19:16:21,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:21,501 INFO L225 Difference]: With dead ends: 60 [2019-10-13 19:16:21,501 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 19:16:21,502 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 19:16:21,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 19:16:21,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 19:16:21,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 19:16:21,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 19:16:21,502 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2019-10-13 19:16:21,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:21,503 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 19:16:21,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:16:21,503 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 19:16:21,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 19:16:21,704 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:16:21,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 19:16:22,384 WARN L191 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 76 [2019-10-13 19:16:22,614 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2019-10-13 19:16:23,079 WARN L191 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 73 [2019-10-13 19:16:23,262 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 33 [2019-10-13 19:16:23,277 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-13 19:16:23,277 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-10-13 19:16:23,277 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 19:16:23,277 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 19:16:23,277 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-13 19:16:23,277 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 19:16:23,277 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 19:16:23,277 INFO L443 ceAbstractionStarter]: For program point L60(lines 60 412) no Hoare annotation was computed. [2019-10-13 19:16:23,277 INFO L443 ceAbstractionStarter]: For program point L250(line 250) no Hoare annotation was computed. [2019-10-13 19:16:23,278 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 8 434) no Hoare annotation was computed. [2019-10-13 19:16:23,278 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-10-13 19:16:23,278 INFO L443 ceAbstractionStarter]: For program point L118(lines 118 398) no Hoare annotation was computed. [2019-10-13 19:16:23,278 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 140) no Hoare annotation was computed. [2019-10-13 19:16:23,278 INFO L443 ceAbstractionStarter]: For program point L209(line 209) no Hoare annotation was computed. [2019-10-13 19:16:23,278 INFO L443 ceAbstractionStarter]: For program point L267(line 267) no Hoare annotation was computed. [2019-10-13 19:16:23,278 INFO L443 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 303) no Hoare annotation was computed. [2019-10-13 19:16:23,278 INFO L443 ceAbstractionStarter]: For program point L36(lines 36 430) no Hoare annotation was computed. [2019-10-13 19:16:23,278 INFO L443 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2019-10-13 19:16:23,278 INFO L443 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2019-10-13 19:16:23,279 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 390) no Hoare annotation was computed. [2019-10-13 19:16:23,279 INFO L443 ceAbstractionStarter]: For program point L78(lines 78 409) no Hoare annotation was computed. [2019-10-13 19:16:23,279 INFO L443 ceAbstractionStarter]: For program point L301(lines 301 311) no Hoare annotation was computed. [2019-10-13 19:16:23,279 INFO L443 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 238) no Hoare annotation was computed. [2019-10-13 19:16:23,279 INFO L443 ceAbstractionStarter]: For program point L219(lines 219 339) no Hoare annotation was computed. [2019-10-13 19:16:23,279 INFO L443 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-10-13 19:16:23,279 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 427) no Hoare annotation was computed. [2019-10-13 19:16:23,279 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2019-10-13 19:16:23,280 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-10-13 19:16:23,280 INFO L443 ceAbstractionStarter]: For program point L277(lines 277 315) no Hoare annotation was computed. [2019-10-13 19:16:23,280 INFO L443 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 221) no Hoare annotation was computed. [2019-10-13 19:16:23,280 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 8 434) no Hoare annotation was computed. [2019-10-13 19:16:23,280 INFO L443 ceAbstractionStarter]: For program point L236(lines 236 326) no Hoare annotation was computed. [2019-10-13 19:16:23,280 INFO L443 ceAbstractionStarter]: For program point L170(lines 170 352) no Hoare annotation was computed. [2019-10-13 19:16:23,280 INFO L443 ceAbstractionStarter]: For program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 381) no Hoare annotation was computed. [2019-10-13 19:16:23,280 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 92) no Hoare annotation was computed. [2019-10-13 19:16:23,281 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 431) no Hoare annotation was computed. [2019-10-13 19:16:23,281 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 8 434) the Hoare annotation is: (= ~__return_375~0 |old(~__return_375~0)|) [2019-10-13 19:16:23,281 INFO L443 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 267) no Hoare annotation was computed. [2019-10-13 19:16:23,281 INFO L443 ceAbstractionStarter]: For program point L369(line 369) no Hoare annotation was computed. [2019-10-13 19:16:23,281 INFO L443 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2019-10-13 19:16:23,281 INFO L443 ceAbstractionStarter]: For program point L303(line 303) no Hoare annotation was computed. [2019-10-13 19:16:23,281 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 357) no Hoare annotation was computed. [2019-10-13 19:16:23,281 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 333) no Hoare annotation was computed. [2019-10-13 19:16:23,282 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 392) no Hoare annotation was computed. [2019-10-13 19:16:23,282 INFO L443 ceAbstractionStarter]: For program point L221(line 221) no Hoare annotation was computed. [2019-10-13 19:16:23,282 INFO L443 ceAbstractionStarter]: For program point L56(lines 56 422) no Hoare annotation was computed. [2019-10-13 19:16:23,282 INFO L443 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 209) no Hoare annotation was computed. [2019-10-13 19:16:23,282 INFO L443 ceAbstractionStarter]: For program point L279(line 279) no Hoare annotation was computed. [2019-10-13 19:16:23,282 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2019-10-13 19:16:23,282 INFO L443 ceAbstractionStarter]: For program point L48(lines 48 428) no Hoare annotation was computed. [2019-10-13 19:16:23,282 INFO L443 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 250) no Hoare annotation was computed. [2019-10-13 19:16:23,282 INFO L443 ceAbstractionStarter]: For program point L238(line 238) no Hoare annotation was computed. [2019-10-13 19:16:23,282 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-10-13 19:16:23,282 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 400) no Hoare annotation was computed. [2019-10-13 19:16:23,283 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-10-13 19:16:23,283 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 349) no Hoare annotation was computed. [2019-10-13 19:16:23,283 INFO L443 ceAbstractionStarter]: For program point L379(lines 379 388) no Hoare annotation was computed. [2019-10-13 19:16:23,283 INFO L443 ceAbstractionStarter]: For program point L90(lines 90 407) no Hoare annotation was computed. [2019-10-13 19:16:23,283 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 432) no Hoare annotation was computed. [2019-10-13 19:16:23,283 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 120) no Hoare annotation was computed. [2019-10-13 19:16:23,283 INFO L443 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2019-10-13 19:16:23,284 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-10-13 19:16:23,284 INFO L443 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 291) no Hoare annotation was computed. [2019-10-13 19:16:23,284 INFO L443 ceAbstractionStarter]: For program point L99(lines 99 406) no Hoare annotation was computed. [2019-10-13 19:16:23,284 INFO L443 ceAbstractionStarter]: For program point L66(lines 66 411) no Hoare annotation was computed. [2019-10-13 19:16:23,284 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-10-13 19:16:23,284 INFO L443 ceAbstractionStarter]: For program point L289(lines 289 313) no Hoare annotation was computed. [2019-10-13 19:16:23,284 INFO L443 ceAbstractionStarter]: For program point L157(lines 157 354) no Hoare annotation was computed. [2019-10-13 19:16:23,284 INFO L443 ceAbstractionStarter]: For program point L58(lines 58 417) no Hoare annotation was computed. [2019-10-13 19:16:23,284 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 324) no Hoare annotation was computed. [2019-10-13 19:16:23,284 INFO L443 ceAbstractionStarter]: For program point L182(lines 182 350) no Hoare annotation was computed. [2019-10-13 19:16:23,285 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-10-13 19:16:23,285 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 108) no Hoare annotation was computed. [2019-10-13 19:16:23,285 INFO L443 ceAbstractionStarter]: For program point L207(lines 207 341) no Hoare annotation was computed. [2019-10-13 19:16:23,285 INFO L443 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-10-13 19:16:23,285 INFO L443 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 279) no Hoare annotation was computed. [2019-10-13 19:16:23,285 INFO L443 ceAbstractionStarter]: For program point L42(lines 42 429) no Hoare annotation was computed. [2019-10-13 19:16:23,285 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 317) no Hoare annotation was computed. [2019-10-13 19:16:23,285 INFO L443 ceAbstractionStarter]: For program point L199(lines 199 348) no Hoare annotation was computed. [2019-10-13 19:16:23,285 INFO L443 ceAbstractionStarter]: For program point L257(lines 257 323) no Hoare annotation was computed. [2019-10-13 19:16:23,285 INFO L443 ceAbstractionStarter]: For program point L381(line 381) no Hoare annotation was computed. [2019-10-13 19:16:23,285 INFO L443 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2019-10-13 19:16:23,285 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 152) no Hoare annotation was computed. [2019-10-13 19:16:23,286 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 355) no Hoare annotation was computed. [2019-10-13 19:16:23,286 INFO L443 ceAbstractionStarter]: For program point L18(lines 18 433) no Hoare annotation was computed. [2019-10-13 19:16:23,286 INFO L443 ceAbstractionStarter]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 369) no Hoare annotation was computed. [2019-10-13 19:16:23,286 INFO L443 ceAbstractionStarter]: For program point L291(line 291) no Hoare annotation was computed. [2019-10-13 19:16:23,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 07:16:23 BoogieIcfgContainer [2019-10-13 19:16:23,320 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 19:16:23,321 INFO L168 Benchmark]: Toolchain (without parser) took 11102.34 ms. Allocated memory was 137.9 MB in the beginning and 332.9 MB in the end (delta: 195.0 MB). Free memory was 102.8 MB in the beginning and 124.4 MB in the end (delta: -21.5 MB). Peak memory consumption was 179.8 MB. Max. memory is 7.1 GB. [2019-10-13 19:16:23,322 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory was 121.2 MB in the beginning and 121.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-10-13 19:16:23,323 INFO L168 Benchmark]: CACSL2BoogieTranslator took 448.83 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 102.6 MB in the beginning and 180.9 MB in the end (delta: -78.2 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2019-10-13 19:16:23,323 INFO L168 Benchmark]: Boogie Preprocessor took 35.61 ms. Allocated memory is still 202.4 MB. Free memory was 180.9 MB in the beginning and 178.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-10-13 19:16:23,324 INFO L168 Benchmark]: RCFGBuilder took 499.02 ms. Allocated memory is still 202.4 MB. Free memory was 178.7 MB in the beginning and 152.1 MB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. [2019-10-13 19:16:23,325 INFO L168 Benchmark]: TraceAbstraction took 10114.00 ms. Allocated memory was 202.4 MB in the beginning and 332.9 MB in the end (delta: 130.5 MB). Free memory was 152.1 MB in the beginning and 124.4 MB in the end (delta: 27.7 MB). Peak memory consumption was 164.6 MB. Max. memory is 7.1 GB. [2019-10-13 19:16:23,328 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.23 ms. Allocated memory is still 137.9 MB. Free memory was 121.2 MB in the beginning and 121.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 448.83 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 102.6 MB in the beginning and 180.9 MB in the end (delta: -78.2 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.61 ms. Allocated memory is still 202.4 MB. Free memory was 180.9 MB in the beginning and 178.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 499.02 ms. Allocated memory is still 202.4 MB. Free memory was 178.7 MB in the beginning and 152.1 MB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10114.00 ms. Allocated memory was 202.4 MB in the beginning and 332.9 MB in the end (delta: 130.5 MB). Free memory was 152.1 MB in the beginning and 124.4 MB in the end (delta: 27.7 MB). Peak memory consumption was 164.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 209]: 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: 279]: 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: 291]: 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: 140]: 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: 267]: 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: 250]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 108]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 221]: 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: 184]: 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 - 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: 9.9s, OverallIterations: 24, TraceHistogramMax: 2, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.5s, HoareTripleCheckerStatistics: 1389 SDtfs, 4056 SDslu, 453 SDs, 0 SdLazy, 2626 SolverSat, 219 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 430 GetRequests, 221 SyntacticMatches, 18 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 2.2s 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.2s HoareSimplificationTime, 9 FomulaSimplificationsInter, 24127 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s 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...