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/reducercommutativity/sep60-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 14:41:56,609 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 14:41:56,611 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 14:41:56,624 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 14:41:56,624 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 14:41:56,625 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 14:41:56,627 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 14:41:56,638 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 14:41:56,640 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 14:41:56,644 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 14:41:56,645 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 14:41:56,647 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 14:41:56,647 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 14:41:56,651 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 14:41:56,652 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 14:41:56,653 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 14:41:56,654 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 14:41:56,658 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 14:41:56,661 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 14:41:56,663 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 14:41:56,666 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 14:41:56,670 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 14:41:56,671 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 14:41:56,672 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 14:41:56,677 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 14:41:56,677 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 14:41:56,677 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 14:41:56,680 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 14:41:56,681 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 14:41:56,684 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 14:41:56,684 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 14:41:56,685 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 14:41:56,686 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 14:41:56,686 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 14:41:56,691 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 14:41:56,691 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 14:41:56,692 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 14:41:56,692 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 14:41:56,692 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 14:41:56,695 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 14:41:56,695 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 14:41:56,697 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 14:41:56,719 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 14:41:56,719 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 14:41:56,722 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 14:41:56,722 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 14:41:56,722 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 14:41:56,723 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 14:41:56,723 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 14:41:56,723 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 14:41:56,723 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 14:41:56,723 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 14:41:56,725 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 14:41:56,725 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 14:41:56,725 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 14:41:56,726 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 14:41:56,726 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 14:41:56,726 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 14:41:56,726 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 14:41:56,726 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 14:41:56,727 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 14:41:56,727 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 14:41:56,727 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 14:41:56,727 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 14:41:56,727 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 14:41:56,728 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 14:41:56,728 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 14:41:56,728 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 14:41:56,728 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 14:41:56,729 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 14:41:56,729 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 14:41:56,779 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 14:41:56,792 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 14:41:56,795 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 14:41:56,797 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 14:41:56,797 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 14:41:56,798 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/sep60-2.i [2019-10-02 14:41:56,874 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96692197c/3a0cfd51a47249b898fb70281cf236b8/FLAG8705bcc6b [2019-10-02 14:41:57,347 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 14:41:57,347 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/sep60-2.i [2019-10-02 14:41:57,354 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96692197c/3a0cfd51a47249b898fb70281cf236b8/FLAG8705bcc6b [2019-10-02 14:41:57,769 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96692197c/3a0cfd51a47249b898fb70281cf236b8 [2019-10-02 14:41:57,780 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 14:41:57,781 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 14:41:57,782 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 14:41:57,783 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 14:41:57,785 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 14:41:57,786 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:41:57" (1/1) ... [2019-10-02 14:41:57,789 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f305386 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:41:57, skipping insertion in model container [2019-10-02 14:41:57,789 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:41:57" (1/1) ... [2019-10-02 14:41:57,795 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 14:41:57,810 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 14:41:58,005 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:41:58,013 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 14:41:58,035 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:41:58,136 INFO L192 MainTranslator]: Completed translation [2019-10-02 14:41:58,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:41:58 WrapperNode [2019-10-02 14:41:58,137 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 14:41:58,138 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 14:41:58,138 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 14:41:58,138 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 14:41:58,151 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:41:58" (1/1) ... [2019-10-02 14:41:58,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:41:58" (1/1) ... [2019-10-02 14:41:58,159 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:41:58" (1/1) ... [2019-10-02 14:41:58,159 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:41:58" (1/1) ... [2019-10-02 14:41:58,168 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:41:58" (1/1) ... [2019-10-02 14:41:58,174 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:41:58" (1/1) ... [2019-10-02 14:41:58,176 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:41:58" (1/1) ... [2019-10-02 14:41:58,178 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 14:41:58,179 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 14:41:58,179 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 14:41:58,179 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 14:41:58,180 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:41:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 14:41:58,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 14:41:58,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 14:41:58,250 INFO L138 BoogieDeclarations]: Found implementation of procedure sep [2019-10-02 14:41:58,250 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 14:41:58,250 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 14:41:58,250 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 14:41:58,250 INFO L130 BoogieDeclarations]: Found specification of procedure sep [2019-10-02 14:41:58,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 14:41:58,251 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 14:41:58,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 14:41:58,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 14:41:58,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 14:41:58,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 14:41:58,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 14:41:58,530 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 14:41:58,530 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-02 14:41:58,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:41:58 BoogieIcfgContainer [2019-10-02 14:41:58,532 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 14:41:58,534 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 14:41:58,534 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 14:41:58,538 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 14:41:58,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 02:41:57" (1/3) ... [2019-10-02 14:41:58,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ef8bf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:41:58, skipping insertion in model container [2019-10-02 14:41:58,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:41:58" (2/3) ... [2019-10-02 14:41:58,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ef8bf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:41:58, skipping insertion in model container [2019-10-02 14:41:58,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:41:58" (3/3) ... [2019-10-02 14:41:58,542 INFO L109 eAbstractionObserver]: Analyzing ICFG sep60-2.i [2019-10-02 14:41:58,555 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 14:41:58,570 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 14:41:58,589 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 14:41:58,621 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 14:41:58,622 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 14:41:58,622 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 14:41:58,622 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 14:41:58,623 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 14:41:58,623 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 14:41:58,623 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 14:41:58,623 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 14:41:58,623 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 14:41:58,644 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-10-02 14:41:58,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-02 14:41:58,652 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:58,653 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:58,655 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:58,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:58,661 INFO L82 PathProgramCache]: Analyzing trace with hash 794343521, now seen corresponding path program 1 times [2019-10-02 14:41:58,663 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:58,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:58,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:58,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:41:58,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:58,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:58,825 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 14:41:58,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:41:58,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 14:41:58,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 14:41:58,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 14:41:58,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 14:41:58,850 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2019-10-02 14:41:58,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:58,875 INFO L93 Difference]: Finished difference Result 56 states and 75 transitions. [2019-10-02 14:41:58,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 14:41:58,876 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2019-10-02 14:41:58,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:58,886 INFO L225 Difference]: With dead ends: 56 [2019-10-02 14:41:58,886 INFO L226 Difference]: Without dead ends: 27 [2019-10-02 14:41:58,890 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 14:41:58,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-02 14:41:58,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-10-02 14:41:58,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-02 14:41:58,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2019-10-02 14:41:58,936 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 32 [2019-10-02 14:41:58,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:58,936 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-10-02 14:41:58,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 14:41:58,937 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2019-10-02 14:41:58,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-02 14:41:58,939 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:58,939 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:58,940 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:58,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:58,940 INFO L82 PathProgramCache]: Analyzing trace with hash 2140793590, now seen corresponding path program 1 times [2019-10-02 14:41:58,941 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:58,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:58,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:58,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:41:58,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:59,025 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 14:41:59,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:41:59,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:41:59,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:41:59,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:41:59,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:41:59,029 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand 3 states. [2019-10-02 14:41:59,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:59,063 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2019-10-02 14:41:59,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:41:59,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-02 14:41:59,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:59,065 INFO L225 Difference]: With dead ends: 48 [2019-10-02 14:41:59,065 INFO L226 Difference]: Without dead ends: 29 [2019-10-02 14:41:59,066 INFO L640 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-10-02 14:41:59,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-02 14:41:59,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-10-02 14:41:59,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-02 14:41:59,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-10-02 14:41:59,074 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 32 [2019-10-02 14:41:59,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:59,074 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-10-02 14:41:59,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:41:59,075 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2019-10-02 14:41:59,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-02 14:41:59,076 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:59,076 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:59,077 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:59,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:59,077 INFO L82 PathProgramCache]: Analyzing trace with hash 2099349144, now seen corresponding path program 1 times [2019-10-02 14:41:59,078 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:59,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:59,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:59,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:41:59,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:59,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:59,181 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 14:41:59,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:41:59,182 INFO L224 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) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:41:59,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:41:59,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:59,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 14:41:59,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:41:59,320 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 14:41:59,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:41:59,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-10-02 14:41:59,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 14:41:59,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 14:41:59,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:41:59,336 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 4 states. [2019-10-02 14:41:59,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:59,366 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2019-10-02 14:41:59,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:41:59,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-10-02 14:41:59,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:59,368 INFO L225 Difference]: With dead ends: 49 [2019-10-02 14:41:59,368 INFO L226 Difference]: Without dead ends: 31 [2019-10-02 14:41:59,369 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:41:59,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-02 14:41:59,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2019-10-02 14:41:59,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-02 14:41:59,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2019-10-02 14:41:59,376 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 34 [2019-10-02 14:41:59,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:59,376 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2019-10-02 14:41:59,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 14:41:59,376 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2019-10-02 14:41:59,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-02 14:41:59,378 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:59,378 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:59,379 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:59,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:59,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1279819331, now seen corresponding path program 1 times [2019-10-02 14:41:59,379 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:59,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:59,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:59,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:41:59,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:59,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:59,472 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 14:41:59,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:41:59,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:41:59,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:41:59,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:41:59,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:41:59,475 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 3 states. [2019-10-02 14:41:59,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:59,504 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2019-10-02 14:41:59,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:41:59,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-02 14:41:59,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:59,507 INFO L225 Difference]: With dead ends: 45 [2019-10-02 14:41:59,508 INFO L226 Difference]: Without dead ends: 31 [2019-10-02 14:41:59,508 INFO L640 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-10-02 14:41:59,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-02 14:41:59,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-10-02 14:41:59,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-02 14:41:59,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2019-10-02 14:41:59,524 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 43 [2019-10-02 14:41:59,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:59,531 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-10-02 14:41:59,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:41:59,531 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2019-10-02 14:41:59,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-02 14:41:59,533 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:59,533 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:59,534 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:59,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:59,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1550635457, now seen corresponding path program 1 times [2019-10-02 14:41:59,534 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:59,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:59,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:59,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:41:59,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:59,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:59,710 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 14:41:59,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:41:59,711 INFO L224 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:41:59,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:41:59,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:59,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 14:41:59,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:41:59,822 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 14:41:59,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:41:59,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-02 14:41:59,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 14:41:59,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 14:41:59,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:41:59,827 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 5 states. [2019-10-02 14:41:59,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:59,872 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2019-10-02 14:41:59,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 14:41:59,876 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-10-02 14:41:59,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:59,877 INFO L225 Difference]: With dead ends: 54 [2019-10-02 14:41:59,877 INFO L226 Difference]: Without dead ends: 33 [2019-10-02 14:41:59,878 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:41:59,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-02 14:41:59,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-10-02 14:41:59,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-02 14:41:59,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2019-10-02 14:41:59,888 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 45 [2019-10-02 14:41:59,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:59,894 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-10-02 14:41:59,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 14:41:59,894 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2019-10-02 14:41:59,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-02 14:41:59,896 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:59,896 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:59,896 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:59,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:59,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1356401117, now seen corresponding path program 2 times [2019-10-02 14:41:59,897 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:59,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:59,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:59,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:41:59,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:59,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:00,040 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 14:42:00,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:00,041 INFO L224 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:00,067 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:42:00,113 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:42:00,113 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:00,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 14:42:00,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:00,131 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 14:42:00,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:00,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-02 14:42:00,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:42:00,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:42:00,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:42:00,140 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 6 states. [2019-10-02 14:42:00,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:00,181 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2019-10-02 14:42:00,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:42:00,182 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-10-02 14:42:00,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:00,183 INFO L225 Difference]: With dead ends: 56 [2019-10-02 14:42:00,183 INFO L226 Difference]: Without dead ends: 35 [2019-10-02 14:42:00,184 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:42:00,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-02 14:42:00,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-10-02 14:42:00,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-02 14:42:00,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2019-10-02 14:42:00,190 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 47 [2019-10-02 14:42:00,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:00,190 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2019-10-02 14:42:00,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:42:00,190 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2019-10-02 14:42:00,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-02 14:42:00,191 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:00,192 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:00,192 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:00,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:00,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1005160965, now seen corresponding path program 3 times [2019-10-02 14:42:00,192 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:00,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:00,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:00,194 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:00,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:00,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:00,308 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 14:42:00,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:00,309 INFO L224 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) [2019-10-02 14:42:00,340 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:00,371 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-02 14:42:00,372 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:00,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 14:42:00,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:00,407 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 14:42:00,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:00,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-10-02 14:42:00,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 14:42:00,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 14:42:00,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:42:00,418 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 8 states. [2019-10-02 14:42:00,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:00,493 INFO L93 Difference]: Finished difference Result 63 states and 79 transitions. [2019-10-02 14:42:00,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 14:42:00,495 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2019-10-02 14:42:00,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:00,496 INFO L225 Difference]: With dead ends: 63 [2019-10-02 14:42:00,496 INFO L226 Difference]: Without dead ends: 42 [2019-10-02 14:42:00,496 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:42:00,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-02 14:42:00,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2019-10-02 14:42:00,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-02 14:42:00,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2019-10-02 14:42:00,502 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 49 [2019-10-02 14:42:00,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:00,503 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2019-10-02 14:42:00,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 14:42:00,503 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2019-10-02 14:42:00,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-02 14:42:00,504 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:00,504 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:00,505 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:00,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:00,505 INFO L82 PathProgramCache]: Analyzing trace with hash 742022364, now seen corresponding path program 4 times [2019-10-02 14:42:00,505 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:00,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:00,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:00,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:00,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:00,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:00,610 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 20 proven. 25 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-02 14:42:00,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:00,610 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 14:42:00,646 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:00,701 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:42:00,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:00,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 14:42:00,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:00,780 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-10-02 14:42:00,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:00,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2019-10-02 14:42:00,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 14:42:00,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 14:42:00,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:42:00,791 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 10 states. [2019-10-02 14:42:00,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:00,875 INFO L93 Difference]: Finished difference Result 71 states and 89 transitions. [2019-10-02 14:42:00,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 14:42:00,876 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 60 [2019-10-02 14:42:00,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:00,877 INFO L225 Difference]: With dead ends: 71 [2019-10-02 14:42:00,878 INFO L226 Difference]: Without dead ends: 47 [2019-10-02 14:42:00,879 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:42:00,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-02 14:42:00,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2019-10-02 14:42:00,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-02 14:42:00,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2019-10-02 14:42:00,894 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 60 [2019-10-02 14:42:00,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:00,894 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2019-10-02 14:42:00,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 14:42:00,894 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2019-10-02 14:42:00,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-02 14:42:00,899 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:00,899 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:00,899 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:00,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:00,900 INFO L82 PathProgramCache]: Analyzing trace with hash -535819369, now seen corresponding path program 5 times [2019-10-02 14:42:00,900 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:00,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:00,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:00,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:00,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:00,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:01,073 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2019-10-02 14:42:01,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:01,074 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 14:42:01,110 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:01,185 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-10-02 14:42:01,186 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:01,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 14:42:01,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:01,248 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 70 proven. 12 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-10-02 14:42:01,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:01,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2019-10-02 14:42:01,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 14:42:01,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 14:42:01,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-10-02 14:42:01,253 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 12 states. [2019-10-02 14:42:01,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:01,330 INFO L93 Difference]: Finished difference Result 79 states and 99 transitions. [2019-10-02 14:42:01,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 14:42:01,333 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2019-10-02 14:42:01,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:01,334 INFO L225 Difference]: With dead ends: 79 [2019-10-02 14:42:01,334 INFO L226 Difference]: Without dead ends: 52 [2019-10-02 14:42:01,337 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-10-02 14:42:01,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-02 14:42:01,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2019-10-02 14:42:01,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-02 14:42:01,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2019-10-02 14:42:01,353 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 71 [2019-10-02 14:42:01,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:01,353 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2019-10-02 14:42:01,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 14:42:01,354 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2019-10-02 14:42:01,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-02 14:42:01,355 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:01,355 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:01,356 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:01,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:01,356 INFO L82 PathProgramCache]: Analyzing trace with hash 778847808, now seen corresponding path program 6 times [2019-10-02 14:42:01,359 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:01,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:01,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:01,361 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:01,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:01,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:01,518 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2019-10-02 14:42:01,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:01,518 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:01,545 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 14:42:01,597 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-10-02 14:42:01,597 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:01,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 14:42:01,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:01,645 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 122 proven. 1 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2019-10-02 14:42:01,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:01,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2019-10-02 14:42:01,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 14:42:01,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 14:42:01,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-02 14:42:01,654 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 11 states. [2019-10-02 14:42:01,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:01,718 INFO L93 Difference]: Finished difference Result 85 states and 102 transitions. [2019-10-02 14:42:01,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 14:42:01,718 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 82 [2019-10-02 14:42:01,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:01,720 INFO L225 Difference]: With dead ends: 85 [2019-10-02 14:42:01,720 INFO L226 Difference]: Without dead ends: 55 [2019-10-02 14:42:01,720 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-02 14:42:01,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-02 14:42:01,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2019-10-02 14:42:01,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-02 14:42:01,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2019-10-02 14:42:01,727 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 82 [2019-10-02 14:42:01,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:01,727 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2019-10-02 14:42:01,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 14:42:01,728 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2019-10-02 14:42:01,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-02 14:42:01,729 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:01,729 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 7, 7, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:01,729 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:01,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:01,730 INFO L82 PathProgramCache]: Analyzing trace with hash 27018272, now seen corresponding path program 7 times [2019-10-02 14:42:01,730 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:01,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:01,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:01,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:01,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:01,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:01,848 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-02 14:42:01,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:01,849 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:01,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:42:01,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:01,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 14:42:01,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:02,000 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-02 14:42:02,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:02,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-02 14:42:02,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 14:42:02,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 14:42:02,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-02 14:42:02,008 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 11 states. [2019-10-02 14:42:02,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:02,053 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2019-10-02 14:42:02,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 14:42:02,056 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 86 [2019-10-02 14:42:02,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:02,057 INFO L225 Difference]: With dead ends: 88 [2019-10-02 14:42:02,057 INFO L226 Difference]: Without dead ends: 56 [2019-10-02 14:42:02,060 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-02 14:42:02,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-02 14:42:02,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-10-02 14:42:02,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-02 14:42:02,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2019-10-02 14:42:02,074 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 86 [2019-10-02 14:42:02,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:02,075 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2019-10-02 14:42:02,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 14:42:02,075 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2019-10-02 14:42:02,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-02 14:42:02,076 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:02,077 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 8, 8, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:02,077 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:02,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:02,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1793036866, now seen corresponding path program 8 times [2019-10-02 14:42:02,078 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:02,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:02,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:02,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:42:02,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:02,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:02,207 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-02 14:42:02,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:02,207 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 14:42:02,236 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:02,292 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:42:02,293 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:02,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 14:42:02,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:02,327 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-02 14:42:02,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:02,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-10-02 14:42:02,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 14:42:02,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 14:42:02,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-02 14:42:02,343 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 12 states. [2019-10-02 14:42:02,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:02,402 INFO L93 Difference]: Finished difference Result 90 states and 106 transitions. [2019-10-02 14:42:02,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 14:42:02,404 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 88 [2019-10-02 14:42:02,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:02,405 INFO L225 Difference]: With dead ends: 90 [2019-10-02 14:42:02,405 INFO L226 Difference]: Without dead ends: 58 [2019-10-02 14:42:02,412 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-02 14:42:02,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-02 14:42:02,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-10-02 14:42:02,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-02 14:42:02,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2019-10-02 14:42:02,422 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 88 [2019-10-02 14:42:02,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:02,423 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2019-10-02 14:42:02,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 14:42:02,423 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2019-10-02 14:42:02,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-02 14:42:02,424 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:02,425 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 9, 9, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:02,425 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:02,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:02,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1870143516, now seen corresponding path program 9 times [2019-10-02 14:42:02,426 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:02,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:02,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:02,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:02,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:02,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:02,565 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-02 14:42:02,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:02,566 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 14:42:02,589 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:02,637 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-02 14:42:02,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:02,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 14:42:02,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:02,688 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 122 proven. 4 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:42:02,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:02,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2019-10-02 14:42:02,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 14:42:02,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 14:42:02,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-10-02 14:42:02,695 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand 15 states. [2019-10-02 14:42:02,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:02,766 INFO L93 Difference]: Finished difference Result 95 states and 112 transitions. [2019-10-02 14:42:02,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 14:42:02,768 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 90 [2019-10-02 14:42:02,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:02,769 INFO L225 Difference]: With dead ends: 95 [2019-10-02 14:42:02,769 INFO L226 Difference]: Without dead ends: 63 [2019-10-02 14:42:02,769 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-10-02 14:42:02,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-02 14:42:02,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2019-10-02 14:42:02,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-02 14:42:02,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2019-10-02 14:42:02,783 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 90 [2019-10-02 14:42:02,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:02,784 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2019-10-02 14:42:02,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 14:42:02,784 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2019-10-02 14:42:02,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-02 14:42:02,785 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:02,785 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 10, 10, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:02,785 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:02,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:02,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1573371196, now seen corresponding path program 10 times [2019-10-02 14:42:02,786 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:02,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:02,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:02,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:02,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:02,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:02,948 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2019-10-02 14:42:02,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:02,948 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 14:42:02,977 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:03,033 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:42:03,033 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:03,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-02 14:42:03,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:03,064 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2019-10-02 14:42:03,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:03,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-10-02 14:42:03,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 14:42:03,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 14:42:03,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-02 14:42:03,079 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand 14 states. [2019-10-02 14:42:03,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:03,138 INFO L93 Difference]: Finished difference Result 98 states and 114 transitions. [2019-10-02 14:42:03,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 14:42:03,140 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 94 [2019-10-02 14:42:03,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:03,140 INFO L225 Difference]: With dead ends: 98 [2019-10-02 14:42:03,141 INFO L226 Difference]: Without dead ends: 64 [2019-10-02 14:42:03,141 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-02 14:42:03,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-02 14:42:03,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2019-10-02 14:42:03,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-02 14:42:03,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2019-10-02 14:42:03,147 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 94 [2019-10-02 14:42:03,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:03,147 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2019-10-02 14:42:03,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 14:42:03,147 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2019-10-02 14:42:03,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-02 14:42:03,148 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:03,149 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:03,149 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:03,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:03,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1553707290, now seen corresponding path program 11 times [2019-10-02 14:42:03,149 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:03,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:03,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:03,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:03,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:03,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:03,318 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2019-10-02 14:42:03,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:03,319 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:03,343 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:42:03,561 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-10-02 14:42:03,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:03,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 14:42:03,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:03,652 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 116 proven. 22 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2019-10-02 14:42:03,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:03,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 19 [2019-10-02 14:42:03,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 14:42:03,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 14:42:03,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2019-10-02 14:42:03,659 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand 19 states. [2019-10-02 14:42:03,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:03,756 INFO L93 Difference]: Finished difference Result 105 states and 127 transitions. [2019-10-02 14:42:03,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 14:42:03,757 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 96 [2019-10-02 14:42:03,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:03,758 INFO L225 Difference]: With dead ends: 105 [2019-10-02 14:42:03,759 INFO L226 Difference]: Without dead ends: 71 [2019-10-02 14:42:03,760 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2019-10-02 14:42:03,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-10-02 14:42:03,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2019-10-02 14:42:03,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-02 14:42:03,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2019-10-02 14:42:03,766 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 96 [2019-10-02 14:42:03,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:03,766 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2019-10-02 14:42:03,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 14:42:03,767 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2019-10-02 14:42:03,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-02 14:42:03,768 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:03,768 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 15, 12, 12, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:03,769 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:03,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:03,769 INFO L82 PathProgramCache]: Analyzing trace with hash 492928205, now seen corresponding path program 12 times [2019-10-02 14:42:03,769 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:03,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:03,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:03,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:03,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:03,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:03,894 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2019-10-02 14:42:03,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:03,895 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:03,930 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 14:42:04,121 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-10-02 14:42:04,122 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:04,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 14:42:04,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:04,182 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 180 proven. 9 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (14)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:42:04,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:04,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-10-02 14:42:04,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 14:42:04,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 14:42:04,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-02 14:42:04,195 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand 7 states. [2019-10-02 14:42:04,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:04,231 INFO L93 Difference]: Finished difference Result 97 states and 112 transitions. [2019-10-02 14:42:04,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 14:42:04,232 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 107 [2019-10-02 14:42:04,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:04,233 INFO L225 Difference]: With dead ends: 97 [2019-10-02 14:42:04,233 INFO L226 Difference]: Without dead ends: 71 [2019-10-02 14:42:04,234 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-02 14:42:04,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-10-02 14:42:04,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-10-02 14:42:04,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-02 14:42:04,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2019-10-02 14:42:04,243 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 107 [2019-10-02 14:42:04,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:04,245 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2019-10-02 14:42:04,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 14:42:04,246 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2019-10-02 14:42:04,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-02 14:42:04,248 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:04,248 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 15, 12, 12, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:04,249 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:04,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:04,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1457348017, now seen corresponding path program 13 times [2019-10-02 14:42:04,249 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:04,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:04,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:04,251 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:04,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:04,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:04,425 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 89 proven. 124 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2019-10-02 14:42:04,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:04,426 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 14:42:04,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:04,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:04,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-02 14:42:04,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:04,701 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2019-10-02 14:42:04,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:04,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15] total 21 [2019-10-02 14:42:04,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-02 14:42:04,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-02 14:42:04,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=288, Unknown=0, NotChecked=0, Total=420 [2019-10-02 14:42:04,713 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand 21 states. [2019-10-02 14:42:04,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:04,805 INFO L93 Difference]: Finished difference Result 117 states and 141 transitions. [2019-10-02 14:42:04,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-02 14:42:04,806 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 109 [2019-10-02 14:42:04,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:04,806 INFO L225 Difference]: With dead ends: 117 [2019-10-02 14:42:04,807 INFO L226 Difference]: Without dead ends: 78 [2019-10-02 14:42:04,808 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=132, Invalid=288, Unknown=0, NotChecked=0, Total=420 [2019-10-02 14:42:04,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-02 14:42:04,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2019-10-02 14:42:04,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-02 14:42:04,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2019-10-02 14:42:04,814 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 109 [2019-10-02 14:42:04,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:04,814 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2019-10-02 14:42:04,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-02 14:42:04,814 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2019-10-02 14:42:04,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-02 14:42:04,815 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:04,816 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 18, 13, 13, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:04,816 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:04,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:04,816 INFO L82 PathProgramCache]: Analyzing trace with hash -966850552, now seen corresponding path program 14 times [2019-10-02 14:42:04,816 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:04,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:04,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:04,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:42:04,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:04,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:05,011 INFO L134 CoverageAnalysis]: Checked inductivity of 713 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-10-02 14:42:05,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:05,012 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:05,048 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:42:05,115 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:42:05,115 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:05,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-02 14:42:05,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:05,167 INFO L134 CoverageAnalysis]: Checked inductivity of 713 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-10-02 14:42:05,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:05,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-10-02 14:42:05,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 14:42:05,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 14:42:05,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-02 14:42:05,173 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand 17 states. [2019-10-02 14:42:05,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:05,234 INFO L93 Difference]: Finished difference Result 120 states and 140 transitions. [2019-10-02 14:42:05,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 14:42:05,234 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 120 [2019-10-02 14:42:05,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:05,235 INFO L225 Difference]: With dead ends: 120 [2019-10-02 14:42:05,235 INFO L226 Difference]: Without dead ends: 78 [2019-10-02 14:42:05,236 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-02 14:42:05,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-02 14:42:05,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-10-02 14:42:05,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-02 14:42:05,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2019-10-02 14:42:05,240 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 120 [2019-10-02 14:42:05,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:05,241 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2019-10-02 14:42:05,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 14:42:05,241 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2019-10-02 14:42:05,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-02 14:42:05,242 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:05,242 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 18, 14, 14, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:05,243 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:05,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:05,243 INFO L82 PathProgramCache]: Analyzing trace with hash -770159190, now seen corresponding path program 15 times [2019-10-02 14:42:05,243 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:05,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:05,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:05,245 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:05,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:05,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:05,467 INFO L134 CoverageAnalysis]: Checked inductivity of 740 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-10-02 14:42:05,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:05,467 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:05,511 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:42:05,597 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-02 14:42:05,598 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:05,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 14:42:05,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:05,698 INFO L134 CoverageAnalysis]: Checked inductivity of 740 backedges. 250 proven. 16 refuted. 0 times theorem prover too weak. 474 trivial. 0 not checked. [2019-10-02 14:42:05,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:05,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 7] total 22 [2019-10-02 14:42:05,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-02 14:42:05,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-02 14:42:05,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=306, Unknown=0, NotChecked=0, Total=462 [2019-10-02 14:42:05,706 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand 22 states. [2019-10-02 14:42:05,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:05,797 INFO L93 Difference]: Finished difference Result 125 states and 146 transitions. [2019-10-02 14:42:05,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-02 14:42:05,798 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 122 [2019-10-02 14:42:05,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:05,799 INFO L225 Difference]: With dead ends: 125 [2019-10-02 14:42:05,799 INFO L226 Difference]: Without dead ends: 83 [2019-10-02 14:42:05,800 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=306, Unknown=0, NotChecked=0, Total=462 [2019-10-02 14:42:05,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-10-02 14:42:05,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2019-10-02 14:42:05,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-02 14:42:05,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2019-10-02 14:42:05,804 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 122 [2019-10-02 14:42:05,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:05,805 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2019-10-02 14:42:05,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-02 14:42:05,805 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2019-10-02 14:42:05,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-02 14:42:05,806 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:05,806 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 18, 15, 15, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:05,807 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:05,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:05,808 INFO L82 PathProgramCache]: Analyzing trace with hash -65326966, now seen corresponding path program 16 times [2019-10-02 14:42:05,808 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:05,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:05,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:05,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:05,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:05,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:06,035 INFO L134 CoverageAnalysis]: Checked inductivity of 778 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2019-10-02 14:42:06,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:06,035 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:06,069 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:42:06,145 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:42:06,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:06,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-02 14:42:06,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:06,191 INFO L134 CoverageAnalysis]: Checked inductivity of 778 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2019-10-02 14:42:06,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:06,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-10-02 14:42:06,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 14:42:06,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 14:42:06,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-10-02 14:42:06,198 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand 19 states. [2019-10-02 14:42:06,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:06,270 INFO L93 Difference]: Finished difference Result 128 states and 148 transitions. [2019-10-02 14:42:06,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 14:42:06,272 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 126 [2019-10-02 14:42:06,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:06,274 INFO L225 Difference]: With dead ends: 128 [2019-10-02 14:42:06,274 INFO L226 Difference]: Without dead ends: 84 [2019-10-02 14:42:06,275 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-10-02 14:42:06,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-10-02 14:42:06,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2019-10-02 14:42:06,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-10-02 14:42:06,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2019-10-02 14:42:06,280 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 126 [2019-10-02 14:42:06,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:06,280 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2019-10-02 14:42:06,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 14:42:06,281 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2019-10-02 14:42:06,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-02 14:42:06,283 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:06,283 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 18, 16, 16, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:06,283 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:06,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:06,284 INFO L82 PathProgramCache]: Analyzing trace with hash 549336236, now seen corresponding path program 17 times [2019-10-02 14:42:06,284 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:06,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:06,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:06,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:06,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:06,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:06,589 INFO L134 CoverageAnalysis]: Checked inductivity of 809 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2019-10-02 14:42:06,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:06,589 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:06,621 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:42:08,282 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2019-10-02 14:42:08,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:08,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 14:42:08,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:08,410 INFO L134 CoverageAnalysis]: Checked inductivity of 809 backedges. 244 proven. 51 refuted. 0 times theorem prover too weak. 514 trivial. 0 not checked. [2019-10-02 14:42:08,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:08,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 9] total 26 [2019-10-02 14:42:08,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 14:42:08,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 14:42:08,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=444, Unknown=0, NotChecked=0, Total=650 [2019-10-02 14:42:08,417 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand 26 states. [2019-10-02 14:42:08,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:08,527 INFO L93 Difference]: Finished difference Result 135 states and 161 transitions. [2019-10-02 14:42:08,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 14:42:08,527 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 128 [2019-10-02 14:42:08,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:08,528 INFO L225 Difference]: With dead ends: 135 [2019-10-02 14:42:08,529 INFO L226 Difference]: Without dead ends: 91 [2019-10-02 14:42:08,529 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=444, Unknown=0, NotChecked=0, Total=650 [2019-10-02 14:42:08,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-10-02 14:42:08,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2019-10-02 14:42:08,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-02 14:42:08,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2019-10-02 14:42:08,534 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 128 [2019-10-02 14:42:08,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:08,534 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2019-10-02 14:42:08,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 14:42:08,534 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2019-10-02 14:42:08,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-02 14:42:08,536 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:08,536 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 21, 17, 17, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:08,536 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:08,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:08,537 INFO L82 PathProgramCache]: Analyzing trace with hash 750218439, now seen corresponding path program 18 times [2019-10-02 14:42:08,537 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:08,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:08,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:08,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:08,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:08,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:08,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1022 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 733 trivial. 0 not checked. [2019-10-02 14:42:08,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:08,821 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:08,870 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 14:42:09,928 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-10-02 14:42:09,929 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:09,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 14:42:09,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:10,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1022 backedges. 332 proven. 25 refuted. 0 times theorem prover too weak. 665 trivial. 0 not checked. [2019-10-02 14:42:10,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:10,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 8] total 26 [2019-10-02 14:42:10,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 14:42:10,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 14:42:10,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=433, Unknown=0, NotChecked=0, Total=650 [2019-10-02 14:42:10,068 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand 26 states. [2019-10-02 14:42:10,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:10,159 INFO L93 Difference]: Finished difference Result 141 states and 164 transitions. [2019-10-02 14:42:10,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 14:42:10,161 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 139 [2019-10-02 14:42:10,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:10,162 INFO L225 Difference]: With dead ends: 141 [2019-10-02 14:42:10,162 INFO L226 Difference]: Without dead ends: 94 [2019-10-02 14:42:10,163 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=217, Invalid=433, Unknown=0, NotChecked=0, Total=650 [2019-10-02 14:42:10,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-10-02 14:42:10,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2019-10-02 14:42:10,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-10-02 14:42:10,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2019-10-02 14:42:10,169 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 139 [2019-10-02 14:42:10,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:10,170 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2019-10-02 14:42:10,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 14:42:10,170 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2019-10-02 14:42:10,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-02 14:42:10,171 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:10,172 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 21, 18, 18, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:10,172 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:10,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:10,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1905335783, now seen corresponding path program 19 times [2019-10-02 14:42:10,172 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:10,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:10,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:10,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:10,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:10,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:10,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1068 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2019-10-02 14:42:10,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:10,465 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:10,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:42:10,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:10,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-02 14:42:10,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:10,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1068 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2019-10-02 14:42:10,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:10,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-10-02 14:42:10,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-02 14:42:10,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-02 14:42:10,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-10-02 14:42:10,638 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand 22 states. [2019-10-02 14:42:10,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:10,709 INFO L93 Difference]: Finished difference Result 144 states and 166 transitions. [2019-10-02 14:42:10,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-02 14:42:10,710 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 143 [2019-10-02 14:42:10,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:10,711 INFO L225 Difference]: With dead ends: 144 [2019-10-02 14:42:10,711 INFO L226 Difference]: Without dead ends: 95 [2019-10-02 14:42:10,711 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-10-02 14:42:10,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-10-02 14:42:10,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2019-10-02 14:42:10,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-10-02 14:42:10,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2019-10-02 14:42:10,716 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 143 [2019-10-02 14:42:10,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:10,717 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2019-10-02 14:42:10,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-02 14:42:10,717 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2019-10-02 14:42:10,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-02 14:42:10,718 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:10,719 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 21, 19, 19, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:10,719 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:10,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:10,719 INFO L82 PathProgramCache]: Analyzing trace with hash 708223493, now seen corresponding path program 20 times [2019-10-02 14:42:10,720 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:10,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:10,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:10,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:42:10,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:10,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:11,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1105 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2019-10-02 14:42:11,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:11,130 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:11,179 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:42:11,264 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:42:11,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:11,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-02 14:42:11,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:11,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1105 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (22)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:42:11,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:11,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-10-02 14:42:11,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 14:42:11,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 14:42:11,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-02 14:42:11,349 INFO L87 Difference]: Start difference. First operand 94 states and 105 transitions. Second operand 23 states. [2019-10-02 14:42:11,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:11,411 INFO L93 Difference]: Finished difference Result 146 states and 168 transitions. [2019-10-02 14:42:11,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-02 14:42:11,412 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 145 [2019-10-02 14:42:11,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:11,413 INFO L225 Difference]: With dead ends: 146 [2019-10-02 14:42:11,413 INFO L226 Difference]: Without dead ends: 97 [2019-10-02 14:42:11,414 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-02 14:42:11,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-10-02 14:42:11,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2019-10-02 14:42:11,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-10-02 14:42:11,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2019-10-02 14:42:11,419 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 145 [2019-10-02 14:42:11,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:11,419 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2019-10-02 14:42:11,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 14:42:11,419 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2019-10-02 14:42:11,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-02 14:42:11,421 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:11,421 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:11,421 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:11,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:11,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1334548131, now seen corresponding path program 21 times [2019-10-02 14:42:11,422 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:11,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:11,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:11,425 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:11,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:11,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:11,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1144 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2019-10-02 14:42:11,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:11,770 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:11,800 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:42:11,912 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-10-02 14:42:11,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:11,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 14:42:11,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:12,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1144 backedges. 332 proven. 36 refuted. 0 times theorem prover too weak. 776 trivial. 0 not checked. [2019-10-02 14:42:12,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:12,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 9] total 30 [2019-10-02 14:42:12,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-02 14:42:12,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-02 14:42:12,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=582, Unknown=0, NotChecked=0, Total=870 [2019-10-02 14:42:12,072 INFO L87 Difference]: Start difference. First operand 96 states and 107 transitions. Second operand 30 states. [2019-10-02 14:42:12,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:12,196 INFO L93 Difference]: Finished difference Result 151 states and 174 transitions. [2019-10-02 14:42:12,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-02 14:42:12,197 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 147 [2019-10-02 14:42:12,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:12,198 INFO L225 Difference]: With dead ends: 151 [2019-10-02 14:42:12,198 INFO L226 Difference]: Without dead ends: 102 [2019-10-02 14:42:12,199 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=288, Invalid=582, Unknown=0, NotChecked=0, Total=870 [2019-10-02 14:42:12,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-10-02 14:42:12,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2019-10-02 14:42:12,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-10-02 14:42:12,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2019-10-02 14:42:12,203 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 147 [2019-10-02 14:42:12,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:12,203 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2019-10-02 14:42:12,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-02 14:42:12,203 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2019-10-02 14:42:12,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-02 14:42:12,205 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:12,205 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:12,205 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:12,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:12,206 INFO L82 PathProgramCache]: Analyzing trace with hash 614187715, now seen corresponding path program 22 times [2019-10-02 14:42:12,206 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:12,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:12,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:12,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:12,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:12,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:12,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 757 trivial. 0 not checked. [2019-10-02 14:42:12,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:12,559 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:12,585 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:42:12,666 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:42:12,667 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:12,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 14:42:12,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:12,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 330 proven. 70 refuted. 0 times theorem prover too weak. 798 trivial. 0 not checked. [2019-10-02 14:42:12,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:12,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 10] total 32 [2019-10-02 14:42:12,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-02 14:42:12,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-02 14:42:12,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=672, Unknown=0, NotChecked=0, Total=992 [2019-10-02 14:42:12,834 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand 32 states. [2019-10-02 14:42:12,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:12,960 INFO L93 Difference]: Finished difference Result 159 states and 187 transitions. [2019-10-02 14:42:12,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-02 14:42:12,961 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 151 [2019-10-02 14:42:12,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:12,962 INFO L225 Difference]: With dead ends: 159 [2019-10-02 14:42:12,962 INFO L226 Difference]: Without dead ends: 108 [2019-10-02 14:42:12,963 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=320, Invalid=672, Unknown=0, NotChecked=0, Total=992 [2019-10-02 14:42:12,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-10-02 14:42:12,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 105. [2019-10-02 14:42:12,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-10-02 14:42:12,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2019-10-02 14:42:12,967 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 151 [2019-10-02 14:42:12,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:12,968 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2019-10-02 14:42:12,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-02 14:42:12,968 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2019-10-02 14:42:12,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-02 14:42:12,969 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:12,969 INFO L411 BasicCegarLoop]: trace histogram [24, 24, 24, 22, 22, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:12,970 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:12,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:12,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1444040044, now seen corresponding path program 23 times [2019-10-02 14:42:12,970 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:12,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:12,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:12,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:12,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:13,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:13,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1448 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 964 trivial. 0 not checked. [2019-10-02 14:42:13,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:13,350 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:13,395 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:42:14,972 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2019-10-02 14:42:14,973 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:14,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 14:42:14,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:15,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1448 backedges. 420 proven. 92 refuted. 0 times theorem prover too weak. 936 trivial. 0 not checked. [2019-10-02 14:42:15,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:15,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 11] total 34 [2019-10-02 14:42:15,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-02 14:42:15,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-02 14:42:15,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=768, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 14:42:15,168 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand 34 states. [2019-10-02 14:42:15,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:15,283 INFO L93 Difference]: Finished difference Result 167 states and 197 transitions. [2019-10-02 14:42:15,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-02 14:42:15,284 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 162 [2019-10-02 14:42:15,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:15,285 INFO L225 Difference]: With dead ends: 167 [2019-10-02 14:42:15,285 INFO L226 Difference]: Without dead ends: 113 [2019-10-02 14:42:15,287 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=354, Invalid=768, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 14:42:15,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-10-02 14:42:15,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2019-10-02 14:42:15,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-10-02 14:42:15,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 123 transitions. [2019-10-02 14:42:15,293 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 123 transitions. Word has length 162 [2019-10-02 14:42:15,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:15,293 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 123 transitions. [2019-10-02 14:42:15,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-02 14:42:15,294 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 123 transitions. [2019-10-02 14:42:15,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-10-02 14:42:15,295 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:15,295 INFO L411 BasicCegarLoop]: trace histogram [27, 27, 27, 23, 23, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:15,295 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:15,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:15,296 INFO L82 PathProgramCache]: Analyzing trace with hash 895327071, now seen corresponding path program 24 times [2019-10-02 14:42:15,296 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:15,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:15,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:15,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:15,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:15,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:15,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1727 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 1198 trivial. 0 not checked. [2019-10-02 14:42:15,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:15,814 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:15,849 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 14:42:16,638 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2019-10-02 14:42:16,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:16,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 14:42:16,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:16,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1727 backedges. 532 proven. 49 refuted. 0 times theorem prover too weak. 1146 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (26)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:42:16,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:16,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 10] total 34 [2019-10-02 14:42:16,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-02 14:42:16,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-02 14:42:16,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=753, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 14:42:16,812 INFO L87 Difference]: Start difference. First operand 110 states and 123 transitions. Second operand 34 states. [2019-10-02 14:42:17,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:17,011 INFO L93 Difference]: Finished difference Result 173 states and 200 transitions. [2019-10-02 14:42:17,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-02 14:42:17,011 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 173 [2019-10-02 14:42:17,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:17,013 INFO L225 Difference]: With dead ends: 173 [2019-10-02 14:42:17,013 INFO L226 Difference]: Without dead ends: 116 [2019-10-02 14:42:17,014 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=369, Invalid=753, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 14:42:17,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-10-02 14:42:17,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2019-10-02 14:42:17,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-10-02 14:42:17,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 127 transitions. [2019-10-02 14:42:17,022 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 127 transitions. Word has length 173 [2019-10-02 14:42:17,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:17,023 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 127 transitions. [2019-10-02 14:42:17,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-02 14:42:17,023 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 127 transitions. [2019-10-02 14:42:17,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-10-02 14:42:17,026 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:17,026 INFO L411 BasicCegarLoop]: trace histogram [27, 27, 27, 24, 24, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:17,026 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:17,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:17,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1960013183, now seen corresponding path program 25 times [2019-10-02 14:42:17,027 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:17,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:17,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:17,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:17,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:17,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:17,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1789 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 1213 trivial. 0 not checked. [2019-10-02 14:42:17,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:17,457 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:17,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:42:17,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:17,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-02 14:42:17,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:17,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1789 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 1213 trivial. 0 not checked. [2019-10-02 14:42:17,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:17,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-10-02 14:42:17,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-02 14:42:17,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-02 14:42:17,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-10-02 14:42:17,674 INFO L87 Difference]: Start difference. First operand 114 states and 127 transitions. Second operand 28 states. [2019-10-02 14:42:17,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:17,771 INFO L93 Difference]: Finished difference Result 176 states and 202 transitions. [2019-10-02 14:42:17,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-02 14:42:17,771 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 177 [2019-10-02 14:42:17,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:17,772 INFO L225 Difference]: With dead ends: 176 [2019-10-02 14:42:17,772 INFO L226 Difference]: Without dead ends: 117 [2019-10-02 14:42:17,774 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-10-02 14:42:17,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-10-02 14:42:17,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2019-10-02 14:42:17,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-10-02 14:42:17,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 129 transitions. [2019-10-02 14:42:17,779 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 129 transitions. Word has length 177 [2019-10-02 14:42:17,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:17,779 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 129 transitions. [2019-10-02 14:42:17,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-02 14:42:17,779 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 129 transitions. [2019-10-02 14:42:17,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-02 14:42:17,780 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:17,780 INFO L411 BasicCegarLoop]: trace histogram [27, 27, 27, 25, 25, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:17,780 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:17,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:17,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1803654627, now seen corresponding path program 26 times [2019-10-02 14:42:17,781 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:17,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:17,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:17,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:42:17,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:17,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:18,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1838 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 1213 trivial. 0 not checked. [2019-10-02 14:42:18,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:18,297 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:18,339 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:42:18,427 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:42:18,427 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:18,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-02 14:42:18,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:18,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1838 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 1213 trivial. 0 not checked. [2019-10-02 14:42:18,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:18,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-10-02 14:42:18,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-02 14:42:18,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-02 14:42:18,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-02 14:42:18,478 INFO L87 Difference]: Start difference. First operand 116 states and 129 transitions. Second operand 29 states. [2019-10-02 14:42:18,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:18,573 INFO L93 Difference]: Finished difference Result 178 states and 204 transitions. [2019-10-02 14:42:18,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-02 14:42:18,574 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 179 [2019-10-02 14:42:18,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:18,575 INFO L225 Difference]: With dead ends: 178 [2019-10-02 14:42:18,575 INFO L226 Difference]: Without dead ends: 119 [2019-10-02 14:42:18,576 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-02 14:42:18,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-10-02 14:42:18,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2019-10-02 14:42:18,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-10-02 14:42:18,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 131 transitions. [2019-10-02 14:42:18,581 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 131 transitions. Word has length 179 [2019-10-02 14:42:18,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:18,582 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 131 transitions. [2019-10-02 14:42:18,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-02 14:42:18,582 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 131 transitions. [2019-10-02 14:42:18,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-02 14:42:18,584 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:18,584 INFO L411 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:18,584 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:18,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:18,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1969010491, now seen corresponding path program 27 times [2019-10-02 14:42:18,585 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:18,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:18,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:18,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:18,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:18,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:19,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1889 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 1213 trivial. 0 not checked. [2019-10-02 14:42:19,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:19,122 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:19,161 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:42:19,412 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-10-02 14:42:19,413 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:19,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-02 14:42:19,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:19,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1889 backedges. 532 proven. 64 refuted. 0 times theorem prover too weak. 1293 trivial. 0 not checked. [2019-10-02 14:42:19,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:19,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 11] total 38 [2019-10-02 14:42:19,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-02 14:42:19,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-02 14:42:19,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=460, Invalid=946, Unknown=0, NotChecked=0, Total=1406 [2019-10-02 14:42:19,613 INFO L87 Difference]: Start difference. First operand 118 states and 131 transitions. Second operand 38 states. [2019-10-02 14:42:19,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:19,759 INFO L93 Difference]: Finished difference Result 183 states and 210 transitions. [2019-10-02 14:42:19,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-02 14:42:19,759 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 181 [2019-10-02 14:42:19,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:19,760 INFO L225 Difference]: With dead ends: 183 [2019-10-02 14:42:19,761 INFO L226 Difference]: Without dead ends: 124 [2019-10-02 14:42:19,762 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=460, Invalid=946, Unknown=0, NotChecked=0, Total=1406 [2019-10-02 14:42:19,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-10-02 14:42:19,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2019-10-02 14:42:19,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-10-02 14:42:19,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 135 transitions. [2019-10-02 14:42:19,766 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 135 transitions. Word has length 181 [2019-10-02 14:42:19,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:19,767 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 135 transitions. [2019-10-02 14:42:19,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-02 14:42:19,767 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 135 transitions. [2019-10-02 14:42:19,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-10-02 14:42:19,768 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:19,768 INFO L411 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:19,769 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:19,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:19,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1362363483, now seen corresponding path program 28 times [2019-10-02 14:42:19,769 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:19,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:19,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:19,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:19,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:19,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:20,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1959 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 1230 trivial. 0 not checked. [2019-10-02 14:42:20,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:20,251 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:20,288 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:42:20,377 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:42:20,377 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:20,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-02 14:42:20,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:20,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1959 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 1230 trivial. 0 not checked. [2019-10-02 14:42:20,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:20,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-10-02 14:42:20,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-02 14:42:20,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-02 14:42:20,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-02 14:42:20,428 INFO L87 Difference]: Start difference. First operand 122 states and 135 transitions. Second operand 31 states. [2019-10-02 14:42:20,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:20,531 INFO L93 Difference]: Finished difference Result 186 states and 212 transitions. [2019-10-02 14:42:20,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-02 14:42:20,532 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 185 [2019-10-02 14:42:20,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:20,533 INFO L225 Difference]: With dead ends: 186 [2019-10-02 14:42:20,533 INFO L226 Difference]: Without dead ends: 125 [2019-10-02 14:42:20,534 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-02 14:42:20,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-10-02 14:42:20,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2019-10-02 14:42:20,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-10-02 14:42:20,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 137 transitions. [2019-10-02 14:42:20,539 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 137 transitions. Word has length 185 [2019-10-02 14:42:20,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:20,539 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 137 transitions. [2019-10-02 14:42:20,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-02 14:42:20,540 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 137 transitions. [2019-10-02 14:42:20,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-02 14:42:20,541 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:20,541 INFO L411 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 27, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:20,541 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:20,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:20,542 INFO L82 PathProgramCache]: Analyzing trace with hash 106922745, now seen corresponding path program 29 times [2019-10-02 14:42:20,542 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:20,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:20,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:20,543 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:20,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:20,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:21,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2014 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 1230 trivial. 0 not checked. [2019-10-02 14:42:21,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:21,034 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:21,075 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:42:30,796 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 28 check-sat command(s) [2019-10-02 14:42:30,797 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:30,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-02 14:42:30,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:31,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2014 backedges. 526 proven. 117 refuted. 0 times theorem prover too weak. 1371 trivial. 0 not checked. [2019-10-02 14:42:31,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:31,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 12] total 41 [2019-10-02 14:42:31,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-02 14:42:31,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-02 14:42:31,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=530, Invalid=1110, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 14:42:31,083 INFO L87 Difference]: Start difference. First operand 124 states and 137 transitions. Second operand 41 states. [2019-10-02 14:42:31,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:31,236 INFO L93 Difference]: Finished difference Result 193 states and 225 transitions. [2019-10-02 14:42:31,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-02 14:42:31,236 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 187 [2019-10-02 14:42:31,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:31,237 INFO L225 Difference]: With dead ends: 193 [2019-10-02 14:42:31,238 INFO L226 Difference]: Without dead ends: 132 [2019-10-02 14:42:31,239 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=530, Invalid=1110, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 14:42:31,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-10-02 14:42:31,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 129. [2019-10-02 14:42:31,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-10-02 14:42:31,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 143 transitions. [2019-10-02 14:42:31,244 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 143 transitions. Word has length 187 [2019-10-02 14:42:31,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:31,244 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 143 transitions. [2019-10-02 14:42:31,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-02 14:42:31,245 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 143 transitions. [2019-10-02 14:42:31,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-10-02 14:42:31,246 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:31,246 INFO L411 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 29, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:31,246 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:31,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:31,247 INFO L82 PathProgramCache]: Analyzing trace with hash 451284766, now seen corresponding path program 30 times [2019-10-02 14:42:31,247 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:31,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:31,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:31,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:31,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:31,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:31,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2332 backedges. 648 proven. 145 refuted. 0 times theorem prover too weak. 1539 trivial. 0 not checked. [2019-10-02 14:42:31,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:31,513 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:31,558 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 14:42:36,696 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2019-10-02 14:42:36,696 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:36,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-02 14:42:36,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:36,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2332 backedges. 650 proven. 81 refuted. 0 times theorem prover too weak. 1601 trivial. 0 not checked. [2019-10-02 14:42:36,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:36,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2019-10-02 14:42:36,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 14:42:36,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 14:42:36,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2019-10-02 14:42:36,848 INFO L87 Difference]: Start difference. First operand 129 states and 143 transitions. Second operand 23 states. [2019-10-02 14:42:36,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:36,933 INFO L93 Difference]: Finished difference Result 200 states and 233 transitions. [2019-10-02 14:42:36,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-02 14:42:36,933 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 198 [2019-10-02 14:42:36,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:36,935 INFO L225 Difference]: With dead ends: 200 [2019-10-02 14:42:36,935 INFO L226 Difference]: Without dead ends: 137 [2019-10-02 14:42:36,936 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2019-10-02 14:42:36,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-10-02 14:42:36,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2019-10-02 14:42:36,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-10-02 14:42:36,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 149 transitions. [2019-10-02 14:42:36,940 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 149 transitions. Word has length 198 [2019-10-02 14:42:36,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:36,941 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 149 transitions. [2019-10-02 14:42:36,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 14:42:36,941 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 149 transitions. [2019-10-02 14:42:36,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-02 14:42:36,942 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:36,943 INFO L411 BasicCegarLoop]: trace histogram [33, 33, 33, 29, 29, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:36,943 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:36,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:36,943 INFO L82 PathProgramCache]: Analyzing trace with hash 358550649, now seen corresponding path program 31 times [2019-10-02 14:42:36,943 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:36,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:36,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:36,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:36,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:37,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:37,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2639 backedges. 0 proven. 954 refuted. 0 times theorem prover too weak. 1685 trivial. 0 not checked. [2019-10-02 14:42:37,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:37,196 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:37,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:42:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:37,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-02 14:42:37,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:37,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2639 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 1798 trivial. 0 not checked. [2019-10-02 14:42:37,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:37,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 32] total 44 [2019-10-02 14:42:37,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-10-02 14:42:37,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-10-02 14:42:37,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=586, Invalid=1306, Unknown=0, NotChecked=0, Total=1892 [2019-10-02 14:42:37,904 INFO L87 Difference]: Start difference. First operand 134 states and 149 transitions. Second operand 44 states. [2019-10-02 14:42:38,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:38,101 INFO L93 Difference]: Finished difference Result 211 states and 247 transitions. [2019-10-02 14:42:38,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-02 14:42:38,101 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 209 [2019-10-02 14:42:38,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:38,103 INFO L225 Difference]: With dead ends: 211 [2019-10-02 14:42:38,103 INFO L226 Difference]: Without dead ends: 142 [2019-10-02 14:42:38,104 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=586, Invalid=1306, Unknown=0, NotChecked=0, Total=1892 [2019-10-02 14:42:38,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-10-02 14:42:38,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 139. [2019-10-02 14:42:38,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-10-02 14:42:38,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 155 transitions. [2019-10-02 14:42:38,111 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 155 transitions. Word has length 209 [2019-10-02 14:42:38,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:38,111 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 155 transitions. [2019-10-02 14:42:38,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-10-02 14:42:38,111 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 155 transitions. [2019-10-02 14:42:38,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-10-02 14:42:38,112 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:38,113 INFO L411 BasicCegarLoop]: trace histogram [36, 36, 36, 30, 30, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:38,113 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:38,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:38,113 INFO L82 PathProgramCache]: Analyzing trace with hash -925593826, now seen corresponding path program 32 times [2019-10-02 14:42:38,113 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:38,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:38,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:38,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:42:38,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:38,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:38,707 INFO L134 CoverageAnalysis]: Checked inductivity of 3013 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 2113 trivial. 0 not checked. [2019-10-02 14:42:38,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:38,708 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:38,758 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:42:38,859 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:42:38,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:38,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-02 14:42:38,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:38,917 INFO L134 CoverageAnalysis]: Checked inductivity of 3013 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 2113 trivial. 0 not checked. [2019-10-02 14:42:38,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:38,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-10-02 14:42:38,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-02 14:42:38,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-02 14:42:38,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 14:42:38,922 INFO L87 Difference]: Start difference. First operand 139 states and 155 transitions. Second operand 34 states. [2019-10-02 14:42:39,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:39,028 INFO L93 Difference]: Finished difference Result 214 states and 246 transitions. [2019-10-02 14:42:39,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-02 14:42:39,029 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 220 [2019-10-02 14:42:39,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:39,030 INFO L225 Difference]: With dead ends: 214 [2019-10-02 14:42:39,030 INFO L226 Difference]: Without dead ends: 142 [2019-10-02 14:42:39,031 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 14:42:39,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-10-02 14:42:39,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2019-10-02 14:42:39,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-10-02 14:42:39,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 157 transitions. [2019-10-02 14:42:39,036 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 157 transitions. Word has length 220 [2019-10-02 14:42:39,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:39,037 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 157 transitions. [2019-10-02 14:42:39,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-02 14:42:39,037 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 157 transitions. [2019-10-02 14:42:39,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-10-02 14:42:39,038 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:39,038 INFO L411 BasicCegarLoop]: trace histogram [36, 36, 36, 31, 31, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:39,039 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:39,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:39,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1217207232, now seen corresponding path program 33 times [2019-10-02 14:42:39,039 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:39,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:39,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:39,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:39,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:39,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:39,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3074 backedges. 460 proven. 670 refuted. 0 times theorem prover too weak. 1944 trivial. 0 not checked. [2019-10-02 14:42:39,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:39,318 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:39,372 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:42:39,924 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-10-02 14:42:39,924 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:39,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-02 14:42:39,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:40,087 INFO L134 CoverageAnalysis]: Checked inductivity of 3074 backedges. 922 proven. 100 refuted. 0 times theorem prover too weak. 2052 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (35)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:42:40,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:40,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 26 [2019-10-02 14:42:40,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 14:42:40,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 14:42:40,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2019-10-02 14:42:40,093 INFO L87 Difference]: Start difference. First operand 141 states and 157 transitions. Second operand 26 states. [2019-10-02 14:42:40,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:40,208 INFO L93 Difference]: Finished difference Result 220 states and 257 transitions. [2019-10-02 14:42:40,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 14:42:40,208 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 222 [2019-10-02 14:42:40,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:40,210 INFO L225 Difference]: With dead ends: 220 [2019-10-02 14:42:40,210 INFO L226 Difference]: Without dead ends: 149 [2019-10-02 14:42:40,210 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2019-10-02 14:42:40,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-10-02 14:42:40,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2019-10-02 14:42:40,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-10-02 14:42:40,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 163 transitions. [2019-10-02 14:42:40,216 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 163 transitions. Word has length 222 [2019-10-02 14:42:40,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:40,218 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 163 transitions. [2019-10-02 14:42:40,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 14:42:40,218 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 163 transitions. [2019-10-02 14:42:40,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-10-02 14:42:40,219 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:40,220 INFO L411 BasicCegarLoop]: trace histogram [39, 39, 39, 31, 31, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:40,220 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:40,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:40,220 INFO L82 PathProgramCache]: Analyzing trace with hash 380561175, now seen corresponding path program 34 times [2019-10-02 14:42:40,220 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:40,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:40,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:40,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:40,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:40,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:40,490 INFO L134 CoverageAnalysis]: Checked inductivity of 3437 backedges. 537 proven. 784 refuted. 0 times theorem prover too weak. 2116 trivial. 0 not checked. [2019-10-02 14:42:40,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:40,490 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:40,535 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:42:40,662 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:42:40,662 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:40,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-02 14:42:40,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:41,319 INFO L134 CoverageAnalysis]: Checked inductivity of 3437 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 2476 trivial. 0 not checked. [2019-10-02 14:42:41,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:42:41,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 34] total 48 [2019-10-02 14:42:41,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-02 14:42:41,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-02 14:42:41,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=680, Invalid=1576, Unknown=0, NotChecked=0, Total=2256 [2019-10-02 14:42:41,325 INFO L87 Difference]: Start difference. First operand 146 states and 163 transitions. Second operand 48 states. [2019-10-02 14:42:41,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:41,516 INFO L93 Difference]: Finished difference Result 231 states and 271 transitions. [2019-10-02 14:42:41,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-02 14:42:41,516 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 233 [2019-10-02 14:42:41,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:41,518 INFO L225 Difference]: With dead ends: 231 [2019-10-02 14:42:41,518 INFO L226 Difference]: Without dead ends: 154 [2019-10-02 14:42:41,519 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=680, Invalid=1576, Unknown=0, NotChecked=0, Total=2256 [2019-10-02 14:42:41,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-10-02 14:42:41,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2019-10-02 14:42:41,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-10-02 14:42:41,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 169 transitions. [2019-10-02 14:42:41,525 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 169 transitions. Word has length 233 [2019-10-02 14:42:41,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:41,525 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 169 transitions. [2019-10-02 14:42:41,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-02 14:42:41,525 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 169 transitions. [2019-10-02 14:42:41,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-10-02 14:42:41,526 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:41,527 INFO L411 BasicCegarLoop]: trace histogram [42, 42, 42, 32, 32, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:41,527 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:41,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:41,527 INFO L82 PathProgramCache]: Analyzing trace with hash -175071424, now seen corresponding path program 35 times [2019-10-02 14:42:41,527 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:41,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:41,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:41,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:42:41,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:41,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:42,207 INFO L134 CoverageAnalysis]: Checked inductivity of 3869 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 2845 trivial. 0 not checked. [2019-10-02 14:42:42,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:42,208 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:42,252 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:43:17,732 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2019-10-02 14:43:17,733 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:43:17,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-02 14:43:17,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:43:18,252 INFO L134 CoverageAnalysis]: Checked inductivity of 3869 backedges. 1236 proven. 287 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-10-02 14:43:18,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:43:18,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 17] total 50 [2019-10-02 14:43:18,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-10-02 14:43:18,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-10-02 14:43:18,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=730, Invalid=1720, Unknown=0, NotChecked=0, Total=2450 [2019-10-02 14:43:18,276 INFO L87 Difference]: Start difference. First operand 151 states and 169 transitions. Second operand 50 states. [2019-10-02 14:43:18,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:43:18,491 INFO L93 Difference]: Finished difference Result 239 states and 281 transitions. [2019-10-02 14:43:18,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-10-02 14:43:18,491 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 244 [2019-10-02 14:43:18,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:43:18,493 INFO L225 Difference]: With dead ends: 239 [2019-10-02 14:43:18,493 INFO L226 Difference]: Without dead ends: 159 [2019-10-02 14:43:18,494 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=730, Invalid=1720, Unknown=0, NotChecked=0, Total=2450 [2019-10-02 14:43:18,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-10-02 14:43:18,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2019-10-02 14:43:18,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-10-02 14:43:18,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 175 transitions. [2019-10-02 14:43:18,500 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 175 transitions. Word has length 244 [2019-10-02 14:43:18,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:43:18,501 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 175 transitions. [2019-10-02 14:43:18,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-10-02 14:43:18,501 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 175 transitions. [2019-10-02 14:43:18,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-10-02 14:43:18,504 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:43:18,504 INFO L411 BasicCegarLoop]: trace histogram [45, 45, 45, 33, 33, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:43:18,504 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:43:18,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:43:18,505 INFO L82 PathProgramCache]: Analyzing trace with hash -2135521357, now seen corresponding path program 36 times [2019-10-02 14:43:18,505 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:43:18,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:43:18,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:43:18,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:43:18,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:43:18,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:43:19,304 INFO L134 CoverageAnalysis]: Checked inductivity of 4330 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 3241 trivial. 0 not checked. [2019-10-02 14:43:19,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:43:19,305 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:43:19,355 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 14:43:23,963 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-10-02 14:43:23,963 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:43:23,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-02 14:43:23,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:43:24,209 INFO L134 CoverageAnalysis]: Checked inductivity of 4330 backedges. 1420 proven. 121 refuted. 0 times theorem prover too weak. 2789 trivial. 0 not checked. [2019-10-02 14:43:24,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:43:24,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 14] total 48 [2019-10-02 14:43:24,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-02 14:43:24,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-02 14:43:24,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=720, Invalid=1536, Unknown=0, NotChecked=0, Total=2256 [2019-10-02 14:43:24,218 INFO L87 Difference]: Start difference. First operand 156 states and 175 transitions. Second operand 48 states. [2019-10-02 14:43:24,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:43:24,430 INFO L93 Difference]: Finished difference Result 245 states and 284 transitions. [2019-10-02 14:43:24,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-02 14:43:24,430 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 255 [2019-10-02 14:43:24,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:43:24,431 INFO L225 Difference]: With dead ends: 245 [2019-10-02 14:43:24,432 INFO L226 Difference]: Without dead ends: 162 [2019-10-02 14:43:24,433 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=720, Invalid=1536, Unknown=0, NotChecked=0, Total=2256 [2019-10-02 14:43:24,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-10-02 14:43:24,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2019-10-02 14:43:24,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-10-02 14:43:24,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 179 transitions. [2019-10-02 14:43:24,438 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 179 transitions. Word has length 255 [2019-10-02 14:43:24,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:43:24,438 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 179 transitions. [2019-10-02 14:43:24,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-02 14:43:24,439 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 179 transitions. [2019-10-02 14:43:24,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-10-02 14:43:24,440 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:43:24,440 INFO L411 BasicCegarLoop]: trace histogram [45, 45, 45, 34, 34, 12, 12, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:43:24,441 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:43:24,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:43:24,441 INFO L82 PathProgramCache]: Analyzing trace with hash -821476141, now seen corresponding path program 37 times [2019-10-02 14:43:24,441 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:43:24,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:43:24,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:43:24,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:43:24,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:43:24,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:43:25,235 INFO L134 CoverageAnalysis]: Checked inductivity of 4420 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 3264 trivial. 0 not checked. [2019-10-02 14:43:25,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:43:25,235 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:43:25,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:43:25,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:43:25,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 778 conjuncts, 36 conjunts are in the unsatisfiable core [2019-10-02 14:43:25,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:43:25,450 INFO L134 CoverageAnalysis]: Checked inductivity of 4420 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 3264 trivial. 0 not checked. [2019-10-02 14:43:25,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:43:25,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-10-02 14:43:25,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-02 14:43:25,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-02 14:43:25,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-10-02 14:43:25,456 INFO L87 Difference]: Start difference. First operand 160 states and 179 transitions. Second operand 38 states. [2019-10-02 14:43:25,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:43:25,575 INFO L93 Difference]: Finished difference Result 248 states and 286 transitions. [2019-10-02 14:43:25,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-02 14:43:25,576 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 259 [2019-10-02 14:43:25,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:43:25,578 INFO L225 Difference]: With dead ends: 248 [2019-10-02 14:43:25,578 INFO L226 Difference]: Without dead ends: 163 [2019-10-02 14:43:25,579 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-10-02 14:43:25,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-10-02 14:43:25,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2019-10-02 14:43:25,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-10-02 14:43:25,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 181 transitions. [2019-10-02 14:43:25,585 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 181 transitions. Word has length 259 [2019-10-02 14:43:25,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:43:25,585 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 181 transitions. [2019-10-02 14:43:25,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-02 14:43:25,585 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 181 transitions. [2019-10-02 14:43:25,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-10-02 14:43:25,586 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:43:25,587 INFO L411 BasicCegarLoop]: trace histogram [45, 45, 45, 35, 35, 12, 12, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:43:25,587 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:43:25,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:43:25,587 INFO L82 PathProgramCache]: Analyzing trace with hash 285058545, now seen corresponding path program 38 times [2019-10-02 14:43:25,587 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:43:25,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:43:25,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:43:25,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:43:25,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:43:25,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:43:26,335 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 3264 trivial. 0 not checked. [2019-10-02 14:43:26,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:43:26,335 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:43:26,390 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:43:26,512 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:43:26,513 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:43:26,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 784 conjuncts, 37 conjunts are in the unsatisfiable core [2019-10-02 14:43:26,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:43:26,591 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 3264 trivial. 0 not checked. [2019-10-02 14:43:26,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:43:26,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2019-10-02 14:43:26,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-02 14:43:26,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-02 14:43:26,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-10-02 14:43:26,598 INFO L87 Difference]: Start difference. First operand 162 states and 181 transitions. Second operand 39 states. [2019-10-02 14:43:26,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:43:26,733 INFO L93 Difference]: Finished difference Result 250 states and 288 transitions. [2019-10-02 14:43:26,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-02 14:43:26,734 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 261 [2019-10-02 14:43:26,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:43:26,735 INFO L225 Difference]: With dead ends: 250 [2019-10-02 14:43:26,735 INFO L226 Difference]: Without dead ends: 165 [2019-10-02 14:43:26,736 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-10-02 14:43:26,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-10-02 14:43:26,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2019-10-02 14:43:26,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-10-02 14:43:26,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 183 transitions. [2019-10-02 14:43:26,741 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 183 transitions. Word has length 261 [2019-10-02 14:43:26,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:43:26,742 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 183 transitions. [2019-10-02 14:43:26,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-02 14:43:26,742 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 183 transitions. [2019-10-02 14:43:26,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-10-02 14:43:26,743 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:43:26,744 INFO L411 BasicCegarLoop]: trace histogram [45, 45, 45, 36, 36, 12, 12, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:43:26,744 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:43:26,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:43:26,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1486997617, now seen corresponding path program 39 times [2019-10-02 14:43:26,745 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:43:26,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:43:26,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:43:26,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:43:26,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:43:26,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:43:27,586 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 3264 trivial. 0 not checked. [2019-10-02 14:43:27,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:43:27,587 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:43:27,643 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:43:28,400 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-10-02 14:43:28,400 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:43:28,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-02 14:43:28,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:43:28,798 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 1420 proven. 144 refuted. 0 times theorem prover too weak. 2996 trivial. 0 not checked. [2019-10-02 14:43:28,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:43:28,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 15] total 52 [2019-10-02 14:43:28,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-10-02 14:43:28,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-10-02 14:43:28,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=845, Invalid=1807, Unknown=0, NotChecked=0, Total=2652 [2019-10-02 14:43:28,806 INFO L87 Difference]: Start difference. First operand 164 states and 183 transitions. Second operand 52 states. [2019-10-02 14:43:29,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:43:29,094 INFO L93 Difference]: Finished difference Result 255 states and 294 transitions. [2019-10-02 14:43:29,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-10-02 14:43:29,095 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 263 [2019-10-02 14:43:29,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:43:29,097 INFO L225 Difference]: With dead ends: 255 [2019-10-02 14:43:29,097 INFO L226 Difference]: Without dead ends: 170 [2019-10-02 14:43:29,098 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=845, Invalid=1807, Unknown=0, NotChecked=0, Total=2652 [2019-10-02 14:43:29,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-10-02 14:43:29,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2019-10-02 14:43:29,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-10-02 14:43:29,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 187 transitions. [2019-10-02 14:43:29,115 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 187 transitions. Word has length 263 [2019-10-02 14:43:29,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:43:29,116 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 187 transitions. [2019-10-02 14:43:29,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-10-02 14:43:29,116 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 187 transitions. [2019-10-02 14:43:29,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-10-02 14:43:29,118 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:43:29,118 INFO L411 BasicCegarLoop]: trace histogram [45, 45, 45, 37, 37, 13, 13, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:43:29,118 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:43:29,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:43:29,118 INFO L82 PathProgramCache]: Analyzing trace with hash 498134959, now seen corresponding path program 40 times [2019-10-02 14:43:29,119 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:43:29,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:43:29,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:43:29,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:43:29,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:43:29,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:43:29,906 INFO L134 CoverageAnalysis]: Checked inductivity of 4658 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 3289 trivial. 0 not checked. [2019-10-02 14:43:29,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:43:29,906 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:43:29,963 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:43:30,106 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:43:30,107 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:43:30,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 800 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-02 14:43:30,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:43:30,493 INFO L134 CoverageAnalysis]: Checked inductivity of 4658 backedges. 1418 proven. 330 refuted. 0 times theorem prover too weak. 2910 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (42)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:43:30,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:43:30,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 18] total 56 [2019-10-02 14:43:30,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-10-02 14:43:30,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-10-02 14:43:30,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=932, Invalid=2148, Unknown=0, NotChecked=0, Total=3080 [2019-10-02 14:43:30,501 INFO L87 Difference]: Start difference. First operand 168 states and 187 transitions. Second operand 56 states. [2019-10-02 14:43:30,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:43:30,773 INFO L93 Difference]: Finished difference Result 263 states and 307 transitions. [2019-10-02 14:43:30,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-10-02 14:43:30,775 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 267 [2019-10-02 14:43:30,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:43:30,777 INFO L225 Difference]: With dead ends: 263 [2019-10-02 14:43:30,777 INFO L226 Difference]: Without dead ends: 176 [2019-10-02 14:43:30,779 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 592 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=932, Invalid=2148, Unknown=0, NotChecked=0, Total=3080 [2019-10-02 14:43:30,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-10-02 14:43:30,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 173. [2019-10-02 14:43:30,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-10-02 14:43:30,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 193 transitions. [2019-10-02 14:43:30,784 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 193 transitions. Word has length 267 [2019-10-02 14:43:30,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:43:30,784 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 193 transitions. [2019-10-02 14:43:30,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-10-02 14:43:30,784 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 193 transitions. [2019-10-02 14:43:30,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-10-02 14:43:30,786 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:43:30,786 INFO L411 BasicCegarLoop]: trace histogram [48, 48, 48, 38, 38, 13, 13, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:43:30,786 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:43:30,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:43:30,787 INFO L82 PathProgramCache]: Analyzing trace with hash -2124766680, now seen corresponding path program 41 times [2019-10-02 14:43:30,787 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:43:30,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:43:30,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:43:30,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:43:30,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:43:30,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:43:31,778 INFO L134 CoverageAnalysis]: Checked inductivity of 5156 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 3712 trivial. 0 not checked. [2019-10-02 14:43:31,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:43:31,779 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:43:31,866 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:44:24,816 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 38 check-sat command(s) [2019-10-02 14:44:24,816 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:44:24,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-02 14:44:24,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:44:25,255 INFO L134 CoverageAnalysis]: Checked inductivity of 5156 backedges. 1604 proven. 376 refuted. 0 times theorem prover too weak. 3176 trivial. 0 not checked. [2019-10-02 14:44:25,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:44:25,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 19] total 58 [2019-10-02 14:44:25,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-10-02 14:44:25,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-10-02 14:44:25,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=2316, Unknown=0, NotChecked=0, Total=3306 [2019-10-02 14:44:25,272 INFO L87 Difference]: Start difference. First operand 173 states and 193 transitions. Second operand 58 states. [2019-10-02 14:44:25,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:44:25,573 INFO L93 Difference]: Finished difference Result 271 states and 317 transitions. [2019-10-02 14:44:25,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-10-02 14:44:25,576 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 278 [2019-10-02 14:44:25,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:44:25,577 INFO L225 Difference]: With dead ends: 271 [2019-10-02 14:44:25,577 INFO L226 Difference]: Without dead ends: 181 [2019-10-02 14:44:25,578 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=990, Invalid=2316, Unknown=0, NotChecked=0, Total=3306 [2019-10-02 14:44:25,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-10-02 14:44:25,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 178. [2019-10-02 14:44:25,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-10-02 14:44:25,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 199 transitions. [2019-10-02 14:44:25,583 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 199 transitions. Word has length 278 [2019-10-02 14:44:25,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:44:25,584 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 199 transitions. [2019-10-02 14:44:25,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-10-02 14:44:25,584 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 199 transitions. [2019-10-02 14:44:25,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-10-02 14:44:25,586 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:44:25,586 INFO L411 BasicCegarLoop]: trace histogram [51, 51, 51, 39, 39, 13, 13, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:44:25,586 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:44:25,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:44:25,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1943425355, now seen corresponding path program 42 times [2019-10-02 14:44:25,586 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:44:25,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:44:25,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:44:25,588 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:44:25,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:44:25,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:44:26,480 INFO L134 CoverageAnalysis]: Checked inductivity of 5683 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 4162 trivial. 0 not checked. [2019-10-02 14:44:26,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:44:26,480 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:44:26,543 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 14:44:43,259 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 29 check-sat command(s) [2019-10-02 14:44:43,259 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:44:43,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-02 14:44:43,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:44:43,624 INFO L134 CoverageAnalysis]: Checked inductivity of 5683 backedges. 1812 proven. 169 refuted. 0 times theorem prover too weak. 3702 trivial. 0 not checked. [2019-10-02 14:44:43,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:44:43,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 16] total 56 [2019-10-02 14:44:43,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-10-02 14:44:43,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-10-02 14:44:43,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=980, Invalid=2100, Unknown=0, NotChecked=0, Total=3080 [2019-10-02 14:44:43,635 INFO L87 Difference]: Start difference. First operand 178 states and 199 transitions. Second operand 56 states. [2019-10-02 14:44:43,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:44:43,920 INFO L93 Difference]: Finished difference Result 277 states and 320 transitions. [2019-10-02 14:44:43,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-10-02 14:44:43,921 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 289 [2019-10-02 14:44:43,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:44:43,922 INFO L225 Difference]: With dead ends: 277 [2019-10-02 14:44:43,922 INFO L226 Difference]: Without dead ends: 184 [2019-10-02 14:44:43,923 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=980, Invalid=2100, Unknown=0, NotChecked=0, Total=3080 [2019-10-02 14:44:43,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-10-02 14:44:43,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 182. [2019-10-02 14:44:43,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-10-02 14:44:43,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 203 transitions. [2019-10-02 14:44:43,929 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 203 transitions. Word has length 289 [2019-10-02 14:44:43,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:44:43,929 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 203 transitions. [2019-10-02 14:44:43,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-10-02 14:44:43,929 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 203 transitions. [2019-10-02 14:44:43,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-10-02 14:44:43,931 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:44:43,931 INFO L411 BasicCegarLoop]: trace histogram [51, 51, 51, 40, 40, 14, 14, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:44:43,932 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:44:43,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:44:43,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1998565227, now seen corresponding path program 43 times [2019-10-02 14:44:43,932 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:44:43,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:44:43,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:44:43,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:44:43,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:44:44,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:44:44,718 INFO L134 CoverageAnalysis]: Checked inductivity of 5789 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 4189 trivial. 0 not checked. [2019-10-02 14:44:44,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:44:44,718 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:44:44,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:44:44,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:44:44,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 876 conjuncts, 42 conjunts are in the unsatisfiable core [2019-10-02 14:44:44,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:44:44,988 INFO L134 CoverageAnalysis]: Checked inductivity of 5789 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 4189 trivial. 0 not checked. [2019-10-02 14:44:44,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:44:44,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2019-10-02 14:44:44,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-10-02 14:44:44,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-10-02 14:44:44,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-10-02 14:44:44,994 INFO L87 Difference]: Start difference. First operand 182 states and 203 transitions. Second operand 44 states. [2019-10-02 14:44:45,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:44:45,134 INFO L93 Difference]: Finished difference Result 280 states and 322 transitions. [2019-10-02 14:44:45,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-02 14:44:45,135 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 293 [2019-10-02 14:44:45,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:44:45,136 INFO L225 Difference]: With dead ends: 280 [2019-10-02 14:44:45,136 INFO L226 Difference]: Without dead ends: 185 [2019-10-02 14:44:45,137 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-10-02 14:44:45,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-10-02 14:44:45,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2019-10-02 14:44:45,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-10-02 14:44:45,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 205 transitions. [2019-10-02 14:44:45,142 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 205 transitions. Word has length 293 [2019-10-02 14:44:45,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:44:45,143 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 205 transitions. [2019-10-02 14:44:45,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-10-02 14:44:45,143 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 205 transitions. [2019-10-02 14:44:45,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-10-02 14:44:45,145 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:44:45,145 INFO L411 BasicCegarLoop]: trace histogram [51, 51, 51, 41, 41, 14, 14, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:44:45,145 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:44:45,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:44:45,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1780631817, now seen corresponding path program 44 times [2019-10-02 14:44:45,146 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:44:45,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:44:45,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:44:45,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:44:45,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:44:45,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:44:45,988 INFO L134 CoverageAnalysis]: Checked inductivity of 5870 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 4189 trivial. 0 not checked. [2019-10-02 14:44:45,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:44:45,989 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:44:46,054 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:44:46,203 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:44:46,203 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:44:46,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 882 conjuncts, 43 conjunts are in the unsatisfiable core [2019-10-02 14:44:46,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:44:46,280 INFO L134 CoverageAnalysis]: Checked inductivity of 5870 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 4189 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (46)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:44:46,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:44:46,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 45 [2019-10-02 14:44:46,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-10-02 14:44:46,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-10-02 14:44:46,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-10-02 14:44:46,286 INFO L87 Difference]: Start difference. First operand 184 states and 205 transitions. Second operand 45 states. [2019-10-02 14:44:46,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:44:46,424 INFO L93 Difference]: Finished difference Result 282 states and 324 transitions. [2019-10-02 14:44:46,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-02 14:44:46,425 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 295 [2019-10-02 14:44:46,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:44:46,426 INFO L225 Difference]: With dead ends: 282 [2019-10-02 14:44:46,426 INFO L226 Difference]: Without dead ends: 187 [2019-10-02 14:44:46,427 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-10-02 14:44:46,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-10-02 14:44:46,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2019-10-02 14:44:46,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-10-02 14:44:46,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 207 transitions. [2019-10-02 14:44:46,432 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 207 transitions. Word has length 295 [2019-10-02 14:44:46,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:44:46,433 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 207 transitions. [2019-10-02 14:44:46,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-10-02 14:44:46,433 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 207 transitions. [2019-10-02 14:44:46,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-10-02 14:44:46,435 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:44:46,435 INFO L411 BasicCegarLoop]: trace histogram [51, 51, 51, 42, 42, 14, 14, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:44:46,435 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:44:46,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:44:46,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1494944985, now seen corresponding path program 45 times [2019-10-02 14:44:46,436 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:44:46,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:44:46,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:44:46,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:44:46,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:44:46,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:44:47,287 INFO L134 CoverageAnalysis]: Checked inductivity of 5953 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 4189 trivial. 0 not checked. [2019-10-02 14:44:47,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:44:47,288 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:44:47,356 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:44:49,433 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-10-02 14:44:49,434 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:44:49,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-02 14:44:49,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:44:49,809 INFO L134 CoverageAnalysis]: Checked inductivity of 5953 backedges. 1812 proven. 196 refuted. 0 times theorem prover too weak. 3945 trivial. 0 not checked. [2019-10-02 14:44:49,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:44:49,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 17] total 60 [2019-10-02 14:44:49,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-10-02 14:44:49,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-10-02 14:44:49,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1125, Invalid=2415, Unknown=0, NotChecked=0, Total=3540 [2019-10-02 14:44:49,817 INFO L87 Difference]: Start difference. First operand 186 states and 207 transitions. Second operand 60 states. [2019-10-02 14:44:50,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:44:50,129 INFO L93 Difference]: Finished difference Result 287 states and 330 transitions. [2019-10-02 14:44:50,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-10-02 14:44:50,130 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 297 [2019-10-02 14:44:50,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:44:50,131 INFO L225 Difference]: With dead ends: 287 [2019-10-02 14:44:50,132 INFO L226 Difference]: Without dead ends: 192 [2019-10-02 14:44:50,133 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1125, Invalid=2415, Unknown=0, NotChecked=0, Total=3540 [2019-10-02 14:44:50,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-10-02 14:44:50,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 190. [2019-10-02 14:44:50,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-10-02 14:44:50,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 211 transitions. [2019-10-02 14:44:50,138 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 211 transitions. Word has length 297 [2019-10-02 14:44:50,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:44:50,139 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 211 transitions. [2019-10-02 14:44:50,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-10-02 14:44:50,139 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 211 transitions. [2019-10-02 14:44:50,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-10-02 14:44:50,141 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:44:50,141 INFO L411 BasicCegarLoop]: trace histogram [51, 51, 51, 43, 43, 15, 15, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:44:50,141 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:44:50,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:44:50,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1701229497, now seen corresponding path program 46 times [2019-10-02 14:44:50,142 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:44:50,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:44:50,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:44:50,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:44:50,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:44:50,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:44:51,491 INFO L134 CoverageAnalysis]: Checked inductivity of 6067 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 4218 trivial. 0 not checked. [2019-10-02 14:44:51,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:44:51,491 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:44:51,563 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:44:51,722 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:44:51,723 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:44:51,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 898 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-02 14:44:51,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:44:52,192 INFO L134 CoverageAnalysis]: Checked inductivity of 6067 backedges. 1810 proven. 425 refuted. 0 times theorem prover too weak. 3832 trivial. 0 not checked. [2019-10-02 14:44:52,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:44:52,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 20] total 64 [2019-10-02 14:44:52,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-10-02 14:44:52,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-10-02 14:44:52,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1224, Invalid=2808, Unknown=0, NotChecked=0, Total=4032 [2019-10-02 14:44:52,197 INFO L87 Difference]: Start difference. First operand 190 states and 211 transitions. Second operand 64 states. [2019-10-02 14:44:52,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:44:52,509 INFO L93 Difference]: Finished difference Result 295 states and 343 transitions. [2019-10-02 14:44:52,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-10-02 14:44:52,514 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 301 [2019-10-02 14:44:52,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:44:52,515 INFO L225 Difference]: With dead ends: 295 [2019-10-02 14:44:52,515 INFO L226 Difference]: Without dead ends: 198 [2019-10-02 14:44:52,516 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 774 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1224, Invalid=2808, Unknown=0, NotChecked=0, Total=4032 [2019-10-02 14:44:52,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-10-02 14:44:52,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 195. [2019-10-02 14:44:52,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-10-02 14:44:52,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 217 transitions. [2019-10-02 14:44:52,522 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 217 transitions. Word has length 301 [2019-10-02 14:44:52,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:44:52,522 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 217 transitions. [2019-10-02 14:44:52,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-10-02 14:44:52,523 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 217 transitions. [2019-10-02 14:44:52,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-10-02 14:44:52,524 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:44:52,525 INFO L411 BasicCegarLoop]: trace histogram [54, 54, 54, 44, 44, 15, 15, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:44:52,525 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:44:52,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:44:52,525 INFO L82 PathProgramCache]: Analyzing trace with hash 451997968, now seen corresponding path program 47 times [2019-10-02 14:44:52,525 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:44:52,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:44:52,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:44:52,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:44:52,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:44:52,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:44:53,483 INFO L134 CoverageAnalysis]: Checked inductivity of 6631 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 4695 trivial. 0 not checked. [2019-10-02 14:44:53,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:44:53,484 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:44:53,559 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:47:08,658 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 44 check-sat command(s) [2019-10-02 14:47:08,659 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:47:08,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 869 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-02 14:47:08,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:47:09,293 INFO L134 CoverageAnalysis]: Checked inductivity of 6631 backedges. 2020 proven. 477 refuted. 0 times theorem prover too weak. 4134 trivial. 0 not checked. [2019-10-02 14:47:09,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:47:09,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 21] total 66 [2019-10-02 14:47:09,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-10-02 14:47:09,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-10-02 14:47:09,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1290, Invalid=3000, Unknown=0, NotChecked=0, Total=4290 [2019-10-02 14:47:09,325 INFO L87 Difference]: Start difference. First operand 195 states and 217 transitions. Second operand 66 states. [2019-10-02 14:47:09,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:47:09,633 INFO L93 Difference]: Finished difference Result 303 states and 353 transitions. [2019-10-02 14:47:09,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-10-02 14:47:09,635 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 312 [2019-10-02 14:47:09,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:47:09,636 INFO L225 Difference]: With dead ends: 303 [2019-10-02 14:47:09,636 INFO L226 Difference]: Without dead ends: 203 [2019-10-02 14:47:09,637 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 836 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1290, Invalid=3000, Unknown=0, NotChecked=0, Total=4290 [2019-10-02 14:47:09,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-10-02 14:47:09,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 200. [2019-10-02 14:47:09,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-10-02 14:47:09,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 223 transitions. [2019-10-02 14:47:09,642 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 223 transitions. Word has length 312 [2019-10-02 14:47:09,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:47:09,643 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 223 transitions. [2019-10-02 14:47:09,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-10-02 14:47:09,643 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 223 transitions. [2019-10-02 14:47:09,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2019-10-02 14:47:09,645 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:47:09,645 INFO L411 BasicCegarLoop]: trace histogram [57, 57, 57, 45, 45, 15, 15, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:47:09,645 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:47:09,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:47:09,645 INFO L82 PathProgramCache]: Analyzing trace with hash 757542627, now seen corresponding path program 48 times [2019-10-02 14:47:09,646 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:47:09,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:47:09,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:47:09,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:47:09,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:47:09,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:47:10,622 INFO L134 CoverageAnalysis]: Checked inductivity of 7224 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 5199 trivial. 0 not checked. [2019-10-02 14:47:10,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:47:10,623 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:47:10,698 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 14:47:38,521 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 33 check-sat command(s) [2019-10-02 14:47:38,522 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:47:38,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 742 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-02 14:47:38,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:47:38,984 INFO L134 CoverageAnalysis]: Checked inductivity of 7224 backedges. 2252 proven. 225 refuted. 0 times theorem prover too weak. 4747 trivial. 0 not checked. [2019-10-02 14:47:38,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:47:38,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 18] total 64 [2019-10-02 14:47:38,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-10-02 14:47:38,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-10-02 14:47:38,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1280, Invalid=2752, Unknown=0, NotChecked=0, Total=4032 [2019-10-02 14:47:38,997 INFO L87 Difference]: Start difference. First operand 200 states and 223 transitions. Second operand 64 states. [2019-10-02 14:47:39,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:47:39,317 INFO L93 Difference]: Finished difference Result 309 states and 356 transitions. [2019-10-02 14:47:39,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-10-02 14:47:39,323 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 323 [2019-10-02 14:47:39,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:47:39,324 INFO L225 Difference]: With dead ends: 309 [2019-10-02 14:47:39,324 INFO L226 Difference]: Without dead ends: 206 [2019-10-02 14:47:39,325 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1280, Invalid=2752, Unknown=0, NotChecked=0, Total=4032 [2019-10-02 14:47:39,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-10-02 14:47:39,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 204. [2019-10-02 14:47:39,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-10-02 14:47:39,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 227 transitions. [2019-10-02 14:47:39,332 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 227 transitions. Word has length 323 [2019-10-02 14:47:39,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:47:39,332 INFO L475 AbstractCegarLoop]: Abstraction has 204 states and 227 transitions. [2019-10-02 14:47:39,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-10-02 14:47:39,332 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 227 transitions. [2019-10-02 14:47:39,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-10-02 14:47:39,334 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:47:39,334 INFO L411 BasicCegarLoop]: trace histogram [57, 57, 57, 46, 46, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:47:39,335 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:47:39,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:47:39,335 INFO L82 PathProgramCache]: Analyzing trace with hash -194564605, now seen corresponding path program 49 times [2019-10-02 14:47:39,335 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:47:39,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:47:39,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:47:39,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:47:39,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:47:39,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:47:40,597 INFO L134 CoverageAnalysis]: Checked inductivity of 7346 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 5230 trivial. 0 not checked. [2019-10-02 14:47:40,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:47:40,598 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:47:40,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:47:40,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:47:40,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 974 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-02 14:47:40,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:47:40,912 INFO L134 CoverageAnalysis]: Checked inductivity of 7346 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 5230 trivial. 0 not checked. [2019-10-02 14:47:40,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:47:40,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 50 [2019-10-02 14:47:40,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-10-02 14:47:40,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-10-02 14:47:40,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-10-02 14:47:40,918 INFO L87 Difference]: Start difference. First operand 204 states and 227 transitions. Second operand 50 states. [2019-10-02 14:47:41,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:47:41,092 INFO L93 Difference]: Finished difference Result 312 states and 358 transitions. [2019-10-02 14:47:41,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-02 14:47:41,093 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 327 [2019-10-02 14:47:41,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:47:41,094 INFO L225 Difference]: With dead ends: 312 [2019-10-02 14:47:41,094 INFO L226 Difference]: Without dead ends: 207 [2019-10-02 14:47:41,095 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-10-02 14:47:41,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-10-02 14:47:41,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 206. [2019-10-02 14:47:41,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-10-02 14:47:41,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 229 transitions. [2019-10-02 14:47:41,100 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 229 transitions. Word has length 327 [2019-10-02 14:47:41,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:47:41,100 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 229 transitions. [2019-10-02 14:47:41,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-10-02 14:47:41,101 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 229 transitions. [2019-10-02 14:47:41,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-10-02 14:47:41,102 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:47:41,103 INFO L411 BasicCegarLoop]: trace histogram [57, 57, 57, 47, 47, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:47:41,103 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:47:41,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:47:41,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1421221855, now seen corresponding path program 50 times [2019-10-02 14:47:41,104 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:47:41,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:47:41,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:47:41,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:47:41,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:47:41,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:47:42,301 INFO L134 CoverageAnalysis]: Checked inductivity of 7439 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 5230 trivial. 0 not checked. [2019-10-02 14:47:42,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:47:42,302 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:47:42,385 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:47:42,550 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:47:42,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:47:42,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 980 conjuncts, 49 conjunts are in the unsatisfiable core [2019-10-02 14:47:42,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:47:42,630 INFO L134 CoverageAnalysis]: Checked inductivity of 7439 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 5230 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (52)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:47:42,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:47:42,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 51 [2019-10-02 14:47:42,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-10-02 14:47:42,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-10-02 14:47:42,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-10-02 14:47:42,637 INFO L87 Difference]: Start difference. First operand 206 states and 229 transitions. Second operand 51 states. [2019-10-02 14:47:42,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:47:42,819 INFO L93 Difference]: Finished difference Result 314 states and 360 transitions. [2019-10-02 14:47:42,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-10-02 14:47:42,820 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 329 [2019-10-02 14:47:42,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:47:42,821 INFO L225 Difference]: With dead ends: 314 [2019-10-02 14:47:42,821 INFO L226 Difference]: Without dead ends: 209 [2019-10-02 14:47:42,821 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-10-02 14:47:42,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-10-02 14:47:42,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 208. [2019-10-02 14:47:42,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-10-02 14:47:42,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 231 transitions. [2019-10-02 14:47:42,827 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 231 transitions. Word has length 329 [2019-10-02 14:47:42,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:47:42,828 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 231 transitions. [2019-10-02 14:47:42,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-10-02 14:47:42,828 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 231 transitions. [2019-10-02 14:47:42,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-10-02 14:47:42,830 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:47:42,830 INFO L411 BasicCegarLoop]: trace histogram [57, 57, 57, 48, 48, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:47:42,830 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:47:42,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:47:42,832 INFO L82 PathProgramCache]: Analyzing trace with hash 877167295, now seen corresponding path program 51 times [2019-10-02 14:47:42,832 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:47:42,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:47:42,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:47:42,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:47:42,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:47:42,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:47:43,929 INFO L134 CoverageAnalysis]: Checked inductivity of 7534 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 5230 trivial. 0 not checked. [2019-10-02 14:47:43,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:47:43,930 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:47:44,011 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:47:45,607 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-10-02 14:47:45,608 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:47:45,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-02 14:47:45,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:47:46,128 INFO L134 CoverageAnalysis]: Checked inductivity of 7534 backedges. 2252 proven. 256 refuted. 0 times theorem prover too weak. 5026 trivial. 0 not checked. [2019-10-02 14:47:46,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:47:46,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 19] total 68 [2019-10-02 14:47:46,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-10-02 14:47:46,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-10-02 14:47:46,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1445, Invalid=3111, Unknown=0, NotChecked=0, Total=4556 [2019-10-02 14:47:46,136 INFO L87 Difference]: Start difference. First operand 208 states and 231 transitions. Second operand 68 states. [2019-10-02 14:47:46,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:47:46,475 INFO L93 Difference]: Finished difference Result 319 states and 366 transitions. [2019-10-02 14:47:46,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-10-02 14:47:46,475 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 331 [2019-10-02 14:47:46,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:47:46,477 INFO L225 Difference]: With dead ends: 319 [2019-10-02 14:47:46,477 INFO L226 Difference]: Without dead ends: 214 [2019-10-02 14:47:46,478 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 816 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1445, Invalid=3111, Unknown=0, NotChecked=0, Total=4556 [2019-10-02 14:47:46,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-10-02 14:47:46,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2019-10-02 14:47:46,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-10-02 14:47:46,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 235 transitions. [2019-10-02 14:47:46,484 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 235 transitions. Word has length 331 [2019-10-02 14:47:46,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:47:46,485 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 235 transitions. [2019-10-02 14:47:46,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-10-02 14:47:46,485 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 235 transitions. [2019-10-02 14:47:46,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-10-02 14:47:46,487 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:47:46,487 INFO L411 BasicCegarLoop]: trace histogram [57, 57, 57, 49, 49, 17, 17, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:47:46,487 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:47:46,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:47:46,488 INFO L82 PathProgramCache]: Analyzing trace with hash -2138145569, now seen corresponding path program 52 times [2019-10-02 14:47:46,488 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:47:46,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:47:46,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:47:46,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:47:46,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:47:46,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:47:47,586 INFO L134 CoverageAnalysis]: Checked inductivity of 7664 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 5263 trivial. 0 not checked. [2019-10-02 14:47:47,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:47:47,586 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:47:47,674 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:47:47,846 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:47:47,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:47:47,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 996 conjuncts, 51 conjunts are in the unsatisfiable core [2019-10-02 14:47:47,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:47:47,980 INFO L134 CoverageAnalysis]: Checked inductivity of 7664 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 5263 trivial. 0 not checked. [2019-10-02 14:47:47,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:47:47,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 53 [2019-10-02 14:47:47,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-10-02 14:47:47,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-10-02 14:47:47,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-10-02 14:47:47,987 INFO L87 Difference]: Start difference. First operand 212 states and 235 transitions. Second operand 53 states. [2019-10-02 14:47:48,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:47:48,171 INFO L93 Difference]: Finished difference Result 322 states and 368 transitions. [2019-10-02 14:47:48,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-10-02 14:47:48,171 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 335 [2019-10-02 14:47:48,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:47:48,172 INFO L225 Difference]: With dead ends: 322 [2019-10-02 14:47:48,172 INFO L226 Difference]: Without dead ends: 215 [2019-10-02 14:47:48,173 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-10-02 14:47:48,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-10-02 14:47:48,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 214. [2019-10-02 14:47:48,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-10-02 14:47:48,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 237 transitions. [2019-10-02 14:47:48,179 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 237 transitions. Word has length 335 [2019-10-02 14:47:48,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:47:48,179 INFO L475 AbstractCegarLoop]: Abstraction has 214 states and 237 transitions. [2019-10-02 14:47:48,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-10-02 14:47:48,179 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 237 transitions. [2019-10-02 14:47:48,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-10-02 14:47:48,181 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:47:48,181 INFO L411 BasicCegarLoop]: trace histogram [57, 57, 57, 50, 50, 17, 17, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:47:48,182 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:47:48,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:47:48,182 INFO L82 PathProgramCache]: Analyzing trace with hash 715403517, now seen corresponding path program 53 times [2019-10-02 14:47:48,182 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:47:48,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:47:48,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:47:48,184 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:47:48,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:47:48,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:47:49,336 INFO L134 CoverageAnalysis]: Checked inductivity of 7763 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 5263 trivial. 0 not checked. [2019-10-02 14:47:49,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:47:49,336 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:47:49,425 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:50:46,682 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 50 check-sat command(s) [2019-10-02 14:50:46,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:50:46,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 940 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-02 14:50:46,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:50:47,308 INFO L134 CoverageAnalysis]: Checked inductivity of 7763 backedges. 2246 proven. 532 refuted. 0 times theorem prover too weak. 4985 trivial. 0 not checked. [2019-10-02 14:50:47,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:50:47,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 22] total 73 [2019-10-02 14:50:47,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-10-02 14:50:47,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-10-02 14:50:47,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1608, Invalid=3648, Unknown=0, NotChecked=0, Total=5256 [2019-10-02 14:50:47,341 INFO L87 Difference]: Start difference. First operand 214 states and 237 transitions. Second operand 73 states. [2019-10-02 14:50:47,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:50:47,624 INFO L93 Difference]: Finished difference Result 329 states and 381 transitions. [2019-10-02 14:50:47,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-10-02 14:50:47,625 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 337 [2019-10-02 14:50:47,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:50:47,626 INFO L225 Difference]: With dead ends: 329 [2019-10-02 14:50:47,626 INFO L226 Difference]: Without dead ends: 222 [2019-10-02 14:50:47,627 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1608, Invalid=3648, Unknown=0, NotChecked=0, Total=5256 [2019-10-02 14:50:47,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-10-02 14:50:47,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 219. [2019-10-02 14:50:47,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-10-02 14:50:47,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 243 transitions. [2019-10-02 14:50:47,634 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 243 transitions. Word has length 337 [2019-10-02 14:50:47,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:50:47,634 INFO L475 AbstractCegarLoop]: Abstraction has 219 states and 243 transitions. [2019-10-02 14:50:47,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-10-02 14:50:47,634 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 243 transitions. [2019-10-02 14:50:47,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-10-02 14:50:47,636 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:50:47,637 INFO L411 BasicCegarLoop]: trace histogram [60, 60, 60, 51, 51, 17, 17, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:50:47,637 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:50:47,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:50:47,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1985464038, now seen corresponding path program 54 times [2019-10-02 14:50:47,637 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:50:47,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:50:47,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:50:47,639 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:50:47,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:50:47,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:50:48,846 INFO L134 CoverageAnalysis]: Checked inductivity of 8395 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 5794 trivial. 0 not checked. [2019-10-02 14:50:48,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:50:48,847 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:50:48,939 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 14:52:20,177 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2019-10-02 14:52:20,177 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:52:20,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-02 14:52:20,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:52:20,719 INFO L134 CoverageAnalysis]: Checked inductivity of 8395 backedges. 2490 proven. 289 refuted. 0 times theorem prover too weak. 5616 trivial. 0 not checked. [2019-10-02 14:52:20,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:52:20,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 20] total 72 [2019-10-02 14:52:20,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-10-02 14:52:20,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-10-02 14:52:20,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1620, Invalid=3492, Unknown=0, NotChecked=0, Total=5112 [2019-10-02 14:52:20,738 INFO L87 Difference]: Start difference. First operand 219 states and 243 transitions. Second operand 72 states. [2019-10-02 14:52:21,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:52:21,098 INFO L93 Difference]: Finished difference Result 335 states and 384 transitions. [2019-10-02 14:52:21,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-10-02 14:52:21,099 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 348 [2019-10-02 14:52:21,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:52:21,100 INFO L225 Difference]: With dead ends: 335 [2019-10-02 14:52:21,101 INFO L226 Difference]: Without dead ends: 225 [2019-10-02 14:52:21,102 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1620, Invalid=3492, Unknown=0, NotChecked=0, Total=5112 [2019-10-02 14:52:21,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-10-02 14:52:21,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 223. [2019-10-02 14:52:21,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-10-02 14:52:21,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 247 transitions. [2019-10-02 14:52:21,109 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 247 transitions. Word has length 348 [2019-10-02 14:52:21,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:52:21,110 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 247 transitions. [2019-10-02 14:52:21,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-10-02 14:52:21,110 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 247 transitions. [2019-10-02 14:52:21,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-10-02 14:52:21,112 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:52:21,113 INFO L411 BasicCegarLoop]: trace histogram [60, 60, 60, 52, 52, 18, 18, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:52:21,113 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:52:21,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:52:21,113 INFO L82 PathProgramCache]: Analyzing trace with hash -334638598, now seen corresponding path program 55 times [2019-10-02 14:52:21,113 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:52:21,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:52:21,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:52:21,115 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:52:21,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:52:21,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:52:22,339 INFO L134 CoverageAnalysis]: Checked inductivity of 8533 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 5829 trivial. 0 not checked. [2019-10-02 14:52:22,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:52:22,340 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:52:22,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:52:22,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:52:22,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 1045 conjuncts, 54 conjunts are in the unsatisfiable core [2019-10-02 14:52:22,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:52:22,739 INFO L134 CoverageAnalysis]: Checked inductivity of 8533 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 5829 trivial. 0 not checked. [2019-10-02 14:52:22,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:52:22,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 56 [2019-10-02 14:52:22,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-10-02 14:52:22,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-10-02 14:52:22,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-10-02 14:52:22,748 INFO L87 Difference]: Start difference. First operand 223 states and 247 transitions. Second operand 56 states. [2019-10-02 14:52:23,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:52:23,032 INFO L93 Difference]: Finished difference Result 338 states and 386 transitions. [2019-10-02 14:52:23,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-10-02 14:52:23,033 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 352 [2019-10-02 14:52:23,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:52:23,035 INFO L225 Difference]: With dead ends: 338 [2019-10-02 14:52:23,035 INFO L226 Difference]: Without dead ends: 226 [2019-10-02 14:52:23,037 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-10-02 14:52:23,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-10-02 14:52:23,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2019-10-02 14:52:23,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-10-02 14:52:23,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 249 transitions. [2019-10-02 14:52:23,045 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 249 transitions. Word has length 352 [2019-10-02 14:52:23,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:52:23,045 INFO L475 AbstractCegarLoop]: Abstraction has 225 states and 249 transitions. [2019-10-02 14:52:23,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-10-02 14:52:23,046 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 249 transitions. [2019-10-02 14:52:23,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2019-10-02 14:52:23,049 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:52:23,050 INFO L411 BasicCegarLoop]: trace histogram [60, 60, 60, 53, 53, 18, 18, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:52:23,050 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:52:23,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:52:23,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1431364196, now seen corresponding path program 56 times [2019-10-02 14:52:23,051 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:52:23,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:52:23,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:52:23,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:52:23,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:52:23,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:52:24,344 INFO L134 CoverageAnalysis]: Checked inductivity of 8638 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 5829 trivial. 0 not checked. [2019-10-02 14:52:24,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:52:24,345 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:52:24,439 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:52:24,617 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:52:24,617 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:52:24,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 1051 conjuncts, 55 conjunts are in the unsatisfiable core [2019-10-02 14:52:24,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:52:24,713 INFO L134 CoverageAnalysis]: Checked inductivity of 8638 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 5829 trivial. 0 not checked. [2019-10-02 14:52:24,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:52:24,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 57 [2019-10-02 14:52:24,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-10-02 14:52:24,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-10-02 14:52:24,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-10-02 14:52:24,719 INFO L87 Difference]: Start difference. First operand 225 states and 249 transitions. Second operand 57 states. [2019-10-02 14:52:24,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:52:24,965 INFO L93 Difference]: Finished difference Result 340 states and 388 transitions. [2019-10-02 14:52:24,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-10-02 14:52:24,965 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 354 [2019-10-02 14:52:24,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:52:24,967 INFO L225 Difference]: With dead ends: 340 [2019-10-02 14:52:24,967 INFO L226 Difference]: Without dead ends: 228 [2019-10-02 14:52:24,968 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-10-02 14:52:24,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-10-02 14:52:24,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 227. [2019-10-02 14:52:24,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-10-02 14:52:24,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 251 transitions. [2019-10-02 14:52:24,975 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 251 transitions. Word has length 354 [2019-10-02 14:52:24,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:52:24,976 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 251 transitions. [2019-10-02 14:52:24,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-10-02 14:52:24,976 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 251 transitions. [2019-10-02 14:52:24,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-10-02 14:52:24,978 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:52:24,979 INFO L411 BasicCegarLoop]: trace histogram [60, 60, 60, 54, 54, 18, 18, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:52:24,979 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:52:24,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:52:24,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1177290942, now seen corresponding path program 57 times [2019-10-02 14:52:24,980 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:52:24,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:52:24,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:52:24,982 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:52:24,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:52:25,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:52:26,331 INFO L134 CoverageAnalysis]: Checked inductivity of 8745 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 5829 trivial. 0 not checked. [2019-10-02 14:52:26,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:52:26,331 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:52:26,430 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:52:29,460 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-10-02 14:52:29,461 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:52:29,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-02 14:52:29,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:52:30,050 INFO L134 CoverageAnalysis]: Checked inductivity of 8745 backedges. 2490 proven. 324 refuted. 0 times theorem prover too weak. 5931 trivial. 0 not checked. [2019-10-02 14:52:30,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:52:30,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 21] total 76 [2019-10-02 14:52:30,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-10-02 14:52:30,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-10-02 14:52:30,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1805, Invalid=3895, Unknown=0, NotChecked=0, Total=5700 [2019-10-02 14:52:30,060 INFO L87 Difference]: Start difference. First operand 227 states and 251 transitions. Second operand 76 states. [2019-10-02 14:52:30,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:52:30,456 INFO L93 Difference]: Finished difference Result 345 states and 394 transitions. [2019-10-02 14:52:30,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-10-02 14:52:30,457 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 356 [2019-10-02 14:52:30,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:52:30,458 INFO L225 Difference]: With dead ends: 345 [2019-10-02 14:52:30,458 INFO L226 Difference]: Without dead ends: 233 [2019-10-02 14:52:30,459 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1026 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1805, Invalid=3895, Unknown=0, NotChecked=0, Total=5700 [2019-10-02 14:52:30,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-10-02 14:52:30,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 231. [2019-10-02 14:52:30,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-10-02 14:52:30,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 255 transitions. [2019-10-02 14:52:30,465 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 255 transitions. Word has length 356 [2019-10-02 14:52:30,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:52:30,465 INFO L475 AbstractCegarLoop]: Abstraction has 231 states and 255 transitions. [2019-10-02 14:52:30,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-10-02 14:52:30,466 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 255 transitions. [2019-10-02 14:52:30,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-10-02 14:52:30,468 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:52:30,468 INFO L411 BasicCegarLoop]: trace histogram [60, 60, 60, 55, 55, 19, 19, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:52:30,468 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:52:30,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:52:30,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1117321570, now seen corresponding path program 58 times [2019-10-02 14:52:30,469 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:52:30,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:52:30,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:52:30,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:52:30,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:52:30,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:52:31,850 INFO L134 CoverageAnalysis]: Checked inductivity of 8891 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 5866 trivial. 0 not checked. [2019-10-02 14:52:31,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:52:31,851 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:52:31,954 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:52:32,157 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:52:32,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:52:32,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 1067 conjuncts, 57 conjunts are in the unsatisfiable core [2019-10-02 14:52:32,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:52:32,228 INFO L134 CoverageAnalysis]: Checked inductivity of 8891 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 5866 trivial. 0 not checked. [2019-10-02 14:52:32,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:52:32,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 59 [2019-10-02 14:52:32,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-10-02 14:52:32,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-10-02 14:52:32,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-10-02 14:52:32,235 INFO L87 Difference]: Start difference. First operand 231 states and 255 transitions. Second operand 59 states. [2019-10-02 14:52:32,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:52:32,435 INFO L93 Difference]: Finished difference Result 348 states and 396 transitions. [2019-10-02 14:52:32,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-10-02 14:52:32,435 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 360 [2019-10-02 14:52:32,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:52:32,436 INFO L225 Difference]: With dead ends: 348 [2019-10-02 14:52:32,436 INFO L226 Difference]: Without dead ends: 234 [2019-10-02 14:52:32,437 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-10-02 14:52:32,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-10-02 14:52:32,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2019-10-02 14:52:32,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-10-02 14:52:32,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 257 transitions. [2019-10-02 14:52:32,443 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 257 transitions. Word has length 360 [2019-10-02 14:52:32,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:52:32,443 INFO L475 AbstractCegarLoop]: Abstraction has 233 states and 257 transitions. [2019-10-02 14:52:32,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-10-02 14:52:32,443 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 257 transitions. [2019-10-02 14:52:32,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2019-10-02 14:52:32,445 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:52:32,446 INFO L411 BasicCegarLoop]: trace histogram [60, 60, 60, 56, 56, 19, 19, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:52:32,446 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:52:32,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:52:32,446 INFO L82 PathProgramCache]: Analyzing trace with hash 719032384, now seen corresponding path program 59 times [2019-10-02 14:52:32,446 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:52:32,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:52:32,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:52:32,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:52:32,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:52:32,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:52:33,910 INFO L134 CoverageAnalysis]: Checked inductivity of 9002 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 5866 trivial. 0 not checked. [2019-10-02 14:52:33,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:52:33,911 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:52:34,011 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:56:09,790 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 56 check-sat command(s) [2019-10-02 14:56:09,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:56:09,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 1011 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-02 14:56:09,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:56:10,576 INFO L134 CoverageAnalysis]: Checked inductivity of 9002 backedges. 2484 proven. 590 refuted. 0 times theorem prover too weak. 5928 trivial. 0 not checked. [2019-10-02 14:56:10,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:56:10,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 23] total 80 [2019-10-02 14:56:10,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-10-02 14:56:10,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-10-02 14:56:10,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1963, Invalid=4357, Unknown=0, NotChecked=0, Total=6320 [2019-10-02 14:56:10,607 INFO L87 Difference]: Start difference. First operand 233 states and 257 transitions. Second operand 80 states.