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-13a467a-m [2019-10-14 23:15:11,596 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:15:11,599 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:15:11,618 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:15:11,618 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:15:11,620 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:15:11,622 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:15:11,632 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:15:11,636 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:15:11,639 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:15:11,641 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:15:11,642 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:15:11,643 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:15:11,644 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:15:11,647 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:15:11,648 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:15:11,650 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:15:11,651 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:15:11,652 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:15:11,657 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:15:11,661 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:15:11,664 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:15:11,667 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:15:11,668 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:15:11,670 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:15:11,670 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:15:11,670 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:15:11,672 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:15:11,673 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:15:11,674 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:15:11,674 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:15:11,675 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:15:11,676 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:15:11,677 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:15:11,679 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:15:11,679 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:15:11,679 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:15:11,680 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:15:11,680 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:15:11,681 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:15:11,682 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:15:11,683 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-14 23:15:11,709 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:15:11,709 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:15:11,710 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:15:11,711 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:15:11,711 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:15:11,711 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:15:11,711 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:15:11,711 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:15:11,712 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:15:11,712 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:15:11,712 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:15:11,712 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:15:11,712 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:15:11,712 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:15:11,713 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:15:11,713 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:15:11,713 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:15:11,713 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:15:11,713 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:15:11,714 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:15:11,714 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:15:11,714 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:15:11,714 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:15:11,714 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:15:11,715 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:15:11,715 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:15:11,715 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:15:11,715 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:15:11,715 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:15:11,983 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:15:12,004 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:15:12,009 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:15:12,011 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:15:12,012 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:15:12,012 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-14 23:15:12,092 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de947fa37/c13615a6b86b479eb52b2bed7071a05b/FLAG995169fc9 [2019-10-14 23:15:12,601 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:15:12,602 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2019-10-14 23:15:12,616 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de947fa37/c13615a6b86b479eb52b2bed7071a05b/FLAG995169fc9 [2019-10-14 23:15:12,920 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de947fa37/c13615a6b86b479eb52b2bed7071a05b [2019-10-14 23:15:12,931 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:15:12,933 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:15:12,934 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:15:12,934 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:15:12,937 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:15:12,938 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:15:12" (1/1) ... [2019-10-14 23:15:12,941 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c597767 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:12, skipping insertion in model container [2019-10-14 23:15:12,942 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:15:12" (1/1) ... [2019-10-14 23:15:12,949 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:15:12,987 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:15:13,238 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:15:13,244 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:15:13,283 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:15:13,398 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:15:13,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:13 WrapperNode [2019-10-14 23:15:13,399 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:15:13,400 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:15:13,403 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:15:13,403 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:15:13,427 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:13" (1/1) ... [2019-10-14 23:15:13,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:13" (1/1) ... [2019-10-14 23:15:13,435 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:13" (1/1) ... [2019-10-14 23:15:13,435 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:13" (1/1) ... [2019-10-14 23:15:13,443 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:13" (1/1) ... [2019-10-14 23:15:13,449 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:13" (1/1) ... [2019-10-14 23:15:13,451 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:13" (1/1) ... [2019-10-14 23:15:13,454 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:15:13,455 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:15:13,455 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:15:13,455 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:15:13,456 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:13" (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-14 23:15:13,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:15:13,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:15:13,510 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:15:13,510 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:15:13,510 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-14 23:15:13,510 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-14 23:15:13,510 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:15:13,510 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:15:13,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:15:13,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:15:13,906 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:15:13,907 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-14 23:15:13,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:15:13 BoogieIcfgContainer [2019-10-14 23:15:13,909 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:15:13,910 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:15:13,911 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:15:13,914 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:15:13,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:15:12" (1/3) ... [2019-10-14 23:15:13,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1843c622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:15:13, skipping insertion in model container [2019-10-14 23:15:13,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:13" (2/3) ... [2019-10-14 23:15:13,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1843c622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:15:13, skipping insertion in model container [2019-10-14 23:15:13,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:15:13" (3/3) ... [2019-10-14 23:15:13,918 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c [2019-10-14 23:15:13,929 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:15:13,937 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2019-10-14 23:15:13,947 INFO L249 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2019-10-14 23:15:13,974 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:15:13,974 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:15:13,974 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:15:13,974 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:15:13,975 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:15:13,975 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:15:13,975 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:15:13,975 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:15:13,997 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2019-10-14 23:15:14,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-14 23:15:14,004 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:14,005 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-14 23:15:14,007 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:14,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:14,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1637525138, now seen corresponding path program 1 times [2019-10-14 23:15:14,022 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:14,023 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426505183] [2019-10-14 23:15:14,023 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:14,023 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:14,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:14,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:14,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:14,245 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-14 23:15:14,246 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426505183] [2019-10-14 23:15:14,248 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:14,248 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:15:14,248 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220754881] [2019-10-14 23:15:14,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:15:14,253 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:14,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:15:14,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:15:14,271 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 4 states. [2019-10-14 23:15:14,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:14,446 INFO L93 Difference]: Finished difference Result 93 states and 129 transitions. [2019-10-14 23:15:14,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:15:14,448 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-10-14 23:15:14,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:14,463 INFO L225 Difference]: With dead ends: 93 [2019-10-14 23:15:14,464 INFO L226 Difference]: Without dead ends: 80 [2019-10-14 23:15:14,469 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-14 23:15:14,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-10-14 23:15:14,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-10-14 23:15:14,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-10-14 23:15:14,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2019-10-14 23:15:14,545 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 19 [2019-10-14 23:15:14,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:14,546 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2019-10-14 23:15:14,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:15:14,548 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2019-10-14 23:15:14,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-14 23:15:14,549 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:14,549 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-14 23:15:14,551 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:14,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:14,551 INFO L82 PathProgramCache]: Analyzing trace with hash 776331368, now seen corresponding path program 1 times [2019-10-14 23:15:14,552 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:14,552 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743476512] [2019-10-14 23:15:14,552 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:14,552 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:14,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:14,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:14,644 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-14 23:15:14,644 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743476512] [2019-10-14 23:15:14,644 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:14,645 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-14 23:15:14,645 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091968946] [2019-10-14 23:15:14,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 23:15:14,647 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:14,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 23:15:14,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:15:14,648 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 7 states. [2019-10-14 23:15:14,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:14,866 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2019-10-14 23:15:14,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:15:14,868 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-10-14 23:15:14,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:14,869 INFO L225 Difference]: With dead ends: 80 [2019-10-14 23:15:14,870 INFO L226 Difference]: Without dead ends: 78 [2019-10-14 23:15:14,871 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-14 23:15:14,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-14 23:15:14,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-10-14 23:15:14,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-10-14 23:15:14,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2019-10-14 23:15:14,882 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 20 [2019-10-14 23:15:14,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:14,883 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2019-10-14 23:15:14,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 23:15:14,883 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2019-10-14 23:15:14,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-14 23:15:14,884 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:14,884 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-14 23:15:14,885 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:14,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:14,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1269768629, now seen corresponding path program 1 times [2019-10-14 23:15:14,886 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:14,886 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727329503] [2019-10-14 23:15:14,887 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:14,887 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:14,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:14,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:14,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:15,005 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-14 23:15:15,005 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727329503] [2019-10-14 23:15:15,005 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:15,006 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:15:15,006 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357780632] [2019-10-14 23:15:15,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:15:15,007 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:15,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:15:15,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:15:15,008 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 5 states. [2019-10-14 23:15:15,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:15,217 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2019-10-14 23:15:15,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:15:15,217 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-10-14 23:15:15,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:15,219 INFO L225 Difference]: With dead ends: 101 [2019-10-14 23:15:15,219 INFO L226 Difference]: Without dead ends: 99 [2019-10-14 23:15:15,220 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-14 23:15:15,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-10-14 23:15:15,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 76. [2019-10-14 23:15:15,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-14 23:15:15,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2019-10-14 23:15:15,229 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 22 [2019-10-14 23:15:15,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:15,230 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2019-10-14 23:15:15,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:15:15,230 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2019-10-14 23:15:15,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-14 23:15:15,231 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:15,231 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-14 23:15:15,232 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:15,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:15,232 INFO L82 PathProgramCache]: Analyzing trace with hash -708118726, now seen corresponding path program 1 times [2019-10-14 23:15:15,233 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:15,233 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160293608] [2019-10-14 23:15:15,233 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:15,233 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:15,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:15,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:15,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:15,311 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-14 23:15:15,312 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160293608] [2019-10-14 23:15:15,312 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:15,312 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:15:15,313 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867053203] [2019-10-14 23:15:15,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:15:15,314 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:15,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:15:15,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:15:15,314 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 6 states. [2019-10-14 23:15:15,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:15,470 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-10-14 23:15:15,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:15:15,471 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-10-14 23:15:15,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:15,473 INFO L225 Difference]: With dead ends: 76 [2019-10-14 23:15:15,473 INFO L226 Difference]: Without dead ends: 74 [2019-10-14 23:15:15,473 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-14 23:15:15,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-14 23:15:15,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-10-14 23:15:15,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-10-14 23:15:15,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2019-10-14 23:15:15,489 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 23 [2019-10-14 23:15:15,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:15,489 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2019-10-14 23:15:15,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:15:15,490 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2019-10-14 23:15:15,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-14 23:15:15,493 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:15,494 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-14 23:15:15,495 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:15,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:15,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1317531748, now seen corresponding path program 1 times [2019-10-14 23:15:15,496 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:15,496 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53638580] [2019-10-14 23:15:15,497 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:15,497 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:15,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:15,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:15,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:15,601 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-14 23:15:15,605 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53638580] [2019-10-14 23:15:15,605 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:15,605 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:15:15,605 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786179696] [2019-10-14 23:15:15,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:15:15,608 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:15,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:15:15,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:15:15,609 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 6 states. [2019-10-14 23:15:16,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:16,067 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2019-10-14 23:15:16,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-14 23:15:16,068 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-10-14 23:15:16,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:16,070 INFO L225 Difference]: With dead ends: 141 [2019-10-14 23:15:16,080 INFO L226 Difference]: Without dead ends: 139 [2019-10-14 23:15:16,081 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-14 23:15:16,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-10-14 23:15:16,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 77. [2019-10-14 23:15:16,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-14 23:15:16,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2019-10-14 23:15:16,101 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 26 [2019-10-14 23:15:16,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:16,104 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2019-10-14 23:15:16,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:15:16,104 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2019-10-14 23:15:16,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-14 23:15:16,105 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:16,105 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-14 23:15:16,106 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:16,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:16,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1321265557, now seen corresponding path program 1 times [2019-10-14 23:15:16,106 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:16,107 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658960579] [2019-10-14 23:15:16,107 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:16,107 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:16,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:16,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:16,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:16,219 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-14 23:15:16,220 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658960579] [2019-10-14 23:15:16,220 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:16,220 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:15:16,221 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388925320] [2019-10-14 23:15:16,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:15:16,223 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:16,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:15:16,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:15:16,224 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 6 states. [2019-10-14 23:15:16,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:16,536 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2019-10-14 23:15:16,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-14 23:15:16,537 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-10-14 23:15:16,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:16,540 INFO L225 Difference]: With dead ends: 108 [2019-10-14 23:15:16,540 INFO L226 Difference]: Without dead ends: 106 [2019-10-14 23:15:16,541 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-14 23:15:16,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-10-14 23:15:16,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 79. [2019-10-14 23:15:16,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-10-14 23:15:16,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2019-10-14 23:15:16,549 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 26 [2019-10-14 23:15:16,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:16,550 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2019-10-14 23:15:16,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:15:16,550 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2019-10-14 23:15:16,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-14 23:15:16,551 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:16,551 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-14 23:15:16,552 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:16,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:16,552 INFO L82 PathProgramCache]: Analyzing trace with hash -2106185532, now seen corresponding path program 1 times [2019-10-14 23:15:16,552 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:16,553 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050909938] [2019-10-14 23:15:16,553 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:16,553 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:16,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:16,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:16,635 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-14 23:15:16,635 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050909938] [2019-10-14 23:15:16,636 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:16,636 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:15:16,636 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767011290] [2019-10-14 23:15:16,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:15:16,637 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:16,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:15:16,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:15:16,637 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 6 states. [2019-10-14 23:15:16,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:16,865 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2019-10-14 23:15:16,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:15:16,866 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-10-14 23:15:16,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:16,868 INFO L225 Difference]: With dead ends: 121 [2019-10-14 23:15:16,868 INFO L226 Difference]: Without dead ends: 119 [2019-10-14 23:15:16,869 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-14 23:15:16,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-10-14 23:15:16,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 77. [2019-10-14 23:15:16,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-14 23:15:16,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2019-10-14 23:15:16,877 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 27 [2019-10-14 23:15:16,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:16,877 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2019-10-14 23:15:16,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:15:16,877 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2019-10-14 23:15:16,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-14 23:15:16,878 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:16,878 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-14 23:15:16,879 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:16,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:16,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1990437563, now seen corresponding path program 1 times [2019-10-14 23:15:16,880 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:16,880 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061082291] [2019-10-14 23:15:16,880 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:16,880 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:16,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:16,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:16,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:16,969 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-14 23:15:16,970 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061082291] [2019-10-14 23:15:16,970 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:16,970 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:15:16,970 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958256345] [2019-10-14 23:15:16,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:15:16,971 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:16,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:15:16,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:15:16,973 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 6 states. [2019-10-14 23:15:17,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:17,145 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2019-10-14 23:15:17,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:15:17,146 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-10-14 23:15:17,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:17,147 INFO L225 Difference]: With dead ends: 77 [2019-10-14 23:15:17,147 INFO L226 Difference]: Without dead ends: 75 [2019-10-14 23:15:17,148 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-14 23:15:17,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-10-14 23:15:17,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-10-14 23:15:17,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-14 23:15:17,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2019-10-14 23:15:17,155 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 27 [2019-10-14 23:15:17,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:17,155 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2019-10-14 23:15:17,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:15:17,155 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2019-10-14 23:15:17,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-14 23:15:17,156 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:17,156 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-14 23:15:17,157 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:17,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:17,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1549950965, now seen corresponding path program 1 times [2019-10-14 23:15:17,158 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:17,158 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809944347] [2019-10-14 23:15:17,158 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:17,158 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:17,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:17,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:17,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:17,207 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-14 23:15:17,207 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809944347] [2019-10-14 23:15:17,207 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:17,207 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:15:17,208 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868374774] [2019-10-14 23:15:17,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:15:17,208 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:17,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:15:17,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:15:17,209 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 4 states. [2019-10-14 23:15:17,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:17,336 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2019-10-14 23:15:17,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:15:17,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-10-14 23:15:17,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:17,337 INFO L225 Difference]: With dead ends: 115 [2019-10-14 23:15:17,337 INFO L226 Difference]: Without dead ends: 75 [2019-10-14 23:15:17,338 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-14 23:15:17,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-10-14 23:15:17,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-10-14 23:15:17,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-14 23:15:17,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2019-10-14 23:15:17,343 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 29 [2019-10-14 23:15:17,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:17,344 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2019-10-14 23:15:17,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:15:17,344 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2019-10-14 23:15:17,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-14 23:15:17,345 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:17,345 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-14 23:15:17,346 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:17,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:17,346 INFO L82 PathProgramCache]: Analyzing trace with hash 54388864, now seen corresponding path program 1 times [2019-10-14 23:15:17,347 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:17,347 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462015610] [2019-10-14 23:15:17,347 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:17,347 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:17,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:17,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:17,399 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-14 23:15:17,400 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462015610] [2019-10-14 23:15:17,400 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:17,400 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:15:17,400 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574675666] [2019-10-14 23:15:17,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:15:17,401 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:17,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:15:17,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:15:17,402 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand 6 states. [2019-10-14 23:15:17,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:17,539 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-10-14 23:15:17,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:15:17,540 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-10-14 23:15:17,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:17,541 INFO L225 Difference]: With dead ends: 76 [2019-10-14 23:15:17,541 INFO L226 Difference]: Without dead ends: 74 [2019-10-14 23:15:17,542 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-14 23:15:17,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-14 23:15:17,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-10-14 23:15:17,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-14 23:15:17,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2019-10-14 23:15:17,547 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 30 [2019-10-14 23:15:17,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:17,548 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2019-10-14 23:15:17,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:15:17,548 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2019-10-14 23:15:17,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-14 23:15:17,549 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:17,549 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-14 23:15:17,550 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:17,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:17,550 INFO L82 PathProgramCache]: Analyzing trace with hash -196719107, now seen corresponding path program 1 times [2019-10-14 23:15:17,550 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:17,550 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617275167] [2019-10-14 23:15:17,551 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:17,551 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:17,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:17,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:17,629 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-14 23:15:17,629 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617275167] [2019-10-14 23:15:17,630 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796172933] [2019-10-14 23:15:17,630 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-14 23:15:17,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:17,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-14 23:15:17,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:15:17,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:15:17,770 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-14 23:15:17,771 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:15:17,771 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2019-10-14 23:15:17,771 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220813979] [2019-10-14 23:15:17,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-14 23:15:17,772 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:17,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-14 23:15:17,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:15:17,772 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 9 states. [2019-10-14 23:15:18,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:18,011 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2019-10-14 23:15:18,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:15:18,011 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2019-10-14 23:15:18,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:18,012 INFO L225 Difference]: With dead ends: 111 [2019-10-14 23:15:18,013 INFO L226 Difference]: Without dead ends: 109 [2019-10-14 23:15:18,013 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-14 23:15:18,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-10-14 23:15:18,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 70. [2019-10-14 23:15:18,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-14 23:15:18,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2019-10-14 23:15:18,018 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 30 [2019-10-14 23:15:18,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:18,019 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2019-10-14 23:15:18,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-14 23:15:18,019 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2019-10-14 23:15:18,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-14 23:15:18,020 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:18,020 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-14 23:15:18,221 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:15:18,222 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:18,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:18,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1686057932, now seen corresponding path program 1 times [2019-10-14 23:15:18,223 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:18,224 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118118799] [2019-10-14 23:15:18,224 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:18,224 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:18,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:18,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:18,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:18,293 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-14 23:15:18,294 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118118799] [2019-10-14 23:15:18,294 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:18,294 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:15:18,295 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206973808] [2019-10-14 23:15:18,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:15:18,295 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:18,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:15:18,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:15:18,296 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 6 states. [2019-10-14 23:15:18,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:18,410 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-10-14 23:15:18,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:15:18,411 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-10-14 23:15:18,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:18,412 INFO L225 Difference]: With dead ends: 70 [2019-10-14 23:15:18,412 INFO L226 Difference]: Without dead ends: 68 [2019-10-14 23:15:18,412 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-14 23:15:18,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-14 23:15:18,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-10-14 23:15:18,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-14 23:15:18,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2019-10-14 23:15:18,417 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 31 [2019-10-14 23:15:18,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:18,418 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2019-10-14 23:15:18,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:15:18,418 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2019-10-14 23:15:18,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-14 23:15:18,419 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:18,419 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-14 23:15:18,420 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:18,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:18,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1806773561, now seen corresponding path program 1 times [2019-10-14 23:15:18,420 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:18,421 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186051936] [2019-10-14 23:15:18,421 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:18,421 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:18,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:18,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:18,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:18,505 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-14 23:15:18,505 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186051936] [2019-10-14 23:15:18,505 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37990133] [2019-10-14 23:15:18,505 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-14 23:15:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:18,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-14 23:15:18,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:15:18,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:15:18,621 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-14 23:15:18,622 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:15:18,622 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2019-10-14 23:15:18,622 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574819205] [2019-10-14 23:15:18,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-14 23:15:18,623 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:18,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-14 23:15:18,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:15:18,623 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 9 states. [2019-10-14 23:15:18,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:18,800 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2019-10-14 23:15:18,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:15:18,801 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-10-14 23:15:18,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:18,802 INFO L225 Difference]: With dead ends: 69 [2019-10-14 23:15:18,802 INFO L226 Difference]: Without dead ends: 67 [2019-10-14 23:15:18,802 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-14 23:15:18,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-10-14 23:15:18,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2019-10-14 23:15:18,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-14 23:15:18,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2019-10-14 23:15:18,807 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 31 [2019-10-14 23:15:18,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:18,807 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2019-10-14 23:15:18,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-14 23:15:18,807 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2019-10-14 23:15:18,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-14 23:15:18,808 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:18,808 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-14 23:15:19,009 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:15:19,010 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:19,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:19,011 INFO L82 PathProgramCache]: Analyzing trace with hash -287576151, now seen corresponding path program 1 times [2019-10-14 23:15:19,011 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:19,011 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676685497] [2019-10-14 23:15:19,012 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:19,012 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:19,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:19,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:19,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:19,110 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-14 23:15:19,110 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676685497] [2019-10-14 23:15:19,110 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:19,111 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:15:19,111 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446036201] [2019-10-14 23:15:19,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:15:19,114 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:19,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:15:19,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:15:19,115 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 6 states. [2019-10-14 23:15:19,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:19,240 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2019-10-14 23:15:19,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:15:19,241 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-10-14 23:15:19,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:19,242 INFO L225 Difference]: With dead ends: 63 [2019-10-14 23:15:19,242 INFO L226 Difference]: Without dead ends: 61 [2019-10-14 23:15:19,242 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-14 23:15:19,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-14 23:15:19,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-10-14 23:15:19,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-14 23:15:19,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-10-14 23:15:19,247 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 34 [2019-10-14 23:15:19,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:19,247 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-10-14 23:15:19,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:15:19,248 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-10-14 23:15:19,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-14 23:15:19,248 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:19,248 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-14 23:15:19,249 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:19,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:19,249 INFO L82 PathProgramCache]: Analyzing trace with hash -324922921, now seen corresponding path program 1 times [2019-10-14 23:15:19,250 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:19,250 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508575308] [2019-10-14 23:15:19,250 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:19,250 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:19,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:19,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:19,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:19,316 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-14 23:15:19,316 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508575308] [2019-10-14 23:15:19,316 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:19,317 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-14 23:15:19,317 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425636416] [2019-10-14 23:15:19,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-14 23:15:19,318 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:19,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-14 23:15:19,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:15:19,318 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 8 states. [2019-10-14 23:15:19,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:19,496 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2019-10-14 23:15:19,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-14 23:15:19,496 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2019-10-14 23:15:19,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:19,497 INFO L225 Difference]: With dead ends: 71 [2019-10-14 23:15:19,497 INFO L226 Difference]: Without dead ends: 69 [2019-10-14 23:15:19,498 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-14 23:15:19,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-14 23:15:19,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2019-10-14 23:15:19,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-14 23:15:19,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2019-10-14 23:15:19,502 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 35 [2019-10-14 23:15:19,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:19,503 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2019-10-14 23:15:19,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-14 23:15:19,503 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2019-10-14 23:15:19,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-14 23:15:19,504 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:19,504 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-14 23:15:19,504 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:19,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:19,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1080633106, now seen corresponding path program 1 times [2019-10-14 23:15:19,505 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:19,505 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657303511] [2019-10-14 23:15:19,506 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:19,506 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:19,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:19,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:19,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:19,557 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-14 23:15:19,558 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657303511] [2019-10-14 23:15:19,558 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:19,558 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:15:19,558 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346675401] [2019-10-14 23:15:19,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:15:19,559 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:19,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:15:19,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:15:19,559 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 6 states. [2019-10-14 23:15:19,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:19,807 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2019-10-14 23:15:19,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-14 23:15:19,808 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-10-14 23:15:19,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:19,808 INFO L225 Difference]: With dead ends: 91 [2019-10-14 23:15:19,809 INFO L226 Difference]: Without dead ends: 89 [2019-10-14 23:15:19,809 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-14 23:15:19,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-10-14 23:15:19,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2019-10-14 23:15:19,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-14 23:15:19,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2019-10-14 23:15:19,814 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 38 [2019-10-14 23:15:19,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:19,815 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2019-10-14 23:15:19,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:15:19,815 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2019-10-14 23:15:19,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-14 23:15:19,816 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:19,816 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-14 23:15:19,816 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:19,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:19,817 INFO L82 PathProgramCache]: Analyzing trace with hash -860108895, now seen corresponding path program 1 times [2019-10-14 23:15:19,817 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:19,817 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074895564] [2019-10-14 23:15:19,818 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:19,818 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:19,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:19,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:19,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:19,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:15:19,867 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074895564] [2019-10-14 23:15:19,867 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:19,867 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:15:19,868 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269977265] [2019-10-14 23:15:19,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:15:19,868 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:19,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:15:19,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:15:19,869 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 6 states. [2019-10-14 23:15:20,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:20,015 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2019-10-14 23:15:20,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:15:20,015 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-10-14 23:15:20,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:20,016 INFO L225 Difference]: With dead ends: 61 [2019-10-14 23:15:20,017 INFO L226 Difference]: Without dead ends: 59 [2019-10-14 23:15:20,017 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-14 23:15:20,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-14 23:15:20,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-10-14 23:15:20,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-14 23:15:20,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2019-10-14 23:15:20,021 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 39 [2019-10-14 23:15:20,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:20,021 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2019-10-14 23:15:20,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:15:20,022 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2019-10-14 23:15:20,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-14 23:15:20,022 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:20,022 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-14 23:15:20,023 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:20,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:20,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1930828060, now seen corresponding path program 1 times [2019-10-14 23:15:20,023 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:20,024 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098493645] [2019-10-14 23:15:20,024 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:20,024 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:20,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:20,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:20,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:20,074 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-14 23:15:20,074 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098493645] [2019-10-14 23:15:20,074 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:20,075 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:15:20,075 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73755721] [2019-10-14 23:15:20,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:15:20,075 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:20,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:15:20,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:15:20,076 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 6 states. [2019-10-14 23:15:20,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:20,243 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-10-14 23:15:20,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:15:20,244 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-10-14 23:15:20,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:20,245 INFO L225 Difference]: With dead ends: 70 [2019-10-14 23:15:20,245 INFO L226 Difference]: Without dead ends: 68 [2019-10-14 23:15:20,245 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-14 23:15:20,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-14 23:15:20,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-10-14 23:15:20,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-14 23:15:20,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-10-14 23:15:20,251 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 41 [2019-10-14 23:15:20,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:20,252 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-10-14 23:15:20,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:15:20,252 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-10-14 23:15:20,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-14 23:15:20,252 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:20,253 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-14 23:15:20,253 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:20,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:20,253 INFO L82 PathProgramCache]: Analyzing trace with hash 273875486, now seen corresponding path program 1 times [2019-10-14 23:15:20,254 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:20,254 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766971770] [2019-10-14 23:15:20,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:20,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:20,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:20,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:20,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:20,338 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-14 23:15:20,341 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766971770] [2019-10-14 23:15:20,341 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:20,341 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:15:20,342 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768434582] [2019-10-14 23:15:20,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:15:20,342 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:20,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:15:20,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:15:20,343 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 6 states. [2019-10-14 23:15:20,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:20,510 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2019-10-14 23:15:20,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:15:20,511 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-10-14 23:15:20,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:20,512 INFO L225 Difference]: With dead ends: 68 [2019-10-14 23:15:20,512 INFO L226 Difference]: Without dead ends: 66 [2019-10-14 23:15:20,512 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-14 23:15:20,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-14 23:15:20,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-10-14 23:15:20,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-14 23:15:20,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-10-14 23:15:20,517 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 42 [2019-10-14 23:15:20,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:20,518 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-10-14 23:15:20,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:15:20,518 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-10-14 23:15:20,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-14 23:15:20,519 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:20,519 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-14 23:15:20,519 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:20,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:20,520 INFO L82 PathProgramCache]: Analyzing trace with hash -99791318, now seen corresponding path program 1 times [2019-10-14 23:15:20,520 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:20,520 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237362530] [2019-10-14 23:15:20,520 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:20,520 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:20,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:20,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:20,577 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-14 23:15:20,578 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237362530] [2019-10-14 23:15:20,578 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:20,578 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:15:20,578 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407655373] [2019-10-14 23:15:20,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:15:20,579 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:20,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:15:20,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:15:20,580 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 6 states. [2019-10-14 23:15:20,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:20,813 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2019-10-14 23:15:20,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-14 23:15:20,813 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-10-14 23:15:20,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:20,814 INFO L225 Difference]: With dead ends: 90 [2019-10-14 23:15:20,814 INFO L226 Difference]: Without dead ends: 88 [2019-10-14 23:15:20,815 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-14 23:15:20,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-10-14 23:15:20,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 69. [2019-10-14 23:15:20,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-14 23:15:20,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2019-10-14 23:15:20,820 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 43 [2019-10-14 23:15:20,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:20,821 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2019-10-14 23:15:20,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:15:20,821 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2019-10-14 23:15:20,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-14 23:15:20,821 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:20,822 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-14 23:15:20,822 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:20,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:20,822 INFO L82 PathProgramCache]: Analyzing trace with hash 2020599801, now seen corresponding path program 1 times [2019-10-14 23:15:20,823 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:20,823 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056610323] [2019-10-14 23:15:20,823 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:20,823 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:20,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:20,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:20,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:20,916 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-14 23:15:20,917 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056610323] [2019-10-14 23:15:20,917 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399890508] [2019-10-14 23:15:20,917 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-14 23:15:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:20,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-14 23:15:20,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:15:21,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:15:21,029 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-14 23:15:21,029 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:15:21,029 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2019-10-14 23:15:21,029 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885428340] [2019-10-14 23:15:21,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-14 23:15:21,030 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:21,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-14 23:15:21,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:15:21,031 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 9 states. [2019-10-14 23:15:21,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:21,329 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2019-10-14 23:15:21,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 23:15:21,329 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2019-10-14 23:15:21,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:21,330 INFO L225 Difference]: With dead ends: 70 [2019-10-14 23:15:21,331 INFO L226 Difference]: Without dead ends: 68 [2019-10-14 23:15:21,331 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-14 23:15:21,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-14 23:15:21,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-10-14 23:15:21,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-14 23:15:21,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-10-14 23:15:21,336 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 44 [2019-10-14 23:15:21,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:21,337 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-10-14 23:15:21,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-14 23:15:21,337 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-10-14 23:15:21,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-14 23:15:21,337 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:21,338 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-14 23:15:21,542 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:15:21,547 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:21,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:21,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1201439652, now seen corresponding path program 1 times [2019-10-14 23:15:21,548 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:21,548 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046529873] [2019-10-14 23:15:21,548 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:21,548 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:21,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:21,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:21,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:21,640 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-14 23:15:21,640 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046529873] [2019-10-14 23:15:21,640 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:21,640 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:15:21,641 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738737030] [2019-10-14 23:15:21,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:15:21,641 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:21,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:15:21,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:15:21,642 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 6 states. [2019-10-14 23:15:21,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:21,829 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-10-14 23:15:21,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:15:21,831 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2019-10-14 23:15:21,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:21,832 INFO L225 Difference]: With dead ends: 71 [2019-10-14 23:15:21,832 INFO L226 Difference]: Without dead ends: 69 [2019-10-14 23:15:21,833 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-14 23:15:21,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-14 23:15:21,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2019-10-14 23:15:21,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-14 23:15:21,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-10-14 23:15:21,838 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 44 [2019-10-14 23:15:21,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:21,838 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-10-14 23:15:21,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:15:21,839 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-10-14 23:15:21,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-14 23:15:21,839 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:21,839 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-14 23:15:21,840 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:21,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:21,840 INFO L82 PathProgramCache]: Analyzing trace with hash 40764835, now seen corresponding path program 1 times [2019-10-14 23:15:21,840 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:21,841 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095414885] [2019-10-14 23:15:21,841 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:21,841 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:21,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:21,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:21,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:21,913 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-14 23:15:21,913 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095414885] [2019-10-14 23:15:21,913 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:21,913 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:15:21,914 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530732897] [2019-10-14 23:15:21,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:15:21,915 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:21,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:15:21,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:15:21,915 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 6 states. [2019-10-14 23:15:22,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:22,173 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2019-10-14 23:15:22,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 23:15:22,173 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2019-10-14 23:15:22,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:22,174 INFO L225 Difference]: With dead ends: 77 [2019-10-14 23:15:22,174 INFO L226 Difference]: Without dead ends: 75 [2019-10-14 23:15:22,175 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-14 23:15:22,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-10-14 23:15:22,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 55. [2019-10-14 23:15:22,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-14 23:15:22,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2019-10-14 23:15:22,180 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 49 [2019-10-14 23:15:22,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:22,181 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2019-10-14 23:15:22,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:15:22,181 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2019-10-14 23:15:22,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-14 23:15:22,182 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:22,182 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-14 23:15:22,182 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:22,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:22,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1664106253, now seen corresponding path program 1 times [2019-10-14 23:15:22,183 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:22,183 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384046833] [2019-10-14 23:15:22,183 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:22,184 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:22,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:22,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:22,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:22,241 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-14 23:15:22,241 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384046833] [2019-10-14 23:15:22,241 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191733922] [2019-10-14 23:15:22,241 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-14 23:15:22,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:22,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-14 23:15:22,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:15:22,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:15:22,377 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-14 23:15:22,377 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:15:22,378 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2019-10-14 23:15:22,378 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730372701] [2019-10-14 23:15:22,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:15:22,380 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:22,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:15:22,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:15:22,381 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 4 states. [2019-10-14 23:15:22,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:22,423 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2019-10-14 23:15:22,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:15:22,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-10-14 23:15:22,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:22,423 INFO L225 Difference]: With dead ends: 60 [2019-10-14 23:15:22,424 INFO L226 Difference]: Without dead ends: 0 [2019-10-14 23:15:22,424 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-14 23:15:22,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-14 23:15:22,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-14 23:15:22,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-14 23:15:22,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-14 23:15:22,426 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2019-10-14 23:15:22,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:22,427 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-14 23:15:22,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:15:22,427 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-14 23:15:22,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-14 23:15:22,627 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:15:22,633 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-14 23:15:22,773 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 116 [2019-10-14 23:15:23,538 WARN L191 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 76 [2019-10-14 23:15:23,872 WARN L191 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2019-10-14 23:15:24,514 WARN L191 SmtUtils]: Spent 625.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 73 [2019-10-14 23:15:24,691 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 33 [2019-10-14 23:15:24,703 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-14 23:15:24,703 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-14 23:15:24,703 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:15:24,704 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:15:24,704 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-14 23:15:24,704 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-14 23:15:24,704 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-14 23:15:24,704 INFO L443 ceAbstractionStarter]: For program point L60(lines 60 412) no Hoare annotation was computed. [2019-10-14 23:15:24,704 INFO L443 ceAbstractionStarter]: For program point L250(line 250) no Hoare annotation was computed. [2019-10-14 23:15:24,704 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 8 434) no Hoare annotation was computed. [2019-10-14 23:15:24,704 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-10-14 23:15:24,704 INFO L443 ceAbstractionStarter]: For program point L118(lines 118 398) no Hoare annotation was computed. [2019-10-14 23:15:24,704 INFO L443 ceAbstractionStarter]: For program point L209(line 209) no Hoare annotation was computed. [2019-10-14 23:15:24,705 INFO L443 ceAbstractionStarter]: For program point L267(line 267) no Hoare annotation was computed. [2019-10-14 23:15:24,705 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 140) no Hoare annotation was computed. [2019-10-14 23:15:24,705 INFO L443 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 267) no Hoare annotation was computed. [2019-10-14 23:15:24,705 INFO L443 ceAbstractionStarter]: For program point L36(lines 36 430) no Hoare annotation was computed. [2019-10-14 23:15:24,705 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 92) no Hoare annotation was computed. [2019-10-14 23:15:24,705 INFO L443 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2019-10-14 23:15:24,705 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 390) no Hoare annotation was computed. [2019-10-14 23:15:24,705 INFO L443 ceAbstractionStarter]: For program point L78(lines 78 409) no Hoare annotation was computed. [2019-10-14 23:15:24,705 INFO L443 ceAbstractionStarter]: For program point L301(lines 301 311) no Hoare annotation was computed. [2019-10-14 23:15:24,705 INFO L443 ceAbstractionStarter]: For program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 381) no Hoare annotation was computed. [2019-10-14 23:15:24,705 INFO L443 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 221) no Hoare annotation was computed. [2019-10-14 23:15:24,706 INFO L443 ceAbstractionStarter]: For program point L219(lines 219 339) no Hoare annotation was computed. [2019-10-14 23:15:24,706 INFO L443 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-10-14 23:15:24,706 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 427) no Hoare annotation was computed. [2019-10-14 23:15:24,706 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-14 23:15:24,706 INFO L443 ceAbstractionStarter]: For program point L277(lines 277 315) no Hoare annotation was computed. [2019-10-14 23:15:24,706 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 8 434) no Hoare annotation was computed. [2019-10-14 23:15:24,706 INFO L443 ceAbstractionStarter]: For program point L236(lines 236 326) no Hoare annotation was computed. [2019-10-14 23:15:24,706 INFO L443 ceAbstractionStarter]: For program point L170(lines 170 352) no Hoare annotation was computed. [2019-10-14 23:15:24,706 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 108) no Hoare annotation was computed. [2019-10-14 23:15:24,707 INFO L443 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 238) no Hoare annotation was computed. [2019-10-14 23:15:24,707 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 431) no Hoare annotation was computed. [2019-10-14 23:15:24,707 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 8 434) the Hoare annotation is: (= ~__return_375~0 |old(~__return_375~0)|) [2019-10-14 23:15:24,707 INFO L443 ceAbstractionStarter]: For program point L369(line 369) no Hoare annotation was computed. [2019-10-14 23:15:24,707 INFO L443 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2019-10-14 23:15:24,707 INFO L443 ceAbstractionStarter]: For program point L303(line 303) no Hoare annotation was computed. [2019-10-14 23:15:24,707 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 357) no Hoare annotation was computed. [2019-10-14 23:15:24,707 INFO L443 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 303) no Hoare annotation was computed. [2019-10-14 23:15:24,708 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 333) no Hoare annotation was computed. [2019-10-14 23:15:24,708 INFO L443 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2019-10-14 23:15:24,708 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 392) no Hoare annotation was computed. [2019-10-14 23:15:24,708 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2019-10-14 23:15:24,708 INFO L443 ceAbstractionStarter]: For program point L221(line 221) no Hoare annotation was computed. [2019-10-14 23:15:24,708 INFO L443 ceAbstractionStarter]: For program point L56(lines 56 422) no Hoare annotation was computed. [2019-10-14 23:15:24,708 INFO L443 ceAbstractionStarter]: For program point L279(line 279) no Hoare annotation was computed. [2019-10-14 23:15:24,708 INFO L443 ceAbstractionStarter]: For program point L48(lines 48 428) no Hoare annotation was computed. [2019-10-14 23:15:24,708 INFO L443 ceAbstractionStarter]: For program point L238(line 238) no Hoare annotation was computed. [2019-10-14 23:15:24,708 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-10-14 23:15:24,708 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 400) no Hoare annotation was computed. [2019-10-14 23:15:24,708 INFO L443 ceAbstractionStarter]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 369) no Hoare annotation was computed. [2019-10-14 23:15:24,709 INFO L443 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 209) no Hoare annotation was computed. [2019-10-14 23:15:24,709 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-14 23:15:24,709 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 349) no Hoare annotation was computed. [2019-10-14 23:15:24,709 INFO L443 ceAbstractionStarter]: For program point L379(lines 379 388) no Hoare annotation was computed. [2019-10-14 23:15:24,709 INFO L443 ceAbstractionStarter]: For program point L90(lines 90 407) no Hoare annotation was computed. [2019-10-14 23:15:24,709 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 432) no Hoare annotation was computed. [2019-10-14 23:15:24,710 INFO L443 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2019-10-14 23:15:24,710 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-14 23:15:24,710 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 152) no Hoare annotation was computed. [2019-10-14 23:15:24,710 INFO L443 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 279) no Hoare annotation was computed. [2019-10-14 23:15:24,710 INFO L443 ceAbstractionStarter]: For program point L99(lines 99 406) no Hoare annotation was computed. [2019-10-14 23:15:24,710 INFO L443 ceAbstractionStarter]: For program point L66(lines 66 411) no Hoare annotation was computed. [2019-10-14 23:15:24,711 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-14 23:15:24,711 INFO L443 ceAbstractionStarter]: For program point L289(lines 289 313) no Hoare annotation was computed. [2019-10-14 23:15:24,711 INFO L443 ceAbstractionStarter]: For program point L157(lines 157 354) no Hoare annotation was computed. [2019-10-14 23:15:24,711 INFO L443 ceAbstractionStarter]: For program point L58(lines 58 417) no Hoare annotation was computed. [2019-10-14 23:15:24,711 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 324) no Hoare annotation was computed. [2019-10-14 23:15:24,711 INFO L443 ceAbstractionStarter]: For program point L182(lines 182 350) no Hoare annotation was computed. [2019-10-14 23:15:24,711 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-14 23:15:24,712 INFO L443 ceAbstractionStarter]: For program point L207(lines 207 341) no Hoare annotation was computed. [2019-10-14 23:15:24,712 INFO L443 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-10-14 23:15:24,712 INFO L443 ceAbstractionStarter]: For program point L42(lines 42 429) no Hoare annotation was computed. [2019-10-14 23:15:24,712 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 317) no Hoare annotation was computed. [2019-10-14 23:15:24,712 INFO L443 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 291) no Hoare annotation was computed. [2019-10-14 23:15:24,712 INFO L443 ceAbstractionStarter]: For program point L199(lines 199 348) no Hoare annotation was computed. [2019-10-14 23:15:24,712 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2019-10-14 23:15:24,713 INFO L443 ceAbstractionStarter]: For program point L257(lines 257 323) no Hoare annotation was computed. [2019-10-14 23:15:24,713 INFO L443 ceAbstractionStarter]: For program point L381(line 381) no Hoare annotation was computed. [2019-10-14 23:15:24,713 INFO L443 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2019-10-14 23:15:24,713 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 355) no Hoare annotation was computed. [2019-10-14 23:15:24,713 INFO L443 ceAbstractionStarter]: For program point L18(lines 18 433) no Hoare annotation was computed. [2019-10-14 23:15:24,713 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 120) no Hoare annotation was computed. [2019-10-14 23:15:24,713 INFO L443 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 250) no Hoare annotation was computed. [2019-10-14 23:15:24,713 INFO L443 ceAbstractionStarter]: For program point L291(line 291) no Hoare annotation was computed. [2019-10-14 23:15:24,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:15:24 BoogieIcfgContainer [2019-10-14 23:15:24,745 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-14 23:15:24,746 INFO L168 Benchmark]: Toolchain (without parser) took 11814.02 ms. Allocated memory was 142.6 MB in the beginning and 319.8 MB in the end (delta: 177.2 MB). Free memory was 102.6 MB in the beginning and 254.9 MB in the end (delta: -152.4 MB). Peak memory consumption was 184.2 MB. Max. memory is 7.1 GB. [2019-10-14 23:15:24,747 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 142.6 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-10-14 23:15:24,748 INFO L168 Benchmark]: CACSL2BoogieTranslator took 465.96 ms. Allocated memory was 142.6 MB in the beginning and 204.5 MB in the end (delta: 61.9 MB). Free memory was 102.4 MB in the beginning and 183.1 MB in the end (delta: -80.8 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. [2019-10-14 23:15:24,748 INFO L168 Benchmark]: Boogie Preprocessor took 54.46 ms. Allocated memory is still 204.5 MB. Free memory was 183.1 MB in the beginning and 181.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-10-14 23:15:24,749 INFO L168 Benchmark]: RCFGBuilder took 454.57 ms. Allocated memory is still 204.5 MB. Free memory was 181.2 MB in the beginning and 154.8 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2019-10-14 23:15:24,750 INFO L168 Benchmark]: TraceAbstraction took 10834.25 ms. Allocated memory was 204.5 MB in the beginning and 319.8 MB in the end (delta: 115.3 MB). Free memory was 154.1 MB in the beginning and 254.9 MB in the end (delta: -100.8 MB). Peak memory consumption was 173.9 MB. Max. memory is 7.1 GB. [2019-10-14 23:15:24,753 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.48 ms. Allocated memory is still 142.6 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 465.96 ms. Allocated memory was 142.6 MB in the beginning and 204.5 MB in the end (delta: 61.9 MB). Free memory was 102.4 MB in the beginning and 183.1 MB in the end (delta: -80.8 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 54.46 ms. Allocated memory is still 204.5 MB. Free memory was 183.1 MB in the beginning and 181.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 454.57 ms. Allocated memory is still 204.5 MB. Free memory was 181.2 MB in the beginning and 154.8 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10834.25 ms. Allocated memory was 204.5 MB in the beginning and 319.8 MB in the end (delta: 115.3 MB). Free memory was 154.1 MB in the beginning and 254.9 MB in the end (delta: -100.8 MB). Peak memory consumption was 173.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 152]: 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: 279]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 250]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 267]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 291]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 303]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 381]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 369]: 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: 92]: 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: 120]: 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: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 209]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 184]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 225]: Loop Invariant Derived loop invariant: (((((((((2 <= main__cp && 0 < main__scheme) && main__cp + 2 <= main__urilen) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && (((((!(__VERIFIER_assert__cond == 0) && ((((__VERIFIER_assert__cond == 1 && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 <= main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 <= main__urilen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 0 == main__c) && __return_375 == \old(__return_375)) || (((((((((2 <= main__cp && main__c + 2 <= main__tokenlen) && (((((!(__VERIFIER_assert__cond == 0) && ((((__VERIFIER_assert__cond == 1 && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 <= main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 <= main__urilen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 0 == main__c) && __return_375 == \old(__return_375)) && 0 < main__scheme) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1)) || ((((((((((((2 <= main__cp && 1 <= main__c) && !(__VERIFIER_assert__cond == 0)) && (((((!(__VERIFIER_assert__cond == 0) && ((((__VERIFIER_assert__cond == 1 && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 <= main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 <= main__urilen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && __return_375 == \old(__return_375)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: ((((__VERIFIER_assert__cond == 1 && main__cp < main__urilen) && (((((0 < main__scheme && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || (((((!(__VERIFIER_assert__cond == 0) && 0 < main__scheme) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)))) && main__urilen == main__cp + 1) && __return_375 == \old(__return_375)) || ((((__VERIFIER_assert__cond == 1 && main__cp < main__urilen) && (((((0 < main__scheme && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || (((((!(__VERIFIER_assert__cond == 0) && 0 < main__scheme) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)))) && __VERIFIER_assert__cond == 1) && __return_375 == \old(__return_375)) - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: (((((!(__VERIFIER_assert__cond == 0) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && (((!(__VERIFIER_assert__cond == 0) && 1 <= main__c) && ((((((((2 <= main__cp && 0 < main__scheme) && main__cp + 1 < main__urilen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && (!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && (__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __return_375 == \old(__return_375)) || (((__VERIFIER_assert__cond == 1 && __VERIFIER_assert__cond == 1) && ((main__c + 2 <= main__tokenlen && ((((((((2 <= main__cp && 0 < main__scheme) && main__cp + 1 < main__urilen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && (!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && (__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 == main__c) && __return_375 == \old(__return_375)) - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: (((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 <= main__urilen) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 0 < main__scheme) && 1 <= main__cp) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) || ((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1)) && __return_375 == \old(__return_375) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: !(__VERIFIER_assert__cond == 0) && __return_375 == \old(__return_375) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 87 locations, 18 error locations. Result: SAFE, OverallTime: 10.7s, OverallIterations: 24, TraceHistogramMax: 2, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.0s, HoareTripleCheckerStatistics: 1389 SDtfs, 4056 SDslu, 453 SDs, 0 SdLazy, 2626 SolverSat, 219 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 430 GetRequests, 221 SyntacticMatches, 18 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 2.3s 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.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 287 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 17 NumberOfFragments, 611 HoareAnnotationTreeSize, 9 FomulaSimplifications, 40292 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 9 FomulaSimplificationsInter, 24127 FormulaSimplificationTreeSizeReductionInter, 1.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s 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...