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-0883e75 [2019-09-05 11:58:39,656 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 11:58:39,660 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 11:58:39,679 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 11:58:39,680 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 11:58:39,681 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 11:58:39,684 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 11:58:39,696 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 11:58:39,699 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 11:58:39,700 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 11:58:39,701 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 11:58:39,703 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 11:58:39,704 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 11:58:39,705 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 11:58:39,707 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 11:58:39,709 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 11:58:39,710 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 11:58:39,711 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 11:58:39,716 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 11:58:39,718 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 11:58:39,719 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 11:58:39,723 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 11:58:39,724 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 11:58:39,726 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 11:58:39,729 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 11:58:39,729 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 11:58:39,729 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 11:58:39,731 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 11:58:39,733 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 11:58:39,734 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 11:58:39,734 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 11:58:39,736 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 11:58:39,737 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 11:58:39,738 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 11:58:39,742 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 11:58:39,742 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 11:58:39,743 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 11:58:39,743 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 11:58:39,743 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 11:58:39,744 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 11:58:39,744 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 11:58:39,746 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-09-05 11:58:39,765 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 11:58:39,766 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 11:58:39,767 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-05 11:58:39,768 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-05 11:58:39,768 INFO L138 SettingsManager]: * Use SBE=true [2019-09-05 11:58:39,768 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 11:58:39,768 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 11:58:39,769 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-05 11:58:39,769 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 11:58:39,769 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 11:58:39,770 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 11:58:39,770 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 11:58:39,770 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 11:58:39,771 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 11:58:39,771 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 11:58:39,771 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-05 11:58:39,771 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 11:58:39,772 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 11:58:39,772 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 11:58:39,772 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-05 11:58:39,772 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-05 11:58:39,772 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 11:58:39,773 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 11:58:39,773 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 11:58:39,773 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-05 11:58:39,773 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-05 11:58:39,774 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 11:58:39,774 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 11:58:39,774 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-05 11:58:39,822 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 11:58:39,840 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 11:58:39,843 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 11:58:39,847 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 11:58:39,847 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 11:58:39,848 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-09-05 11:58:39,917 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/062cad2ab/3ab0db1a9cb34d9ab437141a27cf5cf2/FLAGdf82b6e65 [2019-09-05 11:58:40,316 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 11:58:40,317 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2019-09-05 11:58:40,325 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/062cad2ab/3ab0db1a9cb34d9ab437141a27cf5cf2/FLAGdf82b6e65 [2019-09-05 11:58:40,729 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/062cad2ab/3ab0db1a9cb34d9ab437141a27cf5cf2 [2019-09-05 11:58:40,739 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 11:58:40,741 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 11:58:40,742 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 11:58:40,742 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 11:58:40,747 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 11:58:40,748 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 11:58:40" (1/1) ... [2019-09-05 11:58:40,751 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@278ac997 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:58:40, skipping insertion in model container [2019-09-05 11:58:40,751 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 11:58:40" (1/1) ... [2019-09-05 11:58:40,758 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 11:58:40,794 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 11:58:40,998 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 11:58:41,003 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 11:58:41,150 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 11:58:41,164 INFO L192 MainTranslator]: Completed translation [2019-09-05 11:58:41,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:58:41 WrapperNode [2019-09-05 11:58:41,165 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 11:58:41,166 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 11:58:41,166 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 11:58:41,166 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 11:58:41,180 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:58:41" (1/1) ... [2019-09-05 11:58:41,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:58:41" (1/1) ... [2019-09-05 11:58:41,188 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:58:41" (1/1) ... [2019-09-05 11:58:41,188 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:58:41" (1/1) ... [2019-09-05 11:58:41,196 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:58:41" (1/1) ... [2019-09-05 11:58:41,201 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:58:41" (1/1) ... [2019-09-05 11:58:41,203 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:58:41" (1/1) ... [2019-09-05 11:58:41,206 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 11:58:41,206 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 11:58:41,207 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 11:58:41,207 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 11:58:41,207 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:58:41" (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-09-05 11:58:41,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 11:58:41,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 11:58:41,260 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 11:58:41,260 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 11:58:41,261 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-05 11:58:41,261 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 11:58:41,261 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-05 11:58:41,261 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 11:58:41,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 11:58:41,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 11:58:41,708 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 11:58:41,708 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-05 11:58:41,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 11:58:41 BoogieIcfgContainer [2019-09-05 11:58:41,710 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 11:58:41,710 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 11:58:41,711 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 11:58:41,713 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 11:58:41,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 11:58:40" (1/3) ... [2019-09-05 11:58:41,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cabacf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 11:58:41, skipping insertion in model container [2019-09-05 11:58:41,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:58:41" (2/3) ... [2019-09-05 11:58:41,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cabacf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 11:58:41, skipping insertion in model container [2019-09-05 11:58:41,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 11:58:41" (3/3) ... [2019-09-05 11:58:41,717 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c [2019-09-05 11:58:41,726 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 11:58:41,734 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2019-09-05 11:58:41,750 INFO L252 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2019-09-05 11:58:41,780 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-05 11:58:41,781 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 11:58:41,781 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-05 11:58:41,781 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 11:58:41,781 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 11:58:41,781 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 11:58:41,781 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 11:58:41,782 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 11:58:41,782 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 11:58:41,802 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2019-09-05 11:58:41,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-05 11:58:41,808 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:58:41,809 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:58:41,812 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:58:41,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:58:41,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1637525138, now seen corresponding path program 1 times [2019-09-05 11:58:41,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:58:41,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:58:41,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:41,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:58:41,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:41,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:58:41,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:58:41,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:58:41,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 11:58:41,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 11:58:41,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 11:58:41,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 11:58:41,995 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 3 states. [2019-09-05 11:58:42,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:58:42,024 INFO L93 Difference]: Finished difference Result 93 states and 129 transitions. [2019-09-05 11:58:42,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 11:58:42,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-05 11:58:42,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:58:42,034 INFO L225 Difference]: With dead ends: 93 [2019-09-05 11:58:42,035 INFO L226 Difference]: Without dead ends: 80 [2019-09-05 11:58:42,038 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 11:58:42,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-05 11:58:42,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-09-05 11:58:42,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-05 11:58:42,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2019-09-05 11:58:42,081 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 19 [2019-09-05 11:58:42,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:58:42,082 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2019-09-05 11:58:42,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 11:58:42,082 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2019-09-05 11:58:42,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-05 11:58:42,083 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:58:42,083 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:58:42,084 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:58:42,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:58:42,085 INFO L82 PathProgramCache]: Analyzing trace with hash 776331368, now seen corresponding path program 1 times [2019-09-05 11:58:42,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:58:42,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:58:42,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:42,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:58:42,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:42,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:58:42,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:58:42,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:58:42,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-05 11:58:42,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 11:58:42,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 11:58:42,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:58:42,183 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 6 states. [2019-09-05 11:58:42,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:58:42,285 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2019-09-05 11:58:42,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 11:58:42,287 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-09-05 11:58:42,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:58:42,288 INFO L225 Difference]: With dead ends: 80 [2019-09-05 11:58:42,288 INFO L226 Difference]: Without dead ends: 78 [2019-09-05 11:58:42,290 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-05 11:58:42,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-05 11:58:42,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-09-05 11:58:42,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-09-05 11:58:42,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2019-09-05 11:58:42,311 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 20 [2019-09-05 11:58:42,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:58:42,313 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2019-09-05 11:58:42,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 11:58:42,313 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2019-09-05 11:58:42,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-05 11:58:42,314 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:58:42,315 INFO L399 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-09-05 11:58:42,315 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:58:42,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:58:42,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1269768629, now seen corresponding path program 1 times [2019-09-05 11:58:42,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:58:42,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:58:42,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:42,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:58:42,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:42,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:58:42,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:58:42,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:58:42,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 11:58:42,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 11:58:42,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 11:58:42,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 11:58:42,412 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 4 states. [2019-09-05 11:58:42,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:58:42,508 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2019-09-05 11:58:42,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 11:58:42,509 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-09-05 11:58:42,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:58:42,511 INFO L225 Difference]: With dead ends: 101 [2019-09-05 11:58:42,511 INFO L226 Difference]: Without dead ends: 99 [2019-09-05 11:58:42,512 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:58:42,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-05 11:58:42,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 76. [2019-09-05 11:58:42,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-05 11:58:42,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2019-09-05 11:58:42,522 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 22 [2019-09-05 11:58:42,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:58:42,522 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2019-09-05 11:58:42,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 11:58:42,523 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2019-09-05 11:58:42,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-05 11:58:42,524 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:58:42,524 INFO L399 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-09-05 11:58:42,525 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:58:42,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:58:42,525 INFO L82 PathProgramCache]: Analyzing trace with hash -708118726, now seen corresponding path program 1 times [2019-09-05 11:58:42,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:58:42,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:58:42,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:42,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:58:42,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:58:42,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:58:42,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:58:42,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 11:58:42,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:58:42,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:58:42,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:58:42,608 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 5 states. [2019-09-05 11:58:42,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:58:42,711 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-09-05 11:58:42,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 11:58:42,711 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-09-05 11:58:42,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:58:42,712 INFO L225 Difference]: With dead ends: 76 [2019-09-05 11:58:42,713 INFO L226 Difference]: Without dead ends: 74 [2019-09-05 11:58:42,713 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:58:42,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-05 11:58:42,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-09-05 11:58:42,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-09-05 11:58:42,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2019-09-05 11:58:42,721 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 23 [2019-09-05 11:58:42,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:58:42,721 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2019-09-05 11:58:42,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:58:42,722 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2019-09-05 11:58:42,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-05 11:58:42,723 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:58:42,723 INFO L399 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-09-05 11:58:42,723 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:58:42,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:58:42,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1317531748, now seen corresponding path program 1 times [2019-09-05 11:58:42,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:58:42,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:58:42,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:42,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:58:42,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:42,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:58:42,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:58:42,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:58:42,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 11:58:42,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:58:42,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:58:42,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:58:42,791 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 5 states. [2019-09-05 11:58:42,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:58:42,957 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2019-09-05 11:58:42,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 11:58:42,958 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-09-05 11:58:42,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:58:42,959 INFO L225 Difference]: With dead ends: 141 [2019-09-05 11:58:42,959 INFO L226 Difference]: Without dead ends: 139 [2019-09-05 11:58:42,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-05 11:58:42,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-09-05 11:58:42,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 77. [2019-09-05 11:58:42,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-05 11:58:42,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2019-09-05 11:58:42,978 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 26 [2019-09-05 11:58:42,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:58:42,981 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2019-09-05 11:58:42,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:58:42,982 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2019-09-05 11:58:42,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-05 11:58:42,983 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:58:42,983 INFO L399 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-09-05 11:58:42,983 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:58:42,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:58:42,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1321265557, now seen corresponding path program 1 times [2019-09-05 11:58:42,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:58:42,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:58:42,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:42,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:58:42,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:42,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:58:43,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:58:43,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:58:43,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 11:58:43,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:58:43,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:58:43,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:58:43,048 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 5 states. [2019-09-05 11:58:43,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:58:43,202 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2019-09-05 11:58:43,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 11:58:43,204 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-09-05 11:58:43,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:58:43,205 INFO L225 Difference]: With dead ends: 108 [2019-09-05 11:58:43,206 INFO L226 Difference]: Without dead ends: 106 [2019-09-05 11:58:43,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-05 11:58:43,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-09-05 11:58:43,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 79. [2019-09-05 11:58:43,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-05 11:58:43,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2019-09-05 11:58:43,223 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 26 [2019-09-05 11:58:43,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:58:43,224 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2019-09-05 11:58:43,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:58:43,224 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2019-09-05 11:58:43,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-05 11:58:43,228 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:58:43,229 INFO L399 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-09-05 11:58:43,230 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:58:43,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:58:43,231 INFO L82 PathProgramCache]: Analyzing trace with hash -2106185532, now seen corresponding path program 1 times [2019-09-05 11:58:43,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:58:43,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:58:43,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:43,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:58:43,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:43,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:58:43,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:58:43,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:58:43,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 11:58:43,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:58:43,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:58:43,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:58:43,322 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 5 states. [2019-09-05 11:58:43,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:58:43,441 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2019-09-05 11:58:43,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 11:58:43,442 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-09-05 11:58:43,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:58:43,443 INFO L225 Difference]: With dead ends: 121 [2019-09-05 11:58:43,443 INFO L226 Difference]: Without dead ends: 119 [2019-09-05 11:58:43,444 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:58:43,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-09-05 11:58:43,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 77. [2019-09-05 11:58:43,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-05 11:58:43,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2019-09-05 11:58:43,451 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 27 [2019-09-05 11:58:43,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:58:43,451 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2019-09-05 11:58:43,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:58:43,451 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2019-09-05 11:58:43,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-05 11:58:43,452 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:58:43,452 INFO L399 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-09-05 11:58:43,453 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:58:43,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:58:43,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1990437563, now seen corresponding path program 1 times [2019-09-05 11:58:43,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:58:43,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:58:43,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:43,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:58:43,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:43,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:58:43,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:58:43,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:58:43,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 11:58:43,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:58:43,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:58:43,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:58:43,500 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 5 states. [2019-09-05 11:58:43,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:58:43,597 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2019-09-05 11:58:43,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 11:58:43,597 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-09-05 11:58:43,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:58:43,598 INFO L225 Difference]: With dead ends: 77 [2019-09-05 11:58:43,598 INFO L226 Difference]: Without dead ends: 75 [2019-09-05 11:58:43,599 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:58:43,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-05 11:58:43,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-09-05 11:58:43,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-05 11:58:43,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2019-09-05 11:58:43,605 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 27 [2019-09-05 11:58:43,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:58:43,606 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2019-09-05 11:58:43,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:58:43,606 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2019-09-05 11:58:43,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-05 11:58:43,607 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:58:43,607 INFO L399 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-09-05 11:58:43,608 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:58:43,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:58:43,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1549950965, now seen corresponding path program 1 times [2019-09-05 11:58:43,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:58:43,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:58:43,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:43,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:58:43,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:43,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:58:43,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:58:43,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:58:43,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 11:58:43,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 11:58:43,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 11:58:43,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 11:58:43,638 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 3 states. [2019-09-05 11:58:43,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:58:43,681 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2019-09-05 11:58:43,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 11:58:43,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-05 11:58:43,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:58:43,682 INFO L225 Difference]: With dead ends: 115 [2019-09-05 11:58:43,682 INFO L226 Difference]: Without dead ends: 75 [2019-09-05 11:58:43,683 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 11:58:43,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-05 11:58:43,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-09-05 11:58:43,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-05 11:58:43,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2019-09-05 11:58:43,689 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 29 [2019-09-05 11:58:43,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:58:43,690 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2019-09-05 11:58:43,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 11:58:43,690 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2019-09-05 11:58:43,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-05 11:58:43,691 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:58:43,691 INFO L399 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-09-05 11:58:43,692 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:58:43,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:58:43,692 INFO L82 PathProgramCache]: Analyzing trace with hash 54388864, now seen corresponding path program 1 times [2019-09-05 11:58:43,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:58:43,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:58:43,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:43,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:58:43,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:43,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:58:43,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:58:43,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:58:43,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 11:58:43,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:58:43,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:58:43,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:58:43,758 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand 5 states. [2019-09-05 11:58:43,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:58:43,837 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-09-05 11:58:43,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 11:58:43,838 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-09-05 11:58:43,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:58:43,840 INFO L225 Difference]: With dead ends: 76 [2019-09-05 11:58:43,840 INFO L226 Difference]: Without dead ends: 74 [2019-09-05 11:58:43,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:58:43,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-05 11:58:43,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-09-05 11:58:43,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-05 11:58:43,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2019-09-05 11:58:43,849 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 30 [2019-09-05 11:58:43,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:58:43,850 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2019-09-05 11:58:43,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:58:43,850 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2019-09-05 11:58:43,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-05 11:58:43,854 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:58:43,855 INFO L399 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-09-05 11:58:43,855 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:58:43,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:58:43,856 INFO L82 PathProgramCache]: Analyzing trace with hash -196719107, now seen corresponding path program 1 times [2019-09-05 11:58:43,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:58:43,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:58:43,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:43,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:58:43,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:43,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:58:43,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 11:58:43,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:58:43,973 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:58:43,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:58:44,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:58:44,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-05 11:58:44,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:58:44,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:58:44,127 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 11:58:44,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:58:44,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-09-05 11:58:44,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-05 11:58:44,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-05 11:58:44,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-05 11:58:44,132 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 8 states. [2019-09-05 11:58:44,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:58:44,264 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2019-09-05 11:58:44,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 11:58:44,264 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-09-05 11:58:44,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:58:44,265 INFO L225 Difference]: With dead ends: 111 [2019-09-05 11:58:44,266 INFO L226 Difference]: Without dead ends: 109 [2019-09-05 11:58:44,266 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-09-05 11:58:44,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-09-05 11:58:44,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 70. [2019-09-05 11:58:44,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-05 11:58:44,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2019-09-05 11:58:44,271 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 30 [2019-09-05 11:58:44,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:58:44,272 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2019-09-05 11:58:44,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-05 11:58:44,272 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2019-09-05 11:58:44,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-05 11:58:44,273 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:58:44,273 INFO L399 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-09-05 11:58:44,273 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:58:44,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:58:44,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1686057932, now seen corresponding path program 1 times [2019-09-05 11:58:44,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:58:44,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:58:44,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:44,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:58:44,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:58:44,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:58:44,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:58:44,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 11:58:44,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:58:44,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:58:44,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:58:44,308 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 5 states. [2019-09-05 11:58:44,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:58:44,373 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-09-05 11:58:44,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 11:58:44,374 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-09-05 11:58:44,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:58:44,375 INFO L225 Difference]: With dead ends: 70 [2019-09-05 11:58:44,375 INFO L226 Difference]: Without dead ends: 68 [2019-09-05 11:58:44,375 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:58:44,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-09-05 11:58:44,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-09-05 11:58:44,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-05 11:58:44,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2019-09-05 11:58:44,383 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 31 [2019-09-05 11:58:44,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:58:44,385 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2019-09-05 11:58:44,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:58:44,385 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2019-09-05 11:58:44,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-05 11:58:44,387 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:58:44,387 INFO L399 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-09-05 11:58:44,388 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:58:44,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:58:44,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1806773561, now seen corresponding path program 1 times [2019-09-05 11:58:44,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:58:44,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:58:44,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:44,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:58:44,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:44,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:58:44,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 11:58:44,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:58:44,453 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:58:44,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:58:44,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:58:44,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-05 11:58:44,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:58:44,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:58:44,557 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 11:58:44,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:58:44,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-09-05 11:58:44,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-05 11:58:44,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-05 11:58:44,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-05 11:58:44,562 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 8 states. [2019-09-05 11:58:44,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:58:44,653 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2019-09-05 11:58:44,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 11:58:44,653 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2019-09-05 11:58:44,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:58:44,654 INFO L225 Difference]: With dead ends: 69 [2019-09-05 11:58:44,654 INFO L226 Difference]: Without dead ends: 67 [2019-09-05 11:58:44,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-09-05 11:58:44,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-05 11:58:44,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2019-09-05 11:58:44,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-05 11:58:44,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2019-09-05 11:58:44,659 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 31 [2019-09-05 11:58:44,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:58:44,659 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2019-09-05 11:58:44,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-05 11:58:44,659 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2019-09-05 11:58:44,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-05 11:58:44,660 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:58:44,660 INFO L399 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-09-05 11:58:44,661 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:58:44,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:58:44,661 INFO L82 PathProgramCache]: Analyzing trace with hash -287576151, now seen corresponding path program 1 times [2019-09-05 11:58:44,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:58:44,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:58:44,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:44,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:58:44,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:44,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:58:44,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:58:44,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:58:44,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 11:58:44,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:58:44,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:58:44,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:58:44,726 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 5 states. [2019-09-05 11:58:44,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:58:44,803 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2019-09-05 11:58:44,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 11:58:44,804 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-09-05 11:58:44,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:58:44,804 INFO L225 Difference]: With dead ends: 63 [2019-09-05 11:58:44,804 INFO L226 Difference]: Without dead ends: 61 [2019-09-05 11:58:44,805 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:58:44,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-05 11:58:44,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-09-05 11:58:44,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-05 11:58:44,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-09-05 11:58:44,808 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 34 [2019-09-05 11:58:44,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:58:44,809 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-09-05 11:58:44,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:58:44,809 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-09-05 11:58:44,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-05 11:58:44,810 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:58:44,810 INFO L399 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-09-05 11:58:44,810 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:58:44,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:58:44,811 INFO L82 PathProgramCache]: Analyzing trace with hash -324922921, now seen corresponding path program 1 times [2019-09-05 11:58:44,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:58:44,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:58:44,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:44,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:58:44,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:44,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:58:44,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:58:44,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:58:44,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-05 11:58:44,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-05 11:58:44,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-05 11:58:44,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:58:44,861 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 7 states. [2019-09-05 11:58:44,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:58:44,944 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2019-09-05 11:58:44,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 11:58:44,944 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-09-05 11:58:44,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:58:44,945 INFO L225 Difference]: With dead ends: 71 [2019-09-05 11:58:44,945 INFO L226 Difference]: Without dead ends: 69 [2019-09-05 11:58:44,946 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-09-05 11:58:44,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-05 11:58:44,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2019-09-05 11:58:44,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-05 11:58:44,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2019-09-05 11:58:44,949 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 35 [2019-09-05 11:58:44,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:58:44,950 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2019-09-05 11:58:44,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-05 11:58:44,950 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2019-09-05 11:58:44,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-05 11:58:44,951 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:58:44,951 INFO L399 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-09-05 11:58:44,951 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:58:44,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:58:44,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1080633106, now seen corresponding path program 1 times [2019-09-05 11:58:44,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:58:44,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:58:44,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:44,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:58:44,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:44,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:58:44,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:58:44,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:58:44,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 11:58:44,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:58:44,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:58:44,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:58:44,999 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 5 states. [2019-09-05 11:58:45,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:58:45,102 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2019-09-05 11:58:45,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 11:58:45,103 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-09-05 11:58:45,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:58:45,103 INFO L225 Difference]: With dead ends: 91 [2019-09-05 11:58:45,103 INFO L226 Difference]: Without dead ends: 89 [2019-09-05 11:58:45,104 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:58:45,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-09-05 11:58:45,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2019-09-05 11:58:45,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-09-05 11:58:45,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2019-09-05 11:58:45,109 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 38 [2019-09-05 11:58:45,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:58:45,109 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2019-09-05 11:58:45,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:58:45,109 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2019-09-05 11:58:45,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-05 11:58:45,110 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:58:45,110 INFO L399 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-09-05 11:58:45,110 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:58:45,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:58:45,111 INFO L82 PathProgramCache]: Analyzing trace with hash -860108895, now seen corresponding path program 1 times [2019-09-05 11:58:45,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:58:45,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:58:45,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:45,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:58:45,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:45,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:58:45,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:58:45,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:58:45,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 11:58:45,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:58:45,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:58:45,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:58:45,155 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 5 states. [2019-09-05 11:58:45,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:58:45,234 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2019-09-05 11:58:45,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 11:58:45,234 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-09-05 11:58:45,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:58:45,235 INFO L225 Difference]: With dead ends: 61 [2019-09-05 11:58:45,235 INFO L226 Difference]: Without dead ends: 59 [2019-09-05 11:58:45,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:58:45,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-05 11:58:45,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-09-05 11:58:45,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-05 11:58:45,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2019-09-05 11:58:45,240 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 39 [2019-09-05 11:58:45,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:58:45,240 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2019-09-05 11:58:45,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:58:45,240 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2019-09-05 11:58:45,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-05 11:58:45,241 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:58:45,241 INFO L399 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-09-05 11:58:45,241 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:58:45,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:58:45,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1930828060, now seen corresponding path program 1 times [2019-09-05 11:58:45,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:58:45,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:58:45,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:45,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:58:45,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:45,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:58:45,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-09-05 11:58:45,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:58:45,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 11:58:45,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:58:45,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:58:45,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:58:45,295 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 5 states. [2019-09-05 11:58:45,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:58:45,315 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-09-05 11:58:45,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 11:58:45,316 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-09-05 11:58:45,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:58:45,317 INFO L225 Difference]: With dead ends: 70 [2019-09-05 11:58:45,317 INFO L226 Difference]: Without dead ends: 68 [2019-09-05 11:58:45,317 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:58:45,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-09-05 11:58:45,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-09-05 11:58:45,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-05 11:58:45,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-09-05 11:58:45,323 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 41 [2019-09-05 11:58:45,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:58:45,323 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-09-05 11:58:45,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:58:45,323 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-09-05 11:58:45,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-05 11:58:45,324 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:58:45,324 INFO L399 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-09-05 11:58:45,324 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:58:45,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:58:45,325 INFO L82 PathProgramCache]: Analyzing trace with hash 273875486, now seen corresponding path program 1 times [2019-09-05 11:58:45,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:58:45,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:58:45,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:45,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:58:45,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:45,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:58:45,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:58:45,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:58:45,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 11:58:45,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:58:45,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:58:45,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:58:45,368 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 5 states. [2019-09-05 11:58:45,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:58:45,395 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2019-09-05 11:58:45,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 11:58:45,396 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-09-05 11:58:45,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:58:45,396 INFO L225 Difference]: With dead ends: 68 [2019-09-05 11:58:45,397 INFO L226 Difference]: Without dead ends: 66 [2019-09-05 11:58:45,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:58:45,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-05 11:58:45,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-09-05 11:58:45,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-05 11:58:45,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-09-05 11:58:45,402 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 42 [2019-09-05 11:58:45,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:58:45,402 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-09-05 11:58:45,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:58:45,402 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-09-05 11:58:45,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-05 11:58:45,403 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:58:45,403 INFO L399 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-09-05 11:58:45,403 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:58:45,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:58:45,404 INFO L82 PathProgramCache]: Analyzing trace with hash -99791318, now seen corresponding path program 1 times [2019-09-05 11:58:45,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:58:45,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:58:45,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:45,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:58:45,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:45,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:58:45,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:58:45,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:58:45,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 11:58:45,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:58:45,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:58:45,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:58:45,476 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 5 states. [2019-09-05 11:58:45,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:58:45,601 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2019-09-05 11:58:45,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 11:58:45,601 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-09-05 11:58:45,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:58:45,602 INFO L225 Difference]: With dead ends: 90 [2019-09-05 11:58:45,602 INFO L226 Difference]: Without dead ends: 88 [2019-09-05 11:58:45,603 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:58:45,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-09-05 11:58:45,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 69. [2019-09-05 11:58:45,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-05 11:58:45,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2019-09-05 11:58:45,609 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 43 [2019-09-05 11:58:45,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:58:45,610 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2019-09-05 11:58:45,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:58:45,610 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2019-09-05 11:58:45,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-05 11:58:45,611 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:58:45,611 INFO L399 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-09-05 11:58:45,611 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:58:45,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:58:45,612 INFO L82 PathProgramCache]: Analyzing trace with hash 2020599801, now seen corresponding path program 1 times [2019-09-05 11:58:45,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:58:45,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:58:45,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:45,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:58:45,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:45,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:58:45,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:58:45,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:58:45,710 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:58:45,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:58:45,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:58:45,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-05 11:58:45,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:58:45,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:58:45,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:58:45,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:58:45,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-09-05 11:58:45,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-05 11:58:45,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-05 11:58:45,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-05 11:58:45,823 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 8 states. [2019-09-05 11:58:45,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:58:45,952 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2019-09-05 11:58:45,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 11:58:45,952 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2019-09-05 11:58:45,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:58:45,953 INFO L225 Difference]: With dead ends: 70 [2019-09-05 11:58:45,953 INFO L226 Difference]: Without dead ends: 68 [2019-09-05 11:58:45,953 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 7 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-09-05 11:58:45,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-09-05 11:58:45,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-09-05 11:58:45,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-05 11:58:45,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-09-05 11:58:45,959 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 44 [2019-09-05 11:58:45,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:58:45,960 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-09-05 11:58:45,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-05 11:58:45,960 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-09-05 11:58:45,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-05 11:58:45,960 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:58:45,960 INFO L399 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-09-05 11:58:45,961 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:58:45,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:58:45,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1201439652, now seen corresponding path program 1 times [2019-09-05 11:58:45,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:58:45,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:58:45,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:45,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:58:45,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:45,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:58:46,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:58:46,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:58:46,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 11:58:46,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:58:46,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:58:46,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:58:46,010 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 5 states. [2019-09-05 11:58:46,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:58:46,100 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-09-05 11:58:46,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 11:58:46,100 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-09-05 11:58:46,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:58:46,101 INFO L225 Difference]: With dead ends: 71 [2019-09-05 11:58:46,101 INFO L226 Difference]: Without dead ends: 69 [2019-09-05 11:58:46,101 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:58:46,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-05 11:58:46,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2019-09-05 11:58:46,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-05 11:58:46,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-09-05 11:58:46,107 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 44 [2019-09-05 11:58:46,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:58:46,107 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-09-05 11:58:46,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:58:46,107 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-09-05 11:58:46,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-05 11:58:46,108 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:58:46,108 INFO L399 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-09-05 11:58:46,108 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:58:46,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:58:46,109 INFO L82 PathProgramCache]: Analyzing trace with hash 40764835, now seen corresponding path program 1 times [2019-09-05 11:58:46,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:58:46,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:58:46,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:46,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:58:46,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:46,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:58:46,155 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 11:58:46,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:58:46,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 11:58:46,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:58:46,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:58:46,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:58:46,156 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 5 states. [2019-09-05 11:58:46,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:58:46,279 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2019-09-05 11:58:46,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 11:58:46,279 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-09-05 11:58:46,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:58:46,280 INFO L225 Difference]: With dead ends: 77 [2019-09-05 11:58:46,280 INFO L226 Difference]: Without dead ends: 75 [2019-09-05 11:58:46,281 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-05 11:58:46,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-05 11:58:46,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 55. [2019-09-05 11:58:46,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-05 11:58:46,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2019-09-05 11:58:46,285 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 49 [2019-09-05 11:58:46,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:58:46,286 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2019-09-05 11:58:46,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:58:46,286 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2019-09-05 11:58:46,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-05 11:58:46,287 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:58:46,287 INFO L399 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-09-05 11:58:46,287 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:58:46,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:58:46,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1664106253, now seen corresponding path program 1 times [2019-09-05 11:58:46,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:58:46,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:58:46,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:46,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:58:46,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:46,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:58:46,330 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:58:46,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:58:46,330 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:58:46,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:58:46,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:58:46,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-05 11:58:46,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:58:46,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:58:46,418 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 11:58:46,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-05 11:58:46,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2019-09-05 11:58:46,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 11:58:46,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 11:58:46,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:58:46,423 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 6 states. [2019-09-05 11:58:46,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:58:46,476 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2019-09-05 11:58:46,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 11:58:46,477 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-09-05 11:58:46,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:58:46,478 INFO L225 Difference]: With dead ends: 60 [2019-09-05 11:58:46,478 INFO L226 Difference]: Without dead ends: 0 [2019-09-05 11:58:46,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-05 11:58:46,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-05 11:58:46,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-05 11:58:46,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-05 11:58:46,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-05 11:58:46,480 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2019-09-05 11:58:46,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:58:46,480 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-05 11:58:46,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 11:58:46,480 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-05 11:58:46,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-05 11:58:46,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-05 11:58:47,082 WARN L188 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 70 [2019-09-05 11:58:47,295 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 34 [2019-09-05 11:58:47,649 WARN L188 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 67 [2019-09-05 11:58:47,781 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 29 [2019-09-05 11:58:47,785 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-05 11:58:47,785 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-09-05 11:58:47,785 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-05 11:58:47,785 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-05 11:58:47,785 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-05 11:58:47,785 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-05 11:58:47,786 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-05 11:58:47,786 INFO L443 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 238) no Hoare annotation was computed. [2019-09-05 11:58:47,786 INFO L443 ceAbstractionStarter]: For program point L60(lines 60 412) no Hoare annotation was computed. [2019-09-05 11:58:47,786 INFO L443 ceAbstractionStarter]: For program point L250(line 250) no Hoare annotation was computed. [2019-09-05 11:58:47,786 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 8 434) no Hoare annotation was computed. [2019-09-05 11:58:47,786 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-09-05 11:58:47,786 INFO L443 ceAbstractionStarter]: For program point L118(lines 118 398) no Hoare annotation was computed. [2019-09-05 11:58:47,786 INFO L443 ceAbstractionStarter]: For program point L209(line 209) no Hoare annotation was computed. [2019-09-05 11:58:47,786 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 140) no Hoare annotation was computed. [2019-09-05 11:58:47,786 INFO L443 ceAbstractionStarter]: For program point L267(line 267) no Hoare annotation was computed. [2019-09-05 11:58:47,786 INFO L443 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 209) no Hoare annotation was computed. [2019-09-05 11:58:47,786 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 120) no Hoare annotation was computed. [2019-09-05 11:58:47,786 INFO L443 ceAbstractionStarter]: For program point L36(lines 36 430) no Hoare annotation was computed. [2019-09-05 11:58:47,787 INFO L443 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2019-09-05 11:58:47,787 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 390) no Hoare annotation was computed. [2019-09-05 11:58:47,787 INFO L443 ceAbstractionStarter]: For program point L78(lines 78 409) no Hoare annotation was computed. [2019-09-05 11:58:47,787 INFO L443 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 279) no Hoare annotation was computed. [2019-09-05 11:58:47,787 INFO L443 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 267) no Hoare annotation was computed. [2019-09-05 11:58:47,787 INFO L443 ceAbstractionStarter]: For program point L301(lines 301 311) no Hoare annotation was computed. [2019-09-05 11:58:47,787 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 108) no Hoare annotation was computed. [2019-09-05 11:58:47,787 INFO L443 ceAbstractionStarter]: For program point L219(lines 219 339) no Hoare annotation was computed. [2019-09-05 11:58:47,787 INFO L443 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-09-05 11:58:47,787 INFO L443 ceAbstractionStarter]: For program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 381) no Hoare annotation was computed. [2019-09-05 11:58:47,787 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 427) no Hoare annotation was computed. [2019-09-05 11:58:47,788 INFO L439 ceAbstractionStarter]: At program point L310(lines 225 339) the Hoare annotation is: (let ((.cse0 (<= 2 main_~main__cp~0)) (.cse1 (and (and (and (and (not (= main_~__VERIFIER_assert__cond~6 0)) (= main_~__VERIFIER_assert__cond~3 1) (not (= main_~__VERIFIER_assert__cond~5 0)) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~2 0)) (not (= main_~__VERIFIER_assert__cond~1 0))) (= main_~__VERIFIER_assert__cond~0 1)) (= main_~__VERIFIER_assert__cond~4 1) (not (= main_~__VERIFIER_assert__cond~7 0))) (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= main_~__VERIFIER_assert__cond~8 0)))) (.cse4 (= main_~__VERIFIER_assert__cond~9 1)) (.cse2 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse3 (= main_~__VERIFIER_assert__cond~10 1)) (.cse6 (= 0 main_~main__c~0)) (.cse5 (<= 1 main_~main__scheme~0))) (or (and .cse0 (not (= main_~__VERIFIER_assert__cond~15 0)) .cse1 .cse2 .cse3 (not (= main_~__VERIFIER_assert__cond~13 0)) (not (= main_~__VERIFIER_assert__cond~14 0)) (<= 0 main_~main__c~0) .cse4 (= main_~__VERIFIER_assert__cond~12 1) .cse5) (and .cse0 .cse1 (<= (+ main_~main__cp~0 2) main_~main__urilen~0) .cse4 (= main_~__VERIFIER_assert__cond~8 1) .cse6 .cse5) (and .cse0 .cse1 (<= (+ main_~main__c~0 2) main_~main__tokenlen~0) .cse4 .cse2 .cse3 .cse6 .cse5))) [2019-09-05 11:58:47,788 INFO L443 ceAbstractionStarter]: For program point L277(lines 277 315) no Hoare annotation was computed. [2019-09-05 11:58:47,788 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 8 434) no Hoare annotation was computed. [2019-09-05 11:58:47,788 INFO L443 ceAbstractionStarter]: For program point L236(lines 236 326) no Hoare annotation was computed. [2019-09-05 11:58:47,788 INFO L443 ceAbstractionStarter]: For program point L170(lines 170 352) no Hoare annotation was computed. [2019-09-05 11:58:47,788 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 92) no Hoare annotation was computed. [2019-09-05 11:58:47,788 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 431) no Hoare annotation was computed. [2019-09-05 11:58:47,788 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 8 434) the Hoare annotation is: true [2019-09-05 11:58:47,789 INFO L443 ceAbstractionStarter]: For program point L369(line 369) no Hoare annotation was computed. [2019-09-05 11:58:47,789 INFO L443 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2019-09-05 11:58:47,789 INFO L443 ceAbstractionStarter]: For program point L303(line 303) no Hoare annotation was computed. [2019-09-05 11:58:47,789 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 357) no Hoare annotation was computed. [2019-09-05 11:58:47,789 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 333) no Hoare annotation was computed. [2019-09-05 11:58:47,789 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 392) no Hoare annotation was computed. [2019-09-05 11:58:47,789 INFO L443 ceAbstractionStarter]: For program point L221(line 221) no Hoare annotation was computed. [2019-09-05 11:58:47,789 INFO L443 ceAbstractionStarter]: For program point L56(lines 56 422) no Hoare annotation was computed. [2019-09-05 11:58:47,789 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 152) no Hoare annotation was computed. [2019-09-05 11:58:47,790 INFO L443 ceAbstractionStarter]: For program point L279(line 279) no Hoare annotation was computed. [2019-09-05 11:58:47,790 INFO L443 ceAbstractionStarter]: For program point L48(lines 48 428) no Hoare annotation was computed. [2019-09-05 11:58:47,790 INFO L443 ceAbstractionStarter]: For program point L238(line 238) no Hoare annotation was computed. [2019-09-05 11:58:47,790 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2019-09-05 11:58:47,790 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-09-05 11:58:47,790 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 400) no Hoare annotation was computed. [2019-09-05 11:58:47,790 INFO L443 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 221) no Hoare annotation was computed. [2019-09-05 11:58:47,791 INFO L439 ceAbstractionStarter]: At program point L387(lines 124 398) the Hoare annotation is: (and (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (<= 1 main_~main__scheme~0) (let ((.cse0 (= main_~__VERIFIER_assert__cond~3 1)) (.cse1 (<= 1 main_~main__cp~0)) (.cse2 (= main_~__VERIFIER_assert__cond~0 1)) (.cse3 (not (= main_~__VERIFIER_assert__cond~1 0)))) (or (and .cse0 (= main_~__VERIFIER_assert__cond~2 1) .cse1 .cse2 .cse3) (and .cse0 (not (= main_~__VERIFIER_assert__cond~17 0)) .cse1 .cse2 (not (= main_~__VERIFIER_assert__cond~2 0)) .cse3 (= main_~__VERIFIER_assert__cond~16 1))))) [2019-09-05 11:58:47,791 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 349) no Hoare annotation was computed. [2019-09-05 11:58:47,791 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2019-09-05 11:58:47,791 INFO L443 ceAbstractionStarter]: For program point L379(lines 379 388) no Hoare annotation was computed. [2019-09-05 11:58:47,791 INFO L443 ceAbstractionStarter]: For program point L90(lines 90 407) no Hoare annotation was computed. [2019-09-05 11:58:47,791 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 432) no Hoare annotation was computed. [2019-09-05 11:58:47,791 INFO L443 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 250) no Hoare annotation was computed. [2019-09-05 11:58:47,791 INFO L443 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2019-09-05 11:58:47,792 INFO L439 ceAbstractionStarter]: At program point L396(lines 126 397) the Hoare annotation is: (let ((.cse0 (and (= main_~__VERIFIER_assert__cond~3 1) (and (let ((.cse1 (<= 1 main_~main__cp~0)) (.cse2 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse3 (<= 1 main_~main__scheme~0)) (.cse4 (not (= main_~__VERIFIER_assert__cond~0 0)))) (or (and (not (= main_~__VERIFIER_assert__cond~16 0)) .cse1 (not (= main_~__VERIFIER_assert__cond~2 0)) .cse2 .cse3 .cse4) (and (= main_~__VERIFIER_assert__cond~2 1) .cse1 .cse2 .cse3 .cse4))) (< main_~main__cp~0 main_~main__urilen~0))))) (or (and .cse0 (= (+ main_~main__cp~0 1) main_~main__urilen~0)) (and .cse0 (= main_~__VERIFIER_assert__cond~0 1)))) [2019-09-05 11:58:47,792 INFO L443 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 291) no Hoare annotation was computed. [2019-09-05 11:58:47,792 INFO L443 ceAbstractionStarter]: For program point L99(lines 99 406) no Hoare annotation was computed. [2019-09-05 11:58:47,792 INFO L443 ceAbstractionStarter]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 369) no Hoare annotation was computed. [2019-09-05 11:58:47,792 INFO L443 ceAbstractionStarter]: For program point L66(lines 66 411) no Hoare annotation was computed. [2019-09-05 11:58:47,792 INFO L439 ceAbstractionStarter]: At program point L322(lines 257 323) the Hoare annotation is: (let ((.cse0 (= main_~__VERIFIER_assert__cond~9 1)) (.cse1 (and (<= 2 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~8 0)) (= main_~__VERIFIER_assert__cond~4 1) (and (not (= main_~__VERIFIER_assert__cond~6 0)) (= main_~__VERIFIER_assert__cond~3 1) (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~5 0)) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (= main_~__VERIFIER_assert__cond~0 1) (not (= main_~__VERIFIER_assert__cond~2 0)) (<= 1 main_~main__scheme~0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~9 0)))) (.cse2 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse3 (= main_~__VERIFIER_assert__cond~10 1))) (or (and (not (= main_~__VERIFIER_assert__cond~15 0)) .cse0 (and (not (= main_~__VERIFIER_assert__cond~14 0)) (<= 0 main_~main__c~0) .cse1 .cse2 (not (= main_~__VERIFIER_assert__cond~13 0))) (= main_~__VERIFIER_assert__cond~12 1) .cse3) (and (and (<= (+ main_~main__c~0 2) main_~main__tokenlen~0) .cse0 .cse1 .cse2) .cse3 (= 0 main_~main__c~0)))) [2019-09-05 11:58:47,792 INFO L443 ceAbstractionStarter]: For program point L289(lines 289 313) no Hoare annotation was computed. [2019-09-05 11:58:47,793 INFO L443 ceAbstractionStarter]: For program point L157(lines 157 354) no Hoare annotation was computed. [2019-09-05 11:58:47,793 INFO L443 ceAbstractionStarter]: For program point L58(lines 58 417) no Hoare annotation was computed. [2019-09-05 11:58:47,793 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 324) no Hoare annotation was computed. [2019-09-05 11:58:47,793 INFO L443 ceAbstractionStarter]: For program point L182(lines 182 350) no Hoare annotation was computed. [2019-09-05 11:58:47,793 INFO L439 ceAbstractionStarter]: At program point L405(lines 99 406) the Hoare annotation is: (not (= main_~__VERIFIER_assert__cond~0 0)) [2019-09-05 11:58:47,793 INFO L443 ceAbstractionStarter]: For program point L207(lines 207 341) no Hoare annotation was computed. [2019-09-05 11:58:47,793 INFO L443 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2019-09-05 11:58:47,793 INFO L443 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-09-05 11:58:47,793 INFO L443 ceAbstractionStarter]: For program point L42(lines 42 429) no Hoare annotation was computed. [2019-09-05 11:58:47,793 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 317) no Hoare annotation was computed. [2019-09-05 11:58:47,794 INFO L443 ceAbstractionStarter]: For program point L199(lines 199 348) no Hoare annotation was computed. [2019-09-05 11:58:47,794 INFO L443 ceAbstractionStarter]: For program point L257(lines 257 323) no Hoare annotation was computed. [2019-09-05 11:58:47,794 INFO L443 ceAbstractionStarter]: For program point L381(line 381) no Hoare annotation was computed. [2019-09-05 11:58:47,794 INFO L443 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2019-09-05 11:58:47,794 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 355) no Hoare annotation was computed. [2019-09-05 11:58:47,794 INFO L443 ceAbstractionStarter]: For program point L18(lines 18 433) no Hoare annotation was computed. [2019-09-05 11:58:47,794 INFO L443 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 303) no Hoare annotation was computed. [2019-09-05 11:58:47,794 INFO L443 ceAbstractionStarter]: For program point L291(line 291) no Hoare annotation was computed. [2019-09-05 11:58:47,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.09 11:58:47 BoogieIcfgContainer [2019-09-05 11:58:47,821 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-05 11:58:47,825 INFO L168 Benchmark]: Toolchain (without parser) took 7081.64 ms. Allocated memory was 142.6 MB in the beginning and 323.0 MB in the end (delta: 180.4 MB). Free memory was 90.2 MB in the beginning and 272.6 MB in the end (delta: -182.3 MB). Peak memory consumption was 156.8 MB. Max. memory is 7.1 GB. [2019-09-05 11:58:47,826 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 142.6 MB. Free memory was 108.7 MB in the beginning and 108.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-05 11:58:47,827 INFO L168 Benchmark]: CACSL2BoogieTranslator took 423.81 ms. Allocated memory was 142.6 MB in the beginning and 199.8 MB in the end (delta: 57.1 MB). Free memory was 90.0 MB in the beginning and 176.6 MB in the end (delta: -86.6 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. [2019-09-05 11:58:47,827 INFO L168 Benchmark]: Boogie Preprocessor took 40.22 ms. Allocated memory is still 199.8 MB. Free memory was 176.6 MB in the beginning and 174.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-09-05 11:58:47,828 INFO L168 Benchmark]: RCFGBuilder took 503.26 ms. Allocated memory is still 199.8 MB. Free memory was 174.9 MB in the beginning and 148.6 MB in the end (delta: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2019-09-05 11:58:47,829 INFO L168 Benchmark]: TraceAbstraction took 6110.22 ms. Allocated memory was 199.8 MB in the beginning and 323.0 MB in the end (delta: 123.2 MB). Free memory was 148.0 MB in the beginning and 272.6 MB in the end (delta: -124.6 MB). Peak memory consumption was 157.4 MB. Max. memory is 7.1 GB. [2019-09-05 11:58:47,833 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.51 ms. Allocated memory is still 142.6 MB. Free memory was 108.7 MB in the beginning and 108.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 423.81 ms. Allocated memory was 142.6 MB in the beginning and 199.8 MB in the end (delta: 57.1 MB). Free memory was 90.0 MB in the beginning and 176.6 MB in the end (delta: -86.6 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.22 ms. Allocated memory is still 199.8 MB. Free memory was 176.6 MB in the beginning and 174.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 503.26 ms. Allocated memory is still 199.8 MB. Free memory was 174.9 MB in the beginning and 148.6 MB in the end (delta: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6110.22 ms. Allocated memory was 199.8 MB in the beginning and 323.0 MB in the end (delta: 123.2 MB). Free memory was 148.0 MB in the beginning and 272.6 MB in the end (delta: -124.6 MB). Peak memory consumption was 157.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 140]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 184]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 291]: 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: 92]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 120]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 267]: 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: 152]: 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: 80]: 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: 369]: 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: 303]: 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: 238]: 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 - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 225]: Loop Invariant Derived loop invariant: (((((((((((2 <= main__cp && !(__VERIFIER_assert__cond == 0)) && (((((((((!(__VERIFIER_assert__cond == 0) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 <= main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 <= main__c) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && 1 <= main__scheme) || ((((((2 <= main__cp && (((((((((!(__VERIFIER_assert__cond == 0) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 <= main__urilen) && !(__VERIFIER_assert__cond == 0)) && main__cp + 2 <= main__urilen) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && 0 == main__c) && 1 <= main__scheme)) || (((((((2 <= main__cp && (((((((((!(__VERIFIER_assert__cond == 0) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 <= main__urilen) && !(__VERIFIER_assert__cond == 0)) && main__c + 2 <= main__tokenlen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 0 == main__c) && 1 <= main__scheme) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: ((__VERIFIER_assert__cond == 1 && ((((((!(__VERIFIER_assert__cond == 0) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__scheme) && !(__VERIFIER_assert__cond == 0)) || ((((__VERIFIER_assert__cond == 1 && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__scheme) && !(__VERIFIER_assert__cond == 0))) && main__cp < main__urilen) && main__cp + 1 == main__urilen) || ((__VERIFIER_assert__cond == 1 && ((((((!(__VERIFIER_assert__cond == 0) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__scheme) && !(__VERIFIER_assert__cond == 0)) || ((((__VERIFIER_assert__cond == 1 && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__scheme) && !(__VERIFIER_assert__cond == 0))) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1) - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: ((((!(__VERIFIER_assert__cond == 0) && __VERIFIER_assert__cond == 1) && (((!(__VERIFIER_assert__cond == 0) && 0 <= main__c) && ((((2 <= main__cp && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && ((((((!(__VERIFIER_assert__cond == 0) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) || (((((main__c + 2 <= main__tokenlen && __VERIFIER_assert__cond == 1) && ((((2 <= main__cp && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && ((((((!(__VERIFIER_assert__cond == 0) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 0 == main__c) - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: (main__cp + 1 <= main__urilen && 1 <= main__scheme) && (((((__VERIFIER_assert__cond == 1 && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) || ((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: !(__VERIFIER_assert__cond == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 87 locations, 18 error locations. SAFE Result, 6.0s OverallTime, 24 OverallIterations, 2 TraceHistogramMax, 2.2s AutomataDifference, 0.0s DeadEndRemovalTime, 1.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 1399 SDtfs, 2521 SDslu, 1859 SDs, 0 SdLazy, 1170 SolverSat, 142 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 338 GetRequests, 196 SyntacticMatches, 13 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.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 AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 287 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 17 NumberOfFragments, 539 HoareAnnotationTreeSize, 9 FomulaSimplifications, 44952 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 9 FomulaSimplificationsInter, 17293 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 957 NumberOfCodeBlocks, 957 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 929 ConstructedInterpolants, 0 QuantifiedInterpolants, 80420 SizeOfPredicates, 25 NumberOfNonLiveVariables, 547 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 28 InterpolantComputations, 21 PerfectInterpolantSequences, 16/33 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...