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/sep05-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 11:15:08,002 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 11:15:08,004 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 11:15:08,019 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 11:15:08,019 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 11:15:08,021 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 11:15:08,023 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 11:15:08,036 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 11:15:08,037 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 11:15:08,038 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 11:15:08,039 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 11:15:08,042 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 11:15:08,043 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 11:15:08,046 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 11:15:08,048 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 11:15:08,050 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 11:15:08,052 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 11:15:08,054 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 11:15:08,057 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 11:15:08,061 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 11:15:08,064 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 11:15:08,066 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 11:15:08,068 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 11:15:08,069 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 11:15:08,071 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 11:15:08,071 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 11:15:08,072 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 11:15:08,074 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 11:15:08,075 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 11:15:08,077 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 11:15:08,077 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 11:15:08,079 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 11:15:08,080 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 11:15:08,080 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 11:15:08,084 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 11:15:08,084 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 11:15:08,085 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 11:15:08,085 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 11:15:08,085 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 11:15:08,086 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 11:15:08,087 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 11:15:08,088 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 11:15:08,107 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 11:15:08,108 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 11:15:08,110 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 11:15:08,111 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 11:15:08,111 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 11:15:08,111 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 11:15:08,111 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 11:15:08,112 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 11:15:08,112 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 11:15:08,112 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 11:15:08,113 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 11:15:08,113 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 11:15:08,113 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 11:15:08,114 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 11:15:08,114 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 11:15:08,114 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 11:15:08,114 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 11:15:08,115 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 11:15:08,115 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 11:15:08,115 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 11:15:08,115 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 11:15:08,115 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 11:15:08,116 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 11:15:08,116 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 11:15:08,116 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 11:15:08,117 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 11:15:08,117 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 11:15:08,117 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 11:15:08,117 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 11:15:08,169 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 11:15:08,187 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 11:15:08,193 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 11:15:08,194 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 11:15:08,195 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 11:15:08,195 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/sep05-1.i [2019-09-07 11:15:08,272 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35c5c1e81/a8f0fae18ed24b57a14a72ccdd0a4669/FLAG524656c8d [2019-09-07 11:15:08,728 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 11:15:08,730 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/sep05-1.i [2019-09-07 11:15:08,737 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35c5c1e81/a8f0fae18ed24b57a14a72ccdd0a4669/FLAG524656c8d [2019-09-07 11:15:09,151 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35c5c1e81/a8f0fae18ed24b57a14a72ccdd0a4669 [2019-09-07 11:15:09,163 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 11:15:09,165 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 11:15:09,165 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 11:15:09,166 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 11:15:09,171 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 11:15:09,172 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 11:15:09" (1/1) ... [2019-09-07 11:15:09,174 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6501343a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:15:09, skipping insertion in model container [2019-09-07 11:15:09,175 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 11:15:09" (1/1) ... [2019-09-07 11:15:09,182 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 11:15:09,199 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 11:15:09,355 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 11:15:09,364 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 11:15:09,384 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 11:15:09,397 INFO L192 MainTranslator]: Completed translation [2019-09-07 11:15:09,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:15:09 WrapperNode [2019-09-07 11:15:09,398 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 11:15:09,399 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 11:15:09,399 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 11:15:09,399 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 11:15:09,497 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:15:09" (1/1) ... [2019-09-07 11:15:09,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:15:09" (1/1) ... [2019-09-07 11:15:09,504 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:15:09" (1/1) ... [2019-09-07 11:15:09,505 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:15:09" (1/1) ... [2019-09-07 11:15:09,513 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:15:09" (1/1) ... [2019-09-07 11:15:09,518 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:15:09" (1/1) ... [2019-09-07 11:15:09,520 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:15:09" (1/1) ... [2019-09-07 11:15:09,524 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 11:15:09,524 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 11:15:09,525 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 11:15:09,525 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 11:15:09,526 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:15:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 11:15:09,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 11:15:09,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 11:15:09,582 INFO L138 BoogieDeclarations]: Found implementation of procedure sep [2019-09-07 11:15:09,582 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 11:15:09,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 11:15:09,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 11:15:09,583 INFO L130 BoogieDeclarations]: Found specification of procedure sep [2019-09-07 11:15:09,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-07 11:15:09,583 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 11:15:09,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-07 11:15:09,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-07 11:15:09,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-07 11:15:09,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 11:15:09,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 11:15:09,859 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 11:15:09,860 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-07 11:15:09,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 11:15:09 BoogieIcfgContainer [2019-09-07 11:15:09,862 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 11:15:09,872 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 11:15:09,872 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 11:15:09,876 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 11:15:09,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 11:15:09" (1/3) ... [2019-09-07 11:15:09,878 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e69bc40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 11:15:09, skipping insertion in model container [2019-09-07 11:15:09,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:15:09" (2/3) ... [2019-09-07 11:15:09,878 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e69bc40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 11:15:09, skipping insertion in model container [2019-09-07 11:15:09,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 11:15:09" (3/3) ... [2019-09-07 11:15:09,881 INFO L109 eAbstractionObserver]: Analyzing ICFG sep05-1.i [2019-09-07 11:15:09,896 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 11:15:09,913 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 11:15:09,936 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 11:15:09,976 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 11:15:09,977 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 11:15:09,977 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 11:15:09,977 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 11:15:09,977 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 11:15:09,977 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 11:15:09,977 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 11:15:09,977 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 11:15:09,977 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 11:15:09,993 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-09-07 11:15:10,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-07 11:15:10,000 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:15:10,001 INFO L399 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-09-07 11:15:10,003 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:15:10,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:15:10,009 INFO L82 PathProgramCache]: Analyzing trace with hash 794343521, now seen corresponding path program 1 times [2019-09-07 11:15:10,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:15:10,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:15:10,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:15:10,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:15:10,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:15:10,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:15:10,166 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-07 11:15:10,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 11:15:10,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-07 11:15:10,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-07 11:15:10,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-07 11:15:10,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 11:15:10,185 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2019-09-07 11:15:10,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:15:10,205 INFO L93 Difference]: Finished difference Result 56 states and 75 transitions. [2019-09-07 11:15:10,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-07 11:15:10,207 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2019-09-07 11:15:10,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:15:10,214 INFO L225 Difference]: With dead ends: 56 [2019-09-07 11:15:10,215 INFO L226 Difference]: Without dead ends: 27 [2019-09-07 11:15:10,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 11:15:10,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-07 11:15:10,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-09-07 11:15:10,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-07 11:15:10,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2019-09-07 11:15:10,261 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 32 [2019-09-07 11:15:10,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:15:10,262 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-09-07 11:15:10,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-07 11:15:10,262 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2019-09-07 11:15:10,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-07 11:15:10,265 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:15:10,265 INFO L399 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-09-07 11:15:10,265 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:15:10,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:15:10,266 INFO L82 PathProgramCache]: Analyzing trace with hash 2140793590, now seen corresponding path program 1 times [2019-09-07 11:15:10,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:15:10,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:15:10,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:15:10,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:15:10,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:15:10,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:15:10,345 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-07 11:15:10,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 11:15:10,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 11:15:10,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 11:15:10,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 11:15:10,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 11:15:10,349 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand 3 states. [2019-09-07 11:15:10,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:15:10,373 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2019-09-07 11:15:10,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 11:15:10,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-09-07 11:15:10,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:15:10,375 INFO L225 Difference]: With dead ends: 48 [2019-09-07 11:15:10,375 INFO L226 Difference]: Without dead ends: 29 [2019-09-07 11:15:10,377 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 11:15:10,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-07 11:15:10,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-09-07 11:15:10,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-07 11:15:10,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-09-07 11:15:10,390 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 32 [2019-09-07 11:15:10,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:15:10,391 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-09-07 11:15:10,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 11:15:10,391 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2019-09-07 11:15:10,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-07 11:15:10,393 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:15:10,393 INFO L399 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-09-07 11:15:10,394 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:15:10,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:15:10,395 INFO L82 PathProgramCache]: Analyzing trace with hash 2099349144, now seen corresponding path program 1 times [2019-09-07 11:15:10,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:15:10,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:15:10,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:15:10,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:15:10,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:15:10,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:15:10,460 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-07 11:15:10,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:15:10,461 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:15:10,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:15:10,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:15:10,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-07 11:15:10,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:15:10,582 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:15:10,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 11:15:10,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-09-07 11:15:10,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 11:15:10,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 11:15:10,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 11:15:10,590 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 4 states. [2019-09-07 11:15:10,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:15:10,619 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2019-09-07 11:15:10,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 11:15:10,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-09-07 11:15:10,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:15:10,622 INFO L225 Difference]: With dead ends: 49 [2019-09-07 11:15:10,622 INFO L226 Difference]: Without dead ends: 31 [2019-09-07 11:15:10,623 INFO L628 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-09-07 11:15:10,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-07 11:15:10,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2019-09-07 11:15:10,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-07 11:15:10,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2019-09-07 11:15:10,629 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 34 [2019-09-07 11:15:10,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:15:10,630 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2019-09-07 11:15:10,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 11:15:10,630 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2019-09-07 11:15:10,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-07 11:15:10,631 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:15:10,632 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:15:10,632 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:15:10,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:15:10,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1279819331, now seen corresponding path program 1 times [2019-09-07 11:15:10,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:15:10,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:15:10,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:15:10,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:15:10,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:15:10,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:15:10,765 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-07 11:15:10,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 11:15:10,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 11:15:10,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 11:15:10,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 11:15:10,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 11:15:10,767 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 3 states. [2019-09-07 11:15:10,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:15:10,783 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2019-09-07 11:15:10,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 11:15:10,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-09-07 11:15:10,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:15:10,785 INFO L225 Difference]: With dead ends: 45 [2019-09-07 11:15:10,785 INFO L226 Difference]: Without dead ends: 31 [2019-09-07 11:15:10,786 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 11:15:10,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-07 11:15:10,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-09-07 11:15:10,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-07 11:15:10,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2019-09-07 11:15:10,793 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 43 [2019-09-07 11:15:10,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:15:10,795 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-09-07 11:15:10,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 11:15:10,795 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2019-09-07 11:15:10,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-07 11:15:10,796 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:15:10,797 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:15:10,797 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:15:10,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:15:10,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1550635457, now seen corresponding path program 1 times [2019-09-07 11:15:10,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:15:10,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:15:10,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:15:10,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:15:10,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:15:10,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:15:10,906 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-07 11:15:10,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:15:10,906 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:15:10,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:15:10,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:15:10,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 11:15:11,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:15:11,026 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:15:11,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:15:11,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-07 11:15:11,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 11:15:11,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 11:15:11,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 11:15:11,039 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 5 states. [2019-09-07 11:15:11,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:15:11,082 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2019-09-07 11:15:11,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 11:15:11,083 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-09-07 11:15:11,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:15:11,084 INFO L225 Difference]: With dead ends: 54 [2019-09-07 11:15:11,084 INFO L226 Difference]: Without dead ends: 33 [2019-09-07 11:15:11,084 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 11:15:11,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-07 11:15:11,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-09-07 11:15:11,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-07 11:15:11,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2019-09-07 11:15:11,090 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 45 [2019-09-07 11:15:11,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:15:11,090 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-09-07 11:15:11,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 11:15:11,091 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2019-09-07 11:15:11,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-07 11:15:11,092 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:15:11,092 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:15:11,092 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:15:11,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:15:11,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1356401117, now seen corresponding path program 2 times [2019-09-07 11:15:11,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:15:11,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:15:11,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:15:11,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:15:11,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:15:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:15:11,180 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-07 11:15:11,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:15:11,182 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:15:11,198 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:15:11,248 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:15:11,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:15:11,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 11:15:11,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:15:11,286 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:15:11,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:15:11,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2019-09-07 11:15:11,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 11:15:11,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 11:15:11,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-07 11:15:11,292 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 7 states. [2019-09-07 11:15:11,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:15:11,344 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2019-09-07 11:15:11,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 11:15:11,347 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-09-07 11:15:11,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:15:11,348 INFO L225 Difference]: With dead ends: 61 [2019-09-07 11:15:11,348 INFO L226 Difference]: Without dead ends: 40 [2019-09-07 11:15:11,349 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-07 11:15:11,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-07 11:15:11,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2019-09-07 11:15:11,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-07 11:15:11,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2019-09-07 11:15:11,355 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 47 [2019-09-07 11:15:11,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:15:11,356 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2019-09-07 11:15:11,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 11:15:11,356 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2019-09-07 11:15:11,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-07 11:15:11,357 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:15:11,357 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 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-09-07 11:15:11,358 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:15:11,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:15:11,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1057089466, now seen corresponding path program 3 times [2019-09-07 11:15:11,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:15:11,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:15:11,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:15:11,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:15:11,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:15:11,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:15:11,462 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-09-07 11:15:11,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:15:11,462 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:15:11,476 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:15:11,517 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-07 11:15:11,518 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:15:11,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 11:15:11,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:15:11,550 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 42 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-07 11:15:11,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:15:11,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-09-07 11:15:11,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 11:15:11,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 11:15:11,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-07 11:15:11,560 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand 7 states. [2019-09-07 11:15:11,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:15:11,624 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2019-09-07 11:15:11,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 11:15:11,625 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-09-07 11:15:11,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:15:11,626 INFO L225 Difference]: With dead ends: 68 [2019-09-07 11:15:11,626 INFO L226 Difference]: Without dead ends: 45 [2019-09-07 11:15:11,627 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-07 11:15:11,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-07 11:15:11,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2019-09-07 11:15:11,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-07 11:15:11,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2019-09-07 11:15:11,637 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 58 [2019-09-07 11:15:11,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:15:11,638 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2019-09-07 11:15:11,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 11:15:11,638 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2019-09-07 11:15:11,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-07 11:15:11,639 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:15:11,640 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 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] [2019-09-07 11:15:11,640 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:15:11,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:15:11,640 INFO L82 PathProgramCache]: Analyzing trace with hash -515095459, now seen corresponding path program 4 times [2019-09-07 11:15:11,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:15:11,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:15:11,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:15:11,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:15:11,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:15:11,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:15:11,747 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-09-07 11:15:11,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:15:11,748 INFO L223 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-09-07 11:15:11,759 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 11:15:11,803 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:15:11,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:15:11,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 11:15:11,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:15:11,872 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 70 proven. 12 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:15:11,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:15:11,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-09-07 11:15:11,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 11:15:11,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 11:15:11,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-09-07 11:15:11,878 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 10 states. [2019-09-07 11:15:11,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:15:11,943 INFO L93 Difference]: Finished difference Result 79 states and 99 transitions. [2019-09-07 11:15:11,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 11:15:11,944 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 69 [2019-09-07 11:15:11,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:15:11,945 INFO L225 Difference]: With dead ends: 79 [2019-09-07 11:15:11,945 INFO L226 Difference]: Without dead ends: 50 [2019-09-07 11:15:11,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-09-07 11:15:11,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-07 11:15:11,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2019-09-07 11:15:11,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-07 11:15:11,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2019-09-07 11:15:11,960 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 69 [2019-09-07 11:15:11,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:15:11,961 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2019-09-07 11:15:11,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 11:15:11,961 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2019-09-07 11:15:11,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-07 11:15:11,962 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:15:11,963 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 4, 4, 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-09-07 11:15:11,963 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:15:11,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:15:11,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1632310970, now seen corresponding path program 5 times [2019-09-07 11:15:11,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:15:11,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:15:11,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:15:11,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:15:11,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:15:12,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:15:12,065 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2019-09-07 11:15:12,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:15:12,065 INFO L223 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-09-07 11:15:12,084 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 11:15:12,161 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-09-07 11:15:12,161 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:15:12,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 11:15:12,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:15:12,214 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 116 proven. 22 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-09-07 11:15:12,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:15:12,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2019-09-07 11:15:12,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 11:15:12,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 11:15:12,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-09-07 11:15:12,226 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 10 states. [2019-09-07 11:15:12,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:15:12,271 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2019-09-07 11:15:12,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 11:15:12,272 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 80 [2019-09-07 11:15:12,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:15:12,273 INFO L225 Difference]: With dead ends: 84 [2019-09-07 11:15:12,273 INFO L226 Difference]: Without dead ends: 53 [2019-09-07 11:15:12,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-09-07 11:15:12,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-07 11:15:12,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-09-07 11:15:12,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-07 11:15:12,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2019-09-07 11:15:12,280 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 80 [2019-09-07 11:15:12,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:15:12,280 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2019-09-07 11:15:12,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 11:15:12,280 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2019-09-07 11:15:12,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-07 11:15:12,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:15:12,282 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 4, 4, 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-09-07 11:15:12,282 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:15:12,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:15:12,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1531218467, now seen corresponding path program 6 times [2019-09-07 11:15:12,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:15:12,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:15:12,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:15:12,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:15:12,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:15:12,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:15:12,375 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2019-09-07 11:15:12,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:15:12,375 INFO L223 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-09-07 11:15:12,399 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 11:15:12,505 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-09-07 11:15:12,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:15:12,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 11:15:12,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:15:12,530 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2019-09-07 11:15:12,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:15:12,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-07 11:15:12,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 11:15:12,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 11:15:12,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-07 11:15:12,548 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand 8 states. [2019-09-07 11:15:12,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:15:12,581 INFO L93 Difference]: Finished difference Result 91 states and 109 transitions. [2019-09-07 11:15:12,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 11:15:12,581 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 91 [2019-09-07 11:15:12,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:15:12,582 INFO L225 Difference]: With dead ends: 91 [2019-09-07 11:15:12,582 INFO L226 Difference]: Without dead ends: 54 [2019-09-07 11:15:12,583 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-07 11:15:12,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-07 11:15:12,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-09-07 11:15:12,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-07 11:15:12,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2019-09-07 11:15:12,589 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 91 [2019-09-07 11:15:12,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:15:12,590 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2019-09-07 11:15:12,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 11:15:12,590 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2019-09-07 11:15:12,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-07 11:15:12,591 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:15:12,591 INFO L399 BasicCegarLoop]: trace histogram [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-09-07 11:15:12,592 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:15:12,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:15:12,592 INFO L82 PathProgramCache]: Analyzing trace with hash -513954565, now seen corresponding path program 7 times [2019-09-07 11:15:12,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:15:12,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:15:12,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:15:12,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:15:12,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:15:12,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:15:12,675 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2019-09-07 11:15:12,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:15:12,676 INFO L223 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) [2019-09-07 11:15:12,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:15:12,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:15:12,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 11:15:12,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:15:12,778 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 180 proven. 9 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:15:12,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:15:12,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-07 11:15:12,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 11:15:12,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 11:15:12,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 11:15:12,785 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand 7 states. [2019-09-07 11:15:12,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:15:12,824 INFO L93 Difference]: Finished difference Result 82 states and 97 transitions. [2019-09-07 11:15:12,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 11:15:12,826 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-09-07 11:15:12,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:15:12,827 INFO L225 Difference]: With dead ends: 82 [2019-09-07 11:15:12,829 INFO L226 Difference]: Without dead ends: 56 [2019-09-07 11:15:12,830 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 93 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-09-07 11:15:12,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-07 11:15:12,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-09-07 11:15:12,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-07 11:15:12,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2019-09-07 11:15:12,845 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 93 [2019-09-07 11:15:12,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:15:12,845 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2019-09-07 11:15:12,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 11:15:12,846 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2019-09-07 11:15:12,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-07 11:15:12,849 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:15:12,849 INFO L399 BasicCegarLoop]: trace histogram [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-09-07 11:15:12,850 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:15:12,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:15:12,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1590918909, now seen corresponding path program 8 times [2019-09-07 11:15:12,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:15:12,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:15:12,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:15:12,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:15:12,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:15:13,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:15:13,654 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 315 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-09-07 11:15:13,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:15:13,655 INFO L223 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-09-07 11:15:13,675 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:15:13,740 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:15:13,740 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:15:13,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 67 conjunts are in the unsatisfiable core [2019-09-07 11:15:13,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:15:13,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:15:13,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:15:13,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:15:14,121 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 340 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-09-07 11:15:14,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:15:14,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20] total 22 [2019-09-07 11:15:14,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-07 11:15:14,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-07 11:15:14,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2019-09-07 11:15:14,137 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand 22 states. [2019-09-07 11:15:14,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:15:14,723 INFO L93 Difference]: Finished difference Result 152 states and 210 transitions. [2019-09-07 11:15:14,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 11:15:14,726 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 95 [2019-09-07 11:15:14,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:15:14,731 INFO L225 Difference]: With dead ends: 152 [2019-09-07 11:15:14,731 INFO L226 Difference]: Without dead ends: 148 [2019-09-07 11:15:14,733 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 94 SyntacticMatches, 9 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2019-09-07 11:15:14,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-09-07 11:15:14,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 112. [2019-09-07 11:15:14,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-09-07 11:15:14,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 144 transitions. [2019-09-07 11:15:14,786 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 144 transitions. Word has length 95 [2019-09-07 11:15:14,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:15:14,786 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 144 transitions. [2019-09-07 11:15:14,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-07 11:15:14,786 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 144 transitions. [2019-09-07 11:15:14,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-07 11:15:14,790 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:15:14,791 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 14, 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, 1] [2019-09-07 11:15:14,791 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:15:14,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:15:14,791 INFO L82 PathProgramCache]: Analyzing trace with hash -2023990017, now seen corresponding path program 1 times [2019-09-07 11:15:14,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:15:14,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:15:14,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:15:14,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:15:14,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:15:15,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:15:16,078 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 91 proven. 229 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-09-07 11:15:16,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:15:16,078 INFO L223 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-09-07 11:15:16,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:15:16,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:15:16,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 72 conjunts are in the unsatisfiable core [2019-09-07 11:15:16,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:15:16,240 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-09-07 11:15:16,240 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:15:16,249 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:15:16,250 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:15:16,251 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:3 [2019-09-07 11:15:16,566 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:15:16,567 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 42 treesize of output 24 [2019-09-07 11:15:16,567 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:15:16,574 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:15:16,575 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:15:16,575 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:19 [2019-09-07 11:15:16,743 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 23 treesize of output 11 [2019-09-07 11:15:16,744 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:15:16,748 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:15:16,748 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:15:16,749 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:11 [2019-09-07 11:15:16,759 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 13 treesize of output 9 [2019-09-07 11:15:16,759 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:15:16,766 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:15:16,767 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:15:16,767 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:23 [2019-09-07 11:15:17,408 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 7 proven. 362 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-09-07 11:15:17,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:15:17,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 29] total 43 [2019-09-07 11:15:17,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-07 11:15:17,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-07 11:15:17,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1614, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 11:15:17,421 INFO L87 Difference]: Start difference. First operand 112 states and 144 transitions. Second operand 43 states. [2019-09-07 11:15:18,442 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-07 11:15:18,648 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-09-07 11:15:18,913 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-09-07 11:15:23,604 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-07 11:15:24,263 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-09-07 11:15:24,407 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-09-07 11:15:25,456 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-09-07 11:15:25,814 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-07 11:15:29,516 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-09-07 11:15:29,931 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-07 11:15:30,083 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-09-07 11:15:30,551 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-09-07 11:15:32,142 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-09-07 11:15:32,593 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-09-07 11:15:33,195 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-09-07 11:15:33,969 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-09-07 11:15:36,702 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-09-07 11:15:37,315 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-09-07 11:15:37,872 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-07 11:15:38,627 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-09-07 11:15:38,785 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2019-09-07 11:15:39,060 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-09-07 11:15:39,375 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-09-07 11:15:40,039 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-09-07 11:15:40,443 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-09-07 11:15:40,981 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-09-07 11:15:41,831 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2019-09-07 11:15:42,127 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-07 11:15:42,856 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2019-09-07 11:15:43,717 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-09-07 11:15:44,740 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-09-07 11:15:45,190 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-09-07 11:15:45,374 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-09-07 11:15:45,762 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-07 11:15:45,965 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 60 [2019-09-07 11:15:55,224 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-07 11:15:55,425 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 57 [2019-09-07 11:15:56,362 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2019-09-07 11:15:56,569 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 53 [2019-09-07 11:15:57,430 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-09-07 11:15:57,590 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2019-09-07 11:15:57,797 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 58 [2019-09-07 11:15:58,812 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-09-07 11:15:59,922 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-09-07 11:16:00,076 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 54 [2019-09-07 11:16:01,931 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-09-07 11:16:02,579 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-09-07 11:16:02,767 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-09-07 11:16:03,423 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-09-07 11:16:04,178 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2019-09-07 11:16:04,520 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 59 [2019-09-07 11:16:05,437 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-07 11:16:05,604 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 60 [2019-09-07 11:16:05,937 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2019-09-07 11:16:06,259 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 48 [2019-09-07 11:16:06,828 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2019-09-07 11:16:07,619 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-09-07 11:16:07,834 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 58 [2019-09-07 11:16:08,953 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-09-07 11:16:09,601 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 53 [2019-09-07 11:16:09,940 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-09-07 11:16:10,820 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 59 [2019-09-07 11:16:11,020 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 57 [2019-09-07 11:16:11,639 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 60 [2019-09-07 11:16:12,535 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 58 [2019-09-07 11:16:13,050 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 54 [2019-09-07 11:16:13,389 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2019-09-07 11:16:13,888 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-09-07 11:16:14,350 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 66 [2019-09-07 11:16:14,576 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 64 [2019-09-07 11:16:15,179 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 67 [2019-09-07 11:16:15,373 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 60 [2019-09-07 11:16:15,868 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 65 [2019-09-07 11:16:16,453 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 61 [2019-09-07 11:16:16,754 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-09-07 11:16:17,035 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2019-09-07 11:16:17,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:16:17,265 INFO L93 Difference]: Finished difference Result 2102 states and 3120 transitions. [2019-09-07 11:16:17,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 514 states. [2019-09-07 11:16:17,265 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 95 [2019-09-07 11:16:17,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:16:17,275 INFO L225 Difference]: With dead ends: 2102 [2019-09-07 11:16:17,276 INFO L226 Difference]: Without dead ends: 1647 [2019-09-07 11:16:17,339 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 648 GetRequests, 111 SyntacticMatches, 4 SemanticMatches, 533 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130025 ImplicationChecksByTransitivity, 57.1s TimeCoverageRelationStatistics Valid=19735, Invalid=265955, Unknown=0, NotChecked=0, Total=285690 [2019-09-07 11:16:17,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2019-09-07 11:16:17,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 496. [2019-09-07 11:16:17,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2019-09-07 11:16:17,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 703 transitions. [2019-09-07 11:16:17,462 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 703 transitions. Word has length 95 [2019-09-07 11:16:17,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:16:17,462 INFO L475 AbstractCegarLoop]: Abstraction has 496 states and 703 transitions. [2019-09-07 11:16:17,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-07 11:16:17,463 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 703 transitions. [2019-09-07 11:16:17,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-07 11:16:17,466 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:16:17,466 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 14, 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, 1] [2019-09-07 11:16:17,467 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:16:17,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:16:17,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1849084347, now seen corresponding path program 2 times [2019-09-07 11:16:17,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:16:17,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:16:17,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:17,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:16:17,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:17,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:16:18,851 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 201 proven. 99 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-09-07 11:16:18,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:16:18,852 INFO L223 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-09-07 11:16:18,867 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:16:18,934 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:16:18,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:16:18,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 69 conjunts are in the unsatisfiable core [2019-09-07 11:16:18,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:16:18,957 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:16:18,959 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-09-07 11:16:18,960 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:16:18,964 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:16:18,964 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:16:18,964 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-07 11:16:19,228 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:16:19,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:16:19,230 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:16:19,231 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:16:19,232 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 1 case distinctions, treesize of input 44 treesize of output 40 [2019-09-07 11:16:19,233 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:16:19,241 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:16:19,241 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:16:19,241 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:46 [2019-09-07 11:16:19,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:16:19,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:16:19,397 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:16:19,398 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:16:19,399 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:16:19,400 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:16:19,402 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:16:19,402 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 55 [2019-09-07 11:16:19,403 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:16:19,412 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:16:19,413 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:16:19,413 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:70, output treesize:46 [2019-09-07 11:16:19,515 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:16:19,518 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 11:16:19,519 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:16:19,519 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:16:19,520 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:16:19,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:16:19,522 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:16:19,524 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:16:19,524 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 59 treesize of output 61 [2019-09-07 11:16:19,525 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:16:19,543 INFO L567 ElimStorePlain]: treesize reduction 17, result has 73.0 percent of original size [2019-09-07 11:16:19,544 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:16:19,544 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:65, output treesize:46 [2019-09-07 11:16:19,649 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:16:19,650 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:16:19,651 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:16:19,652 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:16:19,652 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 54 treesize of output 38 [2019-09-07 11:16:19,653 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:16:19,660 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:16:19,660 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:16:19,660 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:57, output treesize:38 [2019-09-07 11:16:19,717 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:16:19,718 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:16:19,719 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 1 case distinctions, treesize of input 48 treesize of output 29 [2019-09-07 11:16:19,720 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:16:19,726 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:16:19,727 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:16:19,727 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:23 [2019-09-07 11:16:20,249 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 190 proven. 188 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-07 11:16:20,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:16:20,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 32] total 50 [2019-09-07 11:16:20,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-07 11:16:20,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-07 11:16:20,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=2184, Unknown=0, NotChecked=0, Total=2450 [2019-09-07 11:16:20,256 INFO L87 Difference]: Start difference. First operand 496 states and 703 transitions. Second operand 50 states. [2019-09-07 11:16:22,628 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 38 [2019-09-07 11:16:24,953 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-07 11:16:25,344 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-07 11:16:26,243 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2019-09-07 11:16:26,479 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-09-07 11:16:34,246 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 64 [2019-09-07 11:16:34,395 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-07 11:16:36,160 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-09-07 11:16:36,456 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-07 11:16:36,759 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 65 [2019-09-07 11:16:37,176 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2019-09-07 11:16:37,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:16:37,666 INFO L93 Difference]: Finished difference Result 3328 states and 4908 transitions. [2019-09-07 11:16:37,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2019-09-07 11:16:37,666 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 95 [2019-09-07 11:16:37,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:16:37,683 INFO L225 Difference]: With dead ends: 3328 [2019-09-07 11:16:37,683 INFO L226 Difference]: Without dead ends: 2403 [2019-09-07 11:16:37,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 71 SyntacticMatches, 7 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16377 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=3782, Invalid=38038, Unknown=0, NotChecked=0, Total=41820 [2019-09-07 11:16:37,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2403 states. [2019-09-07 11:16:37,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2403 to 1073. [2019-09-07 11:16:37,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1073 states. [2019-09-07 11:16:37,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 1073 states and 1527 transitions. [2019-09-07 11:16:37,827 INFO L78 Accepts]: Start accepts. Automaton has 1073 states and 1527 transitions. Word has length 95 [2019-09-07 11:16:37,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:16:37,828 INFO L475 AbstractCegarLoop]: Abstraction has 1073 states and 1527 transitions. [2019-09-07 11:16:37,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-07 11:16:37,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1073 states and 1527 transitions. [2019-09-07 11:16:37,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-07 11:16:37,834 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:16:37,834 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 14, 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, 1] [2019-09-07 11:16:37,835 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:16:37,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:16:37,835 INFO L82 PathProgramCache]: Analyzing trace with hash 311055231, now seen corresponding path program 3 times [2019-09-07 11:16:37,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:16:37,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:16:37,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:37,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:16:37,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:16:38,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:16:39,632 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 119 proven. 210 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-09-07 11:16:39,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:16:39,632 INFO L223 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-09-07 11:16:39,642 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 11:16:39,748 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-07 11:16:39,748 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:16:39,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-07 11:16:39,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:16:39,758 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:16:39,758 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-09-07 11:16:39,759 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:16:39,762 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:16:39,763 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:16:39,763 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-07 11:16:40,098 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 62 treesize of output 49 [2019-09-07 11:16:40,100 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:16:40,102 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:16:40,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:16:40,104 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:16:40,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:16:40,107 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:16:40,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:16:40,118 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:16:40,119 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:16:40,120 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:16:40,121 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 35 treesize of output 40 [2019-09-07 11:16:40,121 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-07 11:16:40,126 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:16:40,126 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:16:40,134 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:16:40,134 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:16:40,134 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:46 [2019-09-07 11:16:40,246 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:16:40,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:16:40,250 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:16:40,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:16:40,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:16:40,256 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:16:40,292 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:16:40,293 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 8 case distinctions, treesize of input 64 treesize of output 176 [2019-09-07 11:16:40,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:16:40,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:16:40,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:16:40,296 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:16:40,353 INFO L567 ElimStorePlain]: treesize reduction 247, result has 25.4 percent of original size [2019-09-07 11:16:40,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:16:40,356 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-09-07 11:16:40,356 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:75, output treesize:84 [2019-09-07 11:16:40,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:16:48,434 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 38 [2019-09-07 11:16:48,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,564 WARN L188 SmtUtils]: Spent 20.04 s on a formula simplification that was a NOOP. DAG size: 43 [2019-09-07 11:17:16,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,581 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:17:16,583 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:17:16,590 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:17:16,592 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:17:16,604 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:17:16,606 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:17:16,608 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:17:16,811 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-09-07 11:17:16,811 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:17:16,812 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 95 treesize of output 436 [2019-09-07 11:17:16,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,859 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:17:16,870 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:17:16,872 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:17:16,879 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:17:16,880 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:17:16,949 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:17:16,950 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 232 [2019-09-07 11:17:16,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:16,955 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-07 11:17:17,735 WARN L188 SmtUtils]: Spent 779.00 ms on a formula simplification. DAG size of input: 250 DAG size of output: 72 [2019-09-07 11:17:17,735 INFO L567 ElimStorePlain]: treesize reduction 3824, result has 8.0 percent of original size [2019-09-07 11:17:17,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:17,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:17,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:17,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:17,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:17,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:17,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:17,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:17,741 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-09-07 11:17:17,742 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:167, output treesize:332 [2019-09-07 11:17:17,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:17,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:17,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:17,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:17,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:17,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:17,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:17,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:41,921 WARN L188 SmtUtils]: Spent 24.08 s on a formula simplification that was a NOOP. DAG size: 76 [2019-09-07 11:17:41,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:41,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:41,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:41,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:41,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:41,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:41,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:17:41,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:20:17,134 WARN L188 SmtUtils]: Spent 2.58 m on a formula simplification. DAG size of input: 115 DAG size of output: 73 [2019-09-07 11:20:17,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 11:20:17,149 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-07 11:20:17,149 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:20:17,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:20:17,188 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:20:17,191 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:20:17,194 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:20:17,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:20:17,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:20:17,213 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:20:17,217 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:20:17,219 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:20:17,236 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:20:17,243 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:20:17,257 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:20:17,382 INFO L235 Elim1Store]: Index analysis took 223 ms [2019-09-07 11:20:17,818 WARN L188 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 111 [2019-09-07 11:20:17,819 INFO L341 Elim1Store]: treesize reduction 34, result has 93.3 percent of original size [2019-09-07 11:20:17,820 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 12 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 138 treesize of output 556 [2019-09-07 11:20:17,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:20:17,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:20:17,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:20:17,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:20:17,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:20:17,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:20:17,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:20:17,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:20:17,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:20:17,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:20:17,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:20:17,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:20:17,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:20:17,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:20:17,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:20:17,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:20:17,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:20:17,854 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-07 11:20:17,865 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-07 11:20:17,865 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-07 11:20:17,885 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:20:17,886 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:20:17,887 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:20:17,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:20:17,893 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:20:17,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:20:17,908 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:20:18,061 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-09-07 11:20:18,061 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:20:18,062 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 94 treesize of output 334 [2019-09-07 11:20:18,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:20:18,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:20:18,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:20:18,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:20:18,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:20:18,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:20:18,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:20:18,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:20:18,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:20:18,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:20:18,073 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-07 11:20:18,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:20:18,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:20:18,111 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:20:18,113 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:20:18,150 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:20:18,151 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 123 [2019-09-07 11:20:18,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:20:18,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:20:18,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:20:18,159 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-07 11:20:18,494 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 34 [2019-09-07 11:20:18,495 INFO L567 ElimStorePlain]: treesize reduction 3402, result has 2.7 percent of original size [2019-09-07 11:20:18,496 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:20:18,496 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:509, output treesize:93 [2019-09-07 11:20:20,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:20:20,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:20:20,808 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:20:20,810 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:20:20,811 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:20:20,812 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:20:20,812 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 48 treesize of output 38 [2019-09-07 11:20:20,813 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:20:20,818 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:20:20,819 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:20:20,819 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:23 [2019-09-07 11:20:21,452 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 205 proven. 141 refuted. 1 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-07 11:20:21,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:20:21,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 58 [2019-09-07 11:20:21,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-07 11:20:21,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-07 11:20:21,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=3047, Unknown=8, NotChecked=0, Total=3306 [2019-09-07 11:20:21,457 INFO L87 Difference]: Start difference. First operand 1073 states and 1527 transitions. Second operand 58 states. [2019-09-07 11:20:35,709 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-09-07 11:20:38,316 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 58 [2019-09-07 11:20:38,520 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 62 [2019-09-07 11:20:57,245 WARN L188 SmtUtils]: Spent 2.39 s on a formula simplification. DAG size of input: 77 DAG size of output: 37 [2019-09-07 11:21:01,480 WARN L188 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 100 DAG size of output: 25 [2019-09-07 11:21:13,658 WARN L188 SmtUtils]: Spent 12.10 s on a formula simplification. DAG size of input: 114 DAG size of output: 44 [2019-09-07 11:22:08,167 WARN L188 SmtUtils]: Spent 42.22 s on a formula simplification. DAG size of input: 107 DAG size of output: 92 [2019-09-07 11:22:17,020 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-07 11:22:37,894 WARN L188 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 87 DAG size of output: 65 [2019-09-07 11:23:06,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:23:06,028 INFO L93 Difference]: Finished difference Result 5347 states and 7659 transitions. [2019-09-07 11:23:06,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-09-07 11:23:06,029 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 95 [2019-09-07 11:23:06,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:23:06,049 INFO L225 Difference]: With dead ends: 5347 [2019-09-07 11:23:06,049 INFO L226 Difference]: Without dead ends: 4357 [2019-09-07 11:23:06,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 72 SyntacticMatches, 9 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9200 ImplicationChecksByTransitivity, 304.9s TimeCoverageRelationStatistics Valid=2333, Invalid=24058, Unknown=15, NotChecked=0, Total=26406 [2019-09-07 11:23:06,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4357 states. [2019-09-07 11:23:06,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4357 to 2365. [2019-09-07 11:23:06,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2365 states. [2019-09-07 11:23:06,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2365 states to 2365 states and 3314 transitions. [2019-09-07 11:23:06,467 INFO L78 Accepts]: Start accepts. Automaton has 2365 states and 3314 transitions. Word has length 95 [2019-09-07 11:23:06,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:23:06,467 INFO L475 AbstractCegarLoop]: Abstraction has 2365 states and 3314 transitions. [2019-09-07 11:23:06,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-07 11:23:06,468 INFO L276 IsEmpty]: Start isEmpty. Operand 2365 states and 3314 transitions. [2019-09-07 11:23:06,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-07 11:23:06,481 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:23:06,481 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 14, 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, 1] [2019-09-07 11:23:06,482 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:23:06,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:23:06,482 INFO L82 PathProgramCache]: Analyzing trace with hash -403225797, now seen corresponding path program 4 times [2019-09-07 11:23:06,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:23:06,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:23:06,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:23:06,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:23:06,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:23:06,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:23:08,197 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 97 proven. 274 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-07 11:23:08,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:23:08,198 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:23:08,208 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 11:23:08,276 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:23:08,276 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:23:08,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 67 conjunts are in the unsatisfiable core [2019-09-07 11:23:08,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:23:08,284 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-09-07 11:23:08,284 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:23:08,289 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:23:08,289 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:23:08,289 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-09-07 11:23:08,685 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:23:08,687 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:277) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:146) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.downgradeDimensionsIfNecessary(ArrayOccurrenceAnalysis.java:171) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.computeCostEstimation(ArrayIndexBasedCostEstimation.java:132) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.(ArrayIndexBasedCostEstimation.java:64) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:390) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:453) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-09-07 11:23:08,693 INFO L168 Benchmark]: Toolchain (without parser) took 479528.33 ms. Allocated memory was 141.6 MB in the beginning and 601.4 MB in the end (delta: 459.8 MB). Free memory was 88.9 MB in the beginning and 42.8 MB in the end (delta: 46.1 MB). Peak memory consumption was 505.9 MB. Max. memory is 7.1 GB. [2019-09-07 11:23:08,693 INFO L168 Benchmark]: CDTParser took 0.40 ms. Allocated memory is still 141.6 MB. Free memory was 107.6 MB in the beginning and 107.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-07 11:23:08,693 INFO L168 Benchmark]: CACSL2BoogieTranslator took 233.09 ms. Allocated memory is still 141.6 MB. Free memory was 88.7 MB in the beginning and 78.4 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2019-09-07 11:23:08,694 INFO L168 Benchmark]: Boogie Preprocessor took 125.43 ms. Allocated memory was 141.6 MB in the beginning and 199.2 MB in the end (delta: 57.7 MB). Free memory was 78.4 MB in the beginning and 175.8 MB in the end (delta: -97.5 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. [2019-09-07 11:23:08,694 INFO L168 Benchmark]: RCFGBuilder took 337.46 ms. Allocated memory is still 199.2 MB. Free memory was 175.8 MB in the beginning and 159.7 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 7.1 GB. [2019-09-07 11:23:08,695 INFO L168 Benchmark]: TraceAbstraction took 478819.59 ms. Allocated memory was 199.2 MB in the beginning and 601.4 MB in the end (delta: 402.1 MB). Free memory was 159.1 MB in the beginning and 42.8 MB in the end (delta: 116.3 MB). Peak memory consumption was 518.4 MB. Max. memory is 7.1 GB. [2019-09-07 11:23:08,697 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.40 ms. Allocated memory is still 141.6 MB. Free memory was 107.6 MB in the beginning and 107.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 233.09 ms. Allocated memory is still 141.6 MB. Free memory was 88.7 MB in the beginning and 78.4 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 125.43 ms. Allocated memory was 141.6 MB in the beginning and 199.2 MB in the end (delta: 57.7 MB). Free memory was 78.4 MB in the beginning and 175.8 MB in the end (delta: -97.5 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 337.46 ms. Allocated memory is still 199.2 MB. Free memory was 175.8 MB in the beginning and 159.7 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 478819.59 ms. Allocated memory was 199.2 MB in the beginning and 601.4 MB in the end (delta: 402.1 MB). Free memory was 159.1 MB in the beginning and 42.8 MB in the end (delta: 116.3 MB). Peak memory consumption was 518.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:277) RESULT: Ultimate could not prove your program: Toolchain returned no result. [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...