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/max05-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 14:27:45,988 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 14:27:45,991 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 14:27:46,009 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 14:27:46,010 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 14:27:46,011 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 14:27:46,013 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 14:27:46,023 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 14:27:46,026 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 14:27:46,030 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 14:27:46,033 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 14:27:46,035 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 14:27:46,035 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 14:27:46,037 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 14:27:46,039 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 14:27:46,040 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 14:27:46,042 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 14:27:46,043 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 14:27:46,045 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 14:27:46,050 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 14:27:46,054 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 14:27:46,057 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 14:27:46,060 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 14:27:46,061 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 14:27:46,063 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 14:27:46,064 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 14:27:46,064 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 14:27:46,066 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 14:27:46,067 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 14:27:46,069 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 14:27:46,069 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 14:27:46,070 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 14:27:46,071 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 14:27:46,071 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 14:27:46,073 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 14:27:46,074 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 14:27:46,074 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 14:27:46,075 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 14:27:46,075 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 14:27:46,075 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 14:27:46,076 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 14:27:46,077 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:27:46,108 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 14:27:46,109 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 14:27:46,110 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 14:27:46,110 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 14:27:46,110 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 14:27:46,111 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 14:27:46,111 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 14:27:46,111 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 14:27:46,111 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 14:27:46,111 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 14:27:46,112 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 14:27:46,112 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 14:27:46,112 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 14:27:46,113 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 14:27:46,113 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 14:27:46,114 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 14:27:46,114 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 14:27:46,114 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 14:27:46,114 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 14:27:46,115 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 14:27:46,115 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 14:27:46,115 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 14:27:46,115 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 14:27:46,115 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 14:27:46,116 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 14:27:46,116 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 14:27:46,116 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 14:27:46,116 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 14:27:46,116 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 14:27:46,166 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 14:27:46,185 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 14:27:46,190 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 14:27:46,191 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 14:27:46,191 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 14:27:46,192 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/max05-1.i [2019-10-02 14:27:46,258 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e87f4d4c/c96703b78c4b41d2898096874737d33d/FLAGa3ccd07f4 [2019-10-02 14:27:46,719 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 14:27:46,720 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/max05-1.i [2019-10-02 14:27:46,726 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e87f4d4c/c96703b78c4b41d2898096874737d33d/FLAGa3ccd07f4 [2019-10-02 14:27:47,137 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e87f4d4c/c96703b78c4b41d2898096874737d33d [2019-10-02 14:27:47,147 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 14:27:47,149 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 14:27:47,150 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 14:27:47,151 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 14:27:47,154 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 14:27:47,154 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:27:47" (1/1) ... [2019-10-02 14:27:47,157 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76f51de0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:47, skipping insertion in model container [2019-10-02 14:27:47,158 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:27:47" (1/1) ... [2019-10-02 14:27:47,163 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 14:27:47,179 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 14:27:47,342 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:27:47,350 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 14:27:47,378 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:27:47,391 INFO L192 MainTranslator]: Completed translation [2019-10-02 14:27:47,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:47 WrapperNode [2019-10-02 14:27:47,392 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 14:27:47,393 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 14:27:47,393 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 14:27:47,393 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 14:27:47,498 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:47" (1/1) ... [2019-10-02 14:27:47,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:47" (1/1) ... [2019-10-02 14:27:47,505 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:47" (1/1) ... [2019-10-02 14:27:47,506 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:47" (1/1) ... [2019-10-02 14:27:47,515 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:47" (1/1) ... [2019-10-02 14:27:47,520 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:47" (1/1) ... [2019-10-02 14:27:47,522 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:47" (1/1) ... [2019-10-02 14:27:47,524 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 14:27:47,525 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 14:27:47,525 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 14:27:47,525 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 14:27:47,526 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:47" (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:27:47,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 14:27:47,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 14:27:47,586 INFO L138 BoogieDeclarations]: Found implementation of procedure max [2019-10-02 14:27:47,586 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 14:27:47,586 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 14:27:47,586 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 14:27:47,586 INFO L130 BoogieDeclarations]: Found specification of procedure max [2019-10-02 14:27:47,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 14:27:47,587 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 14:27:47,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 14:27:47,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 14:27:47,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 14:27:47,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 14:27:47,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 14:27:47,889 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 14:27:47,889 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-02 14:27:47,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:27:47 BoogieIcfgContainer [2019-10-02 14:27:47,891 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 14:27:47,900 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 14:27:47,900 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 14:27:47,903 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 14:27:47,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 02:27:47" (1/3) ... [2019-10-02 14:27:47,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55a91b4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:27:47, skipping insertion in model container [2019-10-02 14:27:47,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:47" (2/3) ... [2019-10-02 14:27:47,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55a91b4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:27:47, skipping insertion in model container [2019-10-02 14:27:47,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:27:47" (3/3) ... [2019-10-02 14:27:47,910 INFO L109 eAbstractionObserver]: Analyzing ICFG max05-1.i [2019-10-02 14:27:47,930 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 14:27:47,937 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 14:27:47,954 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 14:27:47,987 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 14:27:47,988 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 14:27:47,988 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 14:27:47,988 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 14:27:47,989 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 14:27:47,989 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 14:27:47,989 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 14:27:47,989 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 14:27:47,989 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 14:27:48,008 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-10-02 14:27:48,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-02 14:27:48,014 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:48,015 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:27:48,017 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:48,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:48,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1379671032, now seen corresponding path program 1 times [2019-10-02 14:27:48,023 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:48,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:48,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:48,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:48,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:48,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:48,211 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:27:48,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:27:48,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:27:48,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:27:48,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:27:48,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:27:48,236 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 3 states. [2019-10-02 14:27:48,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:48,291 INFO L93 Difference]: Finished difference Result 60 states and 81 transitions. [2019-10-02 14:27:48,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:27:48,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-02 14:27:48,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:48,302 INFO L225 Difference]: With dead ends: 60 [2019-10-02 14:27:48,303 INFO L226 Difference]: Without dead ends: 30 [2019-10-02 14:27:48,307 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:27:48,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-02 14:27:48,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-10-02 14:27:48,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-02 14:27:48,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2019-10-02 14:27:48,348 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 32 [2019-10-02 14:27:48,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:48,348 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2019-10-02 14:27:48,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:27:48,349 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2019-10-02 14:27:48,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-02 14:27:48,352 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:48,352 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:27:48,352 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:48,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:48,353 INFO L82 PathProgramCache]: Analyzing trace with hash 551744077, now seen corresponding path program 1 times [2019-10-02 14:27:48,353 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:48,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:48,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:48,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:48,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:48,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:48,476 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:27:48,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:48,477 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:27:48,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:48,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:48,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 14:27:48,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:48,600 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:27:48,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:27:48,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-10-02 14:27:48,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 14:27:48,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 14:27:48,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:27:48,614 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 4 states. [2019-10-02 14:27:48,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:48,654 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2019-10-02 14:27:48,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:27:48,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-10-02 14:27:48,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:48,657 INFO L225 Difference]: With dead ends: 52 [2019-10-02 14:27:48,657 INFO L226 Difference]: Without dead ends: 33 [2019-10-02 14:27:48,658 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:27:48,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-02 14:27:48,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2019-10-02 14:27:48,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-02 14:27:48,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2019-10-02 14:27:48,677 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 34 [2019-10-02 14:27:48,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:48,677 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-10-02 14:27:48,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 14:27:48,677 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2019-10-02 14:27:48,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-02 14:27:48,682 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:48,682 INFO L411 BasicCegarLoop]: trace histogram [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:27:48,682 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:48,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:48,683 INFO L82 PathProgramCache]: Analyzing trace with hash 727331048, now seen corresponding path program 1 times [2019-10-02 14:27:48,683 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:48,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:48,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:48,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:48,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:48,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:48,790 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-02 14:27:48,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:27:48,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:27:48,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:27:48,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:27:48,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:27:48,792 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 3 states. [2019-10-02 14:27:48,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:48,808 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2019-10-02 14:27:48,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:27:48,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-10-02 14:27:48,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:48,810 INFO L225 Difference]: With dead ends: 47 [2019-10-02 14:27:48,810 INFO L226 Difference]: Without dead ends: 32 [2019-10-02 14:27:48,811 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:27:48,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-02 14:27:48,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-10-02 14:27:48,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-02 14:27:48,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-10-02 14:27:48,818 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 46 [2019-10-02 14:27:48,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:48,821 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-10-02 14:27:48,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:27:48,821 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2019-10-02 14:27:48,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-02 14:27:48,822 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:48,823 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1] [2019-10-02 14:27:48,823 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:48,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:48,824 INFO L82 PathProgramCache]: Analyzing trace with hash -270429754, now seen corresponding path program 1 times [2019-10-02 14:27:48,824 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:48,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:48,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:48,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:48,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:48,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:48,966 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-02 14:27:48,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:48,966 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) [2019-10-02 14:27:48,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:27:49,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:49,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 14:27:49,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:49,076 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-02 14:27:49,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:49,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-02 14:27:49,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 14:27:49,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 14:27:49,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:27:49,085 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 5 states. [2019-10-02 14:27:49,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:49,128 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2019-10-02 14:27:49,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 14:27:49,131 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-10-02 14:27:49,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:49,133 INFO L225 Difference]: With dead ends: 56 [2019-10-02 14:27:49,133 INFO L226 Difference]: Without dead ends: 34 [2019-10-02 14:27:49,135 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 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:27:49,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-02 14:27:49,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-10-02 14:27:49,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-02 14:27:49,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2019-10-02 14:27:49,149 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 48 [2019-10-02 14:27:49,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:49,149 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-10-02 14:27:49,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 14:27:49,150 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2019-10-02 14:27:49,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-02 14:27:49,153 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:49,154 INFO L411 BasicCegarLoop]: trace histogram [3, 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:27:49,154 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:49,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:49,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1585951496, now seen corresponding path program 2 times [2019-10-02 14:27:49,155 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:49,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:49,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:49,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:49,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:49,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:49,308 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-02 14:27:49,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:49,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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 14:27:49,335 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:27:49,375 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:27:49,376 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:49,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 14:27:49,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:49,398 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-02 14:27:49,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:49,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-02 14:27:49,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:27:49,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:27:49,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:27:49,403 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 6 states. [2019-10-02 14:27:49,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:49,433 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2019-10-02 14:27:49,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:27:49,433 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2019-10-02 14:27:49,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:49,434 INFO L225 Difference]: With dead ends: 58 [2019-10-02 14:27:49,434 INFO L226 Difference]: Without dead ends: 36 [2019-10-02 14:27:49,435 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 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:27:49,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-02 14:27:49,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-10-02 14:27:49,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-02 14:27:49,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2019-10-02 14:27:49,441 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 50 [2019-10-02 14:27:49,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:49,442 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2019-10-02 14:27:49,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:27:49,442 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2019-10-02 14:27:49,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-02 14:27:49,443 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:49,444 INFO L411 BasicCegarLoop]: trace histogram [3, 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:27:49,444 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:49,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:49,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1138062390, now seen corresponding path program 3 times [2019-10-02 14:27:49,444 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:49,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:49,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:49,446 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:49,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:49,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:49,562 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-02 14:27:49,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:49,563 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) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:27:49,586 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:27:49,620 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-02 14:27:49,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:49,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 14:27:49,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:49,661 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 14:27:49,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:49,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-10-02 14:27:49,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 14:27:49,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 14:27:49,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:27:49,667 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand 8 states. [2019-10-02 14:27:49,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:49,725 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2019-10-02 14:27:49,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 14:27:49,726 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-10-02 14:27:49,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:49,727 INFO L225 Difference]: With dead ends: 67 [2019-10-02 14:27:49,727 INFO L226 Difference]: Without dead ends: 45 [2019-10-02 14:27:49,728 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 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:27:49,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-02 14:27:49,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2019-10-02 14:27:49,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-02 14:27:49,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2019-10-02 14:27:49,734 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 52 [2019-10-02 14:27:49,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:49,735 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2019-10-02 14:27:49,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 14:27:49,735 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2019-10-02 14:27:49,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-02 14:27:49,736 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:49,736 INFO L411 BasicCegarLoop]: trace histogram [6, 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:27:49,737 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:49,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:49,737 INFO L82 PathProgramCache]: Analyzing trace with hash 454933031, now seen corresponding path program 4 times [2019-10-02 14:27:49,737 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:49,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:49,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:49,739 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:49,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:49,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:49,836 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-10-02 14:27:49,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:49,837 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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:27:49,855 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:27:49,890 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:27:49,891 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:49,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 14:27:49,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:49,963 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 44 proven. 6 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:27:49,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:49,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-10-02 14:27:49,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 14:27:49,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 14:27:49,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:27:49,969 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 10 states. [2019-10-02 14:27:50,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:50,064 INFO L93 Difference]: Finished difference Result 76 states and 94 transitions. [2019-10-02 14:27:50,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 14:27:50,065 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-10-02 14:27:50,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:50,066 INFO L225 Difference]: With dead ends: 76 [2019-10-02 14:27:50,066 INFO L226 Difference]: Without dead ends: 50 [2019-10-02 14:27:50,067 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:27:50,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-02 14:27:50,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2019-10-02 14:27:50,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-02 14:27:50,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2019-10-02 14:27:50,078 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 66 [2019-10-02 14:27:50,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:50,082 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2019-10-02 14:27:50,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 14:27:50,083 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2019-10-02 14:27:50,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-02 14:27:50,085 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:50,087 INFO L411 BasicCegarLoop]: trace histogram [9, 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:27:50,087 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:50,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:50,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1150375548, now seen corresponding path program 5 times [2019-10-02 14:27:50,088 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:50,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:50,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:50,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:50,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:50,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:50,233 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2019-10-02 14:27:50,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:50,234 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) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:27:50,263 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:27:50,333 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-10-02 14:27:50,334 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:50,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 14:27:50,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:50,393 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 88 proven. 15 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-10-02 14:27:50,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:50,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 8 [2019-10-02 14:27:50,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 14:27:50,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 14:27:50,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:27:50,403 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand 8 states. [2019-10-02 14:27:50,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:50,461 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2019-10-02 14:27:50,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 14:27:50,462 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 80 [2019-10-02 14:27:50,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:50,463 INFO L225 Difference]: With dead ends: 86 [2019-10-02 14:27:50,463 INFO L226 Difference]: Without dead ends: 57 [2019-10-02 14:27:50,466 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:27:50,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-02 14:27:50,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2019-10-02 14:27:50,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-02 14:27:50,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2019-10-02 14:27:50,478 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 80 [2019-10-02 14:27:50,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:50,478 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2019-10-02 14:27:50,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 14:27:50,479 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2019-10-02 14:27:50,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-02 14:27:50,486 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:50,486 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 5, 5, 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:27:50,487 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:50,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:50,487 INFO L82 PathProgramCache]: Analyzing trace with hash 2112884221, now seen corresponding path program 6 times [2019-10-02 14:27:50,487 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:50,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:50,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:50,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:50,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:50,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:50,621 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 76 proven. 104 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2019-10-02 14:27:50,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:50,622 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:27:50,644 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 14:27:50,744 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-10-02 14:27:50,744 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:50,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 14:27:50,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:50,793 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 154 proven. 4 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-10-02 14:27:50,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:50,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-10-02 14:27:50,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 14:27:50,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 14:27:50,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:27:50,803 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 10 states. [2019-10-02 14:27:50,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:50,876 INFO L93 Difference]: Finished difference Result 95 states and 115 transitions. [2019-10-02 14:27:50,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 14:27:50,876 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2019-10-02 14:27:50,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:50,878 INFO L225 Difference]: With dead ends: 95 [2019-10-02 14:27:50,878 INFO L226 Difference]: Without dead ends: 60 [2019-10-02 14:27:50,878 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:27:50,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-02 14:27:50,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2019-10-02 14:27:50,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-02 14:27:50,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2019-10-02 14:27:50,896 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 94 [2019-10-02 14:27:50,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:50,896 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2019-10-02 14:27:50,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 14:27:50,899 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2019-10-02 14:27:50,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-02 14:27:50,901 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:50,901 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 5, 5, 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:27:50,901 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:50,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:50,902 INFO L82 PathProgramCache]: Analyzing trace with hash 345740406, now seen corresponding path program 7 times [2019-10-02 14:27:50,902 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:50,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:50,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:50,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:27:50,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:50,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:51,008 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 505 trivial. 0 not checked. [2019-10-02 14:27:51,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:51,009 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:27:51,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:51,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:51,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 14:27:51,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:51,167 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 230 proven. 9 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2019-10-02 14:27:51,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:51,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-10-02 14:27:51,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 14:27:51,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 14:27:51,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-02 14:27:51,174 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand 7 states. [2019-10-02 14:27:51,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:51,208 INFO L93 Difference]: Finished difference Result 92 states and 107 transitions. [2019-10-02 14:27:51,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 14:27:51,208 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 108 [2019-10-02 14:27:51,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:51,210 INFO L225 Difference]: With dead ends: 92 [2019-10-02 14:27:51,210 INFO L226 Difference]: Without dead ends: 61 [2019-10-02 14:27:51,210 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 108 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:27:51,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-02 14:27:51,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-10-02 14:27:51,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-02 14:27:51,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2019-10-02 14:27:51,224 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 108 [2019-10-02 14:27:51,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:51,225 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2019-10-02 14:27:51,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 14:27:51,225 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2019-10-02 14:27:51,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-02 14:27:51,226 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:51,226 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 5, 5, 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:27:51,227 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:51,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:51,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1065117484, now seen corresponding path program 8 times [2019-10-02 14:27:51,229 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:51,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:51,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:51,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:51,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:51,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:52,438 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 15 proven. 386 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-10-02 14:27:52,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:27:52,439 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) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:27:52,475 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:27:52,542 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:27:52,542 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:27:52,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 84 conjunts are in the unsatisfiable core [2019-10-02 14:27:52,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:27:52,676 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-10-02 14:27:52,677 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:27:52,687 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:27:52,689 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:27:52,689 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:3 [2019-10-02 14:27:53,482 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:27:53,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:27:53,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:27:53,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:27:53,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:27:53,486 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:27:53,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:27:53,489 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:27:53,490 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:27:53,491 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:27:53,494 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:27:53,494 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 59 [2019-10-02 14:27:53,496 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:27:53,511 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:27:53,512 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:27:53,513 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:77, output treesize:53 [2019-10-02 14:27:53,877 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:27:53,878 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 14:27:53,880 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:27:53,881 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:27:53,882 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:27:53,886 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:27:53,887 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:27:53,888 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:27:53,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:27:53,890 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:27:53,891 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:27:53,894 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:27:53,894 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 81 treesize of output 76 [2019-10-02 14:27:53,896 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:27:53,929 INFO L567 ElimStorePlain]: treesize reduction 16, result has 81.8 percent of original size [2019-10-02 14:27:53,929 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:27:53,930 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:87, output treesize:72 [2019-10-02 14:27:54,094 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:27:54,095 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:27:54,095 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 14:27:54,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:27:54,097 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:27:54,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:27:54,099 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:27:54,100 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:27:54,102 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 14:27:54,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:27:54,104 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:27:54,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:27:54,109 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:27:54,110 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:27:54,111 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 83 treesize of output 88 [2019-10-02 14:27:54,112 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:27:54,141 INFO L567 ElimStorePlain]: treesize reduction 35, result has 65.7 percent of original size [2019-10-02 14:27:54,142 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:27:54,142 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:89, output treesize:67 [2019-10-02 14:27:54,299 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:27:54,300 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 14:27:54,308 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:27:54,310 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:27:54,311 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:27:54,313 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:27:54,314 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:27:54,315 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:27:54,316 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:27:54,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:27:54,319 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 14:27:54,321 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:27:54,322 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 81 [2019-10-02 14:27:54,323 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:27:54,349 INFO L567 ElimStorePlain]: treesize reduction 38, result has 64.8 percent of original size [2019-10-02 14:27:54,350 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:27:54,350 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:91, output treesize:70 [2019-10-02 14:27:54,537 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:27:54,538 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:27:54,539 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:27:54,540 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:27:54,541 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:27:54,542 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:27:54,545 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:27:54,546 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 80 treesize of output 55 [2019-10-02 14:27:54,547 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:27:54,565 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:27:54,566 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:27:54,566 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:83, output treesize:64 [2019-10-02 14:27:54,668 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:27:54,669 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:27:54,670 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:27:54,673 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:27:54,675 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:27:54,677 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:27:54,679 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:27:54,679 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 55 [2019-10-02 14:27:54,681 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:27:54,692 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:27:54,693 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:27:54,693 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:77, output treesize:55 [2019-10-02 14:27:55,852 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 8 proven. 468 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-02 14:27:55,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:27:55,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 45] total 59 [2019-10-02 14:27:55,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-10-02 14:27:55,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-10-02 14:27:55,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=3242, Unknown=0, NotChecked=0, Total=3422 [2019-10-02 14:27:55,868 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand 59 states. [2019-10-02 14:28:06,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:28:06,916 INFO L93 Difference]: Finished difference Result 291 states and 345 transitions. [2019-10-02 14:28:06,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-10-02 14:28:06,916 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 110 [2019-10-02 14:28:06,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:28:06,920 INFO L225 Difference]: With dead ends: 291 [2019-10-02 14:28:06,920 INFO L226 Difference]: Without dead ends: 206 [2019-10-02 14:28:06,928 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 98 SyntacticMatches, 12 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7533 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=1155, Invalid=20601, Unknown=0, NotChecked=0, Total=21756 [2019-10-02 14:28:06,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-10-02 14:28:06,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 164. [2019-10-02 14:28:06,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-10-02 14:28:06,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 198 transitions. [2019-10-02 14:28:06,947 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 198 transitions. Word has length 110 [2019-10-02 14:28:06,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:28:06,948 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 198 transitions. [2019-10-02 14:28:06,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-10-02 14:28:06,948 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 198 transitions. [2019-10-02 14:28:06,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-02 14:28:06,950 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:28:06,950 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 15, 13, 5, 5, 4, 4, 3, 3, 3, 3, 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:28:06,950 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:28:06,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:28:06,951 INFO L82 PathProgramCache]: Analyzing trace with hash -897444716, now seen corresponding path program 1 times [2019-10-02 14:28:06,951 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:28:06,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:28:06,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:06,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:28:06,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:07,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:28:10,746 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 33 [2019-10-02 14:28:13,230 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 32 proven. 486 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 14:28:13,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:28:13,231 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) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:28:13,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:28:13,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:28:13,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 123 conjunts are in the unsatisfiable core [2019-10-02 14:28:13,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:28:13,418 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-10-02 14:28:13,418 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:28:13,426 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:28:13,426 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:28:13,427 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:3 [2019-10-02 14:28:14,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:28:14,170 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:14,171 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:14,172 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:14,184 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 44 [2019-10-02 14:28:14,185 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:28:14,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:14,213 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:14,214 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:14,220 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 42 [2019-10-02 14:28:14,221 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 14:28:14,264 INFO L567 ElimStorePlain]: treesize reduction 6, result has 92.4 percent of original size [2019-10-02 14:28:14,264 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-02 14:28:14,265 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:105, output treesize:55 [2019-10-02 14:28:14,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:28:14,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:28:14,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:28:14,817 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:14,818 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:14,819 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:14,821 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 58 [2019-10-02 14:28:14,823 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:28:14,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:14,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:14,830 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:14,832 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 54 [2019-10-02 14:28:14,833 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 14:28:14,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:14,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:14,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:14,843 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 61 [2019-10-02 14:28:14,844 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 14:28:14,848 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:14,850 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:14,851 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:14,853 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 61 [2019-10-02 14:28:14,854 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 14:28:14,943 INFO L567 ElimStorePlain]: treesize reduction 146, result has 46.1 percent of original size [2019-10-02 14:28:14,944 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-02 14:28:14,944 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:287, output treesize:125 [2019-10-02 14:28:15,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:28:15,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:15,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:15,255 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:15,257 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:15,258 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:15,259 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:15,271 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 69 [2019-10-02 14:28:15,273 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:28:15,302 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:15,303 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:15,304 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:15,305 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:15,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:15,307 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:15,308 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 73 [2019-10-02 14:28:15,309 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 14:28:15,351 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:28:15,352 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-02 14:28:15,352 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:173, output treesize:125 [2019-10-02 14:28:15,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:28:15,691 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:15,692 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:15,695 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:15,696 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:15,697 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:15,698 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:15,710 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 73 [2019-10-02 14:28:15,712 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:28:15,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:15,735 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:15,735 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:15,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:15,738 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:15,740 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:15,741 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 69 [2019-10-02 14:28:15,742 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 14:28:15,778 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:28:15,778 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-02 14:28:15,778 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:173, output treesize:125 [2019-10-02 14:28:16,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:28:16,109 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:16,110 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:16,110 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:16,113 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 53 [2019-10-02 14:28:16,114 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:28:16,154 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:28:16,159 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:16,160 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:16,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:16,163 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 49 [2019-10-02 14:28:16,164 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 14:28:16,197 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:28:16,197 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-02 14:28:16,197 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:147, output treesize:109 [2019-10-02 14:28:16,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:28:16,355 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:16,364 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 44 [2019-10-02 14:28:16,366 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:28:16,383 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:16,387 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 40 [2019-10-02 14:28:16,388 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 14:28:16,418 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:28:16,419 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-02 14:28:16,419 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:135, output treesize:79 [2019-10-02 14:28:17,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:28:17,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:28:17,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:28:17,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:28:17,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:28:17,289 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2019-10-02 14:28:17,289 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 14:28:17,299 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2019-10-02 14:28:17,300 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 14:28:17,348 INFO L567 ElimStorePlain]: treesize reduction 78, result has 45.5 percent of original size [2019-10-02 14:28:17,352 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2019-10-02 14:28:17,353 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 14:28:17,375 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:28:17,376 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-10-02 14:28:17,376 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:179, output treesize:49 [2019-10-02 14:28:17,840 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-02 14:28:17,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:28:17,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 35] total 99 [2019-10-02 14:28:17,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-10-02 14:28:17,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-10-02 14:28:17,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=9369, Unknown=0, NotChecked=0, Total=9702 [2019-10-02 14:28:17,847 INFO L87 Difference]: Start difference. First operand 164 states and 198 transitions. Second operand 99 states. [2019-10-02 14:28:29,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:28:29,843 INFO L93 Difference]: Finished difference Result 445 states and 572 transitions. [2019-10-02 14:28:29,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-10-02 14:28:29,844 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 110 [2019-10-02 14:28:29,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:28:29,849 INFO L225 Difference]: With dead ends: 445 [2019-10-02 14:28:29,850 INFO L226 Difference]: Without dead ends: 441 [2019-10-02 14:28:29,857 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 77 SyntacticMatches, 12 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7952 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=938, Invalid=25794, Unknown=0, NotChecked=0, Total=26732 [2019-10-02 14:28:29,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2019-10-02 14:28:29,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 254. [2019-10-02 14:28:29,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-10-02 14:28:29,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 341 transitions. [2019-10-02 14:28:29,902 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 341 transitions. Word has length 110 [2019-10-02 14:28:29,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:28:29,902 INFO L475 AbstractCegarLoop]: Abstraction has 254 states and 341 transitions. [2019-10-02 14:28:29,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-10-02 14:28:29,902 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 341 transitions. [2019-10-02 14:28:29,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-02 14:28:29,905 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:28:29,906 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 15, 13, 5, 5, 4, 4, 3, 3, 3, 3, 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:28:29,906 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:28:29,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:28:29,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1515534956, now seen corresponding path program 2 times [2019-10-02 14:28:29,906 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:28:29,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:28:29,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:29,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:28:29,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:29,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:28:32,223 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 1 proven. 483 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-02 14:28:32,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:28:32,223 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) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:28:32,272 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:28:32,343 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:28:32,343 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:28:32,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 80 conjunts are in the unsatisfiable core [2019-10-02 14:28:32,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:28:32,357 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-10-02 14:28:32,358 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:28:32,364 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:28:32,364 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:28:32,365 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2019-10-02 14:28:32,415 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-10-02 14:28:32,415 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:28:32,420 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:28:32,421 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:28:32,421 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-10-02 14:28:32,427 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:32,428 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2019-10-02 14:28:32,428 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:28:32,432 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:28:32,433 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:28:32,433 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-10-02 14:28:33,190 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 14:28:33,192 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:33,193 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:33,194 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:33,196 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:33,197 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:33,198 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:33,199 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:28:33,200 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 62 [2019-10-02 14:28:33,201 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:28:33,222 INFO L567 ElimStorePlain]: treesize reduction 20, result has 71.8 percent of original size [2019-10-02 14:28:33,222 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:28:33,223 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:70, output treesize:51 [2019-10-02 14:28:33,370 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:33,371 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 14:28:33,371 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:33,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:33,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:33,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:33,374 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 14:28:33,375 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:33,376 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:33,378 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:28:33,379 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 74 [2019-10-02 14:28:33,380 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:28:33,404 INFO L567 ElimStorePlain]: treesize reduction 33, result has 61.2 percent of original size [2019-10-02 14:28:33,405 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:28:33,405 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:52 [2019-10-02 14:28:33,559 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:33,560 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 14:28:33,561 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:33,562 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:33,564 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:33,564 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:33,565 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 14:28:33,567 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:28:33,567 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 70 [2019-10-02 14:28:33,568 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:28:33,592 INFO L567 ElimStorePlain]: treesize reduction 33, result has 63.7 percent of original size [2019-10-02 14:28:33,593 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:28:33,593 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:77, output treesize:58 [2019-10-02 14:28:33,751 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:33,752 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:33,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:33,755 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:33,756 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:33,756 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:33,758 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:33,759 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:33,760 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:33,772 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:28:33,773 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 68 treesize of output 94 [2019-10-02 14:28:33,774 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:28:33,812 INFO L567 ElimStorePlain]: treesize reduction 28, result has 74.1 percent of original size [2019-10-02 14:28:33,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:28:33,815 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 14:28:33,815 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:74, output treesize:80 [2019-10-02 14:28:33,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:28:34,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:28:36,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:28:37,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:28:37,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:37,983 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:37,984 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:37,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:37,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:37,987 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:37,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:37,989 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:37,990 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:37,991 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:38,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:38,002 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:38,066 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:28:38,067 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 163 [2019-10-02 14:28:38,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:28:38,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:28:38,071 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:28:38,078 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:38,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:38,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:38,085 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:38,088 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:38,089 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:28:38,094 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2019-10-02 14:28:38,095 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 14:28:38,125 INFO L567 ElimStorePlain]: treesize reduction 215, result has 16.0 percent of original size [2019-10-02 14:28:38,125 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:28:38,126 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:144, output treesize:38 [2019-10-02 14:28:39,173 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 232 proven. 240 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-10-02 14:28:39,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:28:39,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 41] total 74 [2019-10-02 14:28:39,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-10-02 14:28:39,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-10-02 14:28:39,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=5168, Unknown=2, NotChecked=0, Total=5402 [2019-10-02 14:28:39,179 INFO L87 Difference]: Start difference. First operand 254 states and 341 transitions. Second operand 74 states. [2019-10-02 14:28:41,830 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-10-02 14:28:47,116 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-10-02 14:29:07,069 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-10-02 14:29:08,719 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2019-10-02 14:29:08,919 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-10-02 14:29:11,275 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2019-10-02 14:29:13,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:29:13,412 INFO L93 Difference]: Finished difference Result 1221 states and 1734 transitions. [2019-10-02 14:29:13,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2019-10-02 14:29:13,415 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 110 [2019-10-02 14:29:13,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:29:13,424 INFO L225 Difference]: With dead ends: 1221 [2019-10-02 14:29:13,424 INFO L226 Difference]: Without dead ends: 1134 [2019-10-02 14:29:13,431 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 111 SyntacticMatches, 6 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21263 ImplicationChecksByTransitivity, 32.7s TimeCoverageRelationStatistics Valid=2027, Invalid=53422, Unknown=11, NotChecked=0, Total=55460 [2019-10-02 14:29:13,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2019-10-02 14:29:13,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 717. [2019-10-02 14:29:13,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-10-02 14:29:13,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1070 transitions. [2019-10-02 14:29:13,525 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1070 transitions. Word has length 110 [2019-10-02 14:29:13,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:29:13,525 INFO L475 AbstractCegarLoop]: Abstraction has 717 states and 1070 transitions. [2019-10-02 14:29:13,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-10-02 14:29:13,526 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1070 transitions. [2019-10-02 14:29:13,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-02 14:29:13,533 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:29:13,534 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 15, 12, 5, 5, 4, 4, 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:29:13,534 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:29:13,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:29:13,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1908561966, now seen corresponding path program 3 times [2019-10-02 14:29:13,534 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:29:13,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:29:13,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:13,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:29:13,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:13,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:29:15,653 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 233 proven. 231 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-02 14:29:15,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:29:15,653 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:29:15,702 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:29:15,805 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-10-02 14:29:15,806 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:29:15,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 66 conjunts are in the unsatisfiable core [2019-10-02 14:29:15,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:29:15,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:29:15,843 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2019-10-02 14:29:15,843 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:29:15,847 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:29:15,847 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:29:15,848 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-10-02 14:29:16,256 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:29:16,258 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:29:16,261 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:29:16,262 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:29:16,262 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:29:16,263 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:29:16,271 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:29:16,271 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 47 [2019-10-02 14:29:16,272 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:29:16,290 INFO L567 ElimStorePlain]: treesize reduction 3, result has 93.6 percent of original size [2019-10-02 14:29:16,290 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:29:16,290 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:51, output treesize:44 [2019-10-02 14:29:16,449 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:29:16,450 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:29:16,452 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:29:16,453 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:29:16,455 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:29:16,456 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:29:16,457 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:29:16,458 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:29:16,459 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:29:16,461 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:29:16,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:29:16,498 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:29:16,498 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 62 treesize of output 183 [2019-10-02 14:29:16,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:16,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:16,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:16,502 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:29:16,567 INFO L567 ElimStorePlain]: treesize reduction 239, result has 25.5 percent of original size [2019-10-02 14:29:16,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:16,568 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-02 14:29:16,568 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:73, output treesize:82 [2019-10-02 14:29:16,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:26,664 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 39 [2019-10-02 14:29:26,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:56,809 WARN L191 SmtUtils]: Spent 20.04 s on a formula simplification that was a NOOP. DAG size: 44 [2019-10-02 14:29:56,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:56,818 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:29:56,819 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:29:56,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:29:56,833 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:29:56,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:29:56,848 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:29:56,849 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:29:56,851 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:29:56,862 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:29:56,864 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:29:56,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:29:56,869 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:29:56,921 INFO L235 Elim1Store]: Index analysis took 104 ms [2019-10-02 14:29:57,121 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-10-02 14:29:57,121 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:29:57,122 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 12 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 93 treesize of output 488 [2019-10-02 14:29:57,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,167 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:29:57,191 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:29:57,192 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:29:57,193 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:29:57,200 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:29:57,201 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:29:57,203 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:29:57,206 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:29:57,291 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:29:57,292 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 69 treesize of output 284 [2019-10-02 14:29:57,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:57,301 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 14:29:58,252 WARN L191 SmtUtils]: Spent 950.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 73 [2019-10-02 14:29:58,253 INFO L567 ElimStorePlain]: treesize reduction 3903, result has 7.2 percent of original size [2019-10-02 14:29:58,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:58,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:58,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:58,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:58,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:58,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:58,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:58,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:58,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:58,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:58,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:58,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:58,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:58,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:58,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:58,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:58,269 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-10-02 14:29:58,269 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:163, output treesize:298 [2019-10-02 14:29:58,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:58,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:58,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:58,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:58,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:58,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:58,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:58,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:58,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:58,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:58,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:58,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:58,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:58,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:58,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:29:58,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:30:22,483 WARN L191 SmtUtils]: Spent 24.07 s on a formula simplification that was a NOOP. DAG size: 75 [2019-10-02 14:30:22,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:30:22,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:30:22,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:30:22,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:30:22,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:30:22,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:30:22,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:30:22,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:30:22,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:30:22,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:30:22,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:30:22,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:30:22,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:33:58,578 WARN L191 SmtUtils]: Spent 3.60 m on a formula simplification. DAG size of input: 125 DAG size of output: 76 [2019-10-02 14:33:58,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-10-02 14:33:58,615 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:33:58,618 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:33:58,631 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:33:58,650 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:33:58,682 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:33:58,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:33:58,741 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:33:58,988 INFO L235 Elim1Store]: Index analysis took 390 ms [2019-10-02 14:33:59,019 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:33:59,019 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 71 treesize of output 145 [2019-10-02 14:33:59,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:33:59,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:33:59,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:33:59,023 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:33:59,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:33:59,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:33:59,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:33:59,100 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:33:59,113 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:33:59,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:33:59,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:33:59,143 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:33:59,146 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:33:59,172 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:33:59,177 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:33:59,182 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:33:59,606 INFO L235 Elim1Store]: Index analysis took 565 ms [2019-10-02 14:33:59,741 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-10-02 14:33:59,741 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:33:59,742 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 12 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 92 treesize of output 356 [2019-10-02 14:33:59,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:33:59,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:33:59,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:33:59,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:33:59,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:33:59,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:33:59,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:33:59,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:33:59,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:33:59,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:33:59,750 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 14:33:59,767 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 14:33:59,767 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 14:33:59,778 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 14:33:59,778 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 14:33:59,788 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 14:33:59,789 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-02 14:33:59,798 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 14:33:59,798 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-02 14:33:59,810 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:33:59,813 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:33:59,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:33:59,820 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:33:59,821 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:33:59,824 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:33:59,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:33:59,830 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:33:59,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:33:59,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:33:59,844 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:33:59,846 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:33:59,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:33:59,869 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:33:59,873 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:33:59,877 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:33:59,878 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:33:59,880 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:33:59,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:34:00,368 WARN L191 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 118 [2019-10-02 14:34:00,369 INFO L341 Elim1Store]: treesize reduction 34, result has 93.5 percent of original size [2019-10-02 14:34:00,369 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 19 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 22 case distinctions, treesize of input 136 treesize of output 578 [2019-10-02 14:34:00,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:34:00,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:34:00,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:34:00,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:34:00,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:34:00,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:34:00,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:34:00,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:34:00,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:34:00,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:34:00,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:34:00,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:34:00,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:34:00,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:34:00,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:34:00,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:34:00,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:34:00,384 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-10-02 14:34:00,837 WARN L191 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 246 DAG size of output: 33 [2019-10-02 14:34:00,837 INFO L567 ElimStorePlain]: treesize reduction 3407, result has 2.2 percent of original size [2019-10-02 14:34:00,837 INFO L496 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:34:00,837 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 10 variables, input treesize:707, output treesize:75 [2019-10-02 14:34:02,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:34:04,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:34:04,121 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:34:04,122 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:34:04,124 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:34:04,125 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:34:04,125 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 36 [2019-10-02 14:34:04,126 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:34:04,144 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:34:04,145 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:34:04,145 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:21 [2019-10-02 14:34:07,866 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 293 proven. 138 refuted. 2 times theorem prover too weak. 88 trivial. 0 not checked. [2019-10-02 14:34:07,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:34:07,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 64 [2019-10-02 14:34:07,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-10-02 14:34:07,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-10-02 14:34:07,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=3805, Unknown=12, NotChecked=0, Total=4032 [2019-10-02 14:34:07,875 INFO L87 Difference]: Start difference. First operand 717 states and 1070 transitions. Second operand 64 states. [2019-10-02 14:34:10,067 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-10-02 14:34:11,407 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-10-02 14:34:11,733 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-10-02 14:34:51,436 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-10-02 14:34:51,686 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-10-02 14:34:52,924 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-10-02 14:34:53,142 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-10-02 14:34:55,156 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-10-02 14:36:05,007 WARN L191 SmtUtils]: Spent 8.12 s on a formula simplification. DAG size of input: 120 DAG size of output: 30 [2019-10-02 14:36:31,476 WARN L191 SmtUtils]: Spent 10.09 s on a formula simplification. DAG size of input: 114 DAG size of output: 36 [2019-10-02 14:36:56,303 WARN L191 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-10-02 14:37:00,158 WARN L191 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-10-02 14:37:02,857 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-10-02 14:37:05,581 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-10-02 14:37:05,762 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-10-02 14:37:16,285 WARN L191 SmtUtils]: Spent 2.75 s on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2019-10-02 14:37:18,851 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-10-02 14:37:28,583 WARN L191 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-10-02 14:37:28,785 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-10-02 14:37:29,001 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-10-02 14:37:31,496 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2019-10-02 14:37:32,916 WARN L191 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 95 DAG size of output: 78 [2019-10-02 14:37:39,439 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 52 [2019-10-02 14:37:43,134 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-10-02 14:37:47,847 WARN L191 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-10-02 14:37:52,970 WARN L191 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-10-02 14:37:56,102 WARN L191 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2019-10-02 14:37:58,557 WARN L191 SmtUtils]: Spent 1.93 s on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-10-02 14:38:02,725 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2019-10-02 14:38:05,448 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 56 [2019-10-02 14:38:05,951 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-10-02 14:38:06,296 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2019-10-02 14:38:17,624 WARN L191 SmtUtils]: Spent 3.62 s on a formula simplification that was a NOOP. DAG size: 63 [2019-10-02 14:38:32,660 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2019-10-02 14:38:38,516 WARN L191 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2019-10-02 14:38:48,314 WARN L191 SmtUtils]: Spent 2.71 s on a formula simplification. DAG size of input: 87 DAG size of output: 81 [2019-10-02 14:38:51,136 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2019-10-02 14:38:55,487 WARN L191 SmtUtils]: Spent 4.23 s on a formula simplification. DAG size of input: 93 DAG size of output: 86 [2019-10-02 14:39:01,730 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-10-02 14:39:02,642 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-10-02 14:39:04,396 WARN L191 SmtUtils]: Spent 835.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2019-10-02 14:39:12,615 WARN L191 SmtUtils]: Spent 8.11 s on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-10-02 14:39:44,552 WARN L191 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-10-02 14:40:04,362 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-10-02 14:40:10,735 WARN L191 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-10-02 14:40:17,493 WARN L191 SmtUtils]: Spent 679.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-10-02 14:40:21,858 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-10-02 14:40:24,376 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-10-02 14:40:35,977 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-10-02 14:40:42,756 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-10-02 14:40:43,070 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-10-02 14:41:10,943 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-10-02 14:41:28,899 WARN L191 SmtUtils]: Spent 2.26 s on a formula simplification that was a NOOP. DAG size: 67 [2019-10-02 14:42:04,543 WARN L191 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 67 DAG size of output: 61