/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-crafted/zero_sum_m3.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 20:16:57,744 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 20:16:57,747 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 20:16:57,766 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 20:16:57,766 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 20:16:57,767 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 20:16:57,768 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 20:16:57,770 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 20:16:57,771 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 20:16:57,772 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 20:16:57,773 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 20:16:57,774 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 20:16:57,775 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 20:16:57,776 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 20:16:57,777 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 20:16:57,778 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 20:16:57,778 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 20:16:57,779 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 20:16:57,781 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 20:16:57,783 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 20:16:57,785 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 20:16:57,786 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 20:16:57,787 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 20:16:57,788 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 20:16:57,790 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 20:16:57,791 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 20:16:57,791 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 20:16:57,792 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 20:16:57,792 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 20:16:57,793 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 20:16:57,794 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 20:16:57,794 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 20:16:57,795 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 20:16:57,796 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 20:16:57,797 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 20:16:57,797 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 20:16:57,798 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 20:16:57,798 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 20:16:57,798 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 20:16:57,799 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 20:16:57,800 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 20:16:57,801 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-11-23 20:16:57,815 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 20:16:57,815 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 20:16:57,816 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 20:16:57,816 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 20:16:57,816 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 20:16:57,817 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 20:16:57,817 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 20:16:57,817 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 20:16:57,817 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 20:16:57,817 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 20:16:57,818 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 20:16:57,818 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 20:16:57,818 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 20:16:57,818 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 20:16:57,818 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 20:16:57,819 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 20:16:57,819 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 20:16:57,819 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 20:16:57,819 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 20:16:57,819 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 20:16:57,820 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 20:16:57,820 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 20:16:57,820 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:16:57,820 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 20:16:57,820 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 20:16:57,820 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 20:16:57,821 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 20:16:57,821 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 20:16:57,821 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 20:16:57,821 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 20:16:58,097 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 20:16:58,115 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 20:16:58,118 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 20:16:58,120 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 20:16:58,120 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 20:16:58,122 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/zero_sum_m3.c [2019-11-23 20:16:58,198 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e769bcb00/a2016f2219e54a24b1bc8c3b032702c4/FLAG56e8cb593 [2019-11-23 20:16:58,678 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 20:16:58,679 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/zero_sum_m3.c [2019-11-23 20:16:58,686 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e769bcb00/a2016f2219e54a24b1bc8c3b032702c4/FLAG56e8cb593 [2019-11-23 20:16:59,048 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e769bcb00/a2016f2219e54a24b1bc8c3b032702c4 [2019-11-23 20:16:59,058 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 20:16:59,060 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 20:16:59,061 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 20:16:59,061 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 20:16:59,065 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 20:16:59,066 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:16:59" (1/1) ... [2019-11-23 20:16:59,069 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@549a0a9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:16:59, skipping insertion in model container [2019-11-23 20:16:59,069 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:16:59" (1/1) ... [2019-11-23 20:16:59,077 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 20:16:59,095 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 20:16:59,297 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:16:59,304 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 20:16:59,327 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:16:59,434 INFO L208 MainTranslator]: Completed translation [2019-11-23 20:16:59,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:16:59 WrapperNode [2019-11-23 20:16:59,434 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 20:16:59,438 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 20:16:59,438 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 20:16:59,438 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 20:16:59,446 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:16:59" (1/1) ... [2019-11-23 20:16:59,453 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:16:59" (1/1) ... [2019-11-23 20:16:59,480 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 20:16:59,481 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 20:16:59,481 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 20:16:59,481 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 20:16:59,491 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:16:59" (1/1) ... [2019-11-23 20:16:59,491 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:16:59" (1/1) ... [2019-11-23 20:16:59,496 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:16:59" (1/1) ... [2019-11-23 20:16:59,496 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:16:59" (1/1) ... [2019-11-23 20:16:59,509 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:16:59" (1/1) ... [2019-11-23 20:16:59,515 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:16:59" (1/1) ... [2019-11-23 20:16:59,517 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:16:59" (1/1) ... [2019-11-23 20:16:59,519 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 20:16:59,520 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 20:16:59,520 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 20:16:59,520 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 20:16:59,521 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:16:59" (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-11-23 20:16:59,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-23 20:16:59,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 20:16:59,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 20:16:59,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-23 20:16:59,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-23 20:16:59,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-23 20:16:59,875 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 20:16:59,876 INFO L284 CfgBuilder]: Removed 13 assume(true) statements. [2019-11-23 20:16:59,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:16:59 BoogieIcfgContainer [2019-11-23 20:16:59,878 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 20:16:59,879 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 20:16:59,879 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 20:16:59,883 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 20:16:59,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:16:59" (1/3) ... [2019-11-23 20:16:59,884 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15bd60af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:16:59, skipping insertion in model container [2019-11-23 20:16:59,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:16:59" (2/3) ... [2019-11-23 20:16:59,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15bd60af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:16:59, skipping insertion in model container [2019-11-23 20:16:59,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:16:59" (3/3) ... [2019-11-23 20:16:59,887 INFO L109 eAbstractionObserver]: Analyzing ICFG zero_sum_m3.c [2019-11-23 20:16:59,898 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 20:16:59,907 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 20:16:59,919 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 20:16:59,945 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 20:16:59,945 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 20:16:59,945 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 20:16:59,945 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 20:16:59,946 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 20:16:59,946 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 20:16:59,946 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 20:16:59,946 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 20:16:59,964 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-11-23 20:16:59,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-23 20:16:59,972 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:16:59,975 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:16:59,975 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:16:59,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:16:59,982 INFO L82 PathProgramCache]: Analyzing trace with hash 534528496, now seen corresponding path program 1 times [2019-11-23 20:16:59,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:16:59,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711987995] [2019-11-23 20:16:59,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:17:00,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:17:00,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:17:00,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711987995] [2019-11-23 20:17:00,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:17:00,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:17:00,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653639587] [2019-11-23 20:17:00,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-23 20:17:00,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:17:00,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-23 20:17:00,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-23 20:17:00,151 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2019-11-23 20:17:00,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:17:00,169 INFO L93 Difference]: Finished difference Result 59 states and 86 transitions. [2019-11-23 20:17:00,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-23 20:17:00,171 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2019-11-23 20:17:00,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:17:00,179 INFO L225 Difference]: With dead ends: 59 [2019-11-23 20:17:00,179 INFO L226 Difference]: Without dead ends: 27 [2019-11-23 20:17:00,183 INFO L630 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-11-23 20:17:00,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-23 20:17:00,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-23 20:17:00,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-23 20:17:00,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2019-11-23 20:17:00,223 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 19 [2019-11-23 20:17:00,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:17:00,224 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2019-11-23 20:17:00,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-23 20:17:00,224 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2019-11-23 20:17:00,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-23 20:17:00,225 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:17:00,228 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:17:00,230 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:17:00,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:17:00,231 INFO L82 PathProgramCache]: Analyzing trace with hash -697412484, now seen corresponding path program 1 times [2019-11-23 20:17:00,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:17:00,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534159574] [2019-11-23 20:17:00,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:17:00,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:17:00,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:17:00,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534159574] [2019-11-23 20:17:00,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:17:00,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:17:00,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484555999] [2019-11-23 20:17:00,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:17:00,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:17:00,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:17:00,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:17:00,349 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand 4 states. [2019-11-23 20:17:00,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:17:00,405 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2019-11-23 20:17:00,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:17:00,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-11-23 20:17:00,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:17:00,407 INFO L225 Difference]: With dead ends: 42 [2019-11-23 20:17:00,407 INFO L226 Difference]: Without dead ends: 38 [2019-11-23 20:17:00,408 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:17:00,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-23 20:17:00,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-11-23 20:17:00,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-23 20:17:00,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2019-11-23 20:17:00,417 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 19 [2019-11-23 20:17:00,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:17:00,420 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2019-11-23 20:17:00,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:17:00,420 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2019-11-23 20:17:00,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-23 20:17:00,421 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:17:00,421 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:17:00,422 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:17:00,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:17:00,422 INFO L82 PathProgramCache]: Analyzing trace with hash -145263842, now seen corresponding path program 1 times [2019-11-23 20:17:00,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:17:00,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378078289] [2019-11-23 20:17:00,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:17:00,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:17:00,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 20:17:00,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378078289] [2019-11-23 20:17:00,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:17:00,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:17:00,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060646521] [2019-11-23 20:17:00,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:17:00,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:17:00,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:17:00,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:17:00,487 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand 3 states. [2019-11-23 20:17:00,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:17:00,532 INFO L93 Difference]: Finished difference Result 73 states and 95 transitions. [2019-11-23 20:17:00,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:17:00,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-23 20:17:00,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:17:00,534 INFO L225 Difference]: With dead ends: 73 [2019-11-23 20:17:00,534 INFO L226 Difference]: Without dead ends: 40 [2019-11-23 20:17:00,535 INFO L630 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-11-23 20:17:00,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-23 20:17:00,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-11-23 20:17:00,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-23 20:17:00,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2019-11-23 20:17:00,543 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 50 transitions. Word has length 21 [2019-11-23 20:17:00,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:17:00,543 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 50 transitions. [2019-11-23 20:17:00,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:17:00,543 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2019-11-23 20:17:00,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-23 20:17:00,544 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:17:00,545 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:17:00,545 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:17:00,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:17:00,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1250455616, now seen corresponding path program 1 times [2019-11-23 20:17:00,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:17:00,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21909436] [2019-11-23 20:17:00,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:17:00,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:17:00,611 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 20:17:00,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21909436] [2019-11-23 20:17:00,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:17:00,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:17:00,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109702265] [2019-11-23 20:17:00,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:17:00,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:17:00,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:17:00,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:17:00,614 INFO L87 Difference]: Start difference. First operand 39 states and 50 transitions. Second operand 4 states. [2019-11-23 20:17:00,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:17:00,745 INFO L93 Difference]: Finished difference Result 68 states and 88 transitions. [2019-11-23 20:17:00,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:17:00,747 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-11-23 20:17:00,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:17:00,748 INFO L225 Difference]: With dead ends: 68 [2019-11-23 20:17:00,749 INFO L226 Difference]: Without dead ends: 40 [2019-11-23 20:17:00,749 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-11-23 20:17:00,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-23 20:17:00,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2019-11-23 20:17:00,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-23 20:17:00,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2019-11-23 20:17:00,765 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 23 [2019-11-23 20:17:00,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:17:00,765 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2019-11-23 20:17:00,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:17:00,766 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2019-11-23 20:17:00,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-23 20:17:00,767 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:17:00,767 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:17:00,768 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:17:00,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:17:00,769 INFO L82 PathProgramCache]: Analyzing trace with hash 615846698, now seen corresponding path program 1 times [2019-11-23 20:17:00,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:17:00,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241288325] [2019-11-23 20:17:00,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:17:00,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:17:00,899 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:17:00,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241288325] [2019-11-23 20:17:00,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002553330] [2019-11-23 20:17:00,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:17:00,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:17:00,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-23 20:17:00,991 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:17:01,055 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:17:01,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:17:01,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-11-23 20:17:01,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339470489] [2019-11-23 20:17:01,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 20:17:01,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:17:01,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 20:17:01,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:17:01,058 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 6 states. [2019-11-23 20:17:01,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:17:01,137 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2019-11-23 20:17:01,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:17:01,138 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-11-23 20:17:01,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:17:01,139 INFO L225 Difference]: With dead ends: 65 [2019-11-23 20:17:01,139 INFO L226 Difference]: Without dead ends: 37 [2019-11-23 20:17:01,140 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:17:01,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-23 20:17:01,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-11-23 20:17:01,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-23 20:17:01,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2019-11-23 20:17:01,146 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 33 [2019-11-23 20:17:01,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:17:01,146 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2019-11-23 20:17:01,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 20:17:01,146 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2019-11-23 20:17:01,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-23 20:17:01,147 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:17:01,147 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:17:01,350 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:17:01,353 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:17:01,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:17:01,354 INFO L82 PathProgramCache]: Analyzing trace with hash -160084788, now seen corresponding path program 2 times [2019-11-23 20:17:01,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:17:01,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50211226] [2019-11-23 20:17:01,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:17:01,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:17:01,449 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-23 20:17:01,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50211226] [2019-11-23 20:17:01,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828008260] [2019-11-23 20:17:01,449 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:17:01,497 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:17:01,498 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:17:01,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-23 20:17:01,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:17:01,535 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-23 20:17:01,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:17:01,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-11-23 20:17:01,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66117556] [2019-11-23 20:17:01,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 20:17:01,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:17:01,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 20:17:01,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-11-23 20:17:01,541 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand 7 states. [2019-11-23 20:17:01,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:17:01,687 INFO L93 Difference]: Finished difference Result 78 states and 94 transitions. [2019-11-23 20:17:01,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 20:17:01,691 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-11-23 20:17:01,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:17:01,692 INFO L225 Difference]: With dead ends: 78 [2019-11-23 20:17:01,692 INFO L226 Difference]: Without dead ends: 54 [2019-11-23 20:17:01,693 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-11-23 20:17:01,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-23 20:17:01,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 48. [2019-11-23 20:17:01,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-23 20:17:01,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2019-11-23 20:17:01,703 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 35 [2019-11-23 20:17:01,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:17:01,703 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2019-11-23 20:17:01,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 20:17:01,703 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2019-11-23 20:17:01,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-23 20:17:01,704 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:17:01,705 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:17:01,909 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:17:01,910 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:17:01,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:17:01,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1337652904, now seen corresponding path program 3 times [2019-11-23 20:17:01,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:17:01,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313826719] [2019-11-23 20:17:01,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:17:02,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:17:03,557 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:17:03,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313826719] [2019-11-23 20:17:03,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455713122] [2019-11-23 20:17:03,558 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:17:03,623 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-23 20:17:03,623 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:17:03,626 WARN L253 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 68 conjunts are in the unsatisfiable core [2019-11-23 20:17:03,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:17:06,520 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:17:06,520 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 18 [2019-11-23 20:17:06,521 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-23 20:17:06,532 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:17:06,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:06,538 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 20:17:06,539 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:31 [2019-11-23 20:17:06,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:06,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:06,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:06,859 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:17:06,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:17:06,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 37] total 60 [2019-11-23 20:17:06,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172696133] [2019-11-23 20:17:06,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-11-23 20:17:06,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:17:06,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-11-23 20:17:06,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=3322, Unknown=0, NotChecked=0, Total=3540 [2019-11-23 20:17:06,863 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 60 states. [2019-11-23 20:17:12,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:17:12,095 INFO L93 Difference]: Finished difference Result 135 states and 153 transitions. [2019-11-23 20:17:12,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-11-23 20:17:12,096 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 47 [2019-11-23 20:17:12,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:17:12,098 INFO L225 Difference]: With dead ends: 135 [2019-11-23 20:17:12,099 INFO L226 Difference]: Without dead ends: 129 [2019-11-23 20:17:12,103 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1928 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=378, Invalid=6428, Unknown=0, NotChecked=0, Total=6806 [2019-11-23 20:17:12,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-23 20:17:12,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 77. [2019-11-23 20:17:12,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-23 20:17:12,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2019-11-23 20:17:12,116 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 47 [2019-11-23 20:17:12,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:17:12,116 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2019-11-23 20:17:12,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-11-23 20:17:12,116 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2019-11-23 20:17:12,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-23 20:17:12,118 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:17:12,118 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:17:12,321 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:17:12,321 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:17:12,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:17:12,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1235984134, now seen corresponding path program 4 times [2019-11-23 20:17:12,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:17:12,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640712864] [2019-11-23 20:17:12,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:17:12,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:17:12,418 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-23 20:17:12,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640712864] [2019-11-23 20:17:12,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163865955] [2019-11-23 20:17:12,419 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:17:12,480 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 20:17:12,481 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:17:12,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-23 20:17:12,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:17:12,544 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-23 20:17:12,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:17:12,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-11-23 20:17:12,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739999114] [2019-11-23 20:17:12,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-23 20:17:12,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:17:12,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-23 20:17:12,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-23 20:17:12,546 INFO L87 Difference]: Start difference. First operand 77 states and 88 transitions. Second operand 13 states. [2019-11-23 20:17:12,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:17:12,851 INFO L93 Difference]: Finished difference Result 152 states and 174 transitions. [2019-11-23 20:17:12,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-23 20:17:12,852 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 49 [2019-11-23 20:17:12,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:17:12,854 INFO L225 Difference]: With dead ends: 152 [2019-11-23 20:17:12,854 INFO L226 Difference]: Without dead ends: 80 [2019-11-23 20:17:12,855 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2019-11-23 20:17:12,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-23 20:17:12,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-11-23 20:17:12,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-23 20:17:12,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2019-11-23 20:17:12,867 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 49 [2019-11-23 20:17:12,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:17:12,867 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2019-11-23 20:17:12,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-23 20:17:12,868 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2019-11-23 20:17:12,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-23 20:17:12,869 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:17:12,869 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:17:13,073 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:17:13,074 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:17:13,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:17:13,074 INFO L82 PathProgramCache]: Analyzing trace with hash -436136292, now seen corresponding path program 5 times [2019-11-23 20:17:13,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:17:13,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757828549] [2019-11-23 20:17:13,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:17:13,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:17:13,143 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-23 20:17:13,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757828549] [2019-11-23 20:17:13,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116522649] [2019-11-23 20:17:13,144 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:17:13,241 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-11-23 20:17:13,241 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:17:13,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-23 20:17:13,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:17:13,289 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-23 20:17:13,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:17:13,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-11-23 20:17:13,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376798737] [2019-11-23 20:17:13,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-23 20:17:13,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:17:13,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-23 20:17:13,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-11-23 20:17:13,292 INFO L87 Difference]: Start difference. First operand 79 states and 90 transitions. Second operand 13 states. [2019-11-23 20:17:13,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:17:13,571 INFO L93 Difference]: Finished difference Result 125 states and 145 transitions. [2019-11-23 20:17:13,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 20:17:13,572 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 51 [2019-11-23 20:17:13,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:17:13,573 INFO L225 Difference]: With dead ends: 125 [2019-11-23 20:17:13,573 INFO L226 Difference]: Without dead ends: 68 [2019-11-23 20:17:13,575 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2019-11-23 20:17:13,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-23 20:17:13,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 62. [2019-11-23 20:17:13,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-23 20:17:13,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2019-11-23 20:17:13,583 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 51 [2019-11-23 20:17:13,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:17:13,584 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2019-11-23 20:17:13,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-23 20:17:13,584 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2019-11-23 20:17:13,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-23 20:17:13,585 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:17:13,585 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:17:13,789 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:17:13,789 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:17:13,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:17:13,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1781065978, now seen corresponding path program 6 times [2019-11-23 20:17:13,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:17:13,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882587180] [2019-11-23 20:17:13,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:17:13,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:17:14,474 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2019-11-23 20:17:14,608 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 34 [2019-11-23 20:17:14,761 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 37 [2019-11-23 20:17:15,394 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 32 [2019-11-23 20:17:15,542 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 43 [2019-11-23 20:17:16,374 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 34 [2019-11-23 20:17:16,681 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 41 [2019-11-23 20:17:16,855 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 41 [2019-11-23 20:17:17,025 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 38 [2019-11-23 20:17:17,336 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2019-11-23 20:17:17,914 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 39 [2019-11-23 20:17:18,073 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 40 [2019-11-23 20:17:18,225 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 37 [2019-11-23 20:17:20,555 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:17:20,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882587180] [2019-11-23 20:17:20,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493055583] [2019-11-23 20:17:20,556 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:17:20,609 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-11-23 20:17:20,609 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:17:20,611 WARN L253 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 92 conjunts are in the unsatisfiable core [2019-11-23 20:17:20,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:17:24,743 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:17:24,744 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 20:17:24,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:17:24,748 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 20:17:24,750 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 20:17:24,751 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 20:17:24,752 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:17:24,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:17:24,898 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-11-23 20:17:24,899 INFO L343 Elim1Store]: treesize reduction 6, result has 95.6 percent of original size [2019-11-23 20:17:24,900 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 3 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 62 treesize of output 141 [2019-11-23 20:17:24,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:24,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:25,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:25,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:25,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:25,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:25,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:25,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:25,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:25,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:25,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:25,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:25,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:25,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:25,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:25,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:25,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:25,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:25,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:25,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:25,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:25,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:25,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:25,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:25,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:25,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:25,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:25,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:25,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:25,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:25,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:25,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:25,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:25,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:25,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:25,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:25,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:25,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:25,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:25,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:25,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:25,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:25,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:25,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:25,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:25,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:25,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:25,027 INFO L496 ElimStorePlain]: Start of recursive call 2: 17 dim-0 vars, End of recursive call: 38 dim-0 vars, and 4 xjuncts. [2019-11-23 20:17:25,173 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 25 [2019-11-23 20:17:25,174 INFO L567 ElimStorePlain]: treesize reduction 1041, result has 3.4 percent of original size [2019-11-23 20:17:25,175 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 20:17:25,176 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:85, output treesize:24 [2019-11-23 20:17:25,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:25,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:25,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:25,470 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:17:25,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:17:25,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 49] total 101 [2019-11-23 20:17:25,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59120349] [2019-11-23 20:17:25,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-11-23 20:17:25,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:17:25,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-11-23 20:17:25,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1375, Invalid=8725, Unknown=0, NotChecked=0, Total=10100 [2019-11-23 20:17:25,476 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 101 states. [2019-11-23 20:17:26,866 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 49 [2019-11-23 20:17:27,735 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 49 [2019-11-23 20:17:29,027 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-11-23 20:17:29,437 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-11-23 20:17:30,269 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 39 [2019-11-23 20:17:31,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:17:31,167 INFO L93 Difference]: Finished difference Result 115 states and 126 transitions. [2019-11-23 20:17:31,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-11-23 20:17:31,167 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 61 [2019-11-23 20:17:31,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:17:31,168 INFO L225 Difference]: With dead ends: 115 [2019-11-23 20:17:31,168 INFO L226 Difference]: Without dead ends: 111 [2019-11-23 20:17:31,172 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6311 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=1828, Invalid=12452, Unknown=0, NotChecked=0, Total=14280 [2019-11-23 20:17:31,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-23 20:17:31,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 99. [2019-11-23 20:17:31,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-23 20:17:31,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 110 transitions. [2019-11-23 20:17:31,183 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 110 transitions. Word has length 61 [2019-11-23 20:17:31,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:17:31,184 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 110 transitions. [2019-11-23 20:17:31,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-11-23 20:17:31,184 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2019-11-23 20:17:31,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-23 20:17:31,185 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:17:31,186 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:17:31,389 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:17:31,389 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:17:31,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:17:31,390 INFO L82 PathProgramCache]: Analyzing trace with hash 2140781352, now seen corresponding path program 7 times [2019-11-23 20:17:31,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:17:31,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917765866] [2019-11-23 20:17:31,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:17:31,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:17:31,488 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-23 20:17:31,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917765866] [2019-11-23 20:17:31,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909532115] [2019-11-23 20:17:31,489 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:17:31,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:17:31,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-23 20:17:31,540 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:17:31,613 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-23 20:17:31,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:17:31,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2019-11-23 20:17:31,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189934449] [2019-11-23 20:17:31,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-23 20:17:31,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:17:31,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-23 20:17:31,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2019-11-23 20:17:31,615 INFO L87 Difference]: Start difference. First operand 99 states and 110 transitions. Second operand 16 states. [2019-11-23 20:17:31,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:17:31,998 INFO L93 Difference]: Finished difference Result 196 states and 218 transitions. [2019-11-23 20:17:31,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-23 20:17:31,999 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 63 [2019-11-23 20:17:31,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:17:32,000 INFO L225 Difference]: With dead ends: 196 [2019-11-23 20:17:32,000 INFO L226 Difference]: Without dead ends: 102 [2019-11-23 20:17:32,001 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2019-11-23 20:17:32,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-23 20:17:32,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2019-11-23 20:17:32,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-23 20:17:32,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 112 transitions. [2019-11-23 20:17:32,011 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 112 transitions. Word has length 63 [2019-11-23 20:17:32,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:17:32,012 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 112 transitions. [2019-11-23 20:17:32,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-23 20:17:32,012 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 112 transitions. [2019-11-23 20:17:32,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-23 20:17:32,013 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:17:32,013 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:17:32,221 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:17:32,221 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:17:32,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:17:32,221 INFO L82 PathProgramCache]: Analyzing trace with hash -784405174, now seen corresponding path program 8 times [2019-11-23 20:17:32,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:17:32,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290463658] [2019-11-23 20:17:32,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:17:32,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:17:32,319 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-11-23 20:17:32,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290463658] [2019-11-23 20:17:32,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658426032] [2019-11-23 20:17:32,319 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:17:32,363 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:17:32,363 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:17:32,365 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-23 20:17:32,367 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:17:32,436 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-11-23 20:17:32,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:17:32,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2019-11-23 20:17:32,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591739041] [2019-11-23 20:17:32,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-23 20:17:32,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:17:32,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-23 20:17:32,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2019-11-23 20:17:32,438 INFO L87 Difference]: Start difference. First operand 101 states and 112 transitions. Second operand 16 states. [2019-11-23 20:17:32,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:17:32,797 INFO L93 Difference]: Finished difference Result 155 states and 175 transitions. [2019-11-23 20:17:32,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-23 20:17:32,798 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 65 [2019-11-23 20:17:32,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:17:32,799 INFO L225 Difference]: With dead ends: 155 [2019-11-23 20:17:32,799 INFO L226 Difference]: Without dead ends: 82 [2019-11-23 20:17:32,800 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2019-11-23 20:17:32,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-23 20:17:32,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76. [2019-11-23 20:17:32,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-23 20:17:32,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2019-11-23 20:17:32,807 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 65 [2019-11-23 20:17:32,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:17:32,807 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2019-11-23 20:17:32,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-23 20:17:32,807 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2019-11-23 20:17:32,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-23 20:17:32,808 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:17:32,809 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:17:33,012 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:17:33,012 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:17:33,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:17:33,013 INFO L82 PathProgramCache]: Analyzing trace with hash 958143540, now seen corresponding path program 9 times [2019-11-23 20:17:33,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:17:33,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674990234] [2019-11-23 20:17:33,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:17:33,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:17:34,077 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 23 [2019-11-23 20:17:34,283 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 37 [2019-11-23 20:17:34,462 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 34 [2019-11-23 20:17:34,684 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 38 [2019-11-23 20:17:34,889 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 35 [2019-11-23 20:17:35,096 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2019-11-23 20:17:35,326 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 34 [2019-11-23 20:17:35,514 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 34 [2019-11-23 20:17:35,692 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 30 [2019-11-23 20:17:35,869 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 32 [2019-11-23 20:17:36,039 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 36 [2019-11-23 20:17:36,236 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 42 [2019-11-23 20:17:36,439 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 39 [2019-11-23 20:17:36,637 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 46 [2019-11-23 20:17:36,841 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2019-11-23 20:17:37,020 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 44 [2019-11-23 20:17:37,190 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2019-11-23 20:17:37,391 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 38 [2019-11-23 20:17:37,530 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 33 [2019-11-23 20:17:37,692 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2019-11-23 20:17:37,876 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 39 [2019-11-23 20:17:38,076 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 49 [2019-11-23 20:17:38,275 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 40 [2019-11-23 20:17:38,468 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 48 [2019-11-23 20:17:38,664 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 45 [2019-11-23 20:17:38,825 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2019-11-23 20:17:39,597 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 41 [2019-11-23 20:17:39,788 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 44 [2019-11-23 20:17:39,981 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 41 [2019-11-23 20:17:40,181 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 44 [2019-11-23 20:17:40,381 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 41 [2019-11-23 20:17:41,182 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-11-23 20:17:43,352 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 1 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:17:43,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674990234] [2019-11-23 20:17:43,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858606405] [2019-11-23 20:17:43,353 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:17:43,410 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-23 20:17:43,410 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:17:43,412 WARN L253 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 118 conjunts are in the unsatisfiable core [2019-11-23 20:17:43,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:17:43,481 INFO L377 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-11-23 20:17:43,481 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:17:43,489 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:17:43,489 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:17:43,490 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2019-11-23 20:17:52,392 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:17:52,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:17:52,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:17:52,411 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:17:52,411 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 51 [2019-11-23 20:17:52,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:52,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:52,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:52,414 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2019-11-23 20:17:52,449 INFO L567 ElimStorePlain]: treesize reduction 50, result has 34.2 percent of original size [2019-11-23 20:17:52,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:52,451 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 20:17:52,451 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:18 [2019-11-23 20:17:52,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:52,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:52,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:17:52,935 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 7 proven. 96 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-23 20:17:52,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:17:52,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 56] total 118 [2019-11-23 20:17:52,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731649573] [2019-11-23 20:17:52,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-11-23 20:17:52,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:17:52,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-11-23 20:17:52,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1066, Invalid=12740, Unknown=0, NotChecked=0, Total=13806 [2019-11-23 20:17:52,941 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 118 states. [2019-11-23 20:17:56,885 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-11-23 20:17:59,587 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 60 [2019-11-23 20:18:00,684 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2019-11-23 20:18:04,254 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 69 [2019-11-23 20:18:05,536 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 89 [2019-11-23 20:18:09,232 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 78 [2019-11-23 20:18:09,721 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 73 [2019-11-23 20:18:10,743 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 93 [2019-11-23 20:18:14,564 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 79 [2019-11-23 20:18:18,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:18:18,477 INFO L93 Difference]: Finished difference Result 137 states and 148 transitions. [2019-11-23 20:18:18,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-11-23 20:18:18,477 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 75 [2019-11-23 20:18:18,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:18:18,479 INFO L225 Difference]: With dead ends: 137 [2019-11-23 20:18:18,479 INFO L226 Difference]: Without dead ends: 133 [2019-11-23 20:18:18,486 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 21 SyntacticMatches, 8 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11020 ImplicationChecksByTransitivity, 35.0s TimeCoverageRelationStatistics Valid=2595, Invalid=30711, Unknown=0, NotChecked=0, Total=33306 [2019-11-23 20:18:18,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-23 20:18:18,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 121. [2019-11-23 20:18:18,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-23 20:18:18,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 132 transitions. [2019-11-23 20:18:18,497 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 132 transitions. Word has length 75 [2019-11-23 20:18:18,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:18:18,498 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 132 transitions. [2019-11-23 20:18:18,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-11-23 20:18:18,498 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 132 transitions. [2019-11-23 20:18:18,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-23 20:18:18,499 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:18:18,500 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:18:18,703 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:18:18,704 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:18:18,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:18:18,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1706175702, now seen corresponding path program 10 times [2019-11-23 20:18:18,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:18:18,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308279328] [2019-11-23 20:18:18,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:18:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:18:18,814 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-23 20:18:18,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308279328] [2019-11-23 20:18:18,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082349647] [2019-11-23 20:18:18,815 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:18:18,875 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 20:18:18,875 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:18:18,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-23 20:18:18,880 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:18:18,971 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 25 proven. 16 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-23 20:18:18,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:18:18,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2019-11-23 20:18:18,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641104912] [2019-11-23 20:18:18,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-23 20:18:18,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:18:18,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-23 20:18:18,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-11-23 20:18:18,972 INFO L87 Difference]: Start difference. First operand 121 states and 132 transitions. Second operand 19 states. [2019-11-23 20:18:19,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:18:19,451 INFO L93 Difference]: Finished difference Result 240 states and 262 transitions. [2019-11-23 20:18:19,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-23 20:18:19,452 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 77 [2019-11-23 20:18:19,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:18:19,453 INFO L225 Difference]: With dead ends: 240 [2019-11-23 20:18:19,453 INFO L226 Difference]: Without dead ends: 124 [2019-11-23 20:18:19,454 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=456, Unknown=0, NotChecked=0, Total=600 [2019-11-23 20:18:19,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-11-23 20:18:19,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2019-11-23 20:18:19,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-11-23 20:18:19,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2019-11-23 20:18:19,462 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 134 transitions. Word has length 77 [2019-11-23 20:18:19,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:18:19,463 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 134 transitions. [2019-11-23 20:18:19,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-23 20:18:19,463 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2019-11-23 20:18:19,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-23 20:18:19,464 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:18:19,464 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:18:19,667 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:18:19,668 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:18:19,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:18:19,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1014758264, now seen corresponding path program 11 times [2019-11-23 20:18:19,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:18:19,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680641936] [2019-11-23 20:18:19,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:18:19,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:18:19,792 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 9 proven. 32 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-11-23 20:18:19,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680641936] [2019-11-23 20:18:19,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639293701] [2019-11-23 20:18:19,793 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:18:20,288 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-23 20:18:20,288 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:18:20,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-23 20:18:20,290 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:18:20,423 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 25 proven. 16 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-11-23 20:18:20,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:18:20,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2019-11-23 20:18:20,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434720902] [2019-11-23 20:18:20,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-23 20:18:20,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:18:20,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-23 20:18:20,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2019-11-23 20:18:20,425 INFO L87 Difference]: Start difference. First operand 123 states and 134 transitions. Second operand 24 states. [2019-11-23 20:18:21,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:18:21,010 INFO L93 Difference]: Finished difference Result 185 states and 205 transitions. [2019-11-23 20:18:21,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-23 20:18:21,011 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 79 [2019-11-23 20:18:21,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:18:21,012 INFO L225 Difference]: With dead ends: 185 [2019-11-23 20:18:21,012 INFO L226 Difference]: Without dead ends: 96 [2019-11-23 20:18:21,013 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=737, Unknown=0, NotChecked=0, Total=930 [2019-11-23 20:18:21,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-23 20:18:21,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2019-11-23 20:18:21,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-23 20:18:21,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2019-11-23 20:18:21,019 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 79 [2019-11-23 20:18:21,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:18:21,019 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2019-11-23 20:18:21,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-23 20:18:21,019 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2019-11-23 20:18:21,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-23 20:18:21,020 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:18:21,021 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:18:21,229 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:18:21,229 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:18:21,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:18:21,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1296238366, now seen corresponding path program 12 times [2019-11-23 20:18:21,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:18:21,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407655373] [2019-11-23 20:18:21,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:18:21,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:18:22,510 WARN L192 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 18 [2019-11-23 20:18:22,871 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 23 [2019-11-23 20:18:23,098 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 26 [2019-11-23 20:18:23,325 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 31 [2019-11-23 20:18:23,553 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 33 [2019-11-23 20:18:23,801 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 36 [2019-11-23 20:18:24,055 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 38 [2019-11-23 20:18:24,314 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 41 [2019-11-23 20:18:24,608 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 41 [2019-11-23 20:18:24,865 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 37 [2019-11-23 20:18:25,120 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 38 [2019-11-23 20:18:25,360 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 33 [2019-11-23 20:18:25,606 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 41 [2019-11-23 20:18:25,841 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 36 [2019-11-23 20:18:26,113 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 47 [2019-11-23 20:18:26,375 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 42 [2019-11-23 20:18:26,658 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 51 [2019-11-23 20:18:26,928 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 47 [2019-11-23 20:18:27,206 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 49 [2019-11-23 20:18:27,473 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 46 [2019-11-23 20:18:27,746 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 49 [2019-11-23 20:18:27,997 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 42 [2019-11-23 20:18:28,246 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 43 [2019-11-23 20:18:28,457 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 38 [2019-11-23 20:18:28,710 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 46 [2019-11-23 20:18:28,947 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 42 [2019-11-23 20:18:29,210 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 50 [2019-11-23 20:18:29,463 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 46 [2019-11-23 20:18:29,722 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 52 [2019-11-23 20:18:29,983 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 49 [2019-11-23 20:18:30,234 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 51 [2019-11-23 20:18:30,483 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 46 [2019-11-23 20:18:30,713 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 47 [2019-11-23 20:18:30,948 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 43 [2019-11-23 20:18:31,174 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 43 [2019-11-23 20:18:31,364 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 39 [2019-11-23 20:18:31,576 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 45 [2019-11-23 20:18:31,782 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 41 [2019-11-23 20:18:32,021 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 49 [2019-11-23 20:18:32,267 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 46 [2019-11-23 20:18:32,539 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 48 [2019-11-23 20:18:32,796 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 45 [2019-11-23 20:18:33,057 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 49 [2019-11-23 20:18:33,296 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 48 [2019-11-23 20:18:33,519 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-11-23 20:18:33,912 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 39 [2019-11-23 20:18:34,143 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 47 [2019-11-23 20:18:34,378 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 44 [2019-11-23 20:18:34,608 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-11-23 20:18:34,835 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 44 [2019-11-23 20:18:35,055 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-11-23 20:18:35,272 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2019-11-23 20:18:35,478 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 40 [2019-11-23 20:18:37,282 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 4 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:18:37,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407655373] [2019-11-23 20:18:37,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246119837] [2019-11-23 20:18:37,282 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:18:37,351 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-11-23 20:18:37,351 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:18:37,355 WARN L253 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 140 conjunts are in the unsatisfiable core [2019-11-23 20:18:37,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:18:37,402 INFO L377 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-11-23 20:18:37,402 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:18:37,411 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:18:37,412 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:18:37,412 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10