/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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-tiling/pr4.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 18:53:34,330 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 18:53:34,332 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 18:53:34,350 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 18:53:34,350 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 18:53:34,352 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 18:53:34,354 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 18:53:34,363 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 18:53:34,368 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 18:53:34,370 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 18:53:34,372 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 18:53:34,374 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 18:53:34,374 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 18:53:34,376 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 18:53:34,377 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 18:53:34,379 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 18:53:34,381 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 18:53:34,382 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 18:53:34,384 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 18:53:34,388 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 18:53:34,392 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 18:53:34,394 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 18:53:34,398 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 18:53:34,398 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 18:53:34,400 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 18:53:34,401 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 18:53:34,401 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 18:53:34,402 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 18:53:34,403 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 18:53:34,405 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 18:53:34,405 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 18:53:34,407 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 18:53:34,408 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 18:53:34,408 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 18:53:34,411 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 18:53:34,411 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 18:53:34,411 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 18:53:34,412 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 18:53:34,412 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 18:53:34,413 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 18:53:34,413 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 18:53:34,414 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-06 18:53:34,440 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 18:53:34,441 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 18:53:34,442 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 18:53:34,447 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 18:53:34,447 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 18:53:34,447 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 18:53:34,447 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 18:53:34,450 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 18:53:34,450 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 18:53:34,450 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 18:53:34,450 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 18:53:34,450 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 18:53:34,451 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 18:53:34,451 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 18:53:34,451 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 18:53:34,451 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 18:53:34,451 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 18:53:34,452 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 18:53:34,452 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 18:53:34,453 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 18:53:34,453 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 18:53:34,453 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 18:53:34,453 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 18:53:34,454 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 18:53:34,454 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 18:53:34,454 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 18:53:34,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 18:53:34,454 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 18:53:34,455 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 18:53:34,732 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 18:53:34,750 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 18:53:34,755 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 18:53:34,756 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 18:53:34,756 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 18:53:34,757 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/pr4.c [2019-11-06 18:53:34,822 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afdcccc73/debb7185f3f84a479d66bc310ca4e1a9/FLAG64fb2e504 [2019-11-06 18:53:35,274 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 18:53:35,275 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/pr4.c [2019-11-06 18:53:35,282 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afdcccc73/debb7185f3f84a479d66bc310ca4e1a9/FLAG64fb2e504 [2019-11-06 18:53:35,651 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afdcccc73/debb7185f3f84a479d66bc310ca4e1a9 [2019-11-06 18:53:35,662 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 18:53:35,664 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 18:53:35,666 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 18:53:35,667 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 18:53:35,671 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 18:53:35,672 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:53:35" (1/1) ... [2019-11-06 18:53:35,675 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6deb8361 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:35, skipping insertion in model container [2019-11-06 18:53:35,675 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:53:35" (1/1) ... [2019-11-06 18:53:35,684 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 18:53:35,704 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 18:53:35,905 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 18:53:35,918 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 18:53:35,963 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 18:53:36,094 INFO L192 MainTranslator]: Completed translation [2019-11-06 18:53:36,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:36 WrapperNode [2019-11-06 18:53:36,096 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 18:53:36,096 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 18:53:36,096 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 18:53:36,096 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 18:53:36,107 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:36" (1/1) ... [2019-11-06 18:53:36,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:36" (1/1) ... [2019-11-06 18:53:36,115 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:36" (1/1) ... [2019-11-06 18:53:36,115 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:36" (1/1) ... [2019-11-06 18:53:36,124 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:36" (1/1) ... [2019-11-06 18:53:36,130 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:36" (1/1) ... [2019-11-06 18:53:36,131 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:36" (1/1) ... [2019-11-06 18:53:36,135 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 18:53:36,136 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 18:53:36,136 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 18:53:36,136 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 18:53:36,140 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:36" (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-06 18:53:36,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 18:53:36,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 18:53:36,190 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-06 18:53:36,190 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 18:53:36,190 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 18:53:36,190 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-06 18:53:36,190 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-06 18:53:36,191 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 18:53:36,193 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 18:53:36,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-06 18:53:36,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-06 18:53:36,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-06 18:53:36,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-06 18:53:36,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 18:53:36,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 18:53:36,568 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 18:53:36,569 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-06 18:53:36,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:53:36 BoogieIcfgContainer [2019-11-06 18:53:36,570 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 18:53:36,571 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 18:53:36,571 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 18:53:36,574 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 18:53:36,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 06:53:35" (1/3) ... [2019-11-06 18:53:36,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a7e7af8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:53:36, skipping insertion in model container [2019-11-06 18:53:36,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:36" (2/3) ... [2019-11-06 18:53:36,576 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a7e7af8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:53:36, skipping insertion in model container [2019-11-06 18:53:36,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:53:36" (3/3) ... [2019-11-06 18:53:36,579 INFO L109 eAbstractionObserver]: Analyzing ICFG pr4.c [2019-11-06 18:53:36,589 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 18:53:36,597 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 18:53:36,609 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 18:53:36,634 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 18:53:36,634 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 18:53:36,634 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 18:53:36,634 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 18:53:36,634 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 18:53:36,635 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 18:53:36,635 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 18:53:36,635 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 18:53:36,651 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-11-06 18:53:36,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-06 18:53:36,657 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:53:36,657 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:53:36,659 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:53:36,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:53:36,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1387739323, now seen corresponding path program 1 times [2019-11-06 18:53:36,670 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:53:36,671 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109926187] [2019-11-06 18:53:36,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:53:36,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:36,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:36,941 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-06 18:53:36,942 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109926187] [2019-11-06 18:53:36,943 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 18:53:36,944 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 18:53:36,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378853114] [2019-11-06 18:53:36,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 18:53:36,949 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:53:36,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 18:53:36,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 18:53:36,966 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 6 states. [2019-11-06 18:53:37,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:53:37,170 INFO L93 Difference]: Finished difference Result 56 states and 73 transitions. [2019-11-06 18:53:37,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 18:53:37,172 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-06 18:53:37,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:53:37,183 INFO L225 Difference]: With dead ends: 56 [2019-11-06 18:53:37,183 INFO L226 Difference]: Without dead ends: 32 [2019-11-06 18:53:37,187 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-06 18:53:37,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-06 18:53:37,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-11-06 18:53:37,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-06 18:53:37,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2019-11-06 18:53:37,236 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 16 [2019-11-06 18:53:37,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:53:37,237 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2019-11-06 18:53:37,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 18:53:37,237 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2019-11-06 18:53:37,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-06 18:53:37,238 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:53:37,238 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:53:37,239 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:53:37,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:53:37,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1385892281, now seen corresponding path program 1 times [2019-11-06 18:53:37,240 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:53:37,240 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007238559] [2019-11-06 18:53:37,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:53:37,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:37,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:37,470 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-06 18:53:37,470 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007238559] [2019-11-06 18:53:37,471 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 18:53:37,471 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 18:53:37,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798166960] [2019-11-06 18:53:37,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 18:53:37,475 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:53:37,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 18:53:37,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-06 18:53:37,476 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand 5 states. [2019-11-06 18:53:37,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:53:37,665 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2019-11-06 18:53:37,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 18:53:37,666 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-06 18:53:37,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:53:37,669 INFO L225 Difference]: With dead ends: 54 [2019-11-06 18:53:37,670 INFO L226 Difference]: Without dead ends: 37 [2019-11-06 18:53:37,671 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-06 18:53:37,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-06 18:53:37,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2019-11-06 18:53:37,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-06 18:53:37,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2019-11-06 18:53:37,679 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 16 [2019-11-06 18:53:37,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:53:37,680 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2019-11-06 18:53:37,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 18:53:37,680 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2019-11-06 18:53:37,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-06 18:53:37,681 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:53:37,681 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] [2019-11-06 18:53:37,682 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:53:37,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:53:37,682 INFO L82 PathProgramCache]: Analyzing trace with hash 830594452, now seen corresponding path program 1 times [2019-11-06 18:53:37,682 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:53:37,683 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32618932] [2019-11-06 18:53:37,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:53:37,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:38,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:38,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:53:38,096 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32618932] [2019-11-06 18:53:38,097 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215947953] [2019-11-06 18:53:38,097 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-06 18:53:38,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:38,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-06 18:53:38,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:53:38,238 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-06 18:53:38,239 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:38,263 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:38,264 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-06 18:53:38,265 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-06 18:53:38,309 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:38,310 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-11-06 18:53:38,311 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:38,320 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:38,321 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-06 18:53:38,321 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-11-06 18:53:38,329 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:38,331 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-11-06 18:53:38,332 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:38,341 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:38,342 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-06 18:53:38,342 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-11-06 18:53:38,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:38,351 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-06 18:53:38,352 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:38,359 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:38,359 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-06 18:53:38,360 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:11 [2019-11-06 18:53:38,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:53:38,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:53:38,439 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:53:38,439 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2019-11-06 18:53:38,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198715855] [2019-11-06 18:53:38,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-06 18:53:38,442 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:53:38,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-06 18:53:38,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-11-06 18:53:38,443 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 16 states. [2019-11-06 18:53:39,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:53:39,186 INFO L93 Difference]: Finished difference Result 107 states and 144 transitions. [2019-11-06 18:53:39,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-06 18:53:39,187 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-11-06 18:53:39,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:53:39,190 INFO L225 Difference]: With dead ends: 107 [2019-11-06 18:53:39,190 INFO L226 Difference]: Without dead ends: 91 [2019-11-06 18:53:39,192 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=220, Invalid=710, Unknown=0, NotChecked=0, Total=930 [2019-11-06 18:53:39,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-06 18:53:39,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 41. [2019-11-06 18:53:39,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-06 18:53:39,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2019-11-06 18:53:39,209 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 22 [2019-11-06 18:53:39,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:53:39,210 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2019-11-06 18:53:39,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-06 18:53:39,210 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2019-11-06 18:53:39,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-06 18:53:39,211 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:53:39,211 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] [2019-11-06 18:53:39,418 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:53:39,418 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:53:39,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:53:39,418 INFO L82 PathProgramCache]: Analyzing trace with hash 243788438, now seen corresponding path program 1 times [2019-11-06 18:53:39,418 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:53:39,419 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214811477] [2019-11-06 18:53:39,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:53:39,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:39,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:53:39,520 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214811477] [2019-11-06 18:53:39,520 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 18:53:39,521 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 18:53:39,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034986881] [2019-11-06 18:53:39,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 18:53:39,522 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:53:39,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 18:53:39,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 18:53:39,522 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand 5 states. [2019-11-06 18:53:39,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:53:39,633 INFO L93 Difference]: Finished difference Result 70 states and 90 transitions. [2019-11-06 18:53:39,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 18:53:39,635 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-06 18:53:39,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:53:39,636 INFO L225 Difference]: With dead ends: 70 [2019-11-06 18:53:39,637 INFO L226 Difference]: Without dead ends: 47 [2019-11-06 18:53:39,637 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 18:53:39,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-06 18:53:39,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2019-11-06 18:53:39,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-06 18:53:39,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2019-11-06 18:53:39,657 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 22 [2019-11-06 18:53:39,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:53:39,658 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2019-11-06 18:53:39,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 18:53:39,658 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2019-11-06 18:53:39,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-06 18:53:39,660 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:53:39,660 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] [2019-11-06 18:53:39,660 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:53:39,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:53:39,660 INFO L82 PathProgramCache]: Analyzing trace with hash -149238572, now seen corresponding path program 1 times [2019-11-06 18:53:39,661 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:53:39,661 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091690773] [2019-11-06 18:53:39,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:53:39,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:39,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:53:39,734 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091690773] [2019-11-06 18:53:39,734 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 18:53:39,735 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 18:53:39,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916629491] [2019-11-06 18:53:39,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 18:53:39,741 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:53:39,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 18:53:39,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 18:53:39,741 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand 5 states. [2019-11-06 18:53:39,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:53:39,849 INFO L93 Difference]: Finished difference Result 70 states and 88 transitions. [2019-11-06 18:53:39,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 18:53:39,850 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-06 18:53:39,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:53:39,851 INFO L225 Difference]: With dead ends: 70 [2019-11-06 18:53:39,852 INFO L226 Difference]: Without dead ends: 47 [2019-11-06 18:53:39,852 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 18:53:39,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-06 18:53:39,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2019-11-06 18:53:39,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-06 18:53:39,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2019-11-06 18:53:39,860 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 22 [2019-11-06 18:53:39,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:53:39,860 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2019-11-06 18:53:39,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 18:53:39,861 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2019-11-06 18:53:39,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-06 18:53:39,861 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:53:39,861 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] [2019-11-06 18:53:39,862 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:53:39,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:53:39,862 INFO L82 PathProgramCache]: Analyzing trace with hash 551826006, now seen corresponding path program 1 times [2019-11-06 18:53:39,862 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:53:39,863 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273326108] [2019-11-06 18:53:39,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:53:39,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:40,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:40,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:53:40,038 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273326108] [2019-11-06 18:53:40,038 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654443726] [2019-11-06 18:53:40,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-06 18:53:40,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:40,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-06 18:53:40,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:53:40,103 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-06 18:53:40,103 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:40,109 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:40,110 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:53:40,110 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-06 18:53:40,123 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2019-11-06 18:53:40,127 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:40,131 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:40,134 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:40,137 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2019-11-06 18:53:40,138 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:40,144 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:40,144 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:53:40,152 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:40,153 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-06 18:53:40,153 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:19 [2019-11-06 18:53:40,182 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2019-11-06 18:53:40,187 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:40,188 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:40,190 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:40,192 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:40,195 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2019-11-06 18:53:40,195 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:40,201 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:40,201 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:53:40,210 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:40,211 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-06 18:53:40,211 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:31 [2019-11-06 18:53:40,246 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:40,248 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:40,250 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:40,252 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:40,252 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-11-06 18:53:40,254 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:40,262 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:40,262 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:53:40,262 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-11-06 18:53:40,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:53:40,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:53:40,343 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:53:40,344 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2019-11-06 18:53:40,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788878535] [2019-11-06 18:53:40,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-06 18:53:40,345 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:53:40,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-06 18:53:40,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-11-06 18:53:40,346 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand 16 states. [2019-11-06 18:53:40,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:53:40,943 INFO L93 Difference]: Finished difference Result 84 states and 109 transitions. [2019-11-06 18:53:40,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-06 18:53:40,944 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-11-06 18:53:40,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:53:40,945 INFO L225 Difference]: With dead ends: 84 [2019-11-06 18:53:40,945 INFO L226 Difference]: Without dead ends: 82 [2019-11-06 18:53:40,946 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 17 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2019-11-06 18:53:40,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-06 18:53:40,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 51. [2019-11-06 18:53:40,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-06 18:53:40,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2019-11-06 18:53:40,955 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 65 transitions. Word has length 22 [2019-11-06 18:53:40,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:53:40,956 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 65 transitions. [2019-11-06 18:53:40,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-06 18:53:40,956 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2019-11-06 18:53:40,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-06 18:53:40,957 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:53:40,957 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:53:41,160 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:53:41,161 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:53:41,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:53:41,161 INFO L82 PathProgramCache]: Analyzing trace with hash -927487005, now seen corresponding path program 1 times [2019-11-06 18:53:41,162 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:53:41,162 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054654266] [2019-11-06 18:53:41,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:53:41,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:41,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:41,212 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:53:41,212 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054654266] [2019-11-06 18:53:41,213 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 18:53:41,213 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 18:53:41,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425837540] [2019-11-06 18:53:41,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 18:53:41,214 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:53:41,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 18:53:41,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 18:53:41,214 INFO L87 Difference]: Start difference. First operand 51 states and 65 transitions. Second operand 4 states. [2019-11-06 18:53:41,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:53:41,296 INFO L93 Difference]: Finished difference Result 80 states and 101 transitions. [2019-11-06 18:53:41,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 18:53:41,297 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-11-06 18:53:41,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:53:41,298 INFO L225 Difference]: With dead ends: 80 [2019-11-06 18:53:41,298 INFO L226 Difference]: Without dead ends: 57 [2019-11-06 18:53:41,299 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 18:53:41,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-06 18:53:41,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2019-11-06 18:53:41,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-06 18:53:41,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2019-11-06 18:53:41,307 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 28 [2019-11-06 18:53:41,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:53:41,307 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2019-11-06 18:53:41,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 18:53:41,308 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2019-11-06 18:53:41,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-06 18:53:41,309 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:53:41,309 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:53:41,309 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:53:41,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:53:41,309 INFO L82 PathProgramCache]: Analyzing trace with hash -344073693, now seen corresponding path program 1 times [2019-11-06 18:53:41,310 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:53:41,310 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805626326] [2019-11-06 18:53:41,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:53:41,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:41,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:41,346 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:53:41,347 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805626326] [2019-11-06 18:53:41,347 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 18:53:41,347 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 18:53:41,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914614594] [2019-11-06 18:53:41,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 18:53:41,349 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:53:41,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 18:53:41,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 18:53:41,350 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand 4 states. [2019-11-06 18:53:41,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:53:41,434 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2019-11-06 18:53:41,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 18:53:41,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-11-06 18:53:41,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:53:41,436 INFO L225 Difference]: With dead ends: 73 [2019-11-06 18:53:41,436 INFO L226 Difference]: Without dead ends: 50 [2019-11-06 18:53:41,436 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 18:53:41,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-06 18:53:41,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2019-11-06 18:53:41,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-06 18:53:41,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2019-11-06 18:53:41,444 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 28 [2019-11-06 18:53:41,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:53:41,444 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2019-11-06 18:53:41,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 18:53:41,444 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2019-11-06 18:53:41,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-06 18:53:41,445 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:53:41,445 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:53:41,446 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:53:41,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:53:41,446 INFO L82 PathProgramCache]: Analyzing trace with hash -183866139, now seen corresponding path program 1 times [2019-11-06 18:53:41,446 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:53:41,446 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911069431] [2019-11-06 18:53:41,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:53:41,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:41,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:41,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:41,616 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:53:41,617 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911069431] [2019-11-06 18:53:41,617 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814507820] [2019-11-06 18:53:41,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-06 18:53:41,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:41,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-06 18:53:41,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:53:41,741 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-06 18:53:41,741 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:41,750 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:41,750 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-06 18:53:41,751 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-11-06 18:53:41,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:41,786 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-11-06 18:53:41,786 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:41,795 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:41,796 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-06 18:53:41,796 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-11-06 18:53:41,802 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:41,803 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-06 18:53:41,804 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:41,812 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:41,813 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-06 18:53:41,813 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 [2019-11-06 18:53:41,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:53:41,955 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:53:41,956 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:53:41,956 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2019-11-06 18:53:41,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908210741] [2019-11-06 18:53:41,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-06 18:53:41,957 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:53:41,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-06 18:53:41,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-11-06 18:53:41,958 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 18 states. [2019-11-06 18:53:45,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:53:45,303 INFO L93 Difference]: Finished difference Result 146 states and 184 transitions. [2019-11-06 18:53:45,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-06 18:53:45,304 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 31 [2019-11-06 18:53:45,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:53:45,306 INFO L225 Difference]: With dead ends: 146 [2019-11-06 18:53:45,306 INFO L226 Difference]: Without dead ends: 121 [2019-11-06 18:53:45,308 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=328, Invalid=1232, Unknown=0, NotChecked=0, Total=1560 [2019-11-06 18:53:45,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-06 18:53:45,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 72. [2019-11-06 18:53:45,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-06 18:53:45,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 86 transitions. [2019-11-06 18:53:45,322 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 86 transitions. Word has length 31 [2019-11-06 18:53:45,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:53:45,323 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 86 transitions. [2019-11-06 18:53:45,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-06 18:53:45,323 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 86 transitions. [2019-11-06 18:53:45,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-06 18:53:45,325 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:53:45,325 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:53:45,533 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:53:45,534 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:53:45,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:53:45,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1823363683, now seen corresponding path program 1 times [2019-11-06 18:53:45,535 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:53:45,535 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909362725] [2019-11-06 18:53:45,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:53:45,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:45,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:45,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:45,654 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:53:45,655 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909362725] [2019-11-06 18:53:45,655 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543235588] [2019-11-06 18:53:45,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-06 18:53:45,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:45,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-06 18:53:45,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:53:45,735 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-06 18:53:45,735 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:45,743 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:45,744 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-06 18:53:45,744 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-06 18:53:45,770 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:45,772 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-11-06 18:53:45,772 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:45,785 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:45,785 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:53:45,786 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-11-06 18:53:45,815 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:45,817 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:45,819 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:45,822 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:45,822 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-11-06 18:53:45,823 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:45,832 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:45,833 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:53:45,833 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-11-06 18:53:45,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:53:45,955 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:53:45,955 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:53:45,955 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 17 [2019-11-06 18:53:45,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292087612] [2019-11-06 18:53:45,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-06 18:53:45,956 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:53:45,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-06 18:53:45,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-11-06 18:53:45,957 INFO L87 Difference]: Start difference. First operand 72 states and 86 transitions. Second operand 17 states. [2019-11-06 18:53:46,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:53:46,749 INFO L93 Difference]: Finished difference Result 174 states and 210 transitions. [2019-11-06 18:53:46,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-06 18:53:46,750 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2019-11-06 18:53:46,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:53:46,752 INFO L225 Difference]: With dead ends: 174 [2019-11-06 18:53:46,752 INFO L226 Difference]: Without dead ends: 158 [2019-11-06 18:53:46,753 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=626, Unknown=0, NotChecked=0, Total=812 [2019-11-06 18:53:46,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-06 18:53:46,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 72. [2019-11-06 18:53:46,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-06 18:53:46,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 86 transitions. [2019-11-06 18:53:46,768 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 86 transitions. Word has length 31 [2019-11-06 18:53:46,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:53:46,769 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 86 transitions. [2019-11-06 18:53:46,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-06 18:53:46,769 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 86 transitions. [2019-11-06 18:53:46,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-06 18:53:46,770 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:53:46,770 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:53:46,977 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:53:46,978 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:53:46,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:53:46,978 INFO L82 PathProgramCache]: Analyzing trace with hash -2048901787, now seen corresponding path program 1 times [2019-11-06 18:53:46,978 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:53:46,978 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933338784] [2019-11-06 18:53:46,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:53:46,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:47,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:47,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:47,097 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:53:47,097 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933338784] [2019-11-06 18:53:47,098 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490619791] [2019-11-06 18:53:47,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-06 18:53:47,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:47,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-06 18:53:47,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:53:47,186 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-06 18:53:47,186 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:47,200 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:47,201 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:53:47,201 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-06 18:53:47,231 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:47,232 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-11-06 18:53:47,233 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:47,242 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:47,242 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:53:47,243 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-11-06 18:53:47,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:47,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:47,273 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:47,274 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:47,274 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-11-06 18:53:47,275 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:47,282 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:47,283 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:53:47,283 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-11-06 18:53:47,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:53:47,456 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 18:53:47,456 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:53:47,457 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 21 [2019-11-06 18:53:47,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28331816] [2019-11-06 18:53:47,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-06 18:53:47,458 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:53:47,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-06 18:53:47,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2019-11-06 18:53:47,458 INFO L87 Difference]: Start difference. First operand 72 states and 86 transitions. Second operand 21 states. [2019-11-06 18:53:48,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:53:48,271 INFO L93 Difference]: Finished difference Result 156 states and 185 transitions. [2019-11-06 18:53:48,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-06 18:53:48,272 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 31 [2019-11-06 18:53:48,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:53:48,274 INFO L225 Difference]: With dead ends: 156 [2019-11-06 18:53:48,274 INFO L226 Difference]: Without dead ends: 154 [2019-11-06 18:53:48,275 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=189, Invalid=933, Unknown=0, NotChecked=0, Total=1122 [2019-11-06 18:53:48,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-06 18:53:48,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 122. [2019-11-06 18:53:48,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-06 18:53:48,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 147 transitions. [2019-11-06 18:53:48,298 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 147 transitions. Word has length 31 [2019-11-06 18:53:48,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:53:48,298 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 147 transitions. [2019-11-06 18:53:48,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-06 18:53:48,299 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 147 transitions. [2019-11-06 18:53:48,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-06 18:53:48,300 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:53:48,300 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1] [2019-11-06 18:53:48,504 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:53:48,505 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:53:48,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:53:48,505 INFO L82 PathProgramCache]: Analyzing trace with hash 739082614, now seen corresponding path program 1 times [2019-11-06 18:53:48,505 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:53:48,505 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333576291] [2019-11-06 18:53:48,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:53:48,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:48,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:48,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:48,551 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-06 18:53:48,552 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333576291] [2019-11-06 18:53:48,552 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 18:53:48,552 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 18:53:48,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331352352] [2019-11-06 18:53:48,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 18:53:48,555 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:53:48,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 18:53:48,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 18:53:48,560 INFO L87 Difference]: Start difference. First operand 122 states and 147 transitions. Second operand 4 states. [2019-11-06 18:53:48,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:53:48,658 INFO L93 Difference]: Finished difference Result 148 states and 177 transitions. [2019-11-06 18:53:48,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 18:53:48,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-11-06 18:53:48,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:53:48,660 INFO L225 Difference]: With dead ends: 148 [2019-11-06 18:53:48,660 INFO L226 Difference]: Without dead ends: 123 [2019-11-06 18:53:48,660 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 18:53:48,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-06 18:53:48,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2019-11-06 18:53:48,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-06 18:53:48,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 145 transitions. [2019-11-06 18:53:48,690 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 145 transitions. Word has length 37 [2019-11-06 18:53:48,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:53:48,690 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 145 transitions. [2019-11-06 18:53:48,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 18:53:48,690 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 145 transitions. [2019-11-06 18:53:48,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-06 18:53:48,692 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:53:48,692 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1] [2019-11-06 18:53:48,692 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:53:48,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:53:48,692 INFO L82 PathProgramCache]: Analyzing trace with hash -2055358474, now seen corresponding path program 2 times [2019-11-06 18:53:48,693 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:53:48,693 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229757628] [2019-11-06 18:53:48,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:53:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:48,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:48,742 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-06 18:53:48,743 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229757628] [2019-11-06 18:53:48,743 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 18:53:48,743 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 18:53:48,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540748857] [2019-11-06 18:53:48,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 18:53:48,744 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:53:48,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 18:53:48,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 18:53:48,745 INFO L87 Difference]: Start difference. First operand 122 states and 145 transitions. Second operand 4 states. [2019-11-06 18:53:48,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:53:48,829 INFO L93 Difference]: Finished difference Result 124 states and 146 transitions. [2019-11-06 18:53:48,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 18:53:48,830 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-11-06 18:53:48,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:53:48,832 INFO L225 Difference]: With dead ends: 124 [2019-11-06 18:53:48,832 INFO L226 Difference]: Without dead ends: 99 [2019-11-06 18:53:48,832 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 18:53:48,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-06 18:53:48,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-11-06 18:53:48,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-06 18:53:48,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 117 transitions. [2019-11-06 18:53:48,850 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 117 transitions. Word has length 37 [2019-11-06 18:53:48,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:53:48,851 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 117 transitions. [2019-11-06 18:53:48,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 18:53:48,851 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 117 transitions. [2019-11-06 18:53:48,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-06 18:53:48,852 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:53:48,852 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 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-06 18:53:48,853 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:53:48,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:53:48,853 INFO L82 PathProgramCache]: Analyzing trace with hash -68187980, now seen corresponding path program 2 times [2019-11-06 18:53:48,853 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:53:48,854 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643793210] [2019-11-06 18:53:48,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:53:48,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:49,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:49,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:49,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:49,015 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 18:53:49,015 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643793210] [2019-11-06 18:53:49,016 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714806742] [2019-11-06 18:53:49,016 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 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-06 18:53:49,091 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 18:53:49,091 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 18:53:49,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-06 18:53:49,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:53:49,169 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-06 18:53:49,169 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:49,181 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:49,182 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-06 18:53:49,182 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-11-06 18:53:49,220 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:49,221 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-06 18:53:49,222 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:49,234 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:49,235 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-06 18:53:49,235 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:31 [2019-11-06 18:53:49,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:53:49,512 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 18:53:49,513 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:53:49,513 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2019-11-06 18:53:49,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143237207] [2019-11-06 18:53:49,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-06 18:53:49,514 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:53:49,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-06 18:53:49,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2019-11-06 18:53:49,515 INFO L87 Difference]: Start difference. First operand 99 states and 117 transitions. Second operand 21 states. [2019-11-06 18:53:50,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:53:50,908 INFO L93 Difference]: Finished difference Result 242 states and 295 transitions. [2019-11-06 18:53:50,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-06 18:53:50,914 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2019-11-06 18:53:50,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:53:50,916 INFO L225 Difference]: With dead ends: 242 [2019-11-06 18:53:50,916 INFO L226 Difference]: Without dead ends: 212 [2019-11-06 18:53:50,917 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=336, Invalid=1470, Unknown=0, NotChecked=0, Total=1806 [2019-11-06 18:53:50,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-11-06 18:53:50,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 150. [2019-11-06 18:53:50,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-06 18:53:50,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 182 transitions. [2019-11-06 18:53:50,939 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 182 transitions. Word has length 40 [2019-11-06 18:53:50,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:53:50,940 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 182 transitions. [2019-11-06 18:53:50,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-06 18:53:50,940 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 182 transitions. [2019-11-06 18:53:50,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-06 18:53:50,941 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:53:50,941 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 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-06 18:53:51,144 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:53:51,144 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:53:51,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:53:51,145 INFO L82 PathProgramCache]: Analyzing trace with hash -577661070, now seen corresponding path program 1 times [2019-11-06 18:53:51,145 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:53:51,145 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131074241] [2019-11-06 18:53:51,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:53:51,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:51,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:51,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:51,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:51,248 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 18:53:51,248 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131074241] [2019-11-06 18:53:51,248 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224899170] [2019-11-06 18:53:51,249 INFO L94 rtionOrderModulation]: Keeping assertion order 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-06 18:53:51,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:51,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-06 18:53:51,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:53:51,358 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-06 18:53:51,359 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:51,370 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:51,371 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-06 18:53:51,371 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-06 18:53:51,403 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:51,404 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-06 18:53:51,404 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:51,414 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:51,414 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:53:51,415 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-06 18:53:51,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:53:51,636 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 18:53:51,636 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:53:51,636 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2019-11-06 18:53:51,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008602164] [2019-11-06 18:53:51,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-06 18:53:51,637 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:53:51,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-06 18:53:51,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2019-11-06 18:53:51,638 INFO L87 Difference]: Start difference. First operand 150 states and 182 transitions. Second operand 18 states. [2019-11-06 18:53:52,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:53:52,704 INFO L93 Difference]: Finished difference Result 348 states and 426 transitions. [2019-11-06 18:53:52,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-06 18:53:52,709 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 40 [2019-11-06 18:53:52,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:53:52,711 INFO L225 Difference]: With dead ends: 348 [2019-11-06 18:53:52,711 INFO L226 Difference]: Without dead ends: 318 [2019-11-06 18:53:52,712 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=277, Invalid=1129, Unknown=0, NotChecked=0, Total=1406 [2019-11-06 18:53:52,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-11-06 18:53:52,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 131. [2019-11-06 18:53:52,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-06 18:53:52,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 161 transitions. [2019-11-06 18:53:52,734 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 161 transitions. Word has length 40 [2019-11-06 18:53:52,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:53:52,735 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 161 transitions. [2019-11-06 18:53:52,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-06 18:53:52,735 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 161 transitions. [2019-11-06 18:53:52,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-06 18:53:52,736 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:53:52,736 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 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-06 18:53:52,938 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:53:52,939 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:53:52,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:53:52,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1318015414, now seen corresponding path program 1 times [2019-11-06 18:53:52,940 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:53:52,940 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227268641] [2019-11-06 18:53:52,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:53:52,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:52,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:52,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:52,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:52,998 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-06 18:53:52,999 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227268641] [2019-11-06 18:53:52,999 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 18:53:52,999 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 18:53:52,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892340217] [2019-11-06 18:53:53,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 18:53:53,000 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:53:53,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 18:53:53,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 18:53:53,001 INFO L87 Difference]: Start difference. First operand 131 states and 161 transitions. Second operand 5 states. [2019-11-06 18:53:53,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:53:53,117 INFO L93 Difference]: Finished difference Result 200 states and 247 transitions. [2019-11-06 18:53:53,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 18:53:53,117 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-11-06 18:53:53,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:53:53,119 INFO L225 Difference]: With dead ends: 200 [2019-11-06 18:53:53,119 INFO L226 Difference]: Without dead ends: 158 [2019-11-06 18:53:53,119 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 18:53:53,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-06 18:53:53,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 137. [2019-11-06 18:53:53,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-11-06 18:53:53,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 168 transitions. [2019-11-06 18:53:53,137 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 168 transitions. Word has length 40 [2019-11-06 18:53:53,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:53:53,138 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 168 transitions. [2019-11-06 18:53:53,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 18:53:53,138 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 168 transitions. [2019-11-06 18:53:53,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-06 18:53:53,139 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:53:53,139 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 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-06 18:53:53,139 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:53:53,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:53:53,139 INFO L82 PathProgramCache]: Analyzing trace with hash 808542324, now seen corresponding path program 1 times [2019-11-06 18:53:53,140 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:53:53,140 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080726545] [2019-11-06 18:53:53,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:53:53,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:53,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:53,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:53,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:53,267 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 18:53:53,268 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080726545] [2019-11-06 18:53:53,268 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705584751] [2019-11-06 18:53:53,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-06 18:53:53,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:53,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-06 18:53:53,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:53:53,374 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-06 18:53:53,374 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:53,379 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:53,380 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:53:53,380 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-06 18:53:53,410 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:53:53,411 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-06 18:53:53,411 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:53,416 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:53,416 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:53:53,416 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-06 18:53:53,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:53:53,677 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 18:53:53,677 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:53:53,677 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2019-11-06 18:53:53,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078650762] [2019-11-06 18:53:53,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-06 18:53:53,678 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:53:53,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-06 18:53:53,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2019-11-06 18:53:53,678 INFO L87 Difference]: Start difference. First operand 137 states and 168 transitions. Second operand 22 states. [2019-11-06 18:53:54,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:53:54,648 INFO L93 Difference]: Finished difference Result 255 states and 306 transitions. [2019-11-06 18:53:54,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-06 18:53:54,657 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2019-11-06 18:53:54,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:53:54,658 INFO L225 Difference]: With dead ends: 255 [2019-11-06 18:53:54,659 INFO L226 Difference]: Without dead ends: 253 [2019-11-06 18:53:54,659 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=233, Invalid=1249, Unknown=0, NotChecked=0, Total=1482 [2019-11-06 18:53:54,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-11-06 18:53:54,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 201. [2019-11-06 18:53:54,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-11-06 18:53:54,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 245 transitions. [2019-11-06 18:53:54,688 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 245 transitions. Word has length 40 [2019-11-06 18:53:54,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:53:54,689 INFO L462 AbstractCegarLoop]: Abstraction has 201 states and 245 transitions. [2019-11-06 18:53:54,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-06 18:53:54,689 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 245 transitions. [2019-11-06 18:53:54,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-06 18:53:54,690 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:53:54,690 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:53:54,893 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:53:54,894 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:53:54,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:53:54,894 INFO L82 PathProgramCache]: Analyzing trace with hash 754664901, now seen corresponding path program 3 times [2019-11-06 18:53:54,894 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:53:54,894 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965601246] [2019-11-06 18:53:54,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:53:54,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:55,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:55,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:55,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:55,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:55,028 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-06 18:53:55,028 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965601246] [2019-11-06 18:53:55,029 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373763159] [2019-11-06 18:53:55,029 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-06 18:53:55,097 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-06 18:53:55,097 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 18:53:55,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-06 18:53:55,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:53:55,133 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 18:53:55,133 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:55,138 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:55,138 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:53:55,138 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-06 18:53:55,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:53:55,389 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-06 18:53:55,389 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:53:55,389 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2019-11-06 18:53:55,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726996869] [2019-11-06 18:53:55,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-06 18:53:55,390 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:53:55,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-06 18:53:55,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2019-11-06 18:53:55,391 INFO L87 Difference]: Start difference. First operand 201 states and 245 transitions. Second operand 20 states. [2019-11-06 18:53:58,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:53:58,657 INFO L93 Difference]: Finished difference Result 337 states and 405 transitions. [2019-11-06 18:53:58,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-06 18:53:58,658 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 49 [2019-11-06 18:53:58,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:53:58,660 INFO L225 Difference]: With dead ends: 337 [2019-11-06 18:53:58,660 INFO L226 Difference]: Without dead ends: 289 [2019-11-06 18:53:58,662 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=355, Invalid=1625, Unknown=0, NotChecked=0, Total=1980 [2019-11-06 18:53:58,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-06 18:53:58,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 227. [2019-11-06 18:53:58,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-11-06 18:53:58,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 273 transitions. [2019-11-06 18:53:58,703 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 273 transitions. Word has length 49 [2019-11-06 18:53:58,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:53:58,704 INFO L462 AbstractCegarLoop]: Abstraction has 227 states and 273 transitions. [2019-11-06 18:53:58,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-06 18:53:58,704 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 273 transitions. [2019-11-06 18:53:58,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-06 18:53:58,705 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:53:58,705 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:53:58,908 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:53:58,909 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:53:58,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:53:58,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1414196423, now seen corresponding path program 2 times [2019-11-06 18:53:58,909 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:53:58,909 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694072293] [2019-11-06 18:53:58,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:53:58,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:59,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:59,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:59,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:59,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:53:59,161 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-06 18:53:59,161 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694072293] [2019-11-06 18:53:59,161 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527582374] [2019-11-06 18:53:59,161 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 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-06 18:53:59,282 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 18:53:59,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 18:53:59,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-06 18:53:59,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:53:59,336 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 18:53:59,336 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:53:59,340 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:53:59,340 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:53:59,341 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-06 18:53:59,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:53:59,605 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-06 18:53:59,606 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:53:59,606 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2019-11-06 18:53:59,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919138914] [2019-11-06 18:53:59,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-06 18:53:59,606 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:53:59,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-06 18:53:59,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2019-11-06 18:53:59,607 INFO L87 Difference]: Start difference. First operand 227 states and 273 transitions. Second operand 23 states. [2019-11-06 18:54:01,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:54:01,450 INFO L93 Difference]: Finished difference Result 438 states and 529 transitions. [2019-11-06 18:54:01,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-11-06 18:54:01,450 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 49 [2019-11-06 18:54:01,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:54:01,453 INFO L225 Difference]: With dead ends: 438 [2019-11-06 18:54:01,453 INFO L226 Difference]: Without dead ends: 436 [2019-11-06 18:54:01,456 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=336, Invalid=2016, Unknown=0, NotChecked=0, Total=2352 [2019-11-06 18:54:01,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-11-06 18:54:01,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 323. [2019-11-06 18:54:01,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-11-06 18:54:01,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 394 transitions. [2019-11-06 18:54:01,521 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 394 transitions. Word has length 49 [2019-11-06 18:54:01,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:54:01,521 INFO L462 AbstractCegarLoop]: Abstraction has 323 states and 394 transitions. [2019-11-06 18:54:01,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-06 18:54:01,521 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 394 transitions. [2019-11-06 18:54:01,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-06 18:54:01,523 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:54:01,523 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:54:01,727 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:54:01,728 INFO L410 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:54:01,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:54:01,728 INFO L82 PathProgramCache]: Analyzing trace with hash -396413684, now seen corresponding path program 1 times [2019-11-06 18:54:01,729 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:54:01,729 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397311873] [2019-11-06 18:54:01,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:54:01,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:01,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:01,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:01,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:01,769 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-06 18:54:01,769 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397311873] [2019-11-06 18:54:01,770 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 18:54:01,770 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 18:54:01,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742432457] [2019-11-06 18:54:01,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 18:54:01,770 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:54:01,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 18:54:01,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 18:54:01,771 INFO L87 Difference]: Start difference. First operand 323 states and 394 transitions. Second operand 4 states. [2019-11-06 18:54:01,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:54:01,904 INFO L93 Difference]: Finished difference Result 396 states and 484 transitions. [2019-11-06 18:54:01,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 18:54:01,905 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-06 18:54:01,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:54:01,907 INFO L225 Difference]: With dead ends: 396 [2019-11-06 18:54:01,907 INFO L226 Difference]: Without dead ends: 285 [2019-11-06 18:54:01,908 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 18:54:01,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-11-06 18:54:01,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 270. [2019-11-06 18:54:01,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-11-06 18:54:01,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 325 transitions. [2019-11-06 18:54:01,953 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 325 transitions. Word has length 52 [2019-11-06 18:54:01,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:54:01,954 INFO L462 AbstractCegarLoop]: Abstraction has 270 states and 325 transitions. [2019-11-06 18:54:01,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 18:54:01,954 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 325 transitions. [2019-11-06 18:54:01,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-06 18:54:01,955 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:54:01,955 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:54:01,955 INFO L410 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:54:01,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:54:01,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1654570314, now seen corresponding path program 1 times [2019-11-06 18:54:01,956 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:54:01,956 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779398230] [2019-11-06 18:54:01,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:54:01,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:01,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:01,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:01,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:01,993 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-06 18:54:01,994 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779398230] [2019-11-06 18:54:01,994 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 18:54:01,994 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 18:54:01,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094909780] [2019-11-06 18:54:01,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 18:54:01,995 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:54:01,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 18:54:01,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 18:54:01,996 INFO L87 Difference]: Start difference. First operand 270 states and 325 transitions. Second operand 4 states. [2019-11-06 18:54:02,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:54:02,157 INFO L93 Difference]: Finished difference Result 415 states and 504 transitions. [2019-11-06 18:54:02,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 18:54:02,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-06 18:54:02,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:54:02,159 INFO L225 Difference]: With dead ends: 415 [2019-11-06 18:54:02,160 INFO L226 Difference]: Without dead ends: 302 [2019-11-06 18:54:02,160 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 18:54:02,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-11-06 18:54:02,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 268. [2019-11-06 18:54:02,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-11-06 18:54:02,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 320 transitions. [2019-11-06 18:54:02,228 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 320 transitions. Word has length 52 [2019-11-06 18:54:02,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:54:02,228 INFO L462 AbstractCegarLoop]: Abstraction has 268 states and 320 transitions. [2019-11-06 18:54:02,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 18:54:02,228 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 320 transitions. [2019-11-06 18:54:02,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-06 18:54:02,230 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:54:02,230 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:54:02,230 INFO L410 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:54:02,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:54:02,230 INFO L82 PathProgramCache]: Analyzing trace with hash 692013642, now seen corresponding path program 2 times [2019-11-06 18:54:02,230 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:54:02,231 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243201329] [2019-11-06 18:54:02,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:54:02,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:02,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:02,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:02,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:02,280 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-06 18:54:02,281 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243201329] [2019-11-06 18:54:02,281 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 18:54:02,281 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 18:54:02,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47465418] [2019-11-06 18:54:02,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 18:54:02,282 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:54:02,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 18:54:02,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 18:54:02,283 INFO L87 Difference]: Start difference. First operand 268 states and 320 transitions. Second operand 4 states. [2019-11-06 18:54:02,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:54:02,415 INFO L93 Difference]: Finished difference Result 337 states and 399 transitions. [2019-11-06 18:54:02,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 18:54:02,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-06 18:54:02,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:54:02,417 INFO L225 Difference]: With dead ends: 337 [2019-11-06 18:54:02,417 INFO L226 Difference]: Without dead ends: 246 [2019-11-06 18:54:02,418 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 18:54:02,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-11-06 18:54:02,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 242. [2019-11-06 18:54:02,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-11-06 18:54:02,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 286 transitions. [2019-11-06 18:54:02,476 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 286 transitions. Word has length 52 [2019-11-06 18:54:02,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:54:02,476 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 286 transitions. [2019-11-06 18:54:02,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 18:54:02,477 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 286 transitions. [2019-11-06 18:54:02,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-06 18:54:02,478 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:54:02,478 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 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-06 18:54:02,478 INFO L410 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:54:02,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:54:02,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1773448148, now seen corresponding path program 4 times [2019-11-06 18:54:02,479 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:54:02,479 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382325748] [2019-11-06 18:54:02,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:54:02,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:02,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:02,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:02,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:02,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:02,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:02,861 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 34 proven. 17 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-06 18:54:02,862 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382325748] [2019-11-06 18:54:02,862 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765350275] [2019-11-06 18:54:02,862 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 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-06 18:54:02,939 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-06 18:54:02,939 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 18:54:02,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-06 18:54:02,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:54:03,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 18:54:03,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:54:03,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:54:03,233 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 50 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-06 18:54:03,234 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:54:03,234 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2019-11-06 18:54:03,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500575764] [2019-11-06 18:54:03,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-06 18:54:03,236 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:54:03,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-06 18:54:03,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2019-11-06 18:54:03,236 INFO L87 Difference]: Start difference. First operand 242 states and 286 transitions. Second operand 21 states. [2019-11-06 18:54:03,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:54:03,849 INFO L93 Difference]: Finished difference Result 458 states and 527 transitions. [2019-11-06 18:54:03,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-06 18:54:03,850 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 58 [2019-11-06 18:54:03,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:54:03,852 INFO L225 Difference]: With dead ends: 458 [2019-11-06 18:54:03,852 INFO L226 Difference]: Without dead ends: 257 [2019-11-06 18:54:03,853 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756 [2019-11-06 18:54:03,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-11-06 18:54:03,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 232. [2019-11-06 18:54:03,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-06 18:54:03,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 268 transitions. [2019-11-06 18:54:03,891 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 268 transitions. Word has length 58 [2019-11-06 18:54:03,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:54:03,891 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 268 transitions. [2019-11-06 18:54:03,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-06 18:54:03,892 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 268 transitions. [2019-11-06 18:54:03,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-06 18:54:03,893 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:54:03,893 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:54:04,097 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:54:04,097 INFO L410 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:54:04,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:54:04,098 INFO L82 PathProgramCache]: Analyzing trace with hash 175055585, now seen corresponding path program 5 times [2019-11-06 18:54:04,098 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:54:04,098 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307999276] [2019-11-06 18:54:04,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:54:04,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:04,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:04,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:04,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:04,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:04,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:04,375 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 12 proven. 46 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-06 18:54:04,375 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307999276] [2019-11-06 18:54:04,376 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110816653] [2019-11-06 18:54:04,376 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 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-06 18:54:04,462 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-11-06 18:54:04,462 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 18:54:04,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-06 18:54:04,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:54:04,507 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-06 18:54:04,507 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:54:04,517 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:04,517 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:54:04,518 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-11-06 18:54:04,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:04,552 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-11-06 18:54:04,552 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:54:04,565 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:04,566 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:54:04,566 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2019-11-06 18:54:04,638 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:04,639 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:04,641 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:04,642 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:04,642 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 43 [2019-11-06 18:54:04,643 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:54:04,659 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:04,660 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-06 18:54:04,660 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:46 [2019-11-06 18:54:04,698 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:04,699 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:04,700 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:04,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:04,703 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:04,704 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:04,711 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:04,712 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 58 [2019-11-06 18:54:04,712 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:54:04,741 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:04,742 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-06 18:54:04,742 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:46 [2019-11-06 18:54:04,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:04,748 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:04,750 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:04,751 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:04,752 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:04,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:04,755 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:04,755 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 58 [2019-11-06 18:54:04,756 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:54:04,769 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:04,769 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:54:04,769 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:68, output treesize:64 [2019-11-06 18:54:04,811 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:04,812 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:04,813 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:04,815 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:04,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:04,817 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:04,818 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:04,819 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:04,821 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:04,822 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 18:54:04,823 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:04,823 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 55 [2019-11-06 18:54:04,824 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:54:04,840 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:04,841 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:54:04,841 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2019-11-06 18:54:05,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:54:05,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 18:54:05,654 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 12 proven. 46 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-06 18:54:05,655 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 18:54:05,655 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 31 [2019-11-06 18:54:05,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991167496] [2019-11-06 18:54:05,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-06 18:54:05,655 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 18:54:05,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-06 18:54:05,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=842, Unknown=0, NotChecked=0, Total=930 [2019-11-06 18:54:05,656 INFO L87 Difference]: Start difference. First operand 232 states and 268 transitions. Second operand 31 states. [2019-11-06 18:54:08,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 18:54:08,385 INFO L93 Difference]: Finished difference Result 309 states and 354 transitions. [2019-11-06 18:54:08,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-06 18:54:08,385 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 64 [2019-11-06 18:54:08,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 18:54:08,387 INFO L225 Difference]: With dead ends: 309 [2019-11-06 18:54:08,387 INFO L226 Difference]: Without dead ends: 293 [2019-11-06 18:54:08,389 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 52 SyntacticMatches, 10 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=397, Invalid=2795, Unknown=0, NotChecked=0, Total=3192 [2019-11-06 18:54:08,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-11-06 18:54:08,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 275. [2019-11-06 18:54:08,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-11-06 18:54:08,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 318 transitions. [2019-11-06 18:54:08,436 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 318 transitions. Word has length 64 [2019-11-06 18:54:08,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 18:54:08,436 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 318 transitions. [2019-11-06 18:54:08,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-06 18:54:08,437 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 318 transitions. [2019-11-06 18:54:08,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-06 18:54:08,438 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 18:54:08,438 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 18:54:08,642 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:54:08,643 INFO L410 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 18:54:08,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 18:54:08,643 INFO L82 PathProgramCache]: Analyzing trace with hash -653298979, now seen corresponding path program 3 times [2019-11-06 18:54:08,643 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 18:54:08,643 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669428961] [2019-11-06 18:54:08,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 18:54:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:08,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:08,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:08,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:08,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:08,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 18:54:08,931 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 12 proven. 46 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-06 18:54:08,931 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669428961] [2019-11-06 18:54:08,931 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55780763] [2019-11-06 18:54:08,931 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 18:54:09,052 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-06 18:54:09,052 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 18:54:09,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-06 18:54:09,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 18:54:09,116 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-06 18:54:09,116 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:54:09,122 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:09,123 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 18:54:09,123 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-06 18:54:09,217 INFO L341 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2019-11-06 18:54:09,218 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2019-11-06 18:54:09,218 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:54:09,230 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:09,231 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-06 18:54:09,231 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:16 [2019-11-06 18:54:09,248 INFO L341 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2019-11-06 18:54:09,249 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2019-11-06 18:54:09,249 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:54:09,268 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:09,268 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-06 18:54:09,268 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:16 [2019-11-06 18:54:09,282 INFO L341 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2019-11-06 18:54:09,282 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2019-11-06 18:54:09,283 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:54:09,292 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:09,292 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-06 18:54:09,293 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:16 [2019-11-06 18:54:09,316 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 18:54:09,317 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 57 [2019-11-06 18:54:09,318 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 18:54:09,347 INFO L567 ElimStorePlain]: treesize reduction 32, result has 46.7 percent of original size [2019-11-06 18:54:09,348 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 18:54:09,348 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-11-06 18:54:10,097 WARN L191 SmtUtils]: Spent 710.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-11-06 18:54:10,584 WARN L191 SmtUtils]: Spent 463.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-11-06 18:54:16,060 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 25